Robust on-line computation of Reeb graphs: simplicity and speed
暂无分享,去创建一个
Valerio Pascucci | Peer-Timo Bremer | Giorgio Scorzelli | Ajith Mascarenhas | Valerio Pascucci | P. Bremer | A. Mascarenhas | G. Scorzelli
[1] Martin Isenburg,et al. Streaming compression of tetrahedral volume meshes , 2006, Graphics Interface.
[2] Tosiyasu L. Kunii,et al. Surface coding based on Morse theory , 1991, IEEE Computer Graphics and Applications.
[3] Jack Snoeyink,et al. Simplifying flexible isosurfaces using local geometric measures , 2004, IEEE Visualization 2004.
[4] Anath Fischer,et al. Cutting 3D freeform objects with genus-n into single boundary surfaces using topological graphs , 2002, SMA '02.
[5] Martin Isenburg,et al. Streaming meshes , 2005, VIS 05. IEEE Visualization, 2005..
[6] Günter Rote,et al. Simple and optimal output-sensitive construction of contour trees using monotone paths , 2005, Comput. Geom..
[7] Valerio Pascucci,et al. Loops in Reeb Graphs of 2-Manifolds , 2003, SCG '03.
[8] Silvia Biasottisilvia. Topological techniques for shape understanding , 2001 .
[9] Herbert Edelsbrunner,et al. Extreme Elevation on a 2-Manifold , 2004, SCG '04.
[10] Taku Komura,et al. Topology matching for fully automatic similarity estimation of 3D shapes , 2001, SIGGRAPH.
[11] Tosiyasu L. Kunii,et al. Constructing a Reeb graph automatically from cross sections , 1991, IEEE Computer Graphics and Applications.
[12] Tosiyasu L. Kunii,et al. A feature-based approach for smooth surfaces , 1997, SMA '97.
[13] Hans Hagen,et al. Exploring scalar fields using critical isovalues , 2002, IEEE Visualization, 2002. VIS 2002..
[14] Jack Snoeyink,et al. Computing contour trees in all dimensions , 2000, SODA '00.
[15] Valerio Pascucci,et al. Parallel Computation of the Topology of Level Sets , 2003, Algorithmica.
[16] Valerio Pascucci,et al. Contour trees and small seed sets for isosurface traversal , 1997, SCG '97.
[17] Anath Fischer,et al. Topology recognition of 3D closed freeform objects based on topological graphs , 2001, SMA '01.
[18] Valerio Pascucci,et al. Robust on-line computation of Reeb graphs: simplicity and speed , 2007, SIGGRAPH 2007.
[19] Michael Garland,et al. Fair morse functions for extracting the topological structure of a surface mesh , 2004, ACM Trans. Graph..
[20] John Hart,et al. ACM Transactions on Graphics , 2004, SIGGRAPH 2004.
[21] Mathieu Desbrun,et al. Removing excess topology from isosurfaces , 2004, TOGS.
[22] Leif Kobbelt,et al. A Stream Algorithm for the Decimation of Massive Meshes , 2003, Graphics Interface.
[23] Anne Verroust-Blondet,et al. Level set diagrams of polyhedral objects , 1999, SMA '99.
[24] Herbert Edelsbrunner,et al. Topological Persistence and Simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[25] Robert E. Tarjan,et al. Making data structures persistent , 1986, STOC '86.
[26] David E. Breen,et al. Semi-regular mesh extraction from volumes , 2000, Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145).
[27] Marco Attene,et al. Re-meshing techniques for topological analysis , 2001, Proceedings International Conference on Shape Modeling and Applications.
[28] Thomas A. Funkhouser,et al. Shape-based retrieval and analysis of 3d models , 2005, CACM.