Name
Abstract | ||
|---|---|---|
We present a graph algorithm to find fundamental cycles aligned with the principal curvature directions of a surface. Specifically, we use the tree-cotree decomposition of graphs embedded in manifolds, guided with edge weights, in order to produce these cycles. Our algorithm is very quick compared to existing methods, with a worst case running lime of O(nlogn + gn) where it is the number of faces and g is the surface genus. Further, its flexibility to accommodate different weighting functions and to handle boundaries may be used to produce cycles suitable for a variety of applications and models. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1111/j.1467-8659.2009.01580.x | COMPUTER GRAPHICS FORUM |
Field | DocType | Volume |
Graph,Graph algorithms,Discrete mathematics,Topology,Weighting,Curvature,Principal curvature,Time complexity,Manifold,Mathematics | Journal | 28.0 |
Issue | ISSN | Citations |
SP7.0 | 0167-7055 | 3 |
PageRank | References | Authors |
0.40 | 22 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pablo Diaz-gutierrez | 1 | 51 | 4.54 |
| David Eppstein | 2 | 4897 | 533.94 |
| Meenakshisundaram Gopi | 3 | 119 | 9.06 |