Improved construction of vertical decompositions of three-dimensional arrangements

DOI10.1145/513400.513437zbMath1414.68136OpenAlexW1987388366MaRDI QIDQ4557564

Hayim Shaul, Dan Halperin

Publication date: 23 November 2018

Published in: Proceedings of the eighteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/513400.513437

zbMATH Keywords

arrangementsexact computationvertical decompositiongeometric software

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items (4)

Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces ⋮ A generic and flexible framework for the geometrical and topological analysis of (algebraic) surfaces ⋮ On the computation of an arrangement of quadrics in 3D ⋮ Geometric optimization and sums of algebraic functions

This page was built for publication: Improved construction of vertical decompositions of three-dimensional arrangements