A simple output-sensitive algorithm for hidden surface removal
ACM Transactions on Graphics (TOG)
Motion planning amidst fat obstacles (extended abstract)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Spheres, molecules, and hidden surface removal
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Realistic input models for geometric algorithms
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
The 2-center problem with obstacles
Proceedings of the sixteenth annual symposium on Computational geometry
Proceedings of the sixteenth annual symposium on Computational geometry
Online point location in planar arrangements and its applications
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The 2-center problem with obstacles
Journal of Algorithms
Speeding Up the Incremental Construction of the Union of Geometric Objects in Practice
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
TSP with Neighborhoods of Varying Size
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Output-sensitive construction of the union of triangles
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
TSP with neighborhoods of varying size
Journal of Algorithms
On the union of fat tetrahedra in three dimensions
Journal of the ACM (JACM)
TSP with neighborhoods of varying size
Journal of Algorithms
Improved bound for the union of fat triangles
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
It is shown that for every fixed delta 0 the following holds: if F is a union of n triangles, all of whose angles are at least delta , then the complement of F has O(n) connected components, and the boundary of F consists of O(n log log n) segments. This latter complexity becomes linear if all triangles are of roughly the same size or if they are all infinite wedges. A randomized algorithm that computes F in expected time O(n2/sup alpha (n)/ log n) is given. Several applications of these results are presented.