image binning or smoothing, or assuming any specific source shape or size. The details of our algorithm are given in the following sections.

Voronoi diagram construction\[VT\]
----------------------------------

The pattern of the Voronoi cells is also called a Voronoi diagram, which is composed of the edges of the cells (Voronoi edges). A simple algorithm for constructing a Voronoi diagram at the highest computational speed is the [*sweep-line*]{} algorithm [@Fortune1986] [^3]. We implemented this algorithm and further developed it for better and faster performance. As a first step, we confined the Voronoi diagram, originally defined in the infinite plane, to the box domain of the image. Second, in addition to the classical Voronoi diagram, we built a discrete Voronoi diagram by including all pixels enclosed by a Voronoi cell into a discrete Voronoi cell. If one pixel is equally distant from two or more Voronoi sites (i.e., the pixel center falls on an Voronoi edge), it is assigned randomly among the two or more cells. Finally, as a third step, we connected the pair of Voronoi sites on both sides of each Voronoi edge, building the so-called Delaunay diagram, which will constitute the structure on which FOF and our deblending procedure are 