Reference26 articles.
1. On indecomposable polyhedra;Bagemihl;The American Mathematical Monthly,1948
2. Compatible tetrahedralizations;Bern;In Proc. 9th Annual ACM Symposium on Computational Geometry,1993
3. Marshall W. Bern and David Eppstein. Mesh generation and optimal triangulation. In Ding-Zhu Du and Frank Kwang-Ming Hwang, editors, Computing in Euclidean Geometry, number 4 in Lecture Notes Series on Computing, pages 47-123. World Scientific, second edition, 1995.
4. Convex partition of polyhedra: a lower bound and worst-case optimal algorithm;Bernard Chazelle;SIAM Journal on Computing,1984
5. Triangulating a non-convex polytope;Bernard Chazelle;Discrete & Computational Geometry,1990
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Bibliography;Meshing, Geometric Modeling and Numerical Simulation 2;2019-01-24
2. On Tetrahedralisations Containing Knotted and Linked Line Segments;Procedia Engineering;2017