COMPUTING CLOSEST POINTS FOR SEGMENTS

DOI10.1142/S0218195903001268zbMath1093.68122OpenAlexW2154628670MaRDI QIDQ4818603

Sergei Bespamyatnikh

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195903001268

zbMATH Keywords

Voronoi diagramclosest pointsHopcroft's problem

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment ⋮ Computing closest and farthest points for a query segment ⋮ Farthest-point queries with geometric and combinatorial constraints

Cites Work

• Unnamed Item
• Range searching with efficient hierarchical cuttings
• Maintenance of configurations in the plane
• Optimal time bounds for some proximity problems in the plane
• Cutting hyperplanes for divide-and-conquer
• Queries with segments in Voronoi diagrams
• New lower bounds for Hopcroft's problem
• Algorithms for Reporting and Counting Geometric Intersections
• Dynamic Voronoi diagrams
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems

This page was built for publication: COMPUTING CLOSEST POINTS FOR SEGMENTS