✦ LIBER ✦

Efficient generation of simple polygons for characterizing the shape of a set of points in the plane

✍ Scribed by Matt Duckham; Lars Kulik; Mike Worboys; Antony Galton

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polygonizations of point sets in the pla

✍ Linda Deneen; Gary Shute 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 619 KB

Fitting polygonal functions to a set of

✍ S.L Hakimi; E.F Schmeichel 📂 Article 📅 1991 🏛 Elsevier Science ⚖ 520 KB

The maximum size of a convex polygon in

✍ N. Alon; M. Katchalski; W. R. Pulleyblank 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 364 KB

A simple algorithm for the unique charac

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

On the boundary of a finite set of point

✍ Václav Medek 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 485 KB

An efficient algorithm for finding the m

✍ Naoki Makimoto; Ikuo Nakagawa; Akihisa Tamura 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 398 KB