On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
Discrete & Computational Geometry
Efficient hidden surface removal for objects with small union size
Computational Geometry: Theory and Applications
On the union of fat wedges and separating a collection of segments by a line
Computational Geometry: Theory and Applications
Fat Triangles Determine Linearly Many Holes
SIAM Journal on Computing
The complexity of the free space for a robot moving amidst fat obstacles
Computational Geometry: Theory and Applications
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
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
Computational Geometry: Theory and Applications
On fat partitioning, fat covering and the union size of polygons
Computational Geometry: Theory and Applications
Balanced aspect ratio trees: combining the advantages of k-d trees and octrees
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On the Boundary Complexity of the Union of Fat Triangles
SIAM Journal on Computing
Balanced aspect ratio trees
On the union of κ-round objects
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Vertical ray shooting for fat objects
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
SIAM Journal on Computing
Computational Geometry: Theory and Applications
I/O-efficient map overlay and point location in low-density subdivisions
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Computing the visibility map of fat objects
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| 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)log2n). This improves the best known bound, and extends it to a more general class of objects.