: The task of 3D shape classification is to assign a set of unordered shapes into pre-tagged classes with class labels, and find the most suitable class for a newly given shape. In...
Zhenbao Liu, Jun Mitani, Yukio Fukui, Seiichi Nish...
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
David M. Mount, Nathan S. Netanyahu, Christine D. ...
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
Detecting dominant points is an important step for shape representation. Most of dominant point detection methods attend to preset or find the region of support of each point. In ...
We address two-dimensional shape-based classification, considering shapes described by arbitrary sets of unlabeled points, or landmarks. This is relevant in practice because, in m...