On the Boundary of the Union of Planar Convex Sets
โ Scribed by J. Pach; M. Sharir
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 119 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0179-5376
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