Walking around fat obstacles.

DOI10.1016/S0020-0190(01)00321-0zbMATH Open1043.68101OpenAlexW1982151947MaRDI QIDQ1853053FDOQ1853053

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

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

Recommendations

• Shortest paths in the plane with convex polygonal obstacles
• Shortest paths in the plane with polygonal obstacles
• On Shortest Paths Amidst Convex Polyhedra
• New results on shortest paths in three dimensions
• scientific article; zbMATH DE number 4064475

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)

Cites Work

• Range Searching and Point Location among Fat Objects
• 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects
• Title not available (Why is that?)
• Linear size binary space partitions for uncluttered scenes
• The complexity of the free space for motion planning amidst fat obstacles
• Title not available (Why is that?)
• An optimal algorithm for the on-line closest-pair problem

Cited In (3)

• Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes
• Simple wriggling is hard unless you are a fat hippo
• A note on the perimeter of fat objects

This page was built for publication: Walking around fat obstacles.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853053)