✦ LIBER ✦

A characterization of convexity and central symmetry for planar polygonal sets

✍ Scribed by S. W. Dharmadhikari; Kumar Jogdeo

Book ID: 112884359
Publisher: The Hebrew University Magnes Press
Year: 1973
Tongue: English
Weight: 454 KB
Volume: 15
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02757074

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Planar point sets with a small number of

Planar point sets with a small number of empty convex polygons

✍ Bárány, Imre; Valtr, Pável 📂 Article 📅 2004 🏛 Akadmiai Kiad 🌐 Hungarian ⚖ 303 KB

A simple algorithm for the unique charac

A simple algorithm for the unique characterization of convex polygons

✍ P.K Harvey 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 315 KB

A characterization of the convexity of c

A characterization of the convexity of cyclic polygons in terms of the central angles

✍ Iosif Pinelis 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 136 KB

An Optimal Algorithm for the Intersectio

An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons

✍ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the

Measure of central symmetry for fields o

Measure of central symmetry for fields of convex figures and three-dimensional convex bodies

✍ V. V. Makeev 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 604 KB

Comment on a simple algorithm for the un

Comment on a simple algorithm for the unique characterization of convex polygons

✍ R.G. Miles; J.G. Tough 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 48 KB