Exact and approximation algorithms for computing optimal fat decompositions
From MaRDI portal
Publication:598551
DOI10.1016/j.comgeo.2004.01.004zbMath1056.65016OpenAlexW2027037071MaRDI QIDQ598551
Publication date: 6 August 2004
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.01.004
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient hidden surface removal for objects with small union size
- Motion planning in environments with low obstacle density
- Finding the medial axis of a simple polygon in linear time
- The complexity of the free space for a robot moving amidst fat obstacles
- On fat partitioning, fat covering and the union size of polygons
- On the complexity of the union of fat convex objects in the plane
- Dynamic data structures for fat objects and their applications
- Analysis of a bounding box heuristic for object intersection
- Decomposing a Polygon into Simpler Components
- Range Searching and Point Location among Fat Objects
- Fat Triangles Determine Linearly Many Holes
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- Filling polyhedral molds
