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

Regular Steiner polygons

โœ Scribed by M.J. Kaiser

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
347 KB
Volume
11
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.

โœฆ Synopsis

The symmetric difference area functional is minimized for a pair of planar convex polygons. Two solution procedures are outlined: a direct constructive methodology and a support function formulation. Examples illustrate the solution methodology.

๐Ÿ“œ SIMILAR VOLUMES

Steiner minimal trees on regular polygon
Steiner minimal trees on regular polygons with centre
โœ J.F. Weng; R.S. Booth ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 594 KB

Let P,,n~>3, be the set of vertices of a regular n-gon and o be the centre of P,. Let P+ = P, u [o}. In this paper we determine the Steiner minimal trees on P+. By this example we will see how complicated the Steiner problem may become if even one regular point not lying on the Steiner polygon is ad

Regular polygons in Euclidean space
Regular polygons in Euclidean space
โœ F. van der Blij ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 317 KB
Homogeneous Graphs and Regular Near Poly
Homogeneous Graphs and Regular Near Polygons
โœ K. Nomura ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 210 KB

We consider a distance-regular graph having homogeneous edge patterns in each entry of its intersection diagram with respect to an edge. We call such graphs homogeneous graphs. We study elementary properties of homogeneous graphs, and we show these graphs are related deeply with regular near polygon