Polygon reconstruction from line cross-sections

Avishay Sidlesky; Gill Barequet; Craig Gotsman

Polygon reconstruction from line cross-sections

Avishay Sidlesky, Gill Barequet, Craig Gotsman

Computer Science

Research output: Contribution to conference › Paper › peer-review

18 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 language	English (US)
Pages	81-84
Number of pages	4
State	Published - Jan 1 2006
Event	18th Annual Canadian Conference on Computational Geometry, CCCG 2006 - Kingston, Canada Duration: Aug 14 2006 → Aug 16 2006

Conference

Conference	18th Annual Canadian Conference on Computational Geometry, CCCG 2006
Country/Territory	Canada
City	Kingston
Period	8/14/06 → 8/16/06

All Science Journal Classification (ASJC) codes

Geometry and Topology
Computational Mathematics

Cite this

@conference{3bda776b0daf40c5bc45cc22a82a29fe,

title = "Polygon reconstruction from line cross-sections",

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.",

author = "Avishay Sidlesky and Gill Barequet and Craig Gotsman",

year = "2006",

month = jan,

day = "1",

language = "English (US)",

pages = "81--84",

note = "18th Annual Canadian Conference on Computational Geometry, CCCG 2006 ; Conference date: 14-08-2006 Through 16-08-2006",

}

TY - CONF

T1 - Polygon reconstruction from line cross-sections

AU - Sidlesky, Avishay

AU - Barequet, Gill

AU - Gotsman, Craig

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85010836990&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85010836990&partnerID=8YFLogxK

M3 - Paper

SP - 81

EP - 84

T2 - 18th Annual Canadian Conference on Computational Geometry, CCCG 2006

Y2 - 14 August 2006 through 16 August 2006

ER -

Polygon reconstruction from line cross-sections

Abstract

Conference

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this