Walking around fat obstacles.

DOI10.1016/S0020-0190(01)00321-0zbMath1043.68101OpenAlexW1982151947MaRDI QIDQ1853053

Klara Kedem, Haggai David, L. Paul Chew, Matthew J. Katz

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00321-0

zbMATH Keywords

Computational geometryFat objectsShort paths

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex functions and convex programs in convex geometry (52A41)

Related Items

Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes ⋮ A note on the perimeter of fat objects

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