Name
Abstract | ||
|---|---|---|
For a given convex polygon with inner angle no less than $\frac{2}{3}\pi$ and boundary edge bounded by [l, αl] for 1≤ α ≤ 1.4, where l 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 [βl,2l], where β is a given constant and meets $0 |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11533719_49 | COCOON |
Keywords | Field | DocType |
triangular mesh,lower bound | Discrete mathematics,Combinatorics,Polygon,Upper and lower bounds,Polygon covering,Steiner tree problem,Convex polygon,Triangulation (social science),Mathematics,Triangle mesh,Bounded function | Conference |
Volume | Issue | ISSN |
3595 | null | 0302-9743 |
ISBN | Citations | PageRank |
3-540-28061-8 | 1 | 0.37 |
References | Authors | |
7 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yinfeng Xu | 1 | 1636 | 108.18 |
| Wenqiang Dai | 2 | 29 | 5.84 |
| naoki katoh | 3 | 1101 | 187.43 |
| Makoto Ohsaki | 4 | 11 | 3.94 |