Sign on

SAO/NASA ADS Astronomy Abstract Service

· Find Similar Abstracts (with default settings below)
· Electronic Refereed Journal Article (HTML)
· Full Refereed Journal Article (PDF/Postscript)
· arXiv e-print (arXiv:0711.4352)
· References in the article
· Citations to the Article (6) (Citation History)
· Refereed Citations to the Article
· Also-Read Articles (Reads History)
·
· Translate This Page
Title:
Methods for rapidly processing angular masks of next-generation galaxy surveys
Authors:
Swanson, M. E. C.; Tegmark, Max; Hamilton, Andrew J. S.; Hill, J. Colin
Affiliation:
AA(Department of Physics and MIT Kavli Institute, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, USA), AB(Department of Physics and MIT Kavli Institute, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, USA), AC(JILA and Department of Astrophysical and Planetary Sciences, Box 440, University of Colorado, Boulder, CO 80309, USA), AD(Department of Physics and MIT Kavli Institute, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, MA 02139, USA)
Publication:
Monthly Notices of the Royal Astronomical Society, Volume 387, Issue 4, pp. 1391-1402. (MNRAS Homepage)
Publication Date:
07/2008
Origin:
MNRAS
MNRAS Keywords:
methods: data analysis , surveys , large-scale structure of Universe
DOI:
10.1111/j.1365-2966.2008.13296.x
Bibliographic Code:
2008MNRAS.387.1391S

Abstract

As galaxy surveys become larger and more complex, keeping track of the completeness, magnitude limit and other survey parameters as a function of direction on the sky becomes an increasingly challenging computational task. For example, typical angular masks of the Sloan Digital Sky Survey contain about N = 300000 distinct spherical polygons. Managing masks with such large numbers of polygons becomes intractably slow, particularly for tasks that run in time with a naive algorithm, such as finding which polygons overlap each other. Here we present a `divide-and-conquer' solution to this challenge: we first split the angular mask into pre-defined regions called `pixels', such that each polygon is in only one pixel, and then perform further computations, such as checking for overlap, on the polygons within each pixel separately. This reduces tasks to , and also reduces the important task of determining in which polygon(s) a point on the sky lies from to , resulting in significant computational speedup. Additionally, we present a method to efficiently convert any angular mask to and from the popular HEALPIX format. This method can be generically applied to convert to and from any desired spherical pixelization. We have implemented these techniques in a new version of the MANGLE software package, which is freely available at http://space.mit.edu/home/tegmark/mangle/, along with complete documentation and example applications. These new methods should prove quite useful to the astronomical community, and since MANGLE is a generic tool for managing angular masks on a sphere, it has the potential to benefit terrestrial mapmaking applications as well.
Bibtex entry for this abstract   Preferred format for this abstract (see Preferences)
   

Find Similar Abstracts:

Use: Authors
Title
Keywords (in text query field)
Abstract Text
Return: Query Results Return    items starting with number
Query Form
Database: Astronomy
Physics
arXiv e-prints