The following pages link to (Q3687711):
Displaying 14 items.
- Distance-sensitive planar point location (Q283883) (← links)
- Algorithms for deciding the containment of polygons (Q671621) (← links)
- A convex polygon among polygonal obstacle: Placement and high-clearance motion (Q685605) (← links)
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241) (← links)
- On the construction of abstract Voronoi diagrams (Q757052) (← links)
- On the angle restricted nearest neighbor problem (Q910232) (← links)
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams (Q1084674) (← links)
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments (Q1093370) (← links)
- A sweepline algorithm for Voronoi diagrams (Q1101224) (← links)
- Separating two simple polygons by a sequence of translations (Q1104080) (← links)
- The upper envelope of Voronoi surfaces and its applications (Q1207797) (← links)
- Extremal polygon containment problems (Q1330463) (← links)
- A new algorithm for the two-polygon containment problem (Q1373882) (← links)
- Computing the maximum overlap of two convex polygons under translations (Q6487432) (← links)
