Converting triangulations to quadrangulations
From MaRDI portal
Publication:1384213
DOI10.1016/S0925-7721(97)00019-9zbMath0894.68158MaRDI QIDQ1384213
Publication date: 13 April 1998
Published in: Computational Geometry (Search for Journal in Brave)
Related Items (17)
CATALOG-BASED REPRESENTATION OF 2D TRIANGULATIONS ⋮ On the ratio between maximum weight perfect matchings and maximum weight matchings in grids ⋮ The cost of perfection for matchings in graphs ⋮ Bichromatic quadrangulations with Steiner points ⋮ Quadrangulations of planar sets ⋮ Illumination by floodlights ⋮ Computing convex quadrangulations ⋮ Convex Quadrangulations of Bichromatic Point Sets ⋮ Decompositions, partitions, and coverings with convex polygons and pseudo-triangles ⋮ An adaptive numerical integration algorithm for polygons ⋮ CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE ⋮ QUADRANGULAR REFINEMENTS OF CONVEX POLYGONS WITH AN APPLICATION TO FINITE-ELEMENT MESHES ⋮ On the ratio between the maximum weight of a perfect matching and the maximum weight of a matching ⋮ Block-balanced meshes in iterative uniform refinement ⋮ Quadrangulations on 3-colored point sets with Steiner points and their winding numbers ⋮ Quadrangulations of a polygon with spirality ⋮ Experimental results on quadrangulations of sets of fixed points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite element mesh generation methods: A review and classification
- Triangulating a simple polygon in linear time
- Drawing the planar dual
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs
- A short proof of Chvatal's Watchman Theorem
- Quadrilateral mesh generation in polygonal regions
- A combinatorial theorem in plane geometry
- Delaunay-based representation of surfaces defined over arbitrarily shaped domains
- TWO THEOREMS IN GRAPH THEORY
- An Algorithm for a Minimum Cover of a Graph
- Traditional Galleries Require Fewer Watchmen
- Easy problems for tree-decomposable graphs
- A quadrilateral finite element including vertex rotations for plane elasticity analysis
- Automatic conversion of triangular finite element meshes to quadrilateral elements
- Linear-time computation of optimal subgraphs of decomposable graphs
- Quadrangulations of planar sets
This page was built for publication: Converting triangulations to quadrangulations
