An intersection-sensitive algorithm for snap rounding
From MaRDI portal
Publication:868103
DOI10.1016/J.COMGEO.2006.03.002zbMATH Open1109.65018OpenAlexW2025131661MaRDI QIDQ868103FDOQ868103
Authors: Mark de Berg, Dan Halperin, 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Introduction to algorithms
- Title not available (Why is that?)
- An optimal algorithm for intersecting line segments in the plane
- Verifiable implementations of geometric algorithms using finite precision arithmetic
- CONTROLLED PERTURBATION FOR ARRANGEMENTS OF CIRCLES
- Title not available (Why is that?)
- On finite-precision representations of geometric objects
- Towards exact geometric computation
- Iterated snap rounding
- Rounding Arrangements Dynamically
- Practical segment intersection with finite precision output
Cited In (13)
- Iterated snap rounding
- Mapping multiple regions to the grid with bounded Hausdorff distance
- 3D snap rounding
- Stable snap rounding
- Snapping graph drawings to the grid optimally
- Improved output-sensitive snap rounding
- Exact Fast Parallel Intersection of Large 3-D Triangular Meshes
- Stable snap rounding
- Snap rounding of Bézier curves
- Title not available (Why is that?)
- Iterated snap rounding with bounded drift
- Rounding meshes in 3D
- Rounding Arrangements Dynamically
Uses Software
This page was built for publication: An intersection-sensitive algorithm for snap rounding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868103)
