✦ LIBER ✦

Statistics of integral convex polygons

✍ Scribed by V. I. Arnol'd

Book ID: 105065165
Publisher: Springer US
Year: 1980
Tongue: English
Weight: 262 KB
Volume: 14
Category: Article
ISSN: 0016-2663
DOI: 10.1007/bf01086547

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computation of the Integral of the Bivar

Computation of the Integral of the Bivariate Normal Distribution Over Convex Polygons

✍ Didonato, A. R.; Jarnagin, Jr., M. P.; Hageman, R. K. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics ⚖ 774 KB

Optimal matching of convex polygons

✍ Pedro Cox; Henri Maitre; Michel Minoux; Celso Ribeiro 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 478 KB

The morphology of convex polygons

✍ Stephan Olariu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 427 KB

Transversal of disjoint convex polygons

✍ Francis Y.L. Chin; Hong Shen; Fu Lee Wang 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Given a set S of n disjoint convex polygons {P i | 1 i n} in a plane, each with k i vertices, the transversal problem is to find, if there exists one, a straight line that goes through every polygon in S. We show that the transversal problem can be solved in O(N + n log n) time, where N = n i=1 k i

Asymptotic Enumeration of Convex Polygon

Asymptotic Enumeration of Convex Polygons

✍ Dudley Stark; Nicholas C. Wormald 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 413 KB

A polygon is an elementary (self-avoiding) cycle in the hypercubic lattice Z d taking at least one step in every dimension. A polygon on Z d is said to be convex if its length is exactly twice the sum of the side lengths of the smallest hypercube containing it. The number of d-dimensional convex pol

Families of m-convex polygons:

✍ W.R.G. James; A.J. Guttmann 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 399 KB