✦ LIBER ✦

An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set

✍ Scribed by E. A. Ramos

Publisher: Springer
Year: 2001
Tongue: English
Weight: 113 KB
Volume: 26
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-001-0029-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A deterministic algorithm for the three-

A deterministic algorithm for the three-dimensional diameter problem

✍ Jiří Matoušek; Otfried Schwarzkopf 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 716 KB

Fast algorithms for computing the diamet

Fast algorithms for computing the diameter of a finite planar set

✍ Binay K. Bhattacharya; Godfried T. Toussaint 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 792 KB

An optimal parallel algorithm for triang

An optimal parallel algorithm for triangulating a set of points in the plane

✍ Ed Merks 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 510 KB

A Parallel Algorithm for Partitioning a

A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters

✍ Muhammad H. Alsuwaiyel 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 163 KB

An efficient three-dimensional algorithm

An efficient three-dimensional algorithm for the computation of wind-driven circulation

✍ R.W. Lardner; H.M. Cekirge 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 593 KB

A three-dimensional criterion for the de

A three-dimensional criterion for the determination of optimal grip points

✍ L. Mangialardi; G. Mantriota; A. Trentadue 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 815 KB

Multiflngered grasping has mused remarkable interest because it makes possible the manipulation of objects of different shapes and sizes. However, manipulating and picking up objects in unstructured environments requires accurate contact-point selection. Generally, such processes are subject to exte