The Mangrove TDS Library  2.0
A C++ tool for the Fast Prototyping of Topological Data Structures
Bibliographic References
[1]

Max K. Agoston. Computer Graphics and Geometric Modeling: Mathematics. Springer, 2005.

[2]

V. Arvind, Das Bireswar, and Johannes Kobler. The Space Complexity of k-Tree Isomorphism. In Proceedings of the 18th International Conference on Algorithms and Computing, pages 822–833. Springer, 2007.

[3]

Dominique Attali, André Lieutier, and David Salinas. An Efficient Data Structure for Simplifying Simplicial Complexes in High Dimensions. International Journal of Computational Geometry and Applications, 22(4):279–303, 2012.

[4]

Jean-Daniel Boissonnant and Clément Maria. The Simplex Tree: an Efficient Data Structure for General Simplicial Complexes. In Proceedings of the 20th European Symposium on Algorithms, pages 731–742, 2012.

[5]

Mario Botsch, Scott Steinberg, Stephan Bischoff, and Leif Kobbelt. OpenMesh: a Generic and Efficient Polygon Mesh Data Structure. In Proceedings of the OpenSG Symposium, 2002.

[6]

Mario Botsch, Leif Kobbelt, Mark Pauly, Pierre Alliez, and Bruno Lévy. Polygon Mesh Processing. A. K. Peters, 2010.

[7]

Michael Brewer, Lori Freitag, Patrick Knupp, Thomas Leurent, and Darryl Melander. The Mesquite Mesh Quality Improvement Toolkit. In Proceedings of the 12th International Meshing Roundtable, pages 239–250. Springer, 2003.

[8]

Erick Brisson. Representing Geometric Structures in d-dimensions: Topology and Order. In Proceedings of the ACM Symposium on Computational Geometry, pages 218–227, 1989.

[9]

David Canino and Leila De Floriani. An Extensible Framework for Modeling Simplicial Complexes. In Poster Compendium of the IEEE Visualization, 2012.

[10]

David Canino and Leila De Floriani. A Compact Representation for Topological Decompositions of Non-manifold Shapes. In 8th International Joint Conference on Computer Vision, Imaging and Computer Graphics Theory and Applications, pages 100–107, 2013.

[11]

David Canino and Leila De Floriani. An Extensible Framework for Modeling Simplicial and Cell Complexes. In Poster Compendium of the 11st Eurographics Symposium on Geometry Processing, 2013.

[12]

David Canino and Leila De Floriani. Representing Simplicial Complexes with Mangroves. In Proceedings of the 22nd International Meshing Roundtable, pages 465–483. Springer, 2013.

[13]

David Canino, Leila De Floriani, and Kenneth Weiss. IA*: an Adjacency-based Representation for Non-Manifold Simplicial Shapes in Arbitrary Dimensions. Computer & Graphics, 35(3):747–753, 2011.

[14]

David Canino. Tools for Modeling and Analysis of Non-manifold Shapes. PhD thesis, Department of Computer Science, Bioengineering, Robotics and Systems Engineering (DIBRIS), University of Genova, Genova, Italy, 2012.

[15]

The Computational Geometry Algorithms Library. http://www.cgal.org.

[16]

The CGoGN Library. http://cgogn.u-strasbg.fr.

[17]

Guillaume Damiand and Monique Teillaud. A Generic Implementation of dD Combinatorial Maps in CGAL. Technical Report INRIA Research Report 8627, INRIA, Project Team Geometrica, 2013.

[18]

Leila De Floriani and Annie Hui. A Scalable Data Structure for Three-Dimensional Non-manifold Objects. In Proceedings of the 1st Eurographics Symposium on Geometry Processing, pages 77–82. ACM Press, 2003.

[19]

Leila De Floriani and Annie Hui. Data Structures for Simplicial Complexes: an Analysis and a Comparison. In Proceedings of the 3rd Eurographics Symposium on Geometry Processing, pages 119–128. ACM Press, 2005.

[20]

Leila De Floriani, Moustafa Mesmoudi, Franco Morando, and Enrico Puppo. Decomposing Non-manifold Objects in Arbitrary Dimension. Graphical Models, 65(1/3):2–22, 2003.

[21]

Leila De Floriani, David Greenfieldboyce, and Annie Hui. A Data Structure for Non-manifold Simplicial d-Complexes. In Proceedings of the 2nd Eurographics Symposium on Geometry Processing, pages 83–92. ACM Press, 2004.

[22]

