Curvature Aware Fundamental Cycles

dc.contributor.authorDiaz-Gutierrez, P.en_US
dc.contributor.authorEppstein, D.en_US
dc.contributor.authorGopi, M.en_US
dc.date.accessioned2015-02-23T16:09:18Z
dc.date.available2015-02-23T16:09:18Z
dc.date.issued2009en_US
dc.description.abstractWe 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 time of O(n log n+gn) where n 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.en_US
dc.description.number7en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume28en_US
dc.identifier.doi10.1111/j.1467-8659.2009.01580.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages2015-2024en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2009.01580.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleCurvature Aware Fundamental Cyclesen_US
Files
Collections