Reconstructing orthogonal polyhedra from putative vertex sets

DOI10.1016/j.comgeo.2011.04.002zbMath1225.65026OpenAlexW2083269131MaRDI QIDQ634249

Burkay Genç, Therese C. Biedl

Publication date: 2 August 2011

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

Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.04.002

zbMATH Keywords

pattern recognitionreconstructionobject recognitionvertex setorthogonal polyhedra

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Covering oriented points in the plane with orthogonal polygons is NP-complete, Covering points with minimum/maximum area orthogonally convex polygons, A fast and efficient algorithm for determining the connected orthogonal convex hulls, Separating bichromatic point sets in the plane by restricted orientation convex hulls, Rectilinear Convex Hull with Minimum Area, Covering points with orthogonal polygons, A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set, Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations

Cites Work

• On the definition and computation of rectilinear convex hulls
• On polyhedra induced by point sets in space
• Connected Rectilinear Graphs on Point Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item