15 search results - page 1 / 3 » Optimal 1-planar graphs which triangulate other surfaces |
DM
2010
13 years 5 months ago
2010
CORR
2007
Springer
13 years 4 months ago
2007
Springer
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 pl...
IPMI
2005
Springer
14 years 5 months ago
2005
Springer
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
DM
2002
13 years 4 months ago
2002
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
SMI
2005
IEEE
13 years 10 months ago
2005
IEEE
Point-based surfaces (i.e. surfaces represented by discrete point sets which are either directly obtained by current 3D acquisition devices or converted from other surface represe...