Mathematics – Logic
Scientific paper
Dec 2004
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2004aas...20516106x&link_type=abstract
American Astronomical Society Meeting 205, #161.06; Bulletin of the American Astronomical Society, Vol. 36, p.1614
Mathematics
Logic
Scientific paper
Voronoi Tessellation and its geometric dual Delaunay Triangulation are robotic techniques which have wide applications on various fields such as distribution of resources, cellular biology, statistics, galaxy distributions and other fields related with problem of closest neighbors. We introduce a quick-hull (QHULL) algorithm to derive the Voronoi Tessellation (Barber, Dobkin, and Huhdanpaa, 1996) in multi-dimensional space. We develop a quick algorithm to find two- or three-dimensional structures from an enormous amount of Voronoi Diagrams (VDs). In order to test the reliability of this technique, we apply it on finding galaxy clusters from the Second Center for Astrophysics Galaxy Catalog (CfA2-GC). The galaxy clusters that we found in CfA2-GC match the known clusters very well. We also calculate the various properties of the galaxy clusters in CfA2-GC. This technique can also be used to find voids of galaxies and even cosmological filaments.
This research is supported by the Department of Energy, under contract W-7405-ENG-36.
No associations
LandOfFree
Application of Voronoi Tessellation on Finding Large-scale Structures does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Application of Voronoi Tessellation on Finding Large-scale Structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Application of Voronoi Tessellation on Finding Large-scale Structures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1644938