CGAL 4.11.2 - Convex Decomposition of Polyhedra: Bibliographic References

Processing math: 100%

$\newcommand{\E}{\mathrm{E}}$

$\newcommand{\A}{\mathrm{A}}$

$\newcommand{\R}{\mathrm{R}}$

$\newcommand{\N}{\mathrm{N}}$

$\newcommand{\Q}{\mathrm{Q}}$

$\newcommand{\Z}{\mathrm{Z}}$

$\def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }$

CGAL 4.11.2 - Convex Decomposition of Polyhedra

•All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages

CGAL 4.11.2 - Convex Decomposition of Polyhedra

[1]

Bernard Chazelle. Convex partitions of polyhedra: a lower bound and worst-case optimal algorithm. SIAM J. Comput., 13:488–507, 1984.