Geodesic
On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra.
Discrete & computational geometry, Tome 7 (1992) no. 4, pp. 227-254.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : partition of polyhedra, triangulation problem, 3-dimensional nonconvex polyhedron 
@article{DCG_1992__7_4_131194,
     author = {R. Seidel and J. Ruppert},
     title = {On the {Difficulty} of {Triangulating} {Three-Dimensional} {Nonconvex} {Polyhedra.}},
     journal = {Discrete & computational geometry},
     pages = {227--254},
     publisher = {mathdoc},
     volume = {7},
     number = {4},
     year = {1992},
     zbl = {0747.52009},
     url = {http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131194/}
}
TY  - JOUR
AU  - R. Seidel
AU  - J. Ruppert
TI  - On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra.
JO  - Discrete & computational geometry
PY  - 1992
SP  - 227
EP  - 254
VL  - 7
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131194/
ID  - DCG_1992__7_4_131194
ER  - 
%0 Journal Article
%A R. Seidel
%A J. Ruppert
%T On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra.
%J Discrete & computational geometry
%D 1992
%P 227-254
%V 7
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131194/
%F DCG_1992__7_4_131194
R. Seidel; J. Ruppert. On the Difficulty of Triangulating Three-Dimensional Nonconvex Polyhedra.. Discrete & computational geometry, Tome 7 (1992) no. 4, pp. 227-254. http://geodesic.mathdoc.fr/item/DCG_1992__7_4_131194/