Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T20:36:14.998Z Has data issue: false hasContentIssue false

An algorithm for constructing locally optimal min-max triangulation

Published online by Cambridge University Press:  17 April 2009

M. Shrivastava
Affiliation:
Department of Mathematics and Computer Science, R.D. University, Jabalpur, India
Rights & Permissions [Opens in a new window]

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.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1996