𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast algorithms for computing the diameter of a finite planar set

✍ Scribed by Binay K. Bhattacharya; Godfried T. Toussaint

Publisher
Springer
Year
1988
Tongue
English
Weight
792 KB
Volume
3
Category
Article
ISSN
0178-2789

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Computing the shape of a planar points s
Computing the shape of a planar points set
✍ Mahmoud Melkemi; Mourad Djebali πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 701 KB

In this article, we introduce a mathematical formalism de"ning the shape of a "nite point set which we call A-shape. The parameter A is a "nite set of points which positions variation allows A-shape to generate a family of graphs extracted from Delaunay triangulation. Each graph corresponds to an el

A fast algorithm for index of annihilati
A fast algorithm for index of annihilation computations
✍ P.Y. Yalamov; M. Mitrouli πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 110 KB

In this paper a fast algorithm for computing the index of annihilation of the associated pencil of a given matrix is presented. Knowledge of this index leads us to the speciΓΏcation of the elementary divisors of the matrix and thus we can specify its canonical forms. It is shown that the new algorith