Corpus ID: 15800265

Nodally 3-connected planar graphs and convex combination mappings

@inproceedings{Dunlaing2007Nodally3P,
  title={Nodally 3-connected planar graphs and convex combination mappings},
  author={Colm O. Dunlaing},
  year={2007}
}

• Colm O. Dunlaing
• Published 2007
• Computer Science

A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a planar graph is nodally 3-connected then such a mapping is an embedding. Floater generalised this result to convex combination mappings in which every internal vertex is a proper weighted average of its neighbours. He also generalised the result to all triangulated planar graphs. This has applications in numerical analysis… Expand

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed