Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
24
click to vote
CCCG
2001
favorite
Email
discuss
report
125
views
Computational Geometry
»
more
CCCG 2001
»
Segment endpoint visibility graphs are hamiltonian
14 years 6 days ago
Download
www.inf.ethz.ch
We show that the segment endpoint visibility graph of any finite set of disjoint line segments in the plane admits a simple Hamiltonian polygon, if not all segments are collinear. This proves a conjecture of Mirzaian.
Michael Hoffmann, Csaba D. Tóth
Real-time Traffic
CCCG 2001
|
CCCG 2007
|
Disjoint Line Segments
|
Segment Endpoint Visibility
|
Simple Hamiltonian Polygon
|
claim paper
Related Content
»
Elastic Partial Matching of Time Series
more »
Post Info
More Details (n/a)
Added
31 Oct 2010
Updated
31 Oct 2010
Type
Conference
Year
2001
Where
CCCG
Authors
Michael Hoffmann, Csaba D. Tóth
Comments
(0)
Researcher Info
Computational Geometry Study Group
Computer Vision