Reconstructing orthogonal polyhedra from putative vertex sets

DOI10.1016/J.COMGEO.2011.04.002zbMATH Open1225.65026OpenAlexW2083269131MaRDI QIDQ634249FDOQ634249

Authors: Burkay Genç, Therese 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

Recommendations

• Reconstructing convex polygons and convex polyhedra from edge and face counts in orthogonal projections
• Reconstructing polygons from scanner data
• Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections
• scientific article; zbMATH DE number 4062601
• scientific article; zbMATH DE number 1303061

zbMATH Keywords

pattern recognitionreconstructionobject recognitionvertex setorthogonal polyhedra

Mathematics Subject Classification ID

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

Cites Work

• On polyhedra induced by point sets in space
• Title not available (Why is that?)
• On the definition and computation of rectilinear convex hulls
• Connected Rectilinear Graphs on Point Sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• One hundred problems in elementary mathematics. With a foreword by Martin Gardner
• Title not available (Why is that?)

Cited In (17)

• Reconstructing sets of orthogonal line segments in the plane
• Title not available (Why is that?)
• Title not available (Why is that?)
• Covering points with minimum/maximum area orthogonally convex polygons
• A fast and efficient algorithm for determining the connected orthogonal convex hulls
• 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
• Rectilinear convex hull of points in 3D and applications
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
• Bounded-degree polyhedronization of point sets
• Separating bichromatic point sets in the plane by restricted orientation convex hulls
• On the reconstruction of polytopes
• Covering oriented points in the plane with orthogonal polygons is NP-complete
• Rectilinear convex hull with minimum area
• Reconstructing convex polygons and convex polyhedra from edge and face counts in orthogonal projections
• Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections
• The rectilinear convex hull of line segments

This page was built for publication: Reconstructing orthogonal polyhedra from putative vertex sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634249)