Summary
In astronomy, the objective determination of large empty spaces or voids in the spatial distribution of galaxies is part of the characterization of the large scale structure of the universe. This paper proposes a new method to find voids that starting from local longest-edges in a Delaunay triangulation builds the largest possible empty or almost empty polygons around them. A polygon is considered a void if its area is larger than a threshold value. The algorithm is validated in 2D points with artificially generated circular and non-convex polygon voids. Since the algorithm naturally extends to 3D, preliminary results in 3D are also shown.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Pinchasi, R., Radoicic, R., Sharir, M.: On empty convex polygons in a planar point set. J. Comb. Theory, Ser. A 113(3), 385–419 (2006)
Balogh, J., González-Aguilar, H., Salazar, G.: Large convex holes in random point sets. Comput. Geom. 46(6), 725–733 (2013)
Nandy, S.C., Bhattacharya, B.B.: On finding an empty staircase polygon of largest area (width) in a planar point-set. Comput. Geom. Theory Appl. 26(2), 143–171 (2003)
El-Ad, H., Piran, T.: Voids in the Large-Scale Structure. Astrophysical Journal 491, 421 (1997)
Hoyle, F., Vogeley, M.S.: Voids in the Point Source Catalogue Survey and the Updated Zwicky Catalog. Astrophysical Journal 566, 641–651 (2002)
Foster, C., Nelson, L.A.: The Size, Shape, and Orientation of Cosmological Voids in the Sloan Digital Sky Survey. Astrophysical Journal 699, 1252–1260 (2009)
O’Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press, New York (1998)
Edelsbrunner, H., Kirkpatrick, D.G., Seidel, R.: On the shape of a set of points in the plane. IEEE Transactions on Information Theory 29(4), 551–558 (1983)
Bradford Barber, C., Dobkin, D.P., Huhdanpaa, H.: The quickhull algorithm for convex hulls. ACM Transactions on Mathematical Software 22(4), 469–483 (1996)
Adelman-McCarthy, J.K., Agüeros, M.A., Allam, S.S., et al.: The Fifth Data Release of the Sloan Digital Sky Survey. Astrophysical Journal Supplement Series 172, 634–644 (2007)
Colless, M., Dalton, G., Maddox, S., Sutherland, W., Norberg, P., et al.: The 2dF Galaxy Redshift Survey: spectra and redshifts. Monthly Notices of the Royal Astronomical Society 328, 1039–1063 (2001)
Bond, J.R., Kofman, L., Pogosyan, D.: How filaments of galaxies are woven into the cosmic web. Nature 380, 603–606 (1996)
Pan, D.C., Vogeley, M.S., Hoyle, F., Choi, Y.-Y., Park, C.: Cosmic voids in Sloan Digital Sky Survey Data Release 7. Monthly Notices of the Royal Astronomical Society 421, 926–934 (2012)
Colberg, J.M., Pearce, F., Foster, C., Platen, E., Brunino, R., et al.: The Aspen-Amsterdam void finder comparison project. Monthly Notices of the Royal Astronomical Society 387, 933–944 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Hervías, C., Hitschfeld-Kahler, N., Campusano, L.E., Font, G. (2014). On Finding Large Polygonal Voids Using Delaunay Triangulation: The Case of Planar Point Sets. In: Sarrate, J., Staten, M. (eds) Proceedings of the 22nd International Meshing Roundtable. Springer, Cham. https://doi.org/10.1007/978-3-319-02335-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-02335-9_16
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-02334-2
Online ISBN: 978-3-319-02335-9
eBook Packages: EngineeringEngineering (R0)