Skip to main content
Springer Nature Link
Log in

Algorithms for computing the center of area of a convex polygon

  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

The center of area of a convex polygonP is the unique pointp * that maximizes the minimum area overlap betweenP and any halfplane that includesp *. We show thatp * is unique and present two algorithms for its computation. The first is a combinatorial algorithm that runs in timeO (n 6 log2 n). The second is a “numerical” algorithm that runs in timeO(GK(n+K)) whereK represents the number of desired bits of precision in the output coordinates andG the number of bits used to represent the coordinates of the input polygon vertices. We conclude with a discussion of implementation issues and related results.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Cole R, Sharir M, Yap CK (1987) Onk-hulls and related problems. SIAM J Comput 16:61–77

    Google Scholar 

  • Chang JS, Yap CK (1986) A polynomial solution for the potato-peeling problem. Discrete Comput Geom 1:155–182

    Google Scholar 

  • Díaz MG (1990) Algorithms for balanced partitions of polygons and point sets. PhD thesis, Johns Hopkins University

  • Díaz MG, O'Rourke J (1989) Computing the center of area of a simple polygon. Tech Rep 89-03, Johns Hopkins University

  • Edelsbrunner H (1987) Algorithms in combinatorial geometry. (EATCS monographs on theoretical computer science, vol 10) Springer, Berlin Heidelberg New York

    Google Scholar 

  • Edelsbrunner H, Pach J, Schwartz J, Sharir M (1987) On the lower envelope of bivariate functions and its applications. In: Proc 28th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, IEEE Press, New York, pp 27–37

    Google Scholar 

  • Grünbaum B (1963) Measures of symmetry for convex sets. In: Klee V (ed) Proc Symposia in Pure Mathematics: Convexity, Vol 7 American Mathematical Society, Providence, RI pp 223–270

    Google Scholar 

  • Grünbaum B (1972) Arrangements and spreads. In: Proc. Regional Conf Ser Math American Mathematical Society, Providence, RI

  • Hoggatt VE Jr (1962) Forbidden area. Am Math Mon 69:98–104

    Google Scholar 

  • Luenberger D (1973) Introduction to linear and non-linear programming. Addison-Wesley, Reading, Mass

    Google Scholar 

  • Preparata F, Shamos M (1985) Computational geometry: an introduction. Springer, Berlin Heidelberg New York

    Google Scholar 

  • Schwartz JT, Sharir M (1990) On the two-dimensional Davenport Schinzel problem. J Symbolic Comput 10:371–393

    Google Scholar 

  • Singmaster DS, Singmaster G (1967) Forbidden regions are convex. Am Math Mon 74:184–186

    Google Scholar 

  • Süss W (1950) Ueber Eichbereiche mit Mittlepunkt. Math Phys Semesterber 1:273–287

    Google Scholar 

  • Yaglom IM, Boltyanskii VG (1961) Convex figures. (Library of the mathematical circle vol. 4). Holt, Rinehart and Winston, New York, NY (Translated by Paul Kelly and Lewis Walton)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Convex Computer Corporation, 75080, Richardson, TX, USA

    Matthew Díaz

  2. Department of Computer Science, Smith College, 01063, Northampton, MA, USA

    Joseph O'Rourke

Authors
  1. Matthew Díaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Joseph O'Rourke
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research partially supported by the second author's NSF grant CCR-8351468, at Johns Hopkins University and Smith College.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Díaz, M., O'Rourke, J. Algorithms for computing the center of area of a convex polygon. The Visual Computer 10, 432–442 (1994). https://doi.org/10.1007/BF01910633

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01910633

Key words