Walking around fat obstacles.
From MaRDI portal
Publication:1853053
DOI10.1016/S0020-0190(01)00321-0zbMath1043.68101MaRDI QIDQ1853053
Klara Kedem, Matthew J. Katz, L. Paul Chew, Haggai David
Publication date: 21 January 2003
Published in: Information Processing Letters (Search for Journal in Brave)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
52A41: Convex functions and convex programs in convex geometry
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- An optimal algorithm for the on-line closest-pair problem
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
- Linear size binary space partitions for uncluttered scenes
- The complexity of the free space for motion planning amidst fat obstacles
- Range Searching and Point Location among Fat Objects