Name
Abstract | ||
|---|---|---|
Computation of homology generators using a graph pyramid can significantly increase performance, compared to the classical methods. First results in 2D exist and show the advantages of the method. Generators are computed on the upper level of a graph pyramid. Top-level graphs may contain self loops and multiple edges, as a side product of the contraction process. Using straight lines to draw these edges would not show the full information: self loops disappear, parallel edges collapse. This paper presents a novel algorithm for correctly visualizing graph pyramids, including multiple edges and self loops which preserves the geometry and the topology of the original image. New insights about the top-down delineation of homology generators in graph pyramids are given. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-85920-8_70 | CIARP |
Keywords | Field | DocType |
graphs pyramids,pyramid drawing,homology generators | Strength of a graph,Topology,Multigraph,Line graph,Hypercube graph,Computer science,Mixed graph,Multiple edges,Complement graph,Topological graph | Conference |
Volume | ISSN | Citations |
5197 | 0302-9743 | 2 |
PageRank | References | Authors |
0.47 | 7 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mabel Iglesias Ham | 1 | 22 | 4.91 |
| Adrian Ion | 2 | 222 | 21.11 |
| Walter G. Kropatsch | 3 | 896 | 152.91 |
| Edel Garcia-Reyes | 4 | 95 | 12.84 |