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?
Asked
Active
Viewed 682 times
5
-
2There are a number of algorithms for quadrilateral mesh generation. See this and this and this for instance. – J. M. ain't a mathematician Sep 02 '11 at 12:05
-
Thanks J-M that is a lot to read ! Is there any specific techniques which you can think of given a set of points in a 2D space? – Arthur Mamou-Mani Sep 02 '11 at 15:53
-
I've read those, but I haven't experimented on them. You will have to experiment for yourself. – J. M. ain't a mathematician Sep 02 '11 at 15:54
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.
lhf
- 216,483