Improved Bounds on the Union Complexity of Fat Objects
Author:
Open Access
- 15 September 2007
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 40 (1) , 127-140
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- The Complexity of the Union of $(\alpha,\beta)$-Covered ObjectsSIAM Journal on Computing, 2005
- Realistic Input Models for Geometric AlgorithmsAlgorithmica, 2002
- On fat partitioning, fat covering and the union size of polygonsComputational Geometry, 1998
- 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objectsComputational Geometry, 1997
- Computing depth orders for fat objects and related problemsComputational Geometry, 1995
- Fat Triangles Determine Linearly Many HolesSIAM Journal on Computing, 1994
- The complexity of the free space for a robot moving amidst fat obstaclesComputational Geometry, 1993
- On the union of fat wedges and separating a collection of segments by a lineComputational Geometry, 1993
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figuresAlgorithmica, 1992
- Efficient hidden surface removal for objects with small union sizeComputational Geometry, 1992