Reconstructing Surface Triangulations by Their Intersection Matrices 26 September 2014
The intersection matrix of a simplicial complex has entries equal to the rank of the intersecction of its facets. We prove that this matrix is enough to define up to isomorphism a triangulation of a surface.
Main Authors: | Arocha Jorge L., Bracho Javier, García-Colín Natalia, Hubard Isabel |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2015-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1816 |
Similar Items
-
Implementing Data-Dependent Triangulations with Higher Order Delaunay Triangulations
by: Natalia Rodríguez, et al.
Published: (2017-12-01) -
Remark on subgroup intersection graph of finite abelian groups
by: Zhao Jinxing, et al.
Published: (2020-09-01) -
Practical Delaunay triangulation algorithms for surface reconstruction and related problems
by: Choi, Sunghee
Published: (2008) -
Improved Fingerprint Indexing Based on Extended Triangulation
by: Sanghoon Lee, et al.
Published: (2021-01-01) -
Optimal area triangulation
by: Vassilev, Tzvetalin Simeonov
Published: (2005)