Is there an algorithm similar to the Delaunay triangulation which can organize a set of points into a set of four sided polygons instead of triangles?
Delaunay-like algorithm to get four sided polygons instead of triangles?
5
$\begingroup$
computational-geometry
-
0I've read those, but I haven't experimented on them. You will have to experiment for yourself. – 2011-09-02
1 Answers
1
I don't know of any quadrangulation having similar properties to a Delaunay triangulation, but you can always convert a triangulation to a quadrangulation by adding additional points, called Steiner points. See the first section of http://www.cs.mcgill.ca/~cs507/projects/1998/rachelp/ for instance.