Abstract
This paper gives a simple characterisation of nodally 3-connected planar graphs, which have the property that barycentric mappings, and more generally convex combination mappings, are embeddings. This has applications in numerical analysis (grid generation), and in computer graphics (image morphing, surface triangulations, texture mapping): see [Michael S. Floater (2002). Convex combination maps. In Algorithms for Approximation IV, 18–23, J. Levesley, I.J. Anderson, and J.C. Mason (eds), University of Huddersfield; Geoffrey White (2004). Mesh parametrization for texture mapping. Undergraduate computer science project, Oxford University].
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
