DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, HK | - |
dc.contributor.author | Cheong, O | - |
dc.contributor.author | Matousek, J | - |
dc.contributor.author | Vigneron, A | - |
dc.date.accessioned | 2016-03-31T09:19:50Z | - |
dc.date.available | 2016-03-31T09:19:50Z | - |
dc.date.created | 2012-01-09 | - |
dc.date.issued | 2012-01 | - |
dc.identifier.issn | 0925-7721 | - |
dc.identifier.other | 2012-OAK-0000024431 | - |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/17019 | - |
dc.description.abstract | Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most 1, and let P be a convex polygon with n vertices. Given a starting configuration (a location and a direction of travel) for B inside P. we characterize the region of all points of P that can be reached by B, and show that it has complexity O(n). We give an O(n(2)) time algorithm to compute this region. We show that a point is reachable only if it can be reached by a path of type CCSCS, where C denotes a unit circle arc and S denotes a line segment. (C) 2011 Elsevier B.V. All rights reserved. | - |
dc.description.statementofresponsibility | X | - |
dc.language | English | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.relation.isPartOf | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.subject | Motion planning | - |
dc.subject | Bounded curvature | - |
dc.subject | Convex polygon | - |
dc.subject | CONSTRAINED SHORTEST PATHS | - |
dc.subject | TIME ALGORITHM | - |
dc.subject | LINEAR-TIME | - |
dc.subject | OBSTACLES | - |
dc.subject | CURVES | - |
dc.subject | PLANE | - |
dc.title | Reachability by paths of bounded curvature in a convex polygon | - |
dc.type | Article | - |
dc.contributor.college | 컴퓨터공학과 | - |
dc.identifier.doi | 10.1016/J.COMGEO.2011.07.003 | - |
dc.author.google | Ahn, HK | - |
dc.author.google | Cheong, O | - |
dc.author.google | Matousek, J | - |
dc.author.google | Vigneron, A | - |
dc.relation.volume | 45 | - |
dc.relation.issue | 1-2 | - |
dc.relation.startpage | 21 | - |
dc.relation.lastpage | 32 | - |
dc.contributor.id | 10152366 | - |
dc.relation.journal | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.relation.index | SCI급, SCOPUS 등재논문 | - |
dc.relation.sci | SCIE | - |
dc.collections.name | Journal Papers | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.45, no.1-2, pp.21 - 32 | - |
dc.identifier.wosid | 000296945500003 | - |
dc.date.tcdate | 2019-01-01 | - |
dc.citation.endPage | 32 | - |
dc.citation.number | 1-2 | - |
dc.citation.startPage | 21 | - |
dc.citation.title | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.citation.volume | 45 | - |
dc.contributor.affiliatedAuthor | Ahn, HK | - |
dc.identifier.scopusid | 2-s2.0-80053565782 | - |
dc.description.journalClass | 1 | - |
dc.description.journalClass | 1 | - |
dc.description.wostc | 5 | - |
dc.description.scptc | 6 | * |
dc.date.scptcdate | 2018-05-121 | * |
dc.type.docType | Article | - |
dc.subject.keywordPlus | SHORTEST PATHS | - |
dc.subject.keywordPlus | TIME ALGORITHM | - |
dc.subject.keywordPlus | CURVES | - |
dc.subject.keywordAuthor | Motion planning | - |
dc.subject.keywordAuthor | Bounded curvature | - |
dc.subject.keywordAuthor | Convex polygon | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.relation.journalWebOfScienceCategory | Mathematics | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.