Abstract
We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all angles smaller than 170°. The output triangulation has competitive size with any optimal size mesh having equally bounded largest angle. The competitive ratio is O(log(L/s)) where L and s are respectively the largest and smallest features in the input. OSM runs in O(n log(L/s) + m) time/work where n is the input size and m is the output size. The algorithm first uses Sparse Voronoi Refinement to compute a quality overlay mesh of the input points alone. This triangulation is then combined with the input edges to give the final mesh.
This work was supported in part by the National Science Foundation under grants CCR-0122581.
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
Bern, M., Eppstein, D., Gilbert, J.R.: Provably Good Mesh Generation. Journal of Computer and System Sciences 48(3), 384–409 (1994)
Ruppert, J.: A Delaunay refinement algorithm for quality 2-dimensional mesh generation. J. Algorithms 18(3), 548–585 (1995)
Mitchell, S., Vavasis, S.: Quality mesh generation in three dimensions. In: Proc. 8th ACM Symp. Comp. Geom., pp. 212–221. ACM Press, New York (1992)
Shewchuk, J.R.: Delaunay Refinement Algorithms for Triangular Mesh Generation. Computational Geometry: Theory and Applications 22(1–3), 21–74 (2002)
Babuška, I., Aziz, A.K.: On the Angle Condition in the Finite Element Method. SIAM Journal on Numerical Analysis 13(2), 214–226 (1976)
Guattery, S., Miller, G.L., Walkington, N.: Estimating interpolation error: A combinatorial approach. In: Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, ACM and SIAM, pp. 406–413 (1999)
Boman, E., Hendrickson, B., Vavasis, S.: Solving elliptic finite element systems in near-linear time with support preconditioners (2004)
Miller, G., Vavasis, S.: Only large angles mater. Private communications (2005)
Pav, S.E.: Delaunay Refinement Algorithms. PhD thesis, Department of Mathematics, Carnegie Mellon University, Pittsburgh, Pennsylvania (2003)
Cheng, S.-W., Poon, S.-H.: Graded Conforming Delaunay Tetrahedralization with Bounded Radius-Edge Ratio. In: Proceedings of the Fourteenth Annual Symposium on Discrete Algorithms, Baltimore, Maryland. Society for Industrial and Applied Mathematics, pp. 295–304 (2003)
Pav, S.E., Walkington, N.J.: Robust Three Dimensional Delaunay Refinement. In: Thirteenth International Meshing Roundtable, Williamsburg, Virginia, Sandia National Laboratories, pp. 145–156(2004)
Cheng, S.W., Dey, T.K., Ramos, E.A., Ray, T.: Quality Meshing for Polyhedra with Small Angles. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, Brooklyn, New York. Association for Computing Machinery, pp. 290–299 (2004)
Bern, M.W., Dobkin, D.P., Eppstein, D.: Triangulating polygons without large angles. Int. J. Comput. Geometry Appl. 5, 171–192 (1995)
Bern, M.W., Mitchell, S.A., Ruppert, J.: Linear-size nonobtuse triangulation of polygons. Discrete & Computational Geometry 14(4), 411–428 (1995)
Mitchell, S.A.: Refining a triangulation of a planar straight-line graph to eliminate large angles. In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, pp. 583–591. IEEE, Los Alamitos (1993)
Tan, T.S.: An optimal bound for high-quality conforming triangulations. GEOMETRY: Discrete and Computational Geometry 15 (1996)
Baker, B.S., Grosse, E., Rafferty, C.S.: Nonobtuse triangulation of polygons. Discrete Comput. Geom. 3(2), 147–168 (1988)
Dey, T.K.: Good triangulations in the plane. In: CCCG: Canadian Conference in Computational Geometry (1990)
Hudson, B., Miller, G., Phillips, T.: Sparse Voronoi Refinement, Technical Report CMU-CS-06-132, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miller, G.L., Phillips, T., Sheehy, D. (2007). Size Competitive Meshing Without Large Angles. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73420-8_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-73420-8_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73419-2
Online ISBN: 978-3-540-73420-8
eBook Packages: Computer ScienceComputer Science (R0)