Rounding Arrangements Dynamically

DOI10.1142/S0218195998000096zbMath1035.68535OpenAlexW2102883867MaRDI QIDQ4513207

David H. Marimont, Leonidas J. Guibas

Publication date: 7 November 2000

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195998000096

zbMATH Keywords

robustnessrandomized algorithmroundingdynamic data structurevertical trapezoidal decomposition

Mathematics Subject Classification ID

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

Related Items

An intersection-sensitive algorithm for snap rounding ⋮ Rounding meshes in 3D ⋮ Snapping Graph Drawings to the Grid Optimally ⋮ Iterated snap rounding with bounded drift ⋮ Improved output-sensitive snap rounding ⋮ Design and analysis of planar shape deformation ⋮ Recent progress in exact geometric computation ⋮ Unnamed Item ⋮ Inner and outer rounding of Boolean operations on lattice polygonal regions ⋮ Iterated snap rounding ⋮ Rounding Voronoi diagram

Cites Work

• Applications of random sampling in computational geometry. II
• A fast planar partition algorithm. I
• Algorithms for Reporting and Counting Geometric Intersections
• An optimal algorithm for intersecting line segments in the plane