Sciweavers

TOG
2002
127views more  TOG 2002»
13 years 11 months ago
Progressive lossless compression of arbitrary simplicial complexes
Efficient algorithms for compressing geometric data have been widely developed in the recent years, but they are mainly designed for closed polyhedral surfaces which are manifold ...
Pierre-Marie Gandoin, Olivier Devillers
ESA
2010
Springer
126views Algorithms» more  ESA 2010»
14 years 17 days ago
Determining Edge Expansion and Other Connectivity Measures of Graphs of Bounded Genus
In this paper, we show that for an n-vertex graph G of genus g, the edge expansion of G can be determined in time nO(g2 ) . We show that the same is true for various other similar ...
Viresh Patel