19 search results - page 2 / 4 » Convex Grid Drawings of Four-connected Plane Graphs |
IJFCS
2006
13 years 5 months ago
2006
CCCG
2010
13 years 6 months ago
2010
d Abstract) Debajyoti Mondal , Rahnuma Islam Nishat , Md. Saidur Rahman , and Muhammad Jawaherul Alam
COMPGEOM
1996
ACM
13 years 9 months ago
1996
ACM
We provideO(n)-timealgorithmsfor constructingthe following types of drawings of n-vertex 3-connectedplanar graphs: 2D convex grid drawings with (3n) (3n=2) area under the edge L1-...
GD
2006
Springer
13 years 8 months ago
2006
Springer
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...
VISUALIZATION
1997
IEEE
13 years 9 months ago
1997
IEEE
Different techniques have been proposed for rendering volumetric scalar data sets. Usually these approaches are focusing on orthogonal cartesian grids, but in the last years resea...