All Questions

how can one construct a finite set of points in the euclidean plane from its Voronoi Diagram and, what is the complexity of the problem?

First using a three dimensional unit cube as an example for the term "regularity", we can have two possible triangulations: (A) (B) We say the lower triangulation is more "regular" than upper ...