Mean value coordinates for arbitrary planar polygons
By Kai Hormann, Michael S. Floater. TOGS, 2006
300 citations recorded by the source corpus.
Subfields: Computational Mechanics, Computer Graphics and Computer-Aided Design
View Paper: https://www.semanticscholar.org/paper/9aa3b98a6e321d6f4d986a8a37ea5775ea890cfe
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
- Natarajan Sukumar
- Gianmarco Manzini
- Alessandro Russo
- A. Tabarraei
- Rida T. Farouki
- L. Beirão da Veiga
- Kai Hormann
- Ankit Srivastava
In Computer Graphics and Computer-Aided Design
- Natarajan Sukumar
- A. Tabarraei
- Rida T. Farouki
- Kai Hormann
- Ankit Srivastava
- Alessandro Russo
- Gianmarco Manzini
- Michael S. Floater
Citations in the corpus
- Extended finite element method on polygonal and quadtree meshes (2008, methodology): “Hormann and Floater [15] have presented the important properties of mean value coordinates along with an implementation for planar polygons.”
- New perspectives on polygonal and polyhedral finite element methods (2014, background): “To this end, on letting ra = x − xa (ra = ||ra||), we can write [71, 51]”
- Barycentric rational interpolation with no poles and high rates of approximation (2007, methodology): “As well as offering an alternative way of interpolating univariate data, we hope that these interpolants might also lead to generalizations of the bivariate interpolants of [15].”
- Exact imposition of boundary conditions with distance functions in physics-informed deep neural networks (2021, background): “Hormann and Floater [81] showed that 10”
- The Bernstein polynomial basis: A centennial retrospective (2012, background): “They can also be generalized to non–convex polygons [112] although the non–negativity property is then relinquished.”