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)
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
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
