AbstractWe show that any locally-fat (or (α,β)-covered) polyhedron with convex fat faces can be decomposed into O(n) tetrahedra, where n is the number of vertices of the polyhedron. We also show that the restriction that the faces are fat is necessary: there are locally-fat polyhedra with non-fat faces that require Ω(n2) pieces in any convex decomposition. Furthermore, we show that if we want the tetrahedra in the decomposition to be fat themselves, then their number cannot be bounded as a function of n in the worst case. Finally, we obtain several results on the problem where we want to only cover the boundary of the polyhedron, and not its entire interior
AbstractThis paper addresses the problem of decomposing a complex polyhedral surface into a small nu...
The polyhedron constructed by Chazelle, known as Chazelle polyhedron [4], is an important example in...
The polyhedron constructed by Chazelle, known as Chazelle polyhedron [4], is an important example in...
AbstractWe show that any locally-fat (or (α,β)-covered) polyhedron with convex fat faces can be deco...
We show that any locally-fat (or (a, ß)-covered) polyhedron with convex fat faces can be decomposed ...
AbstractThe complexity of the contour of the union of simple polygons with n vertices in total can b...
The non-convex polyhedron constructed by Chazelle, known as the Chazelle polyhedron[4], establishes ...
AbstractThe minimum α-fat decomposition problem is the problem of decomposing a simple polygon into ...
AbstractThe non-convex polyhedron constructed by Chazelle, known as the Chazelle polyhedron [4], est...
We show that the combinatorial complexity of the union of n “fat ” tetrahedra in 3-space (i.e., tetr...
AbstractGiven a convex polyhedron P and a convex polygon Q in R3 such that Q′s supporting plane does...
Computational geometry is the branch of theoretical computer science that deals with algorithms and ...
We introduce the fatness parameter of a 4-dimensional polytope P, defined as \phi(P)=(f_1+f...
It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size ...
AbstractThis paper addresses the problem of decomposing a complex polyhedral surface into a small nu...
The polyhedron constructed by Chazelle, known as Chazelle polyhedron [4], is an important example in...
The polyhedron constructed by Chazelle, known as Chazelle polyhedron [4], is an important example in...
AbstractWe show that any locally-fat (or (α,β)-covered) polyhedron with convex fat faces can be deco...
We show that any locally-fat (or (a, ß)-covered) polyhedron with convex fat faces can be decomposed ...
AbstractThe complexity of the contour of the union of simple polygons with n vertices in total can b...
The non-convex polyhedron constructed by Chazelle, known as the Chazelle polyhedron[4], establishes ...
AbstractThe minimum α-fat decomposition problem is the problem of decomposing a simple polygon into ...
AbstractThe non-convex polyhedron constructed by Chazelle, known as the Chazelle polyhedron [4], est...
We show that the combinatorial complexity of the union of n “fat ” tetrahedra in 3-space (i.e., tetr...
AbstractGiven a convex polyhedron P and a convex polygon Q in R3 such that Q′s supporting plane does...
Computational geometry is the branch of theoretical computer science that deals with algorithms and ...
We introduce the fatness parameter of a 4-dimensional polytope P, defined as \phi(P)=(f_1+f...
It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size ...
AbstractThis paper addresses the problem of decomposing a complex polyhedral surface into a small nu...
The polyhedron constructed by Chazelle, known as Chazelle polyhedron [4], is an important example in...
The polyhedron constructed by Chazelle, known as Chazelle polyhedron [4], is an important example in...