Constructible complexes and recursive division of posets
From MaRDI portal
Publication:1978709
DOI10.1016/S0304-3975(99)00195-4zbMATH Open0938.68882MaRDI QIDQ1978709FDOQ1978709
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cites Work
- Lectures on Polytopes
- Combinatorics and commutative algebra.
- The Upper Bound Conjecture and Cohen-Macaulay Rings
- Title not available (Why is that?)
- The maximum numbers of faces of a convex polytope
- On Lexicographically Shellable Posets
- Signable posets and partitionable simplicial complexes
- Shellable Decompositions of Cells and Spheres.
- Posets, regular CW complexes and Bruhat order
- Which Spheres are Shellable?
Cited In (14)
- Title not available (Why is that?)
- A non-partitionable Cohen-Macaulay simplicial complex
- Corners and simpliciality in oriented matroids and partial cubes
- Strong homotopy types, nerves and collapses
- Catalan recursion on externally ordered bases of unit interval positroids
- A balanced non-partitionable Cohen-Macaulay complex
- Discrete Morse theory for manifolds with boundary
- A combinatorial-topological shape category for polygraphs
- Shellings from relative shellings, with an application to NP-completeness
- The Poset of Proper Divisibility
- Overview of shelling for 2-manifold surface reconstruction based on 3D Delaunay triangulation
- Contractible Hamiltonian cycles in triangulated surfaces
- Minimal Cohen--Macaulay Simplicial Complexes
- Mogami manifolds, nuclei, and 3D simplicial gravity
Recommendations
This page was built for publication: Constructible complexes and recursive division of posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978709)
