Inner and outer rounding of Boolean operations on lattice polygonal regions

DOI10.1016/j.comgeo.2004.08.005zbMath1090.65023arXivcs/0604059OpenAlexW2196640915MaRDI QIDQ2575584

Philippe Guigue, Olivier Devillers

Publication date: 5 December 2005

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

Full work available at URL: https://arxiv.org/abs/cs/0604059

zbMATH Keywords

set operationsintersectionlattice polygonal regiongeometric rounding

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Roundoff error (65G50)

Uses Software

• LOOK

Cites Work

• Vertex-rounding a three-dimensional polyhedral subdivision
• Practical segment intersection with finite precision output
• Shortest path geometric rounding
• Rounding Arrangements Dynamically
• Look — a Lazy Object-Oriented Kernel for geometric computation

This page was built for publication: Inner and outer rounding of Boolean operations on lattice polygonal regions