Euler transformation of polyhedral complexes
From MaRDI portal
Recommendations
Cites work
- A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
- Deformable smooth surface design
- Delaunay mesh generation.
- Error estimates for generalized barycentric interpolation
- Gradient bounds for Wachspress coordinates on polytopes
- Guaranteed-quality all-quadrilateral mesh generation with feature preservation
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 1419244 (Why is no real title available?)
- scientific article; zbMATH DE number 1446325 (Why is no real title available?)
- One strike against the min-max degree triangulation problem
- Parity-constrained triangulations with Steiner points
- Plane Graphs with Parity Constraints
- Plane graphs with parity constraints
- Shape regularity conditions for polygonal/polyhedral meshes, exemplified in a discontinuous Galerkin discretization
- Straight skeletons and mitered offsets of nonconvex polytopes
- Straight Skeletons of Three-Dimensional Polyhedra
Cited in
(2)
This page was built for publication: Euler transformation of polyhedral complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5012872)