dc.citation.endPage |
514 |
- |
dc.citation.number |
3 |
- |
dc.citation.startPage |
492 |
- |
dc.citation.title |
DISCRETE & COMPUTATIONAL GEOMETRY |
- |
dc.citation.volume |
52 |
- |
dc.contributor.author |
Vigneron, Antoine |
- |
dc.contributor.author |
Yan, Lie |
- |
dc.date.accessioned |
2023-12-22T02:08:18Z |
- |
dc.date.available |
2023-12-22T02:08:18Z |
- |
dc.date.created |
2016-06-18 |
- |
dc.date.issued |
2014-10 |
- |
dc.description.abstract |
We present a new algorithm for computing motorcycle graphs that runs in time for any , 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 holes in expected time. If all input coordinates are -bit rational numbers, we can compute the straight skeleton of a (possibly degenerate) polygon with holes in expected time. In particular, it means that we can compute the straight skeleton of a simple polygon in expected time if all input coordinates are -bit rationals, while all previously known algorithms have worst-case running time |
- |
dc.identifier.bibliographicCitation |
DISCRETE & COMPUTATIONAL GEOMETRY, v.52, no.3, pp.492 - 514 |
- |
dc.identifier.doi |
10.1007/s00454-014-9625-2 |
- |
dc.identifier.issn |
0179-5376 |
- |
dc.identifier.scopusid |
2-s2.0-85027953958 |
- |
dc.identifier.uri |
https://scholarworks.unist.ac.kr/handle/201301/19930 |
- |
dc.identifier.url |
http://link.springer.com/article/10.1007%2Fs00454-014-9625-2 |
- |
dc.identifier.wosid |
000341912800005 |
- |
dc.language |
영어 |
- |
dc.publisher |
SPRINGER |
- |
dc.title |
A Faster Algorithm for Computing Motorcycle Graphs |
- |
dc.type |
Article |
- |
dc.description.isOpenAccess |
FALSE |
- |
dc.description.journalRegisteredClass |
scie |
- |
dc.description.journalRegisteredClass |
scopus |
- |