Abstract
Previous works involving the Online Delaunay triangulation problem required that the incoming request lies within the triangulation or a predefined initial triangulation framework, which will contain all the incoming points. No mention is made for Online Delaunay triangulation when the request point lies outside the triangulation, which also happens to be the unbounded side of the Convex Hull of the triangulation. In this work, we give a solution for the Online Delaunay triangulation Problem for incoming request points lying in the unbounded side of the Convex Hull bounding the Delaunay triangulation as well for points lying inside the triangulation. We use the Quad-Edge data structure for implementing the Delaunay triangulation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Brown, P.J.C., Faigle, C.T.: A robust efficient algorithm for point location in triangulations. Technical Report UCAM-CL-TR-728, University of Cambridge, Computer Laboratory (February 1997)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)
Devillers, O., Meiser, S., Teillaud, M.: Fully dynamic delaunay triangulation in logarithmic expected time per operation. Comput. Geom. Theory Appl. 2, 55–80 (1992)
De Floriani, L., Puppo, E.: An on-line algorithm for constrained delaunay triangulation. CVGIP: Graphical Models and Image Processing 54(4), 290–300 (1992)
Guibas, L., Stolfi, J.: Primitives for the manipulation of general subdivisions and the computation of voronoi. ACM Trans. Graph. 4, 74–123 (1985)
Guibas, L.J., Knuth, D.E., Sharir, M.: Randomized incremental construction of delaunay and voronoi diagrams. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 414–431. Springer, Heidelberg (1990)
Hjelle, Ø., Dæhlen, M.: Triangulations and Applications (Mathematics and Visualization). Springer-Verlag New York, Inc., Secaucus (2006)
Mostafavi, M.A., Gold, C., Dakowicz, M.: Delete and insert operations in voronoi/delaunay methods and applications. Comput. Geosci. 29, 523–530 (2003)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1997)
Nielsen, F.: Visual Computing: Geometry, Graphics, and Vision. Charles River Media / Thomson Delmar Learning (2005)
Preparata, F.P., Shamos, M.I.: Computational geometry: an introduction. Springer-Verlag New York, Inc., New York (1985)
Schäfer, M.: Computational Engineering - Introduction to Numerical Methods. Springer-Verlag New York, Inc., Secaucus (2006)
Shewchuk, J.: Triangle: Engineering a 2d quality mesh generator and delaunay triangulator. In: Lin, M., Manocha, D. (eds.) FCRC-WS 1996 and WACG 1996. LNCS, vol. 1148, pp. 203–222. Springer, Heidelberg (1996), doi:10.1007/BFb0014497
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mandal, C., Agarwal, S. (2011). Online Delaunay Triangulation Using the Quad-Edge Data Structure. In: Wyld, D.C., Wozniak, M., Chaki, N., Meghanathan, N., Nagamalai, D. (eds) Advances in Computing and Information Technology. ACITY 2011. Communications in Computer and Information Science, vol 198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22555-0_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-22555-0_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22554-3
Online ISBN: 978-3-642-22555-0
eBook Packages: Computer ScienceComputer Science (R0)