Article ID: | iaor1994795 |
Country: | Japan |
Volume: | E75-A |
Issue: | 4 |
Start Page Number: | 468 |
End Page Number: | 477 |
Publication Date: | Apr 1992 |
Journal: | Transactions of the Institute of Electronics, Information and Communication Engineers |
Authors: | Sugihara Kokichi |
Keywords: | geography & environment, graphs, programming: geometric |
This paper presents a simple method for avoiding both numerical errors and degeneracy in an incremental-type algorithm for constructing the Voronoi diagram with respect to points on a plane. It is assumed that the coordinates of the given points are represented with a certain fixed number of bits. All the computations in the algorithm are carried out in four times higher precision, so that degeneracy can be discerned precisely. Every time degeneracy is found, the points are perturbed symbolically according to a very simple rule and thus are reduced to a nondegenerate case. The present technique makes a computer program simple in the sense that it avoids all numerical errors and requires no exceptional branches of processing for degenerate cases.