๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The morphology of convex polygons

โœ Scribed by Stephan Olariu

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
427 KB
Volume
24
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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

On the multimodality of distances in con
On the multimodality of distances in convex polygons
โœ David Avis; Godfried T. Toussaint; Binay K. Bhattacharya ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 264 KB

Examples are given of n vertex convex polygons for which the distances between a fixed vertex and the remaining vertices, visited in order, form a multi-modal function. We show that this function may have as many as n/2 modes, or local maxima. Further examples are given of n vertex convex polygons i