✦ LIBER ✦

The complexity of detecting crossingfree configurations in the plane

✍ Scribed by Klaus Jansen; Gerhard J. Woeginger

Publisher: Springer Netherlands
Year: 1993
Tongue: English
Weight: 879 KB
Volume: 33
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01990536

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of point configurations

✍ Jacob E. Goodman; Richard Pollack 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 959 KB

Monochromatic Translates of Configuratio

Monochromatic Translates of Configurations in the Plane

✍ Arthur D. Szlam 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 100 KB

It is shown that every red blue coloring of the plane, without two blue points distance 1 apart, must have a red translate of every three-point configuration. A seven-point configuration S and a red blue coloring are exhibited, which avoids both distance one in blue and translates of S in red.

The Complexity of Hyperplane Depth in th

The Complexity of Hyperplane Depth in the Plane

✍ Stefan Langerman; William Steiger 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 239 KB

Long Non-crossing Configurations in the

Long Non-crossing Configurations in the Plane

✍ Adrian Dumitrescu; Csaba D. Tóth 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 660 KB

On the combinatorial classification of n

On the combinatorial classification of nondegenerate configurations in the plane

✍ Jacob E Goodman; Richard Pollack 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 920 KB

Detection of Hopf points by counting sec

Detection of Hopf points by counting sectors in the complex plane

✍ W. Govaerts; A. Spence 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 147 KB