✦ LIBER ✦

Families of m-convex polygons:

✍ Scribed by W.R.G. James; A.J. Guttmann

Book ID: 108047069
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 399 KB
Volume: 34
Category: Article
ISSN: 0196-8858
DOI: 10.1016/j.aam.2004.08.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Implicit Convex Polygons

✍ Francisco Gómez; Ferran Hurtado; Suneeta Ramaswami; Vera Sacristán; Godfried Tou 📂 Article 📅 2002 🏛 Springer Netherlands 🌐 English ⚖ 381 KB

On k-convex polygons

✍ Oswin Aichholzer; Franz Aurenhammer; Erik D. Demaine; Ferran Hurtado; Pedro Ramo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 345 KB

Self-affine convex polygons

✍ Eike Hertel; Christian Richter 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 503 KB

Optimal matching of convex polygons

✍ Pedro Cox; Henri Maitre; Michel Minoux; Celso Ribeiro 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 478 KB

The morphology of convex polygons

✍ Stephan Olariu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 427 KB

Transversal of disjoint convex polygons

✍ Francis Y.L. Chin; Hong Shen; Fu Lee Wang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Given a set S of n disjoint convex polygons {P i | 1 i n} in a plane, each with k i vertices, the transversal problem is to find, if there exists one, a straight line that goes through every polygon in S. We show that the transversal problem can be solved in O(N + n log n) time, where N = n i=1 k i