Author:
Smolik Michal,Skala Vaclav
Reference10 articles.
1. Chen,M.-B.: A Parallel 3D Delaunay Triangulation Method. 9th ISPA, IEEE, 2011, pp.52-56.
2. Cignoni,P., Montani,C., Scopigno,R. : DeWall: A Fast Divide & Conquer Delaunay Triangulation Algorithm in Ed. Computer Aided Design, 1998, Vol.30, No.5, pp.333-341.
3. An Empirical Comparison of Techniques for Updating Delaunay Triangulations;Guibas;ACM Symposium on Computer Geometry,2004
4. Ledoux, H., Gold, Ch. -M., Baciu, G.: Flipping to Robustly Delete a Vertex in a Delaunay Tetrahedralization. Computational Science and Its Applications – ICCSA, 2005, Vol. 3480, pp. 737-747.
5. Liu,Y.-X., Snoeying,J.: A Comparison of Five Implementations 3D Delaunay Tessellations. Combinatorial and Computational Geometry, MSRI publ., 2005, Vol.52, pp.439-458.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Delaunay triangulation of large-scale datasets using two-level parallelism;Parallel Computing;2020-10
2. Efficient Speed-Up of Radial Basis Functions Approximation and Interpolation Formula Evaluation;Computational Science and Its Applications – ICCSA 2020;2020
3. TIPP;Proceedings of the 30th International Conference on Scientific and Statistical Database Management;2018-07-09