Author:
Kallmann Marcelo,Bieri Hanspeter,Thalmann Daniel
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Anglada, M.V. (1997): An Improved Incremental Algorithm for Constructing Restricted Delaunay Triangulations. Computer & Graphics, 21 (2), 215–223
2. Bernal, J. (1995): Inserting Line Segments into Triangulations and Tetrahedralizations. Actas de los V I Encuentros de Geometria Computacional, Universitat Politecnica de Catalunya, Barcelona, Spain
3. Boissonnat, J.-D. (1988): Shape Reconstruction from Planar Cross Sections. Computer Vision, Graphics, and Image Processing, 44, 1–29
4. Boissonat, J.-D., Teillaud, M. (1993): On the Randomized Construction of the Delaunay Tree. Theoretical Computer Science, 112, 339–354
5. Chew, L.P. (1987): Constrained Delaunay Triangulations. Proceedings of the Annual Symposium on Computational Geometry ACM, 215–222
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献