Author:
Kolingerová Ivana,Žalik Borut
Subject
Computers in Earth Sciences,Information Systems
Reference13 articles.
1. An improved incremental algorithm for constructing restricted Delaunay triangulations;Anglada;Computers & Graphics,1997
2. Computational geometry. Algorithms and Applications;de Berg,1997
3. Dey, T.K., Kumar, P., 1999. A simple provable algorithm for curve reconstruction. In: Proceedings ACM-SIAM Symposium on Discrete Algorithms, pp. 893–894.
4. Curve reconstruction: connecting dots with good reason;Dey;Computational Geometry: Theory and Applications,2000
5. Dwyer, R.A., 1986. A Simple divide-and-conquer algorithm for constructing Delaunay triangulation in O(n log log n) expected time. In: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 276–284.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献