No CrossRef data available.
Article contents
An algorithm for constructing locally optimal min-max triangulation
Published online by Cambridge University Press: 17 April 2009
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
Several interesting criteria for constructing triangulations associated with a given set of points in a plane have been introduced. In order to obtain optimal triangula-tion with respect to the min-max-angle criterion, it is essential to study the nature of neutral cases with respect to the criterion. Our aim in this paper is to establish precise equations for neutral set curves with respect to the min-max-angle criterion and to develop an algorithm to obtain a locally optimal triangulation with respect to the criterion.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1996
References
REFERENCES
[1]Correc, Y. and Chapius, E., ‘Fast computation of Delaunay triangulations’, Adv. Eng. Software 9 (1987), 77–83.CrossRefGoogle Scholar
[2]Field, D., ‘A flexible Delaunay triangulation algorithm’, General Motors Research Publ. (No. GMR-5675) (1987).Google Scholar
[3]Hansford, D., ‘The neutral case for the min-max triangulation’, Comput. Aided Geom. Design 7 (1990), 431–438.CrossRefGoogle Scholar
[4]Lawson, C.L., ‘Generation of triangular grid with application to contour plotting’, J. P.L. 299 (1972).Google Scholar
[5]Schumaker, L.L., ‘Triangulation methods’, in Topics in multivariate approximation, (Chui, C.K., Schumaker, L.L. and Utreras, F.I., Editors) (Academic Press, New York, 1987), pp. 219–232.CrossRefGoogle Scholar
You have
Access