✦ LIBER ✦

More onk-sets of finite sets in the plane

✍ Scribed by Emo Welzl

Publisher: Springer
Year: 1986
Tongue: English
Weight: 301 KB
Volume: 1
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02187686

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On similarity between finite sets in pla

✍ Nageswara S.V. Rao 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 192 KB

On the distribution of distances in fini

On the distribution of distances in finite sets in the plane

✍ K Vesztergombi 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 894 KB

Let n k denote the number of times the kth largest distance occurs among a set S of n points. We show that if S is the set of vertices of a convex polygone in the euclidean plane, then n1+2n2~3n and n2<~n +n 1. Together with the well-known inequality n~<~n and the trivial inequalities n~>~O and n2>~

More on maximal intersecting families of

More on maximal intersecting families of finite sets

✍ Aart Blokhuis 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 225 KB

Rigid Subanalytic Sets in the Plane

✍ H. Schoutens 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 390 KB

On ‘k-sets’ in the plane

✍ G.W. Peck 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 95 KB

Given an arrangement of n points in the plane, a k-set in the plane is a k element subset of these that can be separated from the others by a straight line. The question of how many j-sets there are with ] less than k was considered by Pach and by Goodman and Pollack [1], who obtained upper bounds o

Separating convex sets in the plane

✍ Jurek Czyzowicz; Eduardo Rivera-Campo; Jorge Urrutia; Joseph Zaks 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 329 KB