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{\lfloor\frac{n}{2}\rfloor}$ internal
Steiner points are always sufficient for a convex quadrilateral mesh of $n$
points in the plane. Furthermore, for any given $n\geq 4$, there are point sets
for which $\lceil\frac{n-3}{2}\rceil-1$ Steiner points are necessary for a
convex quadrilateral mesh. |
Year | DOI | Venue |
|---|---|---|
2002 | https://doi.org/10.1007/s00453-003-1062-1 | Clinical Orthopaedics and Related Research |
Keywords | Field | DocType |
Quadrilateral mesh,Convex,Quadrangulation,Bounded size,Finite
elements,Interpolation | Cyclic quadrilateral,Discrete mathematics,Combinatorics,Steiner tree problem,Equidiagonal quadrilateral,Convex combination,Convex set,Convex function,Quadrilateral,Mathematics,Orthodiagonal quadrilateral | Journal |
Volume | Issue | ISSN |
38 | 2 | 0178-4617 |
Citations | PageRank | References |
5 | 0.49 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Bremner | 1 | 78 | 10.10 |
| Ferran Hurtado | 2 | 744 | 86.37 |
| Suneeta Ramaswami | 3 | 228 | 23.87 |
| Vera Sacristan | 4 | 95 | 11.80 |