DC Field | Value | Language |
---|---|---|
dc.contributor.author | DEBERG, M | ko |
dc.contributor.author | MATOUSEK, J | ko |
dc.contributor.author | Cheong, Otfried | ko |
dc.date.accessioned | 2013-03-02T12:48:54Z | - |
dc.date.available | 2013-03-02T12:48:54Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1995-07 | - |
dc.identifier.citation | DISCRETE COMPUTATIONAL GEOMETRY, v.14, no.1, pp.9 - 29 | - |
dc.identifier.issn | 0179-5376 | - |
dc.identifier.uri | http://hdl.handle.net/10203/73592 | - |
dc.description.abstract | Let B be a set of n arbitrary (possibly intersecting) convex obstacles in R(d). It is shown that any two points which can be connected by a path avoiding the obstacles can also be connected by a path consisting of O(n((d-1)[d/2+1])) segments. The bound cannot be improved below Omega(n(d)); thus, in R(3), the answer is between n(3) and n(4). For open disjoint convex obstacles, a Theta(n) bound is proved. By a well-known reduction, the general case result also upper bounds the complexity for a translational motion of an arbitrary convex robot among convex obstacles. Asymptotically tight bounds and efficient algorithms are given in the planar case. | - |
dc.language | English | - |
dc.publisher | SPRINGER VERLAG | - |
dc.title | PIECEWISE-LINEAR PATHS AMONG CONVEX OBSTACLES | - |
dc.type | Article | - |
dc.identifier.wosid | A1995QZ11500002 | - |
dc.identifier.scopusid | 2-s2.0-21844507823 | - |
dc.type.rims | ART | - |
dc.citation.volume | 14 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 9 | - |
dc.citation.endingpage | 29 | - |
dc.citation.publicationname | DISCRETE COMPUTATIONAL GEOMETRY | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | DEBERG, M | - |
dc.contributor.nonIdAuthor | MATOUSEK, J | - |
dc.type.journalArticle | Article | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.