𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Subsets of Rn with convex midsets

✍ Scribed by W. Dȩbski; K. Kawamura; K. Yamada

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
455 KB
Volume
60
Category
Article
ISSN
0166-8641

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An iterative algorithm for finding a nea
An iterative algorithm for finding a nearest pair of points in two convex subsets of Rn
✍ B. Llanas; M. Fernandez de Sevilla; V. Feliu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 536 KB

We present an algorithm for finding a nearest pair of points in two convex sets of R n, and therefore, their distance. The algorithm is based on the fixed-point theory of nonexpansive operators on a Hilbert space. Its practical implementation requires a fast projection algorithm. We introduce such a

Sets in Rd with no large empty convex su
Sets in Rd with no large empty convex subsets
✍ Pavel Valtr 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Let A be a finite set of points in general position in Rd, d 2 2. Points a,, a2, , a, E A form an n-hole in A (an empty convex subset of A) if they are vertices of a convex polytope containing no other point of A. Let h(d) denote the maximum number h such that any sufficiently large set of points in