Abstract
We introduce a new type of Steiner points, called off-centers, as an alternative to circumcenters, to improve the quality of Delaunay triangulations. We propose a new Delaunay refinement algorithm based on iterative insertion of off-centers. We show that this new algorithm has the same quality and size optimality guarantees of the best known refinement algorithms. In practice, however, the new algorithm inserts about 40% fewer Steiner points (hence runs faster) and generates triangulations that have about 30% fewer elements compared with the best previous algorithms.
Research of the author is supported by NSF under grant CCR-00-86013.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bern, M., Eppstein, D., Gilbert, J.: Provably good mesh generation. J. Comp. System Sciences 48, 384–409 (1994)
Chew, L.P.: Guaranteed-quality triangular meshes. TR-89-983, Cornell Univ. (1989)
Chew, L.P.: Constrained Delaunay triangulations. Algorithmica 4, 97–108 (1989)
Dey, T.K., Bajaj, C.L., Sugihara, K.: On good triangulations in three dimensions. Int. J. Computational Geometry & Applications 2(1), 75–95 (1992)
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)
Miller, G.L.: A time efficient Delaunay refinement algorithm. In: Proc. ACM-SIAM Symp. on Disc. Algorithms (to appear, 2004)
Miller, G.L., Pav, S., Walkington, N.: When and why Ruppert’s algorithm works. In: Proc. 12th Int. Meshing Roundtable, pp. 91–102 (2003)
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)
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
Üngör, A. (2004). Off-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations. In: Farach-Colton, M. (eds) LATIN 2004: Theoretical Informatics. LATIN 2004. Lecture Notes in Computer Science, vol 2976. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24698-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-24698-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21258-4
Online ISBN: 978-3-540-24698-5
eBook Packages: Springer Book Archive