Pages that link to "Item:Q5096784"
From MaRDI portal
The following pages link to A plane-sweep algorithm for finding a closest pair among convex planar objects (Q5096784):
Displaying 4 items.
- An all-round sweep algorithm for 2-dimensional nearest-neighbor problems (Q1203723) (← links)
- 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)
- Computational Science and Its Applications – ICCSA 2004 (Q5901266) (← links)