✦ LIBER ✦

An optimal algorithm for computing a minimum nested nonconvex polygon

✍ Scribed by Subir Kumar Ghosh; Anil Maheshwari

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 276 KB
Volume: 36
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(90)90038-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal algorithm to solve the minimu

An optimal algorithm to solve the minimum weakly cooperative guards problem for 1-spiral polygons

✍ Bern-Cherng Liaw; R.C.T. Lee 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 615 KB

A counterexample to an algorithm for com

A counterexample to an algorithm for computing monotone hulls of simple polygons

✍ Godfried T. Toussaint; Hossam El Gindy 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 241 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

An algorithm for computing the economica

An algorithm for computing the economically optimal X-control chart for a process with multiple assignable causes

✍ Kun-Jen Chung 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 877 KB

A polynomial-time algorithm for computin

A polynomial-time algorithm for computing an optimal admission policy in a GI/M/1/N queue

✍ Norihiro Mizuno 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 242 KB