Name
Abstract | ||
|---|---|---|
In this paper we give upper and lower bounds on the number of Steiner points required to construct a strictly convex quadrilateral mesh for a planar point set. In particular, we show that 3 [n/2] internal Steiner points are always sufficient for a convex quadrilateral mesh of n points in the plane. Furthermore, for any given n greater than or equal to 4, there are point sets for which [(n - 3)/2] - I Steiner points are necessary for a convex quadrilateral mesh. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/S00453-003-1062-1 | ALGORITHMICA |
Keywords | DocType | Volume |
quadrilateral mesh,convex,quadrangulation,bounded size,finite elements,interpolation | Journal | 38.0 |
Issue | ISSN | Citations |
2 | 0178-4617 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Bremner | 1 | 2 | 3.80 |
| Ferran Hurtado | 2 | 744 | 86.37 |
| Suneeta Ramaswami | 3 | 228 | 23.87 |
| Vera Sacristan | 4 | 95 | 11.80 |