A Simple Criterion for Nodal 3-connectivity in Planar Graphs

被引：0
作者：
Dunlaing, Colm O. [1 ]
机构：
[1] Trinity Coll Dublin, Math, Dublin 2, Ireland
来源：
ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE | 2009年 / 225卷 / 0C期
关键词：
Nodally; 3-connected; planar graph;
D O I：
10.1016/j.entcs.2008.12.078
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 [2,11].
引用
收藏
页码：245 / 253
页数：9
相关论文
共 11 条
[1]  
Colm O Dunlaing, 1994, ALCOMII429 COLM DUNL
[2]  
Colm O Dunlaing, 2006, ARXIV07080964
[3]   HOW TO DRAW A PLANAR GRAPH ON A GRID [J].
DEFRAYSSEIX, H ;
PACH, J ;
POLLACK, R .
COMBINATORICA, 1990, 10 (01) :41-51
[4]  
Floater Michael S., 2002, ALGORITHMS APPROXIMA, VIV, P18
[5]  
Floater MS, 2003, MATH COMPUT, V72, P685, DOI 10.1090/S0025-5718-02-01466-7
[6]  
Kant G., 1993, THESIS
[7]  
Moise Edwin E, 1977, GEOMETRIC TOPOLOGY D, V47
[8]  
Read R., 1987, C NUMER, V56, P31
[9]  
Tutte W., 1963, P LOND MATH SOC, P743, DOI DOI 10.1112/PLMS/S3-13.1.743
[10]  
Tutte W. T., 1960, P LOND MATH SOC, V3, P304
12