7 search results - page 2 / 2 » Intersection-Free Morphing of Planar Graphs |
107
Voted
CORR
2007
Springer
15 years 19 days 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...
95
Voted
CVPR
1999
IEEE
16 years 2 months ago
1999
IEEE
The main question we address is: what is the minimal information required to generate closed, non-intersecting planar boundaries? For this paper we restrict ‘shape’ to this mea...