An optimal algorithm for computing visible nearest foreign neighbors among colored line segments

DOI10.1007/BFb0054355zbMath1502.68320OpenAlexW1576918847MaRDI QIDQ5054843

Kamakoti Veezhinathan, Thorsten Graf

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'98 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0054355

Mathematics Subject Classification ID

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

Uses Software

• Voronoi

Cites Work

• Unnamed Item
• Unnamed Item
• An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
• A sweepline algorithm for Voronoi diagrams
• Optimal time bounds for some proximity problems in the plane
• A compact piecewise-linear Voronoi diagram for convex sites in the plane
• Algorithms for Reporting and Counting Geometric Intersections
• Optimal Search in Planar Subdivisions
• A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects
• A plane-sweep algorithm for finding a closest pair among convex planar objects