Polygon Reconstruction from Line Cross-Sections

We study the following geometric probing problem: Reconstruct a planar polygon from its intersections with a collection of arbitrarily-oriented "cutting" lines. We propose an algorithm which enumerates all possible reconstructions that are consistent with the input and comply with a realistic sampling condition. We analyze the complexity of the algorithm and provide some experimental results.

• Type: Conference
• Year: 2006
• Where: CCCG
• Authors: Gill Barequet, Craig Gotsman, Avishay Sidlesky
• Keywords: CCCG 2006, CCCG 2007, Planar Polygon, Possible Reconstructions, Realistic Sampling Condition