✦ LIBER ✦

Optimal algorithms for some intersection radius problems

✍ Scribed by B. K. Bhattacharya; S. Jadhav; A. Mukhopadhyay; J. -M. Robert

Publisher: Springer Vienna
Year: 1994
Tongue: English
Weight: 593 KB
Volume: 52
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02246508

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient dynamic algorithms for some ge

Efficient dynamic algorithms for some geometric intersection problems

✍ Siu Wing Cheng; Ravi Janardan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 705 KB

Space and time optimal algorithms for a

Space and time optimal algorithms for a class of rectangle intersection problems

✍ V.K. Vaishnavi; H.P. Kriegel; D. Wood 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 581 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

Algorithms for some graph theoretical op

Algorithms for some graph theoretical optimization problems

✍ Linda S. Moonen 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 50 KB

An optimal time and minimal space algori

An optimal time and minimal space algorithm for rectangle intersection problems

✍ D. T. Lee 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 478 KB

Optimal Algorithms for Some Polygon Encl

Optimal Algorithms for Some Polygon Enclosure Problems for VLSI Layout Analysis

✍ Vamsi Krishna Kundeti; Prosenjit Gupta 📂 Article 📅 2006 🏛 Springer Netherlands 🌐 English ⚖ 247 KB