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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amenda, N., Choi, S., Kolluri, R.: The power crust, union of balls and the medial axis. Comp. Geom.: Theory & App. 19(2–3), 127–153 (2001)
Amenta, N., Choi, S., Kolluri, R.: The power crust. In: Proc. ACM Symp. Solid Model. & App., pp. 249–260 (2001)
DeltaSphere, Inc. Deltasphere 3D laser scanner (2001), http://www.deltasphere.com/DeltaSphere-3000.html
Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449–467 (1965)
Formann, M., Woeginger, G.J.: On the reconstruction of simple polygons. Bull. Eur. Assoc. Theor. Comp. Sc. 40, 225–230 (1990)
Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman, New York (1979)
Hopcroft, J.E., Karp, R.M.: An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comp. 1(4), 472–484 (1988)
Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comp. 11(4), 676–686 (1982)
Jansen, K., Woeginger, G.J.: The complexity of detecting crossingfree configurations in the plane. BIT 33(4), 580–595 (1993)
Lovász, L., Plummer, M.D.: Matching theory. In: Ann. Disc. Math. North-Holland Mathematics Studies, vol. 29 (1986)
Nyland, L., Lastra, A., McAllister, D., Popescu, V., McCue, C.: Capturing, processing and rendering real-world scenes. In: El-Hakim, S.F., Gruen, A. (eds.) Videometrics and Optical Methods for 3D Shape Measurement, Electronic Imaging. SPIE Int. Soc. Optical. Eng. (2001)
O’Rourke, J.: Uniqueness of orthogonal connect-the-dots. In: Toussaint, G.T. (ed.) Computational Morphology, pp. 97–104. Elsevier, Amsterdam (1988)
Preparata, F., Shamos, M.: Computational Geometry: An Introduction. Springer, Heidelberg (1985)
Rappaport, D.: On the complexity of computing orthogonal polygons from a set of points. Technical Report SOCS-86.9, McGill University, Montréal, Canada (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biedl, T., Durocher, S., Snoeyink, J. (2009). Reconstructing Polygons from Scanner Data. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_87
Download citation
DOI: https://doi.org/10.1007/978-3-642-10631-6_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10630-9
Online ISBN: 978-3-642-10631-6
eBook Packages: Computer ScienceComputer Science (R0)