Author:
Löffler Maarten,van Kreveld Marc
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Abellanas, M., Hurtado, F., Ramos, P.A.: Structural tolerance and Delaunay triangulation. Inf. Proc. Lett. 71, 221–227 (1999)
2. Bandyopadhyay, D., Snoeyink, J.: Almost-Delaunay simplices: nearest neighbour relations for imprecise points. In: Proc. 15th ACM-SIAM Sympos. on Discr. Algorithms, pp. 410–419 (2004)
3. Bajaj, C.: The algebraic degree of geometric optimization problems. Discr. Comput. Geom. 3, 177–191 (1988)
4. Boissonnat, J.-D., Lazard, S.: Convex hulls of bounded curvature. In: Proc. 8th Canad. Conf. on Comput. Geom., pp. 14–19 (1996)
5. Cai, L., Keil, J.M.: Computing visibility information in an inaccurate simple polygon. Internat. J. Comput. Geom. Appl. 7, 515–538 (1997)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fréchet Distance for Uncertain Curves;ACM Transactions on Algorithms;2023-07-14
2. Computing the Fréchet Distance Between Uncertain Curves in One Dimension;Lecture Notes in Computer Science;2021
3. Expected computations on color spanning sets;Journal of Combinatorial Optimization;2014-06-18
4. Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty;Mathematical Foundations of Computer Science 2014;2014
5. Expected Computations on Color Spanning Sets;Frontiers in Algorithmics and Algorithmic Aspects in Information and Management;2013