✦ LIBER ✦

The Unit Distance Problem for Centrally Symmetric Convex Polygons

✍ Scribed by Ábrego; Fernández-Merchant

Publisher: Springer
Year: 2002
Tongue: English
Weight: 157 KB
Volume: 28
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-002-2882-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An isoperimetric inequality for convex p

An isoperimetric inequality for convex polygons and convex sets with the same symmetrals

✍ Marco Longinetti 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 512 KB

A lower bound on the number of unit dist

A lower bound on the number of unit distances between the vertices of a convex polygon

✍ Herbert Edelsbrunner; Péter Hajnal 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 218 KB

An optimal algorithm for computing the m

An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons

✍ G. T. Toussaint 📂 Article 📅 1984 🏛 Springer Vienna 🌐 English ⚖ 374 KB

A central cutting plane algorithm for th

A central cutting plane algorithm for the convex programming problem

✍ Jack Elzinga; Thomas G. Moore 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 496 KB

The limiting normality of the test stati

The limiting normality of the test statistic for the two-sample problem induced by a convex sum distance

✍ Kaoru Fueda 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 375 KB

Critchlow (1992, J. Statist. Plann. Inference, 32, 325-346) proposed a method of a unified construction of a class of rank tests. In this paper, we introduce a convex sum distance and prove the limiting normality of the test statistics for the two-sample problem derived by his method.

Realization of closed, convex, and symme

Realization of closed, convex, and symmetric subsets of the unit square as regions of risk for testing simple hypotheses

✍ K. Obermeyer; D. Plachky 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 257 KB