Reconstructing Polygons from Scanner Data
Therese C. Biedl,Stephane Durocher,Jack Snoeyink +2 more
- 05 Dec 2009
- pp 862-871
TL;DR: This work considers the problem of reconstructing the floor plan of a room from different types of scan data, and presents algorithmic and hardness results for reconstructing two-dimensional polygons from points, point/normal pairs, and visibility polygons.
read more
Abstract: A range-finding scanner can collect information about the shape of an (unknown) polygonal room in which it is placed. Suppose that a set of scanners returns not only a set of points, but also additional information, such as the normal to the plane when a scan beam detects a wall. We consider the problem of reconstructing the floor plan of a room from different types of scan data. In particular, we present algorithmic and hardness results for reconstructing two-dimensional polygons from points, point/normal pairs, and visibility polygons. The polygons may have restrictions on topology (e.g., to be simply connected) or geometry (e.g., to be orthogonal). We show that this reconstruction problem is NP-hard in most models, but for some assumptions allows polynomial-time reconstruction algorithms which we describe.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Curve and surface reconstruction: algorithms with mathematical analysis by Tamal K. Dey Cambridge University Press
TL;DR: This text discusses algorithms for performing these reconstructions for both two-dimensional curves and three-dimensional surfaces in the context of the mathematical basis upon which they are derived and their properties proven.
135
Reconstructing a simple polygon from its angles
Yann Disser,Matúš Mihalák,Peter Widmayer +2 more
- 21 Jun 2010
TL;DR: It is proved that the sequence of angle measurements at all vertices of a simple polygon in cyclic order uniquely determines the polygon up to similarity.
17
Skeletal representations of orthogonal shapes
TL;DR: It is shown that the cube skeleton is homotopically equivalent to its original shape, reduces its dimension, and it is composed of line segments or planar polygons with restricted orientation.
Efficient algorithms for boundary extraction of 2D and 3D orthogonal pseudomanifolds
TL;DR: Algorithms to extract the boundary representation of orthogonal polygons and polyhedra, either manifold or pseudomanifold, from the well-known voxel and octree models as well as from three vertex-based models found in the related literature.
Covering points with orthogonally convex polygons
TL;DR: This paper proposes an O(nlogn) algorithm to construct such a polygon if it exists, or else report the non-existence in the same time bound, and extends the algorithm to count all such polygons without hindering the overall time complexity.
10
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
•Book
Computational Geometry: An Introduction
Franco P. Preparata,Michael Ian Shamos +1 more
- 01 Jan 1978
TL;DR: In this article, the authors present a coherent treatment of computational geometry in the plane, at the graduate textbook level, and point out the way to the solution of the more challenging problems in dimensions higher than two.
4.5K
Computational geometry.
Michael Ian Shamos
- 01 Jan 1978
TL;DR: The first such result is provided by showing that greedy routing can be made to work on Planar triangulations, and some well known results in geometry are generalized to the topological plane.
3.3K
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
John E. Hopcroft,Richard M. Karp +1 more
TL;DR: This paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to $(m + n)\sqrt n $.
3K