Preprocessing imprecise points and splitting triangulations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5369 LNCS, Issue , 2008, Pages 544-555

  Van Kreveld, Marc ^a   Löffler, Maarten ^a   Mitchell, Joseph S B ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

TRIANGULATION;

GEODESY;

EID: 58549104964     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92182-0_49     Document Type: Conference Paper

References (21)

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 Symposium on Discrete Algorithms, pp. 410-419 (2004)
3. Chazelle, B., Devillers, O., Hurtado, F., Mora, M., Sacristán, V., Teillaud, M.: Splitting a Delaunay triangulation in linear time. Algorithmica 34, 39-46 (2002)
4. Chin, F.Y.L., Wang, C.A.: Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear time. SIAM J. Cornput. 28(2), 471-486 (1998)
5. Edelsbrunner, H., Robison, A.D., Shen, X.: Covering convex sets with nonoverlapping polygons. Discrete Math. 81, 153-164 (1990)
6. Ely, J.S., Leclerc, A.P.: Correct Delaunay triangulation in the presence of inexact inputs and arithmetic. Reliable Computing 6, 23-38 (2000)
7. Guibas, L.J., Salesin, D., Stolfi, J.: Constructing strongly convex approximate hulls with inaccurate primitives. Algorithmica 9, 534-560 (1993)
8. Held, M., Mitchell, J.S.B.: Triangulating input-constrained planar point sets. Information Processing Letters (to appear, 2008)
9. Kendall, W.S., Barndorff-Nielson, O., van Lieshout, M.C.: Current Trends in Stochastic Geometry: Likelihood and Computation. CRC Press, Boca Raton (1998)
10. Khanban, A.A.: Basic Algorithms of Computational Geometry with Imprecise Input. PhD thesis, Imperial College, London (2005)
11. Khanban, A.A., Edalat, A.: Computing Delaunay triangulation with imprecise input data. In: Proc. 15th Canad. Conf. Comput. Geom., pp. 94-97 (2003)
12. Khanban, A.A., Edalat, A., Lieutier, A.: Computability of partial Delaunay triangulation and Voronoi diagram. In: Brattka, V., Schröder, M., Weihrauch, K. (eds.) Electronic Notes in Theoretical Computer Science, vol. 66. Elsevier, Amsterdam (2002)
13. Löftier, M., Snoeyink, J.: Delaunay triangulations of imprecise points in linear time after preprocessing. In: Proc. 24th Sympoium on Computational Geometry, pp. 298-304 (2008)
14. Löftier, M., van Kreveld, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 446-457. Springer, Heidelberg (2007)
15. Löftier, M., van Kreveld, M.: Largest and smallest convex hulls for imprecise points. Algorithmica (to appear, 2008)
16. Pocchiola, M., Vegter, G.: Pseudo-triangulations: Theory and applications. In: Proc. 12th Annu. ACM Sympos. Comput. Geom., pp. 291-300 (1996)
17. Rosenfeld, A.: Fuzzy geometry: An updated overview. Inf. Sci. 110(3-4), 127-133 (1998)
18. Rote, G., Wang, C.A., Wang, L., Xu, Y.: On constrained minimum pseudotriangulations. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 445-454. Springer, Heidelberg (2003)
19. Seidel, R.: A method for proving lower bounds for certain geometric problems. In: Toussaint, G.T. (ed.) Computational Geometry, pp. 319-334. North-Holland, Amsterdam (1985)
20. Sember, J., Evans, W.: Guaranteed Voronoi diagrams of uncertain sites. In: Proc. 20th Canad. Conf. Comput. Geom. (2008)
21. Weller, F.: Stability of Voronoi neighborship under perturbations of the sites. In: Proc. 9th Canad. Conf. Comput. Geom., pp. 251-256 (1997)