Structural tolerance and Delaunay triangulation

Information Processing Letters

Volumn 71, Issue 5, 1999, Pages 221-227

  Abellanas, Manuel ^a   Hurtado, Ferran ^b   Ramos, Pedro A ^c  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c UNIVERSITY OF ALCALÁ   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; PERTURBATION TECHNIQUES;

DELAUNAY TRIANGULATION;

COMPUTATIONAL GEOMETRY;

EID: 0033311795     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00107-6     Document Type: Article

References (27)

1. M. Abellanas, J. García, G. Hernández, F. Hurtado, O. Serra, J. Urrutia, Updating polygonizations, Computer Graphics Forum 12 (3) (1993) 143-152.
2. M. Abellanas, F. Hurtado, P. Ramos, Tolerance of geometric structures, in: Proc. 6th Canadian Conference on Computational Geometry, 1994, pp. 250-255.
3. M. Abellanas, F. Hurtado, P. Ramos, Redrawing a graph within a geometric tolerance, in: Proc. Graph Drawing'94, Lecture Notes in Computer Sci., Vol. 894, Springer, Berlin, 1995, pp. 246-253.
4. E.M. Arkin, P. Belleville, J.S.B. Mitchell, D. Mount, K. Romanik, S. Salzberg, D. Souvaine, Testing simple polygons, Comput. Geom. Theory Appl. 8 (1997) 97-114.
5. M.J. Atallah, Some dynamic Computational Geometry problems, Comput. Math. Appl. 11 (1985)1171-1181.
6. P. Eades, W. Lai, K. Misue, K. Sugiyama, Preserving the mental map of a diagram, in: Proc. of Compugraphics'91, 1991, pp. 24-33.
7. 2 log N) time algorithm for the minmax angle triangulation, SIAM J. Sci. Statist. Comput. 13 (1992) 994-1008.
8. W. Evans, Regular polygons are most tolerant, in: Proc. 7th Canadian Conference on Computational Geometry, 1995, pp. 109-113.
9. J.J. Fu, R.C.T. Lee, Voronoi diagrams of moving points in the plane, Internat. J. Comput. Geom. Appl. 1 (1991) 23-32.
10. J. García, P.A. Ramos, Fitting a set of points by a circle, in: Proc. 13th Annual ACM Symposium on Computational Geometry, 1997, pp. 139-146.
11. L.J. Guibas, J.S.B. Mitchell, T. Roos, Voronoi diagrams of moving points in the plane, in: Proc. 17th Internat. Workshop Graph-Theoretical Concepts of Computer Science, Lecture Notes in Computer Sci., Vol. 570, Springer, Berlin, 1991, pp. 113-125.
12. L. Guibas, D. Salesin, J. Stolfi, Epsilon-geometry: Building robust algorithms for imprecise computation, in: Proc. 5th Annual ACM Symposium on Computational Geometry, 1989, pp. 208-217.
13. L. Guibas, D. Salesin, J. Stolfi, Constructing strongly convex approximate hulls with inaccurate primitives, Algorithmica 9 (1993) 534-560.
14. J.W. Jaromczyk, G.T. Toussaint, Relative neighborhood graphs and their relatives, Proc. IEEE 80 (1992) 1502-1517.
15. N. Katoh, T. Tokuyama, K. Iwano, On minimum and maximum spanning trees of linearly moving points, Discrete Comput. Geom. 13 (1995) 161-176.
16. D.T. Lee, On k-nearest neighbor Voronoi diagram in the plane, IEEE Trans. Comput. 31 (1977) 478-487.
17. Z. Li, V. Milenkovic, Constructing strongly convex hulls using exact or rounded arithmetic, Algorithmica 8 (1992) 345-364.
18. K.A. Lyons, Cluster busting in anchored graph drawing, Ph.D. thesis, Queen's University, 1994.
19. K.A. Lyons, H. Meijer, D. Rappaport, Properties of the Voronoi diagram cluster buster, in: Proc. 1993 CAS Conference (CAS-CON'93), Vol. 2, 1993, pp. 1148-1163.
20. C. Monma, S. Suri, Transitions in geometric minimum spanning trees, Discrete Comput. Geom. 8 (1992) 265-293.
21. P.A. Ramos, Tolerancia de estructuras geométricas y combinatorias, Ph.D. thesis, Universidad Politécnica de Madrid, 1995.
22. T.J. Rivlin, Approximation by circles, Computing 21 (1979) 93-104.
23. T. Roos, Tighter bounds for Voronoi diagrams of moving points, in: Proc. 5th Canadian Conference on Computational Geometry, 1993, pp. 358-363.
24. S. Tarasov, On hardness of roundness calculation, in: Proc. 9th Canadian Conference on Computational Geometry, 1997, pp. 175-180.
25. F. Weller, Stability of Voronoi neighborship under perturbation of the sites, in: Proc. 9th Canadian Conference on Computational Geometry, 1997, pp. 251-256.
26. A.C. Yao, Lower bounds for algebraic computation trees with integer inputs, SIAM J. Comput. 20 (1991) 655-668.
27. C.K. Yap, Low level issues in Computational Geometry, in: Proc. 5th Canadian Conference on Computational Geometry, 1993, pp. 405-419.