Abstract
Given a convex polygon P in the plane and a positive integer n, we consider the problem of generating a length-uniform triangular mesh for the interior of P using n Steiner points. More specifically, we want to find both a set S n of n points inside P, and a triangulation of P using S n , with respect to the following minimization criteria: (1) ratio of the maximum edge length to the minimum one, (2) maximum edge length, and (3) maximum triangle perimeter.
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
F. Aurenhammer, “Voronoi diagrams-a survey of a fundamental geometric data structure”, ACM Computing Surveys 23 (1991), 345–405.
M. Bern, D. Dobkin and D. Eppstein, “Triangulating polygons without large angles”, Intl. J. Comput. Geom. and Appl. 5 (1995), 171–192.
M. Bern and D. Eppstein, “Mesh generation and optimal triangulation”, in D.-Z. Du (ed.), Computing in Euclidean Geometry, World Scientific Publishing, 1992, 47–123.
M. Bern, D. Eppstein and J.R. Gilbert, “Provably good mesh generation”, Journal of Computer and System Sciences 48 (1994), 384–409.
M. Bern, S. Mitchell and J. Ruppert, “Linear-size nonobtuse triangulation of polygons”, Proceedings of the 10th Ann. ACM Symposium on Computational Geometry (1994), 221–230.
P. Chew, “Guaranteed-QualityMesh Generation for Curved Surfaces”, Proceedings of the 9th Ann. ACM Symposium on Computational Geometry (1993), 274–280.
H. Edelsbrunner and T.S. Tan, “A quadratic time algorithm for the minmax length triangulation”, SIAM Journal on Computing 22 (1993), 527–551.
T. Feder and D.H. Greene, “Optimal Algorithms for Approximate Clustering”, Proceedings of the 20th Ann. ACM Symposium STOC (1988), 434–444.
T. Gonzalez, “Clustering to minimize the maximum intercluster distance”, Theoretical Computer Science 38 (1985), 293–306.
D.S. Johnson, “The NP-completeness column: An ongoing guide”, Journal of Algorithms 3 (1982), 182–195.
E. Melisseratos and D. Souvaine, “Coping with inconsistencies: A new approach to produce quality triangulations of polygonal domains with holes”, Proceedings of the 8th Ann. ACM Symposium on Computational Geometry (1992), 202–211.
H. Nooshin, K. Ishikawa, P.L. Disney and J.W. Butterworth, “The traviation process”, Journal of the International Association for Shell and Spatial Structures 38 (1997), 165–175.
M. Ohsaki, T. Nakamura and M. Kohiyama, “Shape optimization of a double-layer space truss described by a parametric surface”, International Journal of Space Structures 12 (1997), 109–119.
K.F. Roth, “On a problem of Heilbronn”, Proc. London Mathematical Society 26 (1951), 198–204.
J. Ruppert, “A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation”, Journal of Algorithms 18 (1995), 548–585.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aurenhammer, F., Katoh, N., Kojima, H., Ohsaki, M., Xu, Y. (2000). Approximating Uniform Triangular Meshes in Polygons. In: Du, DZ., Eades, P., Estivill-Castro, V., Lin, X., Sharma, A. (eds) Computing and Combinatorics. COCOON 2000. Lecture Notes in Computer Science, vol 1858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44968-X_3
Download citation
DOI: https://doi.org/10.1007/3-540-44968-X_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67787-1
Online ISBN: 978-3-540-44968-3
eBook Packages: Springer Book Archive