Simple and practical geometric algorithms
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
On fence design and the complexity of push plans for orienting parts
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On the complexity of the union of fat objects in the plane
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
On the union of κ-curved objects
Proceedings of the fourteenth annual symposium on Computational geometry
The complexity of the union of (&agr;, &bgr;)-covered objects
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Pipes, cigars, and kreplach: the union of Minkowski sums in three dimensions
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Motion planning of a ball amid segments in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of a bounding box heuristic for object intersection
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of a bounding box heuristic for object intersection
Journal of the ACM (JACM)
Analyzing bounding boxes for object intersection
ACM Transactions on Graphics (TOG)
The union of congruent cubes in three dimensions
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Computational Geometry: Theory and Applications
On the Complexity of the Union of Geometric Objects
JCDCG '00 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Speeding up the incremental construction of the union of geometric objects in practice
Computational Geometry: Theory and Applications - Special issue on computational geometry - EWCG'02
On lines avoiding unit balls in three dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
On the union of κ-round objects
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
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
Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Vertical ray shooting for fat objects
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The interface between computational and combinatorial geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the twenty-second annual symposium on Computational geometry
Shortest paths on realistic polyhedra
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Computational Geometry: Theory and Applications
Small-size ε-nets for axis-parallel rectangles and boxes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Epsilon nets and union complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry
Near-linear approximation algorithms for geometric hitting sets
Proceedings of the twenty-fifth annual symposium on Computational geometry
On the union of fat tetrahedra in three dimensions
Journal of the ACM (JACM)
Weighted geometric set cover via quasi-uniform sampling
Proceedings of the forty-second ACM symposium on Theory of computing
Better bounds on the union complexity of locally fat objects
Proceedings of the twenty-sixth annual symposium on Computational geometry
Tangencies between families of disjoint regions in the plane
Proceedings of the twenty-sixth annual symposium on Computational geometry
A note on the perimeter of fat objects
Computational Geometry: Theory and Applications
Algorithm engineering: bridging the gap between algorithm theory and practice
Algorithm engineering: bridging the gap between algorithm theory and practice
The union of colorful simplices spanned by a colored point set
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
On the structure and composition of forbidden sequences, with geometric applications
Proceedings of the twenty-seventh annual symposium on Computational geometry
Tangencies between families of disjoint regions in the plane
Computational Geometry: Theory and Applications
Semialgebraic Range Reporting and Emptiness Searching with Applications
SIAM Journal on Computing
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
Improved bound for the union of fat triangles
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved bounds on the union complexity of fat objects
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The union of colorful simplices spanned by a colored point set
Computational Geometry: Theory and Applications
Small-size relative (p,ε)-approximations for well-behaved range spaces
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
The authors show that for every fixed $\delta0$ 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)$ straight segments (where the constants of proportionality depend on $\delta$). This latter complexity becomes linear if all triangles are of roughly the same size or if they are all infinite wedges.