COMPUTING CLOSEST POINTS FOR SEGMENTS

DOI10.1142/S0218195903001268MaRDI QIDQ4818603zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Queries with segments in Voronoi diagrams
• scientific article; zbMATH DE number 1305399
• Computing closest and farthest points for a query segment
• Proximity problems on line segments spanned by points
• Publication:4828970

Cites work

• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Algorithms for Reporting and Counting Geometric Intersections
• Cutting hyperplanes for divide-and-conquer
• Dynamic Voronoi diagrams
• Maintenance of configurations in the plane
• New lower bounds for Hopcroft's problem
• On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
• Optimal time bounds for some proximity problems in the plane
• Queries with segments in Voronoi diagrams
• Range searching with efficient hierarchical cuttings

Cited in

(7)

• Farthest-point queries with geometric and combinatorial constraints
• Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
• scientific article; zbMATH DE number 1305399 (Why is no real title available?)
• Computing closest and farthest points for a query segment
• Proximity problems on line segments spanned by points
• Queries with segments in Voronoi diagrams
• Optimal time bounds for some proximity problems in the plane

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818603)