𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sum of moments of convex polygons

✍ Scribed by G. Fejes Tóth

Book ID
105414000
Publisher
Akadmiai Kiad
Year
1973
Tongue
English
Weight
251 KB
Volume
24
Category
Article
ISSN
1588-2632

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal matching of convex polygons
Optimal matching of convex polygons
✍ Pedro Cox; Henri Maitre; Michel Minoux; Celso Ribeiro 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 478 KB
Transversal of disjoint convex polygons
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:
Families of m-convex polygons:
✍ W.R.G. James; A.J. Guttmann 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 399 KB