article

Approximation of convex discs by polygons

Author:

A. FlorianAuthors Info & Claims

Discrete & Computational Geometry, Volume 1, Issue 3

Pages 241 - 263

https://doi.org/10.1007/BF02187698

Published: 01 December 1986 Publication History

Abstract

We consider the class of all convex discs with areas and perimeters bounded by given constants. Which disc of this class has the least possible area deviation from ak-gon? This and related questions are the subject of the present paper.

References

[1]

A. S. Besicovitch, Variants of a classical isoperimetric problem,Quart. J. Math. Oxford ser. 23 (1952), 42---49.

Google Scholar

[2]

H. G. Eggleston, Approximation to plane convex curves, I. Dowker-type theorems,Proc. London Math. Soc. (3)7 (1957), 351---377.

Crossref

Google Scholar

[3]

G. Fejes Tóth, Covering the plane by convex discs,Acta Math. Acad. Sci. Hungar.23 (1972), 263---270.

Crossref

Google Scholar

[4]

G. Fejes Tóth, Sum of moments of convex polygons,Acta Math. Acad. Sci. Hungar.24 (1973), 417---421.

Crossref

Google Scholar

[5]

G. Fejes Tóth and A. Florian, Covering of the plane by discs,Geom. Dedicata16 (1984), 315---333.

Google Scholar

[6]

L. Fejes Tóth, Filling of a domain by isoperimetric discs,Publ. Math. Debrecen,5 (1957), 119---127.

Google Scholar

[7]

L. Fejes Tóth, On the isoperimetric property of the regular hyperbolic tetrahedra,Magyar Tud. Akad. Mat. Kut. Int. Közl.8A (1963), 53---57.

Google Scholar

[8]

L. Fejes Tóth,Regular Figures, Pergamon Press, Oxford, 1964.

Google Scholar

[9]

L. Fejes Tóth,Lagerungen in der Ebene, auf der Kugel und im Raum, 2nd ed., Springer-Verlag, Berlin-Heidelberg-New York, 1972.

Google Scholar

[10]

L. Fejes Tóth and A. Florian, Packing and covering with convex discs,Mathematika29 (1982), 181---193.

Google Scholar

[11]

L. Fejes Tóth and A. Heppes, Filling of a domain by equiareal discs,Publ. Math. Debrecen7 (1960), 198---203.

Google Scholar

[12]

A. Florian, Integrale auf konvexen Mosaiken,Period. Math. Hungar.6 (1975), 23---38.

Crossref

Google Scholar

[13]

A. Florian, Packing and covering with convex discs,Studia Sci. Math. Hungar., to appear.

Google Scholar

[14]

P. M. Gruber, Approximation of convex bodies,Convexity and Its Applications, Birkhäuser-Verlag, Basel-Boston-Stuttgart, 1983.

Google Scholar

[15]

G. Hajós, Über den Durchschnitt eines Kreises und eines Polygons,Ann. Univ. Sci. Budapest. Eötvös Sect. Math.11 (1968), 137---144.

Google Scholar

[16]

K. Leichtweiss,Konvexe Mengen, Springer-Verlag, Berlin-Heidelberg-New York, 1980.

Google Scholar

[17]

G. C. Shephard and R. J. Webster, Metrics for sets of convex bodies,Mathematika12 (1965), 73---88.

Google Scholar

Index Terms

Approximation of convex discs by polygons
1. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Index terms have been assigned to the content through auto-classification.

Recommendations

Covering convex polygons by two congruent disks
Abstract
We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an O ( n log ⁡ n )-time algorithm for the two-...
Covering Convex Polygons by Two Congruent Disks
Combinatorial Algorithms
Abstract
We consider the planar two-center problem for a convex polygon: given a convex polygon in the plane, find two congruent disks of minimum radius whose union contains the polygon. We present an $O (n log n)$ -time algorithm for the two-center problem for ...
Largest inscribed rectangles in convex polygons

We consider approximation algorithms for the problem of computing an inscribed rectangle having largest area in a convex polygon on n vertices. If the order of the vertices of the polygon is given, we present a randomized algorithm that computes an ...

Comments

Information & Contributors

Information

Published In

cover image Discrete & Computational Geometry

Discrete & Computational Geometry Volume 1, Issue 3

September 1986

89 pages

ISSN:0179-5376

Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 December 1986

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Index Terms

Recommendations

Covering convex polygons by two congruent disks

Covering Convex Polygons by Two Congruent Disks

Largest inscribed rectangles in convex polygons

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations