On the construction of planar embedding for a class of orthogonal polyhedra

DOI10.1007/978-3-031-23612-9_6zbMath1528.68386OpenAlexW4313445172MaRDI QIDQ6166832

Nilanjana Karmakar, Arindam Biswas, Bhargab Bikram Bhattacharya, Subhas C. Nandy

Publication date: 3 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-23612-9_6

zbMATH Keywords

planar graphgraph drawingorthogonal polyhedron

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending Steinitz's theorem to upward star-shaped polyhedra and spherical polyhedra
• Graphs of polyhedra; polyhedra as graphs
• Algorithms for drawing graphs: An annotated bibliography
• Merging polyhedral shapes with scattered features
• Realization spaces of polytopes
• A combinatorial algorithm to construct 3D isothetic covers
• Steinitz Theorems for Orthogonal Polyhedra
• Construction of 3D Orthogonal Cover of a Digital Object
• The Topology of Bendless Three-Dimensional Orthogonal Graph Drawing
• Cauchy’s Theorem for Orthogonal Polyhedra of Genus 0
• Efficient Planarity Testing
• The number of polyhedral (3-connected planar) graphs

This page was built for publication: On the construction of planar embedding for a class of orthogonal polyhedra