A sweep-line algorithm for the inclusion hierarchy among circles

DOI10.1007/BF03167502MaRDI QIDQ2493494zbMATH OpenOpenAlexFDO

Authors D.-S. Kim, Byung Hoon Lee, K. Sugihara

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)

Recommendations

• Computational Science and Its Applications – ICCSA 2004
• scientific article; zbMATH DE number 3876624
• A convex hull algorithm for discs, and applications
• A sweepline algorithm for Euclidean Voronoi diagram of circles
• Topologically sweeping an arrangement

Cites work

• scientific article; zbMATH DE number 1701774 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 2031582 (Why is no real title available?)
• scientific article; zbMATH DE number 1455125 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• Best approximate circles on integer grids
• Finding circles by an array of accumulators
• Introduction to algorithms
• Plane-sweep algorithms for intersecting geometric figures
• 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

Cited in

(1)

• Computational Science and Its Applications – ICCSA 2004

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

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