Quadrangulations of Planar Sets

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 S is a polygon, or the interior of the convex hull of S, if S 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.

[1]  M. Shephard,et al.  Geometry-based fully automatic mesh generation and the delaunay triangulation , 1988 .

[2]  David Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[3]  Godfried T. Toussaint,et al.  NEW RESULTS IN COMPUTATIONAL GEOMETRY RELEVANT TO PATTERN RECOGNITION IN PRACTICE , 1986 .

[4]  Nickolas S. Sapidis,et al.  Advanced techniques for automatic finite element meshing from solid models , 1989 .

[5]  Godfried T. Toussaint,et al.  Guard Placement in Rectilinear Polygons , 1988 .

[6]  John M. Sullivan,et al.  Automatic conversion of triangular finite element meshes to quadrilateral elements , 1991 .

[7]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[8]  J. Sack,et al.  Minimum Decompositions of Polygonal Objects , 1985 .

[9]  E. Heighway.  A mesh generator for automatically subdividing irregular polygons into quadrilaterals , 1983 .

[10]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.

[11]  Kurt Mehlhorn,et al.  Dynamic point location in general subdivisions , 1992, SODA '92.

[12]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[13]  Yuan-Fang Wang,et al.  Surface reconstruction and representation of 3-D scenes , 1986, Pattern Recognit..

[14]  G. Toussaint.  Solving geometric problems with the rotating calipers , 1983 .

[15]  Prosenjit Bose,et al.  No Quadrangulation is Extremely Odd , 1995, ISAAC.

[16]  Larry L. Schumaker,et al.  Cubic spline fitting using data dependent triangulations , 1990, Comput. Aided Geom. Des..

[17]  Tianjun Wang,et al.  A C2-quintic spline interpolation scheme on triangulation , 1992, Comput. Aided Geom. Des..

[18]  Bernard M. E. Moret,et al.  Three-coloring the vertices of a triangulated simple polygon , 1992, Pattern Recognit..

[19]  J. Kahn,et al.  Traditional Galleries Require Fewer Watchmen , 1983 .

[20]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[21]  Takao Asano,et al.  Partitioning a polygonal region into trapezoids , 1986, JACM.

[22]  J. Z. Zhu,et al.  The finite element method , 1977 .

[23]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[24]  Steven Skiena,et al.  Hamilton Triangulations for Fast Rendering , 1994, ESA.

[25]  Bernard Chazelle,et al.  On the convex layers of a planar set , 1985, IEEE Trans. Inf. Theory.

[26]  L. Nackman,et al.  Automatic mesh generation using the symmetric axis transformation of polygonal domains , 1992, Proc. IEEE.

[27]  Micha Sharir,et al.  Piecewise-linear interpolation between polygonal slices , 1994, SCG '94.

[28]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[29]  Subhash Suri,et al.  Applications of a semi-dynamic convex hull algorithm , 1990, BIT.

[30]  K. Ho-Le,et al.  Finite element mesh generation methods: a review and classification , 1988 .

[31]  Alain Fournier,et al.  Triangulating Simple Polygons and Equivalent Problems , 1984, TOGS.

[32]  C. Board,et al.  Display and analysis of spatial data , 1975 .

[33]  Roberto Tamassia,et al.  Fully Dynamic Point Location in a Monotone Subdivision , 1989, SIAM J. Comput..

[34]  N. Sugiyama,et al.  Electron-beam exposure system AMDES , 1979 .

[35]  Anna Lubiw,et al.  Decomposing polygonal regions into convex quadrilaterals , 1985, SCG '85.