Queries with segments in Voronoi diagrams

DOI10.1016/S0925-7721(99)00055-3zbMath0958.68174OpenAlexW2019903130MaRDI QIDQ1567303

Sergei Bespamyatnikh, Jack Scott Snoeyink

Publication date: 5 June 2000

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(99)00055-3

zbMATH Keywords

proximity problems

Mathematics Subject Classification ID

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

Related Items (5)

Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment ⋮ COMPUTING CLOSEST POINTS FOR SEGMENTS ⋮ Computing closest and farthest points for a query segment ⋮ Farthest-point queries with geometric and combinatorial constraints ⋮ Extremal point queries with lines and line segments and related problems

This page was built for publication: Queries with segments in Voronoi diagrams