Euler Transformation of Polyhedral Complexes

DOI10.1142/S0218195920500090OpenAlexW3171754663MaRDI QIDQ5012872

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

zbMATH Keywords

polyhedral complexEulerian tour3D printingcoverage problemsdegree-constrained tessellation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Simplicial sets and complexes in algebraic topology (55U10) Computational aspects of digital topology (68U03)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Straight skeletons and mitered offsets of nonconvex polytopes
• Parity-constrained triangulations with Steiner points
• Guaranteed-quality all-quadrilateral mesh generation with feature preservation
• One strike against the min-max degree triangulation problem
• Error estimates for generalized barycentric interpolation
• Deformable smooth surface design
• Plane graphs with parity constraints
• Delaunay Mesh Generation
• Plane Graphs with Parity Constraints
• Straight Skeletons of Three-Dimensional Polyhedra
• A Graph-Coloring Result and Its Consequences for Polygon-Guarding Problems
• Shape regularity conditions for polygonal/polyhedral meshes, exemplified in a discontinuous Galerkin discretization
• Gradient Bounds for Wachspress Coordinates on Polytopes

This page was built for publication: Euler Transformation of Polyhedral Complexes