The skeleton of a polyhedral set is the union of its edges and vertices. Let be a set of fat, convex polytopes in three dimensions with n vertices in total, and let f max be the maximum complexity of any face of a polytope in . We prove that the total length of the skeleton of the union of the polytopes in is at most O(a(n)·log* n·logf max) times the sum of the skeleton lengths of the individual polytopes
International audienceApproximating convex bodies succinctly by convex polytopes is a fundamental pr...
We introduce a new class of fat, not necessarily convex or polygonal, objects in the plane, namely l...
We derive tight expressions for the maximum number of k-faces, 0 ≤ k ≤ d−1, of the Minkowski sum, P1...
The skeleton of a polyhedral set is the union of its edges and vertices. Let be a set of fat, convex...
We prove a near-linear bound on the combinatorial complexity of the union of n fat convex objects in...
We show that the combinatorial complexity of the union of n “fat ” tetrahedra in 3-space (i.e., tetr...
AbstractThe complexity of the contour of the union of simple polygons with n vertices in total can b...
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 introduce a new class of fat, not necessarily convex or polygonal, objects in the plane, namely l...
International audienceConvex bodies play a fundamental role in geometric computation, and approximat...
International audienceApproximating convex bodies succinctly by convex polytopes is a fundamental pr...
We introduce a new class of fat, not necessarily convex or polygonal, objects in the plane, namely l...
We derive tight expressions for the maximum number of k-faces, 0 ≤ k ≤ d−1, of the Minkowski sum, P1...
The skeleton of a polyhedral set is the union of its edges and vertices. Let be a set of fat, convex...
We prove a near-linear bound on the combinatorial complexity of the union of n fat convex objects in...
We show that the combinatorial complexity of the union of n “fat ” tetrahedra in 3-space (i.e., tetr...
AbstractThe complexity of the contour of the union of simple polygons with n vertices in total can b...
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 introduce a new class of fat, not necessarily convex or polygonal, objects in the plane, namely l...
International audienceConvex bodies play a fundamental role in geometric computation, and approximat...
International audienceApproximating convex bodies succinctly by convex polytopes is a fundamental pr...
We introduce a new class of fat, not necessarily convex or polygonal, objects in the plane, namely l...
We derive tight expressions for the maximum number of k-faces, 0 ≤ k ≤ d−1, of the Minkowski sum, P1...
DOI
Add to ORKG