An intersection-sensitive algorithm for snap rounding

DOI10.1016/j.comgeo.2006.03.002zbMath1109.65018OpenAlexW2025131661MaRDI QIDQ868103

Dan Halperin, Mark T. de Berg, Mark H. Overmars

Publication date: 19 February 2007

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.03.002

zbMATH Keywords

arrangementsalgorithmrobustnessprecisiongeometric rounding

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Mapping multiple regions to the grid with bounded Hausdorff distance ⋮ Rounding meshes in 3D ⋮ Snapping Graph Drawings to the Grid Optimally ⋮ Iterated snap rounding with bounded drift ⋮ Exact Fast Parallel Intersection of Large 3-D Triangular Meshes ⋮ Improved output-sensitive snap rounding ⋮ Unnamed Item

Uses Software

• LEDA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On finite-precision representations of geometric objects
• Towards exact geometric computation
• Verifiable implementations of geometric algorithms using finite precision arithmetic
• Practical segment intersection with finite precision output
• Iterated snap rounding
• An optimal algorithm for intersecting line segments in the plane
• Rounding Arrangements Dynamically
• CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES