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.
Similar content being viewed by others
References
Cole R, Sharir M, Yap CK (1987) Onk-hulls and related problems. SIAM J Comput 16:61–77
Chang JS, Yap CK (1986) A polynomial solution for the potato-peeling problem. Discrete Comput Geom 1:155–182
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
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
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
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
Luenberger D (1973) Introduction to linear and non-linear programming. Addison-Wesley, Reading, Mass
Preparata F, Shamos M (1985) Computational geometry: an introduction. Springer, Berlin Heidelberg New York
Schwartz JT, Sharir M (1990) On the two-dimensional Davenport Schinzel problem. J Symbolic Comput 10:371–393
Singmaster DS, Singmaster G (1967) Forbidden regions are convex. Am Math Mon 74:184–186
Süss W (1950) Ueber Eichbereiche mit Mittlepunkt. Math Phys Semesterber 1:273–287
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)
Author information
Authors and Affiliations
Additional information
Research partially supported by the second author's NSF grant CCR-8351468, at Johns Hopkins University and Smith College.
Rights 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
Issue Date:
DOI: https://doi.org/10.1007/BF01910633