✦ LIBER ✦

Two linear-time algorithms for computing the minimum length polygon of a digital contour

✍ Scribed by J.-O. Lachaud; X. Provençal

Book ID: 113564662
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 734 KB
Volume: 159
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.08.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear time algorithm for max-min leng

A linear time algorithm for max-min length triangulation of a convex polygon

✍ Shiyan Hu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 136 KB

A linear-time algorithm for computing th

A linear-time algorithm for computing the voronoi diagram of a convex polygon

✍ Alok Aggarwal; Leonidas J. Guibas; James Saxe; Peter W. Shor 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 906 KB

A simple linear-time algorithm for compu

A simple linear-time algorithm for computing the RNG and MST of unimodal polygons

✍ Stephan Olariu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 592 KB

A linear time algorithm for computing th

A linear time algorithm for computing the convex hull of an ordered crossing polygon

✍ S.K. Ghosh; R.K. Shyamasundar 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 524 KB

A linear time algorithm for obtaining th

A linear time algorithm for obtaining the convex hull of a simple polygon

✍ S.K. Ghosh; R.K. Shyamasundar 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 330 KB

A linear-time algorithm for computing th

A linear-time algorithm for computing the intersection of all odd cycles in a graph

✍ Leizhen Cai; Baruch Schieber 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 506 KB

We present a linear-time algorithm that finds all edges and vertices in the intersection of all odd cycles in a given graph. We also show an application of our algorithm to a variant of the satisfiability problem of Boolean formulas.