COMPUTING THE REEB GRAPH FOR TRIANGLE MESHES WITH ACTIVE CONTOURS

Laura Brandolini, Marco Piastra

2012

Abstract

This paper illustrates a novel method to compute the Reeb graph for triangle meshes. The algorithm is based on the definition of discrete, active contours as counterparts of continuous level lines. Active contours are made up of edges and vertices with multiple presence and implicitly maintain a faithful representation of the level lines, even in case of coarse meshes with higher genus. This approach gives a great advantage in the identification of the nodes in the Reeb graph and also improves the overall efficiency of the algorithm in that at each step only the information local to the contours and their immediate neighborhood needs to be processed. The validation of functional integrity for the algorithm has been carried out experimentally, with real-world data, without mesh pre-processing.

Paper Citation

in Harvard Style

Brandolini L. and Piastra M. (2012). COMPUTING THE REEB GRAPH FOR TRIANGLE MESHES WITH ACTIVE CONTOURS . In Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM, ISBN 978-989-8425-99-7, pages 80-89. DOI: 10.5220/0003745500800089

in Bibtex Style

@conference{icpram12,
author={Laura Brandolini and Marco Piastra},
title={COMPUTING THE REEB GRAPH FOR TRIANGLE MESHES WITH ACTIVE CONTOURS},
booktitle={Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM,},
year={2012},
pages={80-89},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003745500800089},
isbn={978-989-8425-99-7},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 1st International Conference on Pattern Recognition Applications and Methods - Volume 2: ICPRAM,
TI - COMPUTING THE REEB GRAPH FOR TRIANGLE MESHES WITH ACTIVE CONTOURS
SN - 978-989-8425-99-7
AU - Brandolini L.
AU - Piastra M.
PY - 2012
SP - 80
EP - 89
DO - 10.5220/0003745500800089