Back to Search
Start Over
Triangulating a convex polygon with fewer number of non-standard bars
- Source :
-
Theoretical Computer Science . Dec2007, Vol. 389 Issue 1/2, p143-151. 9p. - Publication Year :
- 2007
-
Abstract
- Abstract: For a given convex polygon with inner angle no less than and boundary edge bounded by for , where is a given standard bar’s length, we investigate the problem of triangulating the polygon using some Steiner points such that (i) the length of each edge in triangulation is bounded by , where is a given constant and meets , and (ii) the number of non-standard bars in the triangulation is minimum. This problem is motivated by practical applications and has not been studied previously. In this paper, we present a heuristic to solve the above problem, which is based on the heuristic to generate a triangular mesh with less number of non-standard bars and shorter maximal edge length, and a process to make the length of each edge lower bounded. Our procedure is simple and easily implemented for this problem, and we prove that it has good performance guaranteed. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 389
- Issue :
- 1/2
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 27641368
- Full Text :
- https://doi.org/10.1016/j.tcs.2007.08.011