Converting triangulations to quadrangulations
From MaRDI portal
Publication:1384213
Recommendations
Cites work
- scientific article; zbMATH DE number 4024134 (Why is no real title available?)
- scientific article; zbMATH DE number 4060719 (Why is no real title available?)
- scientific article; zbMATH DE number 3721436 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A combinatorial theorem in plane geometry
- A quadrilateral finite element including vertex rotations for plane elasticity analysis
- A short proof of Chvatal's Watchman Theorem
- An Algorithm for a Minimum Cover of a Graph
- Automatic conversion of triangular finite element meshes to quadrilateral elements
- Delaunay-based representation of surfaces defined over arbitrarily shaped domains
- Drawing the planar dual
- Easy problems for tree-decomposable graphs
- Finite element mesh generation methods: A review and classification
- Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs
- Linear-time computation of optimal subgraphs of decomposable graphs
- Network flows. Theory, algorithms, and applications.
- No quadrangulation is extremely odd
- Quadrangulations of planar sets
- Quadrilateral mesh generation in polygonal regions
- TWO THEOREMS IN GRAPH THEORY
- Traditional Galleries Require Fewer Watchmen
- Triangulating a simple polygon in linear time
Cited in
(19)- scientific article; zbMATH DE number 2081026 (Why is no real title available?)
- Bichromatic quadrangulations with Steiner points
- Illumination by floodlights
- Experimental results on quadrangulations of sets of fixed points
- Quadrangulations of planar sets
- Quadrangulations of a polygon with spirality
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
- Computing convex quadrangulations
- Quadrangulations on 3-colored point sets with Steiner points and their winding numbers
- Catalog-based representation of 2D triangulations
- Block-balanced meshes in iterative uniform refinement
- QUADRANGULAR REFINEMENTS OF CONVEX POLYGONS WITH AN APPLICATION TO FINITE-ELEMENT MESHES
- An adaptive numerical integration algorithm for polygons
- Convex quadrangulations of bichromatic point sets
- On the ratio between maximum weight perfect matchings and maximum weight matchings in grids
- On the ratio between the maximum weight of a perfect matching and the maximum weight of a matching
- No quadrangulation is extremely odd
- CONSTRAINED QUADRILATERAL MESHES OF BOUNDED SIZE
- The cost of perfection for matchings in graphs
This page was built for publication: Converting triangulations to quadrangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1384213)
