A Simple Criterion for Nodal 3-connectivity in Planar Graphs | Zendy

Colm Ó Dúnlaing | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Simple Criterion for Nodal 3-connectivity in Planar Graphs

Author(s) -

Colm Ó Dúnlaing

Publication year - 2009

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.12.078

Subject(s) - morphing , regular polygon , simple (philosophy) , polyhedron , barycentric coordinate system , texture mapping , planar , planar graph , parametrization (atmospheric modeling) , combinatorics , computer graphics , computer science , mathematics , discrete mathematics , computer graphics (images) , geometry , graph , philosophy , physics , epistemology , quantum mechanics , radiative transfer

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]

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research