✦ LIBER ✦

A linear algorithm for determining the separation of convex polyhedra

✍ Scribed by David P Dobkin; David G Kirkpatrick

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 681 KB
Volume: 6
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(85)90007-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An n log n algorithm for determining the

An n log n algorithm for determining the congruity of polyhedra

✍ Kōkichi Sugihara 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 866 KB

A simple algorithm for determining the e

A simple algorithm for determining the envelope of a set of lines

✍ M. Keil 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 417 KB

An algorithm for determining the most re

An algorithm for determining the most reliable path of a network

✍ V.K. Jain; Krishna Gopal 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 156 KB

An Optimal Algorithm for the Intersectio

An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons

✍ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the

The correctness of the linear closure of

The correctness of the linear closure of a family of recognition algorithms with separating hyperplanes

✍ A.S Dzyuba 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 632 KB

On the convergence of a class of outer a

On the convergence of a class of outer approximation algorithms for convex programs

✍ Masao Fukushima 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 719 KB