Year: 1994
Type: article
Abstract: We consider bounding the cardinality of an arbitrary triangulation with smallest angle {alpha}. We show that if the local feature size (i.e. distance between disjoint vertices or edges) of the triangulation is within a constant factor of the local feature size of the input, then N < O(1/{alpha})M, where N is the cardinality of the triangulation and M is the cardinality of any other triangulation with smallest angle at least {alpha}. Previous results had an O(1/{alpha}{sup 1/{alpha}}) dependence. Our O(1/{alpha}) dependence is tight for input with a large length to height ratio, in which triangles may be oriented along the long dimension.
Author: Mitchell, S. A.
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W142241037