Discrete one-forms on meshes and applications to 3D mesh parameterization
Computer Aided Geometric Design
Discrete one-forms on meshes and applications to 3D mesh parameterization
Computer Aided Geometric Design
On convex greedy embedding conjecture for 3-connected planar graphs
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
| Hi-index | 0.00 |
We present a short proof of the theorem of Tutte that every planar 3-connected graph has a drawing in the plane such that every vertex which is not on the outer cycle is the barycenter of its neighbors. Moreover, this holds for any prescribed representation of the outer cycle. © 2004 Wiley Periodicals, Inc. J Graph Theory 45: 275–280, 2004