Voronoi binning: Optimal adaptive tessellations of multi-dimensional data

Astronomy and Astrophysics – Astrophysics – Instrumentation and Methods for Astrophysics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 11 figures, LaTeX. Invited review for the volume "Tessellations in the Sciences: Virtues, Techniques and Application

Scientific paper

We review the concepts of the Voronoi binning technique (Cappellari & Copin 2003), which optimally solves the problem of preserving the maximum spatial resolution of general two-dimensional data, given a constraint on the minimum signal-to-noise ratio (S/N). This is achieved by partitioning the data in an adaptive fashion using a Voronoi tessellation with nearly hexagonal lattice. We review astrophysical applications of the method to X-ray data, integral-field spectroscopy, Fabry-Perot interferometry, N-body simulations, standard images and other regularly or irregularly sampled data. Voronoi binning, unlike adaptive smoothing, produces maps where the noise in the data can be visually assessed and spurious artifacts can be recognized. The method can be used to bin data according to any general criterion and not just S/N. It can be applied to higher dimensions and it can be used to generate optimal adaptive meshes for numerical simulations.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Voronoi binning: Optimal adaptive tessellations of multi-dimensional data 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 Voronoi binning: Optimal adaptive tessellations of multi-dimensional data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Voronoi binning: Optimal adaptive tessellations of multi-dimensional data will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-243760

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.