Computing the bounded subcomplex of an unbounded polyhedron

DOI10.1016/j.comgeo.2011.11.002zbMath1261.65022arXiv1006.2767OpenAlexW2148675558WikidataQ117245077 ScholiaQ117245077MaRDI QIDQ1941218

Marc E. Pfetsch, Sven Herrmann, Michael Joswig

Publication date: 12 March 2013

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

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

zbMATH Keywords

numerical examplestight spancombinatorial algorithmsHasse diagrambounded subcomplexunbounded polyhedronvertex-incidences

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Bounds on the complexity of halfspace intersections when the bounded faces have small dimension, Algorithms for tight spans and tropical linear spaces

Uses Software

• polymake