SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Efficient hidden surface removal for objects with small union size
Computational Geometry: Theory and Applications
Fat Triangles Determine Linearly Many Holes
SIAM Journal on Computing
Motion planning amidst fat obstacles (extended abstract)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
The complexity of the free space for a robot moving amidst fat obstacles
Computational Geometry: Theory and Applications
I-COLLIDE: an interactive and exact collision detection system for large-scale environments
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
Computer graphics (2nd ed. in C): principles and practice
Computer graphics (2nd ed. in C): principles and practice
Range searching and point location among fat objects
Journal of Algorithms
On the complexity of the union of fat objects in the plane
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Realistic input models for geometric algorithms
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Handbook of discrete and computational geometry
On fat partitioning, fat covering and the union size of polygons
Computational Geometry: Theory and Applications
Analysis of a bounding box heuristic for object intersection
Journal of the ACM (JACM)
Dynamic data structures for fat objects and their applications
Computational Geometry: Theory and Applications
Computing optimal &agr;-fat and &agr;-small decompositions
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Towards an evolved lower bound for the most circular partition of a square
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
| Hi-index | 0.00 |
The minimum α-fat decomposition problem is the problem of decomposing a simple polygon into fewest subpolygons, each with aspect ratio at most α, for a given α 0. The main result in the paper is a polynomial time algorithm that solves the version of this problem that disallows Steiner points. The algorithm returns an optimal α-fat decomposition, if there is one, and reports failure otherwise. We also devise a faster approximation algorithm that produces, for any ε 0, an (α + ε)-fat decomposition with as few polygons as an optimal α-fat decomposition.