A Representation of 2-dimensional Pseudomanifolds and its use in the Design of a Linear-Time Shelling Algorithm

DOI10.1016/S0167-5060(08)70321-2zbMath0391.57008OpenAlexW12544033MaRDI QIDQ4172654

Gopal Danaraj, Victor Klee

Publication date: 1978

Published in: Algorithmic Aspects of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-5060(08)70321-2

zbMATH Keywords

CellsConnectedness GameLinear-Time Shelling AlgorithmLinear-Time StrategyRepresentation of 2-Dimensional Pseudomanifolds

Mathematics Subject Classification ID

Graph theory (05C99) Software, source code, etc. for problems pertaining to manifolds and cell complexes (57-04) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

Extendable shellability for rank 3 matroid complexes ⋮ A note about bistellar operations on PL-manifolds with boundary ⋮ Signable posets and partitionable simplicial complexes ⋮ Overview of shelling for 2-manifold surface reconstruction based on 3D Delaunay triangulation ⋮ Stellare Abänderungen und Schälbarkeit von Komplexen und Polytopen ⋮ Representing geometric structures in \(d\) dimensions: Topology and order ⋮ Shellings from relative shellings, with an application to NP-completeness ⋮ Unnamed Item

This page was built for publication: A Representation of 2-dimensional Pseudomanifolds and its use in the Design of a Linear-Time Shelling Algorithm