Sciweavers

Share
50 search results - page 1 / 10
» Morphing Planar Graph Drawings with Bent Edges
Sort
View
ENDM
2008
123views more  ENDM 2008»
10 years 1 months ago
Morphing Planar Graph Drawings with Bent Edges
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
Anna Lubiw, Mark Petrick
CCCG
2007
10 years 2 months ago
Morphing Planar Graph Drawings
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...
Anna Lubiw
GD
2006
Springer
10 years 5 months ago
Morphing Planar Graphs in Spherical Space
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continu...
Stephen G. Kobourov, Matthew Landis
GD
2003
Springer
10 years 6 months ago
Intersection-Free Morphing of Planar Graphs
Given two diļ¬€erent drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
Cesim Erten, Stephen G. Kobourov, Chandan Pitta
APVIS
2007
10 years 2 months ago
Straight-line grid drawings of planar graphs with linear area
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...
Md. Rezaul Karim, Md. Saidur Rahman
books