A sweep-line algorithm for the inclusion hierarchy among circles

DOI10.1007/BF03167502zbMath1103.68127OpenAlexW2028565328MaRDI QIDQ2493494

Deok-Soo Kim, Kōkichi Sugihara, Byung Hoon Lee

Publication date: 19 June 2006

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

plane-sweep algorithminterval searchnesting of circles

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Best approximate circles on integer grids
• Plane-sweep algorithms for intersecting geometric figures
• Finding circles by an array of accumulators
• Voronoi diagram of a circle set from Voronoi diagram of a point set: I. Topology
• Voronoi diagram of a circle set from Voronoi diagram of a point set: II. Geometry

This page was built for publication: A sweep-line algorithm for the inclusion hierarchy among circles