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