Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1016/j.comgeo.2011.04.002 | Comput. Geom. |
Keywords | Field | DocType |
reconstruction,orthogonal polyhedra,orthogonally convex,fast algorithm,vertex representation,putative vertex set,vertex set,orthogonal polyhedron | Vertex configuration,Orthogonal convex hull,Discrete mathematics,Combinatorics,Vertex (geometry),Vertex (graph theory),Dual polyhedron,Polyhedron,Spherical polyhedron,Mathematics | Journal |
Volume | Issue | ISSN |
44 | 8 | Computational Geometry: Theory and Applications |
Citations | PageRank | References |
8 | 0.73 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Therese Biedl | 1 | 902 | 106.36 |
| Burkay Genç | 2 | 16 | 2.94 |