Iterated snap rounding

DOI10.1016/S0925-7721(01)00064-5zbMath1011.68145OpenAlexW2032286430MaRDI QIDQ1862124

Eli Packer, Dan Halperin

Publication date: 10 March 2003

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

Full work available at URL: https://doi.org/10.1016/s0925-7721(01)00064-5

zbMATH Keywords

arrangementsrobustnessgeometric rounding

Mathematics Subject Classification ID

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

Related Items (10)

PLANAR SHAPE MANIPULATION USING APPROXIMATE GEOMETRIC PRIMITIVES ⋮ An intersection-sensitive algorithm for snap rounding ⋮ Rounding meshes in 3D ⋮ Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction ⋮ Iterated snap rounding with bounded drift ⋮ OVERLAYING SURFACE MESHES, PART I: ALGORITHMS ⋮ Improved output-sensitive snap rounding ⋮ TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS ⋮ Consistent digital curved rays and pseudoline arrangements ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applications of a new space-partitioning technique
• Rotational polygon containment and minimum enclosure using only robust 2D constructions
• Efficient ray shooting and hidden surface removal
• Vertex-rounding a three-dimensional polyhedral subdivision
• Practical segment intersection with finite precision output
• Shortest path geometric rounding
• An optimal algorithm for intersecting line segments in the plane
• Rounding Arrangements Dynamically

This page was built for publication: Iterated snap rounding