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
A dihedral (trihedral) wedge is the intersection of two (resp. three) half-spaces in R 3. It is call...
AbstractThe measure problem of Klee asks for the volume of the union of n axis-parallel boxes in a f...
Abstract. We give an output-sensitive algorithm for computing the vis-ibility map of a set of n cons...
We introduce a new class of fat, not necessarily convex or polygonal, objects in the plane, namely l...
We introduce a new class of fat, not necessarily convex or polygonal, objects in the plane, namely l...
We prove that the union complexity of a set of n constant-complexity locally fat objects (which can ...
We show that, for any γ> 0, the combinatorial complexity of the union of n locally γ-fat objects ...
We show that, for any $\gamma > 0$, the combinatorial complexity of the union of $n$ locally $\ga...
We prove a near-linear bound on the combinatorial complexity of the union of n fat convex objects in...
AbstractThe complexity of the contour of the union of simple polygons with n vertices in total can b...
We show that the combinatorial complexity of the union of n “fat ” tetrahedra in 3-space (i.e., tetr...
The skeleton of a polyhedral set is the union of its edges and vertices. Let be a set of fat, convex...
An (α, β)-covered object is a simply connected planar region c with the property that for each point...
A dihedral (trihedral) wedge is the intersection of two (resp. three) half-spaces in R 3. It is call...
AbstractThe measure problem of Klee asks for the volume of the union of n axis-parallel boxes in a f...
Abstract. We give an output-sensitive algorithm for computing the vis-ibility map of a set of n cons...
We introduce a new class of fat, not necessarily convex or polygonal, objects in the plane, namely l...
We introduce a new class of fat, not necessarily convex or polygonal, objects in the plane, namely l...
We prove that the union complexity of a set of n constant-complexity locally fat objects (which can ...
We show that, for any γ> 0, the combinatorial complexity of the union of n locally γ-fat objects ...
We show that, for any $\gamma > 0$, the combinatorial complexity of the union of $n$ locally $\ga...
We prove a near-linear bound on the combinatorial complexity of the union of n fat convex objects in...
AbstractThe complexity of the contour of the union of simple polygons with n vertices in total can b...
We show that the combinatorial complexity of the union of n “fat ” tetrahedra in 3-space (i.e., tetr...
The skeleton of a polyhedral set is the union of its edges and vertices. Let be a set of fat, convex...
An (α, β)-covered object is a simply connected planar region c with the property that for each point...
A dihedral (trihedral) wedge is the intersection of two (resp. three) half-spaces in R 3. It is call...
AbstractThe measure problem of Klee asks for the volume of the union of n axis-parallel boxes in a f...
Abstract. We give an output-sensitive algorithm for computing the vis-ibility map of a set of n cons...
DOI
Add to ORKG