The n-point and six-partite point of a convex polygon
β Scribed by M.J. Kaiser
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 715 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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)
In his paper [3], F.A.Valentine has defined a three-point property Pa. The first part of that paper contains results valid in n-space. In the second part is specialized to the plane, and among other things it is proved that a set is the union of two convex sets if it has the property P3 and there is
The notion of a coherent decomposition of a metric on a finite set has proven fruitful, with applications to areas such as the geometry of metric cones and bioinformatics. In order to obtain a deeper insight into these decompositions it is important to improve our knowledge of those metrics which ca