ACM Home Page
Please provide us with feedback. Feedback
Mean value coordinates for arbitrary planar polygons
Full text PdfPdf (628 KB)
Source ACM Transactions on Graphics (TOG) archive
Volume 25 ,  Issue 4  (October 2006) table of contents
Pages: 1424 - 1441  
Year of Publication: 2006
ISSN:0730-0301
Authors
Kai Hormann  Clausthal University of Technology, Clausthal-Zellerfeld, Germany
Michael S. Floater  University of Oslo, Oslo, Norway
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 21,   Downloads (12 Months): 196,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1183287.1183295
What is a DOI?

ABSTRACT

Barycentric coordinates for triangles are commonly used in computer graphics, geometric modeling, and other computational sciences because they provide a convenient way to linearly interpolate the data that is given at the corners of a triangle. The concept of barycentric coordinates can also be extended in several ways to convex polygons with more than three vertices, but most of these constructions break down when used in the nonconvex setting. Mean value coordinates offer a choice that is not limited to convex configurations, and we show that they are in fact well-defined for arbitrary planar polygons without self-intersections. Besides their many other important properties, these coordinate functions are smooth and allow an efficient and robust implementation. They are particularly useful for interpolating data that is given at the vertices of the polygons and we present several examples of their application to common problems in computer graphics and geometric modeling.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
Beatson, R. K. and Newsam, G. N. 1992. Fast evaluation of radial basis functions: I. Comput Math. Appl. 24, 12, 7--19.
 
4
Buhmann, M. 2000. Radial basis functions: The state-of-the-art and new results. Acta Numer. 9, 1--37.
 
5
Ceva, G. 1678. De lineis rectis se invicem secantibus, statica constructio. Ludovici Montiae, Mediolanum.
 
6
7
 
8
 
9
 
10
 
11
 
12
Floater, M. S., Hormann, K., and Kós, G. 2006. A general construction of barycentric coordinates over convex polygons. Adv. Comp. Math. 24, 1--4, 311--331.
 
13
 
14
Glasbey, C. A. and Mardia, K. V. 1998. A review of image warping methods. J. Appl. Statistics 25, 2, 155--171.
 
15
16
17
18
 
19
Ju, T., Schaefer, S., Warren, J., and Desbrun, M. 2005. A geometric construction of coordinates for convex polyhedra using polar duals. In Geometry Processing 2005. M. Desbrun and H. Pottmann, Eds. Eurographics Association, 181--186.
 
20
Kounchev, O. 2001. Multivariate Polysplines: Applications to Numerical and Wavelet Analysis. Academic Press, Orlando, FL.
21
 
22
 
23
Malsch, E. A. and Dasgupta, G. 2004a. Interpolations for temperature distributions: A method for all non-concave polygons. Int. J. Solids and Structures 41, 8, 2165--2188.
 
24
Malsch, E. A. and Dasgupta, G. 2004b. Shape functions for polygonal domains with interior nodes. Int. J. Numer. Method Eng. 61, 8, 1153--1172.
 
25
Malsch, E. A. and Dasgupta, G. 2005. Algebraic construction of smooth interpolants on polygonal domains. Mathematica J. 9, 3, 641--658.
 
26
Malsch, E. A., Lin, J. J., and Dasgupta, G. 2005. Smooth two dimensional interpolants: A recipe for all polygons. J. Graph. Tools 10, 2, 27--39.
 
27
28
 
29
Möbius, A. F. 1827. Der Barycentrische Calcul. Johann Ambrosius Barth, Leipzig.
 
30
 
31
Pinkall, U. and Polthier, K. 1993. Computing discrete minimal surfaces and their conjugates. Experim. Math. 2, 1, 15--36.
 
32
 
33
Sibson, R. 1980. A vector identity for the Dirichlet tesselation. Math. Proc. Combridge Phil. Soc. 87, 151--155.
 
34
Sibson, R. 1981. A brief description of natural neighbour interpolation. In Interpolating Multivariate Data. V. Barnett, Ed. Wiley, New York, 21--36.
 
35
Sukumar, N. and Malsch, E. A. 2006. Recent advances in the construction of polygonal finite element interpolants. Arch. Comput. Meth. Eng. 13, 1, 129--163.
 
36
Wachspress, E. L. 1975. A Rational Finite Element Basis. Academic Press, New York.
 
37
Warren, J. 1996. Barycentric coordinates for convex polytopes. Advances in Comput. Math. 6, 2, 97--108.
 
38
Warren, J. 2003. On the uniqueness of barycentric coordinates. In Topics in Algebraic Geometry and Geometric Modeling. R. Goldman and R. Krasauskas, Eds. Contemporary Mathematics, vol. 334. American Mathematical Society, 93--99.
 
39
Warren, J., Schaefer, S., Hirani, A. N., and Desbrun, M. 2004. Barycentric coordinates for convex sets. Tech. Rep., Rice University.
 
40


Collaborative Colleagues:
Kai Hormann: colleagues
Michael S. Floater: colleagues