580 search results - page 61 / 116 » Manifold Clustering of Shapes |
DGCI
2008
Springer
13 years 11 months ago
2008
Springer
A novel method for segmenting simplified skeletons of 3D shapes is presented. The so-called simplified Y-network is computed, defining boundaries between 2D sheets of the simplifie...
VMV
2000
13 years 11 months ago
2000
The use of polygonal meshes, especially triangle meshes, is manifold but a lot of algorithms require the mesh to be structured in a certain way and cannot be applied to an arbitra...
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
Abstract-- This work aims at the development of a versatile control strategy for operating unknown mechanically constrained devices such as drawers or doors. Few assumptions on the...
CHI
2010
ACM
14 years 4 months ago
2010
ACM
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
JDCTA
2010
13 years 4 months ago
2010
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...