Weighted Feature Graph via Hierarchical Clustering
Loading...
Date
2025
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
In computer graphics, mesh clustering is a key component of various applications such as shape matching or skinning weight computation, especially when using hierarchical clustering. Garland et al. [GWH01] proposed to build a hierarchy of clusters by simplifying the dual graph of the mesh. We extend their method to provide control over cluster shapes through a combination of error metrics. Additionally, we alleviate the challenging task of finding an optimal threshold (stopping criterion) by considering a weighted feature graph that incorporates persistent cluster information throughout the hierarchy.
Description
@inproceedings{10.2312:egp.20251025,
booktitle = {Eurographics 2025 - Posters},
editor = {Günther, Tobias and Montazeri, Zahra},
title = {{Weighted Feature Graph via Hierarchical Clustering}},
author = {Ladeuil, Mathieu and Trabucato, Marc and Vaisse, Alexis and Faraj, Noura},
year = {2025},
publisher = {The Eurographics Association},
ISSN = {1017-4656},
ISBN = {978-3-03868-269-1},
DOI = {10.2312/egp.20251025}
}