✦ LIBER ✦

Translation separability of sets of polygons

✍ Scribed by Frank Dehne; Jörg-Rüdiger Sack

Publisher: Springer
Year: 1987
Tongue: English
Weight: 870 KB
Volume: 3
Category: Article
ISSN: 0178-2789
DOI: 10.1007/bf01952829

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Separating two simple polygons by a sequ

Separating two simple polygons by a sequence of translations

✍ R. Pollack; M. Sharir; S. Sifrony 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 891 KB

On separating two simple polygons by a s

On separating two simple polygons by a single translation

✍ G. Toussaint 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 847 KB

The geometry of linear separability in d

The geometry of linear separability in data sets

✍ Adi Ben-Israel; Yuri Levin 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 158 KB

We study the geometry of datasets, using an extension of the Fisher linear discriminant to the case of singular covariance, and a new regularization procedure. A dataset is called linearly separable if its different clusters can be reliably separated by a linear hyperplane. We propose a measure of l

Uniform separability of sets and extensi

Uniform separability of sets and extensions of linear functionals

✍ V. P. Panteleev 📂 Article 📅 1974 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 289 KB

Parallel algorithms for separation of tw

Parallel algorithms for separation of two sets of points and recognition of digital convex polygons

✍ Dilip Sarkar; Ivan Stojmenović 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 605 KB

Polygonizations of point sets in the pla

Polygonizations of point sets in the plane

✍ Linda Deneen; Gary Shute 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 619 KB