## Abstract We provide a sharp, sufficient condition to decide if a point __y__ on a convex surface __S__ is a farthest point (i.e., is at maximal intrinsic distance from some point) on __S__, involving a lower bound __ฯ__ on the total curvature __ฯ~y~__ at __y__, __ฯ~y~__ โฅ __ฯ__. Further conseque
โฆ LIBER โฆ
Farthest points on convex surfaces
โ Scribed by Tudor Zamfirescu
- Publisher
- Springer-Verlag
- Year
- 1997
- Tongue
- French
- Weight
- 122 KB
- Volume
- 226
- Category
- Article
- ISSN
- 0025-5874
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Criteria for farthest points on convex s
โ
Jin-ichi Itoh; Costin Vวlcu
๐
Article
๐
2009
๐
John Wiley and Sons
๐
English
โ 211 KB
Farthest points and cut loci on some deg
โ
Jin-ichi Itoh; Costin Vรฎlcu
๐
Article
๐
2004
๐
Springer
๐
English
โ 167 KB
On farthest points of sets
โ
B.B Panda; O.P Kapoor
๐
Article
๐
1978
๐
Elsevier Science
๐
English
โ 465 KB
On farthest points of sets
โ
M. V. Balashov; G. E. Ivanov
๐
Article
๐
2006
๐
SP MAIK Nauka/Interperiodica
๐
English
โ 157 KB
On the lattice points on strictly convex
โ
Bohuslav Divis
๐
Article
๐
1976
๐
Elsevier Science
๐
English
โ 430 KB
Computing farthest neighbors on a convex
โ
Otfried Cheong; Chan-Su Shin; Antoine Vigneron
๐
Article
๐
2003
๐
Elsevier Science
๐
English
โ 302 KB
Let N be a set of n points in convex position in R 3 . The farthest point Voronoi diagram of N partitions R 3 into n convex cells. We consider the intersection G(N ) of the diagram with the boundary of the convex hull of N . We give an algorithm that computes an implicit representation of G(N ) in e