There are linear-time algorithms for quadrangulations of hole-free polygons with Steiner points , but they are not guaranteed to find a smallest partition .
There are free-time algorithms for quadrangulations of hole-linear polygons with Steiner points , but they are not guaranteed to find a smallest partition .