@inproceedings{d9d51e7eb53646cabb0f5bdd05ae74cf,

title = "Quadrangulations of planar sets",

abstract = "Given a set S such as a polygon or a set of points, a quadrangulation of S is a partition of the interior of S, if 5 is a polygon, or the interior of the convex hull of S, if 5 is a set of points, into quadrangles (quadrilaterals) obtained by inserting edges between pairs of points (diagonals between vertices of the polygon) such that the edges intersect each other only at their end points. Not all polygons or sets of points admit quadrangulations, even when the quadrangles are not required to be convex (convex quadrangulations). In this paper we briefly survey some recent results concerning the characterization of those planar sets that always admit quadrangulations (convex and non-convex) as well as some related computational problems.",

author = "Godfried Toussaint",

year = "1995",

doi = "10.1007/3-540-60220-8_64",

language = "English (US)",

isbn = "3540602208",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "218--227",

editor = "Akl, {Selim G.} and Frank Dehne and J{\"o}rg-R{\"u}diger Sack and Nicola Santoro",

booktitle = "Algorithms and Data Structures - 4th International Workshop, WADS 1995, Proceedings",

note = "4th Workshop on Algorithms and Data Structures, WADS 1995 ; Conference date: 16-08-1995 Through 18-08-1995",

}