File Download
There are no files associated with this item.
SFX Link
- Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
- Vigneron, Antoine
- Geometric Algorithms Lab.
Views & Downloads
Detailed Information
Cited time in 
Cited time in 
Cited time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.citation.conferencePlace | AT | - |
| dc.citation.endPage | 1715 | - |
| dc.citation.startPage | 171 | - |
| dc.citation.title | Symposium on Computational Geometry | - |
| dc.contributor.author | Binham, Daniel | - |
| dc.contributor.author | Manhaes de Castro, Pedro Machado | - |
| dc.contributor.author | Vigneron, Antoine | - |
| dc.date.accessioned | 2023-12-19T18:38:34Z | - |
| dc.date.available | 2023-12-19T18:38:34Z | - |
| dc.date.created | 2017-10-26 | - |
| dc.date.issued | 2017-07-04 | - |
| dc.description.abstract | Given a planar subdivision with n vertices, each face having a cone of possible directions of travel, our goal is to decide which vertices of the subdivision can be reached from a given starting point s. We give an O(n log n)-time algorithm for this problem, as well as an Ω(n log n) lower bound in the algebraic computation tree model. We prove that the generalization where two cones of directions per face are allowed is NP-hard. | - |
| dc.identifier.bibliographicCitation | Symposium on Computational Geometry, pp.171 - 1715 | - |
| dc.identifier.doi | 10.4230/LIPIcs.SoCG.2017.17 | - |
| dc.identifier.issn | 1868-8969 | - |
| dc.identifier.scopusid | 2-s2.0-85029942986 | - |
| dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/32753 | - |
| dc.identifier.url | http://drops.dagstuhl.de/opus/volltexte/2017/7202/ | - |
| dc.language | 영어 | - |
| dc.publisher | 33rd International Symposium on Computational Geometry, SoCG 2017 | - |
| dc.title | Reachability in a planar subdivision with direction constraints | - |
| dc.type | Conference Paper | - |
| dc.date.conferenceDate | 2017-07-04 | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.