Computational geometry: an introduction
Computational geometry: an introduction
Orthogonal polyhedra as geometric bounds in constructive solid geometry
SMA '97 Proceedings of the fourth ACM symposium on Solid modeling and applications
Output-size sensitive algorithms for finding maximal vectors
SCG '85 Proceedings of the first annual symposium on Computational geometry
Proceedings of the conference on Visualization '01
Orthogonal Polyhedra: Representation and Computation
HSCC '99 Proceedings of the Second International Workshop on Hybrid Systems: Computation and Control
On polyhedra induced by point sets in space
Discrete Applied Mathematics
Dot Pattern Processing Using Voronoi Neighborhoods
IEEE Transactions on Pattern Analysis and Machine Intelligence
Merging faces: a new orthogonal simplification of solid models
DGCI'13 Proceedings of the 17th IAPR international conference on Discrete Geometry for Computer Imagery
Covering points with orthogonal polygons
Discrete Applied Mathematics
| Hi-index | 0.00 |
In this paper we study the problem of reconstructing orthogonal polyhedra from a putative vertex set, i.e., we are given a set of points and want to find an orthogonal polyhedron for which this is the set of vertices. This is well-studied in 2D; we mostly focus on 3D, and on the case where the given set of points may be rotated beforehand. We obtain fast algorithms for reconstruction in the case where the answer must be orthogonally convex.