Hierarchical mesh segmentation editing through rotation operations

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Hierarchical and multi-resolution models are well known tools used in may application domains for representing an object at varying levels of detail. In the case of segmentations computed on a mesh, a hierarchical model can be structured as a binary tree representing the hierarchy of the region merging operations performed on the original segmentation for reducing its resolution. In this paper, we address the problem of modifying a hierarchical segmentation in order to augment its expressive power. We adapt two well-known operators defined for modifying binary trees, namely left and right rotation, to the case of hierarchical segmentations. Such operators are then applied to modifying a given hierarchy based on a user-defined function and based on a user-defined segmentation.

Cite

CITATION STYLE

APA

Iuricich, F., & Simari, P. (2015). Hierarchical mesh segmentation editing through rotation operations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9279, pp. 398–409). Springer Verlag. https://doi.org/10.1007/978-3-319-23231-7_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free