Name
Abstract | ||
|---|---|---|
The description of complex configuration is a difficult issue. We present a
powerful technique for cluster identification and characterization. The scheme
is designed to treat with and analyze the experimental and/or simulation data
from various methods. Main steps are as follows. We first divide the space
using face or volume elements from discrete points. Then, combine the elements
with the same and/or similar properties to construct clusters with special
physical characterizations. In the algorithm, we adopt administrative structure
of hierarchy-tree for spatial bodies such as points, lines, faces, blocks, and
clusters. Two fast search algorithms with the complexity are realized. The
establishing of the hierarchy-tree and the fast searching of spatial bodies are
general, which are independent of spatial dimensions. Therefore, it is easy to
extend the skill to other fields. As a verification and validation, we treated
with and analyzed some two-dimensional and three-dimensional random data. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1007/s11433-010-4062-6 | Science China: Physics, Mechanics and Astronomy |
Keywords | Field | DocType |
search algorithm,verification and validation,three dimensional | Cluster (physics),Discrete points,Search algorithm,Verification and validation,Algorithm,Classical mechanics,Physics | Journal |
Volume | Issue | ISSN |
abs/1001.4981 | 9 | null |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guangcai Zhang | 1 | 6 | 2.38 |
| Aiguo Xu | 2 | 26 | 5.75 |
| Guo Lu | 3 | 0 | 0.34 |
| Zeyao Mo | 4 | 73 | 19.48 |