Reconstructing Polygons from Scanner Data

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.

[1]  Gerhard J. Woeginger,et al.  On the reconstruction of simple polygons , 1990, Bull. EATCS.

[2]  Sunghee Choi,et al.  The power crust , 2001, SMA '01.

[3]  Jindong Chen,et al.  Automatic Reconstruction of 3D CAD Models from Digital Scans , 1999, Int. J. Comput. Geom. Appl..

[4]  Voicu Popescu,et al.  Capturing, processing, and rendering real-world scenes , 2000, IS&T/SPIE Electronic Imaging.

[5]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[6]  Joseph S. B. Mitchell,et al.  Generating Random Polygons with Given Vertices , 1996, Comput. Geom..

[7]  Matthew J. Sottile,et al.  Curve and surface reconstruction: algorithms with mathematical analysis by Tamal K. Dey Cambridge University Press , 2010, SIGA.

[8]  Brahim Hnich,et al.  Covering oriented points in the plane with orthogonal polygons is NP-complete , 2010, Electron. Notes Discret. Math..

[9]  Stephane Durocher.  Graph-theoretic and geometric algorithms associated with moment-based polygon reconstruction , 1999 .

[10]  Klaus Jansen,et al.  The complexity of detecting crossingfree configurations in the plane , 1992, BIT Comput. Sci. Sect..

[11]  L. Lovász.  Matching Theory (North-Holland mathematics studies) , 1986 .

[12]  David G. Kirkpatrick,et al.  On the hardness of turn-angle-restricted rectilinear cycle cover problems , 2002, CCCG.

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Jayme Luiz Szwarcfiter,et al.  Hamilton Paths in Grid Graphs , 1982, SIAM J. Comput..

[15]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[16]  Remco C. Veltkamp,et al.  Closed Object Boundaries from Scattered Points , 1994, Lecture Notes in Computer Science.

[17]  Sunghee Choi,et al.  The power crust, unions of balls, and the medial axis transform , 2001, Comput. Geom..

[18]  Armin Gruen,et al.  Videometrics and Optical Methods for 3d Shape Measurement , 2000 .

[19]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[20]  Stephane Durocher,et al.  Reconstructing polygons from scanner data , 2011, Theor. Comput. Sci..

[21]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

[22]  J. O'Rourke.  Uniqueness of Orthogonal Connect-the-Dots , 1988 .

[23]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[24]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .