Small Strictly Convex Quadrilateral Meshes of Point Sets
✍ Scribed by David Bremner; Ferran Hurtado; Suneeta Ramaswami; Vera Sacristán
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Weight
- 323 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A convex subset K of a vector space E over the field of real numbers is linearly bounded (linearly closed) if every line intersects K in a bounded (closed) subset of the line. A hyperplane is the set of x ~ E that satisfy a linear equationf(x) = c, wherefis a linear functional and c is a real number
An algorithm is described to determine the minimum area polar set of a planar convex polygon described in terms of its vertices. We adopt a result due to Santalo to verify our minimizing solution, and then demonstrate the search procedure on a few examples. 'For triangular (and centrally symmetric)