The Complexity of Bisectors and Voronoi Diagrams on Realistic Terrains
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Decompositions and Boundary Coverings of Non-convex Fat Polyhedra
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Small-size ε-nets for axis-parallel rectangles and boxes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Near-linear approximation algorithms for geometric hitting sets
Proceedings of the twenty-fifth annual symposium on Computational geometry
Decompositions and boundary coverings of non-convex fat polyhedra
Computational Geometry: Theory and Applications
On the union of fat tetrahedra in three dimensions
Journal of the ACM (JACM)
Computing the visibility map of fat objects
Computational Geometry: Theory and Applications
Better bounds on the union complexity of locally fat objects
Proceedings of the twenty-sixth annual symposium on Computational geometry
Approximating the Fréchet distance for realistic curves in near linear time
Proceedings of the twenty-sixth annual symposium on Computational geometry
A note about weak ε-nets for axis-parallel boxes in d-space
Information Processing Letters
A note on the perimeter of fat objects
Computational Geometry: Theory and Applications
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
Jaywalking your dog: computing the Fréchet distance with shortcuts
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved bound for the union of fat triangles
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Complexity analysis of random geometric structures made simpler
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |
We introduce a new class of fat, not necessarily convex or polygonal, objects in the plane, namely locally γ-fat objects. We prove that the union complexity of any set of n such objects is O(λ s+2(n)log 2 n). This improves the best known bound, and extends it to a more general class of objects.