We show that any locally-fat (or (a, ß)-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 O(n2) pieces in any convex decomposition. Furthermore, we show that if we want the polyhedra in the decomposition to be fat themselves, then the worst-case number of tetrahedra cannot be bounded as a function of n. Finally, we obtain several results on the problem where we want to only cover the boundary of the polyhedron, and not its entire interior
We show that the size of the perimeter of (α,β)-covered objects is a linear function of the diameter...
In this Note, we show that the size of the perimeter of (α,β)-covered objects is a linear function o...
A convex body K in Rd is said to be reduced if the minimum width of each convex body properly contai...
We show that any locally-fat (or (a, ß)-covered) polyhedron with convex fat faces can be decomposed ...
AbstractWe show that any locally-fat (or (α,β)-covered) polyhedron with convex fat faces can be deco...
AbstractThe complexity of the contour of the union of simple polygons with n vertices in total can b...
We introduce the fatness parameter of a 4-dimensional polytope P, defined as \phi(P)=(f_1+f...
We show that the combinatorial complexity of the union of n “fat ” tetrahedra in 3-space (i.e., tetr...
Abstract. We show that the boundary of a three-dimensional polyhedron with r reflex angles and arbit...
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...
It is known that not all simple polyhedra can be tetrahedralized, i.e., decomposed into a set of tet...
Motivated by a VLSI masking problem, we explore partitions of an orthogonal polygon of n vertices in...
Computational geometry is the branch of theoretical computer science that deals with algorithms and ...
Decomposition is a technique commonly used to partition complex models into simpler components. Whil...
We show that the size of the perimeter of (α,β)-covered objects is a linear function of the diameter...
In this Note, we show that the size of the perimeter of (α,β)-covered objects is a linear function o...
A convex body K in Rd is said to be reduced if the minimum width of each convex body properly contai...
We show that any locally-fat (or (a, ß)-covered) polyhedron with convex fat faces can be decomposed ...
AbstractWe show that any locally-fat (or (α,β)-covered) polyhedron with convex fat faces can be deco...
AbstractThe complexity of the contour of the union of simple polygons with n vertices in total can b...
We introduce the fatness parameter of a 4-dimensional polytope P, defined as \phi(P)=(f_1+f...
We show that the combinatorial complexity of the union of n “fat ” tetrahedra in 3-space (i.e., tetr...
Abstract. We show that the boundary of a three-dimensional polyhedron with r reflex angles and arbit...
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...
It is known that not all simple polyhedra can be tetrahedralized, i.e., decomposed into a set of tet...
Motivated by a VLSI masking problem, we explore partitions of an orthogonal polygon of n vertices in...
Computational geometry is the branch of theoretical computer science that deals with algorithms and ...
Decomposition is a technique commonly used to partition complex models into simpler components. Whil...
We show that the size of the perimeter of (α,β)-covered objects is a linear function of the diameter...
In this Note, we show that the size of the perimeter of (α,β)-covered objects is a linear function o...
A convex body K in Rd is said to be reduced if the minimum width of each convex body properly contai...