Polygonal Voids

A new algorithm for finding polygonal voids in Delaunay triangulations and its parallelization
This paper presents a new algorithm to find under-dense regions called voids inside a 2D point set. The algorithm starts from …
DOI