Polygon reconstruction from line cross-sections

Avishay Sidlesky, Gill Barequet, Craig Gotsman

Research output: Contribution to conferencePaperpeer-review

17 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages81-84
Number of pages4
StatePublished - Jan 1 2006
Event18th Annual Canadian Conference on Computational Geometry, CCCG 2006 - Kingston, Canada
Duration: Aug 14 2006Aug 16 2006

Conference

Conference18th Annual Canadian Conference on Computational Geometry, CCCG 2006
Country/TerritoryCanada
CityKingston
Period8/14/068/16/06

All Science Journal Classification (ASJC) codes

  • Geometry and Topology
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Polygon reconstruction from line cross-sections'. Together they form a unique fingerprint.

Cite this