Cardinality bounds for triangulations with bounded minimum angle
Conference
·
OSTI ID:10146193
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.
- Research Organization:
- Sandia National Labs., Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 10146193
- Report Number(s):
- SAND--94-1046C; CONF-940887--1; ON: DE94010692; BR: GB0103012
- Country of Publication:
- United States
- Language:
- English
Similar Records
Refining a triangulation of a planar straight-line graph to eliminate large angles
Finding a covering triangulation whose maximum angle is provably small
Finding a covering triangulation whose maximum angle is provably small
Conference
·
Thu May 13 00:00:00 EDT 1993
·
OSTI ID:10165881
Finding a covering triangulation whose maximum angle is provably small
Conference
·
Tue Mar 02 23:00:00 EST 1993
·
OSTI ID:10148829
Finding a covering triangulation whose maximum angle is provably small
Conference
·
Tue Mar 02 23:00:00 EST 1993
·
OSTI ID:6518556