Author:
de Castro Pedro Machado Manhães,Devillers Olivier
Subject
Computer Graphics and Computer-Aided Design,Aerospace Engineering,Automotive Engineering,Modelling and Simulation
Reference49 articles.
1. Amenta, N., Attali, D., Devillers, O., 2007. Complexity of Delaunay triangulation for points on lower-dimensional polyhedra. In: Proc. 18th ACM–SIAM Sympos. Discrete Algorithms, pp. 1106–1113.
2. A simple entropy-based algorithm for planar point location;Arya;ACM Trans. Algorithms,2007
3. Attali, D., Boissonnat, J.-D., Lieutier, André, 2003. Complexity of the Delaunay triangulation of points on surfaces: The smooth case. In: Proc. 19th Annu. Sympos. Comput. Geom., pp. 237–246.
4. A linear bound on the complexity of the Delaunay triangulation of points on polyhedral surfaces;Attali;Discrete Comput. Geom.,2004
5. The shortest path through many points;Beardwood;Math. Proc. Camb. Phil. Soc.,1959
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献