Sciweavers

263 search results - page 2 / 53
» Combinatorial Shape Decomposition
Sort
View
INFORMATICALT
2007
80views more  INFORMATICALT 2007»
13 years 5 months ago
Recognition Algorithm for Diamond-Free Graphs
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognit...
Mihai Talmaciu, Elena Nechita
CVPR
2010
IEEE
14 years 1 months ago
Convex Shape Decomposition
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
Liu Hairong, Longin Jan Latecki, Liu Wenyu
GBRPR
2009
Springer
13 years 12 months ago
Computing and Visualizing a Graph-Based Decomposition for Non-manifold Shapes
Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its...
Leila De Floriani, Daniele Panozzo, Annie Hui
CVIU
2008
106views more  CVIU 2008»
13 years 5 months ago
Strategies for shape matching using skeletons
Skeletons are often used as a framework for part-based shape description and matching. This paper describes some useful strategies that can be employed to improve the performance ...
Wooi-Boon Goh