270
N. b. A. Hadi et al.
9. Dwyer, R.A.: Higher-dimensional Voronoi diagrams in linear expected time. Discrete Comput.
Geom. 6, 343–367 (1991)
10. Aurenhammer, F.: Voronoi diagrams: a survey of a fundamental geometric data structure. ACM
Comput. Surv. 23(3), 345–405 (1991)
11. Silveira, R.I., Van Kreveld, M.: Towards a definition of higher order constrained Delaunay
triangulations. Comput. Geom. 42(4), 322–337 (2009)
12. Žalik, B.: An efficient sweep-line Delaunay triangulation algorithm. Comput. Aided Des.
37(10), 1027–1038 (2005)
13. Biniaz, A., Dastghaibyfard, G.: A faster circle-sweep Delaunay triangulation algorithm. Adv.
Eng. Softw. 43(1), 1–13 (2012)
14. De De Oliveira, S.L.G.: A review on delaunay refinement techniques. ICCSA, pp. 172–187
(2012, June)
15. Shewchuk, J.R.: Lecture notes on Delaunay mesh generation. Department of Electrical
Engineering and Computer Sciences (1999)
N. b. A. Hadi et al.
9. Dwyer, R.A.: Higher-dimensional Voronoi diagrams in linear expected time. Discrete Comput.
Geom. 6, 343–367 (1991)
10. Aurenhammer, F.: Voronoi diagrams: a survey of a fundamental geometric data structure. ACM
Comput. Surv. 23(3), 345–405 (1991)
11. Silveira, R.I., Van Kreveld, M.: Towards a definition of higher order constrained Delaunay
triangulations. Comput. Geom. 42(4), 322–337 (2009)
12. Žalik, B.: An efficient sweep-line Delaunay triangulation algorithm. Comput. Aided Des.
37(10), 1027–1038 (2005)
13. Biniaz, A., Dastghaibyfard, G.: A faster circle-sweep Delaunay triangulation algorithm. Adv.
Eng. Softw. 43(1), 1–13 (2012)
14. De De Oliveira, S.L.G.: A review on delaunay refinement techniques. ICCSA, pp. 172–187
(2012, June)
15. Shewchuk, J.R.: Lecture notes on Delaunay mesh generation. Department of Electrical
Engineering and Computer Sciences (1999)