Abstract
Off-centers were recently introduced as an alternative type of Steiner points to circum-centers for computing size-optimal quality guaranteed Delaunay triangulations. In this paper, we study the depth of the off-center insertion hierarchy. We prove that Delaunay refinement with off-centers takes only O(log (L/h)) parallel iterations, where L is the diameter of the domain, and h is the smallest edge in the initial triangulation. This is an improvement over the previously best known algorithm that runs in O(log2(L/h)) iterations.
Keywords
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Amato, N.M., Goodrich, M.T., Ramos, E.A.: Parallel algorithms for higherdimensional convex hulls. In: Proc. 35th IEEE Symp. Foundations of Computer Science, pp. 683–694 (1994)
Bern, M., Eppstein, D., Gilbert, J.: Provably good mesh generation. J. Comp. System Sciences 48, 384–409 (1994)
Bern, M., Eppstein, D., Teng, S.-H.: Parallel construction of quadtrees and quality triangulations. Int. J. Comp. Geometry & Applications 9(6), 517–532 (1999)
Cheng, S.-W., Dey, T.K., Edelsbrunner, H., Facello, M.A., Teng, S.-H.: Sliver exudation. In: Proc. 15th ACM Symp. Comp. Geometry, pp. 1–13 (1999)
Chew, P.: Guaranteed-quality triangular meshes. TR-89-983, Cornell Univ. (1989)
Edelsbrunner, H.: Geometry and Topology for Mesh Generation. Cambridge Univ. Press, Cambridge (2001)
Edelsbrunner, H., Guoy, D.: Sink insertion for mesh improvement. In: Proc. 17th ACM Symp. Comp. Geometry, pp. 115–123 (2001)
Frey, W.H.: Selective refinement: a new strategy for automatic node placement in graded triangular meshes. Int. J. Numerical Meth. Eng. 24, 2183–2200 (1987)
Frey, P., George, P.-L.: Mesh Generation. Oxford, Paris (2000)
Mitchell, S., Vavasis, S.: Quality mesh generation in three dimensions. In: Proc. 8th ACM Symp. Comp. Geometry, pp. 212–221 (1992)
Miller, G.L.: A time efficient Delaunay refinement algorithm. In: Proc. ACM-SIAM Symp. on Disc. Algorithms, pp. 400–409 (2004)
Reif, J.H., Sen, S.: Parallel computational geometry: An approach using randomization. In: Handbook of Comp. Geometry, pp. 765–828. Elsevier, Amsterdam (1999)
Ruppert, J.: A new and simple algorithm for quality 2-dimensional mesh generation. In: Proc. 4th ACM-SIAM Symp. on Disc. Algorithms, pp. 83–92 (1993)
Shewchuk, J.R.: Delaunay Refinement Mesh Generation. Ph.D. thesis, Carnegie Mellon University (1997)
Spielman, D.A., Teng, S.-H., Üngör, A.: Parallel Delaunay refinement: Algorithms and analyses. In: Proc. 11th Int. Meshing Roundtable, pp. 205–217 (2002)
Üngör, A.: Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 151–162. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Spielman, D.A., Teng, Sh., Üngör, A. (2004). Parallel Delaunay Refinement with Off-Centers. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds) Euro-Par 2004 Parallel Processing. Euro-Par 2004. Lecture Notes in Computer Science, vol 3149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27866-5_108
Download citation
DOI: https://doi.org/10.1007/978-3-540-27866-5_108
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22924-7
Online ISBN: 978-3-540-27866-5
eBook Packages: Springer Book Archive