@inproceedings{71608ab8d0134fc29831cc2984181ca8,
title = "Decompositions and boundary coverings of non-convex fat polyhedra",
abstract = "We show that any locally-fat (or (a, {\ss})-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.",
author = "{Berg, de}, M. and C.M. Gray",
year = "2008",
doi = "10.1007/978-3-540-87744-8_15",
language = "English",
isbn = "978-3-540-87743-1",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "173--184",
editor = "D. Halperin and K. Mehlhorn",
booktitle = "Algorithms - ESA 2008 (16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008, Proceedings)",
address = "Germany",
}