Vertex-rounding a three-dimensional polyhedral subdivision
From MaRDI portal
Publication:1809514
DOI10.1007/PL00009480zbMath0939.68139MaRDI QIDQ1809514
Publication date: 25 November 1999
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (9)
Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments ⋮ Rounding meshes in 3D ⋮ Iterated snap rounding with bounded drift ⋮ TWO APPROXIMATE MINKOWSKI SUM ALGORITHMS ⋮ Unnamed Item ⋮ Of What Use Is Floating-Point Arithmetic in Computational Geometry? ⋮ Inner and outer rounding of Boolean operations on lattice polygonal regions ⋮ Iterated snap rounding ⋮ LOOK: A lazy object-oriented kernel design for geometric computation
This page was built for publication: Vertex-rounding a three-dimensional polyhedral subdivision
