✦ LIBER ✦

An efficient algorithm for decomposing a polygon into star-shaped polygons

✍ Scribed by D. Avis; G.T. Toussaint

Publisher: Elsevier Science
Year: 1981
Tongue: English
Weight: 291 KB
Volume: 13
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(81)90002-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple linear hidden-line algorithm fo

A simple linear hidden-line algorithm for star-shaped polygons

✍ David Rappaport; Godfried T Toussaint 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 287 KB

An algorithm for polygonal approximation

An algorithm for polygonal approximation of a digital object

✍ Abolfazl Sirjani; George R Cross 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 274 KB

An optimal algorithm for computing a min

An optimal algorithm for computing a minimum nested nonconvex polygon

✍ Subir Kumar Ghosh; Anil Maheshwari 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 276 KB

A method for representing shape based on

A method for representing shape based on an equivalence relation on polygons

✍ Burzin Bhavnagri 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 920 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