Computing the bounded subcomplex of an unbounded polyhedron
From MaRDI portal
Publication:1941218
DOI10.1016/j.comgeo.2011.11.002zbMath1261.65022arXiv1006.2767WikidataQ117245077 ScholiaQ117245077MaRDI QIDQ1941218
Michael Joswig, Sven Herrmann, Marc E. Pfetsch
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
numerical examples; tight span; combinatorial algorithms; Hasse diagram; bounded subcomplex; unbounded polyhedron; vertex-incidences
65D18: Numerical aspects of computer graphics, image analysis, and computational geometry
Uses Software