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 NPhard in most models, but for some assumptions allows polynomial-time reconstruction algorithms which we describe.

• Type: Conference
• Year: 2009
• Where: ISAAC
• Authors: Therese C. Biedl, Stephane Durocher, Jack Snoeyink
• Keywords: Algorithms, ISAAC 2009, Polynomial-time Reconstruction Algorithms, Two-dimensional Polygons, Visibility Polygons