✦ LIBER ✦

Increasing the minimum distance of a set of points

✍ Scribed by R Pollack

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 55 KB
Volume: 40
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90106-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The minimum feature point set representi

The minimum feature point set representing a convex polyhedral object

✍ Jin-Jang Leou; Wen-Hsiang Tsai 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 342 KB

Distinct distances determined by subsets

Distinct distances determined by subsets of a point set in space

✍ David Avis; Paul Erdo&#x030B;s; János Pach 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 670 KB

Maximum distance between two sets of poi

Maximum distance between two sets of points in Ed

✍ Jean-Marc Robert 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 199 KB

On the stability of minimum points

✍ D.H Hyers 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 397 KB

Outline of a set of points

✍ Yossi Gofman 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 415 KB

Efficiently Approximating the Minimum-Vo

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions

✍ Gill Barequet; Sariel Har-Peled 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We present an efficient O n + 1/ε 4 5 -time algorithm for computing a 1 + ε)approximation of the minimum-volume bounding box of n points in 3 . We also present a simpler algorithm whose running time is O n log n + n/ε 3 . We give some experimental results with implementations of various variants of