A plane-sweep algorithm for finding a closest pair among convex planar objects
From MaRDI portal
Publication:5096784
DOI10.1007/3-540-55210-3_186zbMath1493.68367MaRDI QIDQ5096784
Frank Bartling, Klaus Hinrichs
Publication date: 18 August 2022
Published in: STACS 92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55210-3_186
68W40: Analysis of algorithms
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
An optimal algorithm for computing visible nearest foreign neighbors among colored line segments, A plane-sweep algorithm for the all-nearest-neighbors problem for a set of convex planar objects
Cites Work
- 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 Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
- Intersection and Closest-Pair Problems for a Set of Planar Discs
- Computing the extreme distances between two convex polygons
- Two-Dimensional Voronoi Diagrams in the L p -Metric