Pages that link to "Item:Q3912042"
From MaRDI portal
The following pages link to A New Approach to Planar Point Location (Q3912042):
Displaying 20 items.
- Optimal randomized incremental construction for guaranteed logarithmic planar point location (Q340542) (← links)
- Parallel batched planar point location on the CCC (Q582096) (← links)
- An incremental reconstruction method for dynamic planar point location (Q750176) (← links)
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane (Q793982) (← links)
- Efficient binary space partitions for hidden-surface removal and solid modeling (Q914380) (← links)
- Dynamic planar point location with optimal query time (Q914389) (← links)
- Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection (Q991174) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
- A workbench for computational geometry (Q1322571) (← links)
- New results on binary space partitions in the plane (Q1370930) (← links)
- Storing the subdivision of a polyhedral surface (Q1820438) (← links)
- Efficient visibility queries in simple polygons (Q1862134) (← links)
- A fast algorithm for point-location in a finite element mesh (Q1919124) (← links)
- On constant factors in comparison-based geometric algorithms and data structures (Q2349854) (← links)
- Query point visibility computation in polygons with holes (Q2462733) (← links)
- Dynamic Trees and Dynamic Point Location (Q4210167) (← links)
- A CASE STUDY IN ALGORITHM ENGINEERING FOR GEOMETRIC COMPUTING (Q4682177) (← links)
- New results on binary space partitions in the plane (extended abstract) (Q5056166) (← links)
- Dynamic planar point location with optimal query time (Q5096145) (← links)
- Adaptive Point Location in Planar Convex Subdivisions (Q5370568) (← links)
