✦ LIBER ✦

A Note on Convex Decompositions of a Set of Points in the Plane

✍ Scribed by Víctor Neumann-Lara; Eduardo Rivera-Campo; Jorge Urrutia

Publisher: Springer Japan
Year: 2004
Tongue: English
Weight: 266 KB
Volume: 20
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-004-0555-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum size of a convex polygon in

The maximum size of a convex polygon in a restricted set of points in the plane

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

On the boundary of a finite set of point

On the boundary of a finite set of points in the plane

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

Minimization of convex functions on the

Minimization of convex functions on the convex hull of a point set

✍ Nikolai D. Botkin; Josef Stoer 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 186 KB

On the relative distances of seven point

On the relative distances of seven points in a plane convex body

✍ Antal Joós; Zsolt Lángi 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 232 KB

An optimal real time algorithm for deter

An optimal real time algorithm for determine the convex hull of a set of points in a plane

✍ Z.Q. Wang; L.J. Xiao 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 282 KB

Based on the properties of star polygon and that the convex polygon is a special kind of star polygon, with the star point as the origin and the two lines respectively parallel to the x-axis and y-axis as coordinate axis, a relative coordinate system is built and the planar area is divided into four

On the complexity of finding the convex

On the complexity of finding the convex hull of a set of points

✍ Davis Avis 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 281 KB