pertemuan & perpotongan dua buah garis

[draft]

example case (1)







example case (2)







example case (3)



example case (4)



example case (5)



example case (6)



example case (7)



example case (8)



metode perhitungan atau algoritma terlihat stabil pada masalah pertemuan dua garis dalam bidang yg sama. pada masalah dua garis yg berpotongan akan ditemukan titik tersebut, sedangkan jika dua garis tersebut tidak berpotongan maka akan ditemukan titik perpotongannya dgn prinsip pararel extension line dari salah satu atau kedu garis tersebut.

to be added,

• more test case for algorithm validation


• split both line and make new four line


• multi line intersection to create new split lines


• trim and make further deleting of shortest line


• joining both lines at intersection point to make extent by creating new lines


• create third line perpendicular to second line based on first and second point


• slope planes (?) three dimensional (space) case, can be possible using determinant of matrix methods


• temporary construction line by tracking locks, both polar (angle steps) & parallel