๐”– Bobbio Scriptorium
โœฆ   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

## 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

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
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