Abstract
Barycentric coordinates are unique for triangles, but there are many possible generalizations to convex polygons. In this paper we derive sharp upper and lower bounds on all barycentric coordinates over convex polygons and use them to show that all such coordinates have the same continuous extension to the boundary. We then present a general approach for constructing such coordinates and use it to show that the Wachspress, mean value, and discrete harmonic coordinates all belong to a unifying one-parameter family of smooth three-point coordinates. We show that the only members of this family that are positive, and therefore barycentric, are the Wachspress and mean value ones. However, our general approach allows us to construct several sets of smooth five-point coordinates, which are positive and therefore barycentric.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.M. Carnicer and M.S. Floater, Piecewise linear interpolants to Lagrange and Hermite convex scattered data, Numer. Algorithms 13(3–4) (1996) 345–364.
P. Charrot and J. Gregory, A pentagonal surface patch for computer aided geometric design, Comput. Aided Geom. Design 1(1) (1984) 87–94.
W. Dahmen and C. Micchelli, Convexity of multivariate Bernstein polynomials and box spline surfaces, Studia Sci. Math. Hungar. 23(1–2) (1988) 265–287.
M. Eck, T.D. DeRose, T. Duchamp, H. Hoppe, M. Lounsbery and W. Stuetzle, Multiresolution analysis of arbitrary meshes, in: Proceedings of SIGGRAPH '95 (1995) pp. 173–182.
M.S. Floater, Parameterization and smooth approximation of surface triangulations, Comput. Aided Geom. Design 14(3) (1997) 231–250.
M.S. Floater, Mean value coordinates, Comput. Aided Geom. Design 20(1) (2003) 19–27.
M.S. Floater, One-to-one piecewise linear mappings over triangulations, Math. Comp. 72(242) (2003) 685–696.
R. Goldman, Pyramid Algorithms: A Dynamic Programming Approach to Curves and Surfaces for Geometric Modeling (Morgan Kaufmann, 2002).
C.T. Loop and T.D. DeRose, A multisided generalization of Bézier surfaces, ACM Trans. Graphics 8(3) (1989) 204–234.
M. Meyer, H. Lee, A.H. Barr and M. Desbrun, Generalized barycentric coordinates for irregular polygons, J. Graphics Tools 7(1) (2002) 13–22.
U. Pinkall and K. Polthier, Computing discrete minimal surfaces and their conjugates, Experimental Math. 2(1) (1993) 15–36.
M.H. Protter and H.F. Weinberger, Maximum Principles in Differential Equations, 3rd edn (Springer, 1999).
V. Surazhsky and C. Gotsman, Intrinsic morphing of compatible triangulations, in: Proceedings of 4th Bi-National Israel-Korea Conference on Geometric Modelling and Computer Graphics (2003) pp. 45–50.
E.L. Wachspress, A Rational Finite Element Basis (Academic Press, New York, 1975).
J. Warren, Barycentric coordinates for convex polytopes, Adv. Comput. Math. 6(2) (1996) 97–108.
J. Warren, On the uniqueness of barycentric coordinates, in: Contemporary Mathematics, Proceedings of AGGM '02 (2003) pp. 93–99.
J. Warren, S. Schaefer, A.N. Hirani and M. Desbrun, Barycentric coordinates for convex sets, Technical Report, Rice University (2003).
Author information
Authors and Affiliations
Additional information
Communicated by Rida Farouki
Dedicated to Charles A. Micchelli on his 60th Birthday
Mathematics subject classifications (2000)
26C15, 65D05.
Rights and permissions
About this article
Cite this article
Floater, M.S., Hormann, K. & Kós, G. A general construction of barycentric coordinates over convex polygons. Adv Comput Math 24, 311–331 (2006). https://doi.org/10.1007/s10444-004-7611-6
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10444-004-7611-6