Computing closest and farthest points for a query segment

DOI10.1016/J.TCS.2007.11.015MaRDI QIDQ2481974zbMATH OpenOpenAlexFDO

Authors Michael Segal, Eli Zeitlin

Publication date 15 April 2008

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.11.015

zbMATH Keywords

computational geometrydata structuresegment dragging problem

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Efficiently computing the closest point to a query line
• COMPUTING CLOSEST POINTS FOR SEGMENTS
• Farthest-point queries with geometric and combinatorial constraints
• Farthest-Point Queries with Geometric and Combinatorial Constraints
• Proximity problems on line segments spanned by points

Cites work

• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• An Improved Algorithm for Constructing kth-Order Voronoi Diagrams
• COMPUTING CLOSEST POINTS FOR SEGMENTS
• Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
• Geometric retrieval problems
• On k-Nearest Neighbor Voronoi Diagrams in the Plane
• Queries with segments in Voronoi diagrams
• Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
• The power of geometric duality revisited
• Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment

Cited in

(12)

• Farthest-Point Queries with Geometric and Combinatorial Constraints
• Farthest-point queries with geometric and combinatorial constraints
• On the all-farthest-segments problem for a planar set of points
• Computing a Closest Point to a Query Hyperplane in Three and Higher Dimensions
• Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set
• 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?)
• scientific article; zbMATH DE number 2089210 (Why is no real title available?)
• Searching for the closest-pair in a query translate
• Proximity problems on line segments spanned by points
• COMPUTING CLOSEST POINTS FOR SEGMENTS
• Queries with segments in Voronoi diagrams

This page was built for publication: Computing closest and farthest points for a query segment

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