A Faster Algorithm for Computing Motorcycle Graphs

Handle URI:
http://hdl.handle.net/10754/348466
Title:
A Faster Algorithm for Computing Motorcycle Graphs
Authors:
Vigneron, Antoine E. ( 0000-0003-3586-3431 ) ; Yan, Lie
Abstract:
We present a new algorithm for computing motorcycle graphs that runs in (Formula presented.) time for any (Formula presented.), improving on all previously known algorithms. The main application of this result is to computing the straight skeleton of a polygon. It allows us to compute the straight skeleton of a non-degenerate polygon with (Formula presented.) holes in (Formula presented.) expected time. If all input coordinates are (Formula presented.)-bit rational numbers, we can compute the straight skeleton of a (possibly degenerate) polygon with (Formula presented.) holes in (Formula presented.) expected time. In particular, it means that we can compute the straight skeleton of a simple polygon in (Formula presented.) expected time if all input coordinates are (Formula presented.)-bit rationals, while all previously known algorithms have worst-case running time (Formula presented.). © 2014 Springer Science+Business Media New York.
KAUST Department:
Visual Computing Center (VCC)
Citation:
A Faster Algorithm for Computing Motorcycle Graphs 2014, 52 (3):492 Discrete & Computational Geometry
Publisher:
Springer Verlag
Journal:
Discrete & Computational Geometry
Issue Date:
29-Aug-2014
DOI:
10.1007/s00454-014-9625-2
Type:
Article
ISSN:
0179-5376; 1432-0444
Additional Links:
http://link.springer.com/10.1007/s00454-014-9625-2
Appears in Collections:
Articles; Visual Computing Center (VCC)

Full metadata record

DC FieldValue Language
dc.contributor.authorVigneron, Antoine E.en
dc.contributor.authorYan, Lieen
dc.date.accessioned2015-04-02T13:26:26Zen
dc.date.available2015-04-02T13:26:26Zen
dc.date.issued2014-08-29en
dc.identifier.citationA Faster Algorithm for Computing Motorcycle Graphs 2014, 52 (3):492 Discrete & Computational Geometryen
dc.identifier.issn0179-5376en
dc.identifier.issn1432-0444en
dc.identifier.doi10.1007/s00454-014-9625-2en
dc.identifier.urihttp://hdl.handle.net/10754/348466en
dc.description.abstractWe present a new algorithm for computing motorcycle graphs that runs in (Formula presented.) time for any (Formula presented.), improving on all previously known algorithms. The main application of this result is to computing the straight skeleton of a polygon. It allows us to compute the straight skeleton of a non-degenerate polygon with (Formula presented.) holes in (Formula presented.) expected time. If all input coordinates are (Formula presented.)-bit rational numbers, we can compute the straight skeleton of a (possibly degenerate) polygon with (Formula presented.) holes in (Formula presented.) expected time. In particular, it means that we can compute the straight skeleton of a simple polygon in (Formula presented.) expected time if all input coordinates are (Formula presented.)-bit rationals, while all previously known algorithms have worst-case running time (Formula presented.). © 2014 Springer Science+Business Media New York.en
dc.publisherSpringer Verlagen
dc.relation.urlhttp://link.springer.com/10.1007/s00454-014-9625-2en
dc.rightsArchived with thanks to Discrete & Computational Geometryen
dc.titleA Faster Algorithm for Computing Motorcycle Graphsen
dc.typeArticleen
dc.contributor.departmentVisual Computing Center (VCC)en
dc.identifier.journalDiscrete & Computational Geometryen
dc.eprint.versionPost-printen
dc.contributor.institutionDepartment of Computer Science and Engineering, The Hong Kong University of Science and Technology (HKUST), Clear Water Bay, Kowloon, Hong Kongen
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)en
kaust.authorVigneron, Antoine E.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.