Similarly , if we encounter an endpoint at the intersection of three segments, or in the interior of another segment, we also reject the set. To avoid a lengthy digression from the current discussion a detailed description of this algorithm is postponed until Section 5. M.I. Shamos and D. Huey. Geometric intersection problems . 17th IEEE Annu.
Insertion sort works well for previously sorted lists.
M.Shamos and D.Hoey. Geometric intersection problems . Found. on Comput. No context found. M. I. Shamos and D. Hoey.