Iterated snap rounding
From MaRDI portal
Publication:1862124
DOI10.1016/S0925-7721(01)00064-5zbMath1011.68145MaRDI QIDQ1862124
Publication date: 10 March 2003
Published in: Computational Geometry (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS, OVERLAYING SURFACE MESHES, PART I: ALGORITHMS, Generalized fraction-free \(LU\) factorization for singular systems with kernel extraction, An intersection-sensitive algorithm for snap rounding, Iterated snap rounding with bounded drift, Improved output-sensitive snap rounding
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