Computing optimal &agr;-fat and &agr;-small decompositions

Authors:
Mirela Damian-Iordache;Sriram V. Pemmaraju
Affiliations:
Department of Computer Science, University of Iowa;Department of Computer Science, University of Iowa
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Motion planning amidst fat obstacles (extended abstract)

SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Range searching and point location among fat objects

Journal of Algorithms
Collision detection in aspect and scale bounded polyhedra

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Shape constrained polygon decomposition and graph domination problems

Shape constrained polygon decomposition and graph domination problems

Exact and approximation algorithms for computing optimal fat decompositions

Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02

Hi-index	0.00