Pages that link to "Item:Q5096784"

The following pages link to A plane-sweep algorithm for finding a closest pair among convex planar objects (Q5096784):

Displayed 2 items.

• An optimal algorithm for computing visible nearest foreign neighbors among colored line segments (Q5054843) ‎ (← links)
• A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects (Q5060127) ‎ (← links)