Sciweavers

165 search results - page 17 / 33
» Straightening and Partitioning Shapes
Sort
View
TVLSI
2002
161views more  TVLSI 2002»
13 years 7 months ago
Arbitrarily shaped rectilinear module placement using the transitive closure graph representation
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
Jai-Ming Lin, Hsin-Lung Chen, Yao-Wen Chang
VMV
2003
154views Visualization» more  VMV 2003»
13 years 8 months ago
Piecewise Linear Approximation of Signed Distance Fields
The signed distance field of a surface can effectively support many geometry processing tasks such as decimation, smoothing, and Boolean operations since it provides efficient a...
Jianhua Wu, Leif Kobbelt
ICPR
2008
IEEE
14 years 1 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
VCBM
2010
13 years 2 months ago
A General Approach to Model Biomedical Data from 3D Unorganised Point Clouds with Medial Scaffolds
We present the latest developments in modeling 3D biomedical data via the Medial Scaffold (MS), a 3D acyclic oriented graph representation of the Medial Axis (MA) [LK07, SP08]. Th...
Frederic F. Leymarie, Ming-Ching Chang, Celina Imi...
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
13 years 11 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim