Euler transformation of polyhedral complexes
DOI10.1142/S0218195920500090OpenAlexW3171754663MaRDI QIDQ5012872FDOQ5012872
Authors: Prashant K. Gupta, Bala Krishnamoorthy 
Publication date: 26 November 2021
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.02412
Recommendations
Simplicial sets and complexes in algebraic topology (55U10) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational aspects of digital topology (68U03)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
- Error estimates for generalized barycentric interpolation
- Plane Graphs with Parity Constraints
- Title not available (Why is that?)
- Gradient bounds for Wachspress coordinates on polytopes
- Straight skeletons and mitered offsets of nonconvex polytopes
- Straight Skeletons of Three-Dimensional Polyhedra
- Guaranteed-quality all-quadrilateral mesh generation with feature preservation
- Title not available (Why is that?)
- Parity-constrained triangulations with Steiner points
- Shape regularity conditions for polygonal/polyhedral meshes, exemplified in a discontinuous Galerkin discretization
- Deformable smooth surface design
- Plane graphs with parity constraints
- Delaunay mesh generation.
- One strike against the min-max degree triangulation problem
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)
