Rounding Arrangements Dynamically

DOI10.1142/S0218195998000096MaRDI QIDQ4513207zbMATH OpenOpenAlexFDO

Authors David H. Marimont, Leonidas 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

randomized algorithmrobustnessroundingdynamic data structurevertical trapezoidal decomposition

Mathematics Subject Classification ID

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

Recommendations

• Improved output-sensitive snap rounding
• Publication:3619944
• Computing a Face in an Arrangement of Line Segments and Related Problems
• Topologically sweeping an arrangement
• An intersection-sensitive algorithm for snap rounding

Cites work

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

Cited in

(11)

• Iterated snap rounding
• An intersection-sensitive algorithm for snap rounding
• Inner and outer rounding of Boolean operations on lattice polygonal regions
• Rounding Voronoi diagram
• 3D snap rounding
• Design and analysis of planar shape deformation
• Snapping graph drawings to the grid optimally
• Improved output-sensitive snap rounding
• Recent progress in exact geometric computation
• Iterated snap rounding with bounded drift
• Rounding meshes in 3D

This page was built for publication: Rounding Arrangements Dynamically

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