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 and analyze the experimental and/or simulation data from various methods. The main steps are as follows. We first divide the space using face or volume elements from discrete points. Then, we combine the elements with the same and/or similar properties to construct clusters with special physical characterizations. In the algorithm, we adopt an administrative structure of a hierarchy-tree for spatial bodies such as points, lines, faces, blocks, and clusters. Two fast search algorithms with the complexity lnN are generated. The establishment 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 method to other fields. As a verification and validation, we applied this method and analyzed some two-dimensional and three-dimensional random data.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Ament P. Effects of ionization gradients on Inertial-Confinement-Fusion capsule hydrodynamics stability. Phys Rev Lett, 2008, 101: 115004
de Vries1 P C, Hua M D, McDonald D C, et al. Scaling of rotation and momentum confinement in JET plasmas. Nucl Fusion, 2008, 48: 065006
Bowler B P, Waller W H, Megeath S T, et al. An infrared census of star formation in the horsehead nebula. Astron J, 2009, 137: 3685–3699
Hernquist L. Hierarchical N-body methods. Comput Phys Commun, 1988, 48:107–115
Makino J. Vectorization of a treecode. J Comput Phys, 1990, 87:148–160
Hidaka Y, Choi E M, Mastovsky I, et al. Observation of large arrays of plasma filaments in air breakdown by 1.5-MW 110-GHz gyrotron pulses. Phys Rev Lett, 2008, 100:035003
Nogaret T, Rodney D, Fivel M, et al. Clear band formation simulated by dislocation dynamics: Role of helical turns and pile-ups. J Nucl Mater, 2008, 380:22–29
Kotsiantis S B, Pintelas P E. Recent advances in clustering: A brief survey. WSEAS Trans Inform Sci Appl, 2004, 1:73–81
Fan Y J, Iyigun C, Chaovalitwongse W A. Recent advances in mathematical programming for classification and cluster analysis. CRM Proc Lecture Notes, 2008, 45:67–93
Chazelle B, Devillers O, Hurtado F, et al. Splitting a Delaunay triangulation in linear time. Algorithmica, 2002, 34:39–46
Clarkson K L, Varadarajan K. Improved approximation algorithms for geometric set cover. Discrete Comput Geom, 2007, 37(1):43–58
Black P E. Entry for data structure in Dictionary of Algorithms and Data Structures. U.S. National Institute of Standards and Technology. 15 December. 2004
Knuth D E. The Art of Computer Programming. Vol. 3: Sorting and Searching. Redwood City: Addison Wesley Longman Publishing Co, 1998
Barnes J, Hut P. A hierarchical O(NlnN) force-calculation algorithm. Nature, 1986, 324:446–449
Pfalzner S, Gibbon P. Many Body Tree Methods in Physics. New York: Cambridge University Press, 1996
Nam B, Sussman A. A comparative study of spatial indexing techniques for multidimensional scientific dataset. In: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (SSDBM’04), June 21–23, 2004. 171
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, G., Xu, A., Lu, G. et al. Cluster identification and characterization of physical fields. Sci. China Phys. Mech. Astron. 53, 1610–1618 (2010). https://doi.org/10.1007/s11433-010-4062-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11433-010-4062-6