Walking around fat obstacles. (Q1853053): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Linear size binary space partitions for uncluttered scenes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4344150 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4401028 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Range Searching and Point Location among Fat Objects / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An optimal algorithm for the on-line closest-pair problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of the free space for motion planning amidst fat obstacles / rank | |||
Normal rank |
Latest revision as of 11:21, 5 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Walking around fat obstacles. |
scientific article |
Statements
Walking around fat obstacles. (English)
0 references
21 January 2003
0 references
We prove that if an object \(O\) is convex and fat then, for any two points \(a\) and \(b\) on its boundary, there exists a path on \(O's\) boundary, from \(a\) to \(b,\) whose length is bounded by the length of the line segment \(\overline{ab}\) times some constant \(\beta\). This constant is a function of the dimension \(d\) and the fatness parameter. We prove bounds for \(\beta\), and show how to efficiently find paths on the boundary of \(O\) whose lengths are within these bounds. As an application of this result, we briefly consider the problem of efficiently computing short paths in \(R^{d}\) in the presence of disjoint convex fat obstacles.
0 references
Computational geometry
0 references
Short paths
0 references
Fat objects
0 references
0 references