Vertex-rounding a three-dimensional polyhedral subdivision

DOI10.1007/PL00009480MaRDI QIDQ1809514zbMATH OpenFDO

Authors Steven Fortune

Publication date 25 November 1999

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/PL00009480

zbMATH Keywords

geometric algorithms

Mathematics Subject Classification ID

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

Recommendations

• Rounding meshes in 3D
• 3D snap rounding
• Storing the subdivision of a polyhedral surface
• Linear time approximation of 3D convex polytopes

Cited in

(10)

• LOOK: A lazy object-oriented kernel design for geometric computation
• Iterated snap rounding
• Rounding meshes in 3D
• Boolean operations on 3D selective Nef complexes: data structure, algorithms, optimized implementation and experiments
• Inner and outer rounding of Boolean operations on lattice polygonal regions
• Of What Use Is Floating-Point Arithmetic in Computational Geometry?
• Two approximate Minkowski sum algorithms
• 3D snap rounding
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Iterated snap rounding with bounded drift

This page was built for publication: Vertex-rounding a three-dimensional polyhedral subdivision

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