Algorithms for computing closest points for segments
From MaRDI portal
Cites work
- Algorithms for computing closest points for segments
- Algorithms for ray-shooting and intersection searching
- Algorithms for subpath convex hull queries and ray-shooting among segments
- An optimal algorithm for higher-order Voronoi diagrams in the plane: the usefulness of nondeterminism
- Applications of a new space-partitioning technique
- COMPUTING CLOSEST POINTS FOR SEGMENTS
- Cutting hyperplanes for divide-and-conquer
- Efficient partition trees
- Efficiently computing the closest point to a query line
- Farthest-point queries with geometric and combinatorial constraints
- Fractional cascading. I: A data structuring technique
- Geometric applications of a randomized optimization technique
- Hopcroft's problem, log-star shaving, 2D fractional cascading, and decision trees
- New lower bounds for Hopcroft's problem
- On the Betti Numbers of Real Varieties
- On the combinatorial and algebraic complexity of quantifier elimination
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- Optimal partition trees
- Partitioning arrangements of lines. II: Applications
- Queries with segments in Voronoi diagrams
- Range searching with efficient hierarchical cuttings
- Simplex range searching revisited: how to shave logs in multi-level data structures
- The complexity and construction of many faces in arrangements of lines and of segments
- The power of geometric duality revisited
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
This page was built for publication: Algorithms for computing closest points for segments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869864)