Leila De Floriani, Paola Magillo, Enrico Puppo, and Davide Sobrero. A Multi-resolution Topological Representation for Non-Manifold Meshes. CAD Journal, 36(2):141–159, 2004.

[23]

Leila De Floriani, Annie Hui, Daniele Panozzo, and David Canino. A Dimension-Independent Data Structure for Simplicial Complexes. In Proceedings of the 19th International Meshing Roundtable, pages 403–420. Springer, 2010.

[24]

Leila De Floriani. Basic Notions of Combinatorial Topology, 2003. Lectures Notes, Master's Course on Geometric Modeling.

[25]

Antonio Di Carlo, Franco Milicchio, Alberto Paoluzzi, and Vadim Shapiro. Solid and Physical Modeling with Chain Complexes. In Proceedings of the ACM Symposium on Solid and Physical Modeling, pages 73–84. ACM Press, 2007.

[26]

Mohamed Ebeida and Patrick Knupp. LBMD: a Layer-Based Mesh Data Structure tailored for Generic Implementations. In Proceedings of the 20th AIAA Computational Fluid Dynamics Conference, 2011.

[27]

Herbert Edelsbrunner. Algorithms in Combinatorial Geometry. Springer, 1987.

[28]

Rao Garimella. Mesh Data Structure Selection for Mesh Generation and FEA Applications. International Journal of Numeric Methods in Engineering, 55(4):451–478, 2002.

[29]

Mikhail Gromov. Hyperbolic Groups. Springer, 1987.

[30]

Topraj Gurung, Daniel Laney, Peter Lindstrom, and Jarek Rossignac. SQuad: a Compact Representation for Triangle Meshes. Computer Graphics Forum, 30(2):355–364, 2011.

[31]

Topraj Gurung, Mark Luffel, Peter Lindstrom, and Jarek Rossignac. LR: Compact Connectivity Representation for Triangle Meshes. ACM Transactions on Graphics, 30(4), 2011.

[32]

Lutz Kettner. Using Generic Programming for Designing a Data Structure for Polyhedral Surfaces. Computational Geometry: Theory and Applications, 1(13):65–90, 1999.

[33]

Pierre Kraemer, Lionel Untereiner, Thomas Jund, Sylvain Thery, and David Cazier. CGoGN: n-dimensional Meshes with Combinatorial Maps. In Proceedings of the 22nd International Meshing Roundtable, pages 485–503. Springer, 2013.

[34]

Michael Kremer, David Bommes, and Leif Kobbelt. OpenVolumeMesh: a Versatile Index-based Data Structure for 3D Polytopal Complexes. In Proceedings of the 21st International Meshing Roundtable, pages 531–5480. Springer, 2012.

[35]

Franck Ledoux, Jean-Christophe Weill, and Yves Bertrand. GDMS: a Generic Mesh Data Structure. In Proceedings of the 17th International Meshing Roundtable. Springer, 2008.

[36]

Martti Mantyla. Introduction to Solid Modeling. Computer Science Press, 1988.

[37]

Sara McMains, Joseph M. Hellerstein, and Carlo H. Séquin. Out-of-core Build of a Topological Data Structure from Polygon Soup. In Proceedings of the 6th ACM Symposium on Solid Modeling and Applications, pages 171–182, 2001.

[38]

Alexander Nabutovsky. Geometry of the Space of Triangulations of a Compact Manifold. Communications in Mathematical Physics, 181(2):303–330, 1996.

[39]

The OpenMesh Library. http://openmesh.org.

[40]

The OpenVolumeMesh Library. http://openvolumemesh.org.

[41]

Jean-Francois Remacle and Mark Shephard. An Algorithm Oriented Mesh Database. International Journal of Computational Geometry and Applications, 58(2):374–393, 2003.

[42]

Daniel Sieger and Mario Botsch. Design, Implementation, and Evaluation of the Surface Mesh Data Structure. In Proceedings of the 20th International Meshing Roundtable, pages 533–550. Springer, 2011.

[43]

Timothy Tautges. MOAB-SD: an Integrated Structured and Unstructured Mesh Representation. Engineering with Computers, 20(3), 2004.

[44]

Atul Thakur, Ashis Gopal Banerjee, and Satyandra Gupta. A Survey of CAD Models Simplification Techniques for Physics-based Simulation Applications. Computer-Aided Design, 41(2):65–80, 2009.

[45]

The Visual Computing Graphics Library. http://vcg.isti.cnr.it.

[46]

Paul Kenneth Wright. 21st Century Manifacturing. Prentice Hall, 2001.