✦ LIBER ✦

Finding the convex hull of a simple polygon in linear time

✍ Scribed by S.Y. Shin; T.C. Woo

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 405 KB
Volume: 19
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(86)90043-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the convex hull of a simple po

Computing the convex hull of a simple polygon

✍ Chern-Lin Chen 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 337 KB

Computing the shortest diagonal of a mon

Computing the shortest diagonal of a monotone polygon in linear time

✍ Binhai Zhu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 398 KB

A simple linear-time algorithm for findi

A simple linear-time algorithm for finding path-decompositions of small width

✍ Kevin Cattell; Michael J. Dinneen; Michael R. Fellows 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 601 KB

A simple linear time algorithm for findi

A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone

✍ Glenn K. Manacher; Terrance A. Mankus 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views

## Abstract We exhibit an algorithm for finding a maximum independent set (MIS) for __n__ presorted, unweighted circular arcs in time 0(__n__). Unlike previous algorithms, this is achieved by means of trivial postprocessing of the output of a straightforward algorithm for finding an MIS for a set o

Finding all the palindromes in a binary

Finding all the palindromes in a binary tree in linear time and space

✍ Bettina De Iaco; Fabrizio Luccio 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 457 KB

A computational method for finding the z

A computational method for finding the zeros of a multivariable linear time invariant system

✍ E.J. Davison 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 299 KB

calculating the zeros of the transfer function which exists between an input and output of an arbitrary multivariable linear time invariant system• The method is simple to use; is computationally fast and is accurate. Some numerical examples for a 9th order system are included.