✦ LIBER ✦

An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon

✍ Scribed by J. -D. Boissonnat, S. K. Ghosh, T. Kavitha and S. Lazard

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reachability by paths of bounded curvatu

✍ Hee-Kap Ahn; Otfried Cheong; Jiří Matoušek; Antoine Vigneron 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 336 KB

Numerical stability of a convex hull alg

✍ J. W. Jaromczyk; G. W. Wasilkowski 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 770 KB

A simple algorithm for the unique charac

✍ P.K Harvey 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 315 KB

A linear algorithm for finding the conve

✍ Duncan McCallum; David Avis 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 759 KB

An Efficient Adaptive Algorithm for Cons

✍ Ari Rappoport 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

A linear time algorithm for obtaining th

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