Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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.  consider the problem of reconstructing the floor plan of a room from different types of scan data. In particular,  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).  show that this reconstruction problem is NP-hard in most models, but for some assumptions allows polynomial-time reconstruction algorithms which  describe.
['Therese C. Biedl', 'Stephane Durocher', 'Jack Snoeyink']
I am writing a research paper on a idea Reconstructing Polygons from Scanner Data
[{"from": "human", "value": "I am writing a research paper on a idea Reconstructing Polygons from Scanner Data"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: 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.  consider the problem of reconstructing the floor plan of a room from different types of scan data. In particular,  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).  show that this reconstruction problem is NP-hard in most models, but for some assumptions allows polynomial-time reconstruction algorithms which  describe."}]