Reconstructing orthogonal polyhedra from putative vertex sets

DOI10.1016/J.COMGEO.2011.04.002MaRDI QIDQ634249zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 4062042 (Why is no real title available?)
• scientific article; zbMATH DE number 4062601 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 1303061 (Why is no real title available?)
• scientific article; zbMATH DE number 866021 (Why is no real title available?)
• Connected Rectilinear Graphs on Point Sets
• On polyhedra induced by point sets in space
• On the definition and computation of rectilinear convex hulls
• One hundred problems in elementary mathematics. With a foreword by Martin Gardner

Cited in

(17)

• Rectilinear convex hull with minimum area
• On the reconstruction of polytopes
• Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections
• Covering points with minimum/maximum area orthogonally convex polygons
• The rectilinear convex hull of line segments
• Reconstructing convex polygons and convex polyhedra from edge and face counts in orthogonal projections
• Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
• Rectilinear convex hull of points in 3D and applications
• A fast and efficient algorithm for determining the connected orthogonal convex hulls
• Reconstructing sets of orthogonal line segments in the plane
• Covering oriented points in the plane with orthogonal polygons is NP-complete
• scientific article; zbMATH DE number 4062601 (Why is no real title available?)
• Separating bichromatic point sets in the plane by restricted orientation convex hulls
• A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
• Bounded-degree polyhedronization of point sets
• scientific article; zbMATH DE number 1538126 (Why is no real title available?)
• Covering points with orthogonal polygons

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)