File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

VigneronAntoine

Vigneron, Antoine
Geometric Algorithms Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Full metadata record

DC Field Value Language
dc.citation.conferencePlace HK -
dc.citation.conferencePlace Hong Kong -
dc.citation.endPage 259 -
dc.citation.startPage 251 -
dc.citation.title 16th Annual Symposium on Computational Geometry -
dc.contributor.author Ahn, Hee-Kap -
dc.contributor.author Cheong, Otfried -
dc.contributor.author Matousek, Jiri -
dc.contributor.author Vigneron, Antoine -
dc.date.accessioned 2023-12-20T06:36:54Z -
dc.date.available 2023-12-20T06:36:54Z -
dc.date.created 2016-07-04 -
dc.date.issued 2000-06-12 -
dc.description.abstract A point robot in the plane whose turning radius is constrained to be at least 1 and that is not allowed to make reversals is analyzed. Result is a characterization of the region of points reachable by paths under curvature constraints from a given starting configuration inside a convex polygon. It is shown that all points reachable from the starting configuration is also reachable by paths of a fairly special form. Reachable region is also shown to have complexity linear in the complexity of the polygon. The characterization is constructive and could be used to compute the reachability region. -
dc.identifier.bibliographicCitation 16th Annual Symposium on Computational Geometry, pp.251 - 259 -
dc.identifier.scopusid 2-s2.0-0033718031 -
dc.identifier.uri https://scholarworks.unist.ac.kr/handle/201301/34500 -
dc.identifier.url http://dl.acm.org/citation.cfm?id=336211&CFID=639749174&CFTOKEN=76434841 -
dc.language 영어 -
dc.publisher 16th Annual Symposium on Computational Geometry -
dc.title Reachability by paths of bounded curvature in convex polygons -
dc.type Conference Paper -
dc.date.conferenceDate 2000-06-12 -

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.