An acyclicity theorem for cell complexes in d dimensions

DOI10.1007/BF02122779zbMATH Open0722.52004MaRDI QIDQ756134FDOQ756134

Authors: Herbert Edelsbrunner 

Publication date: 1990

Published in: Combinatorica (Search for Journal in Brave)

Recommendations

• Recognising polytopical cell complexes and constructing projection polyhedra
• Cell complexes, oriented matroids and digital geometry.
• scientific article; zbMATH DE number 2084496
• A single cell in an arrangement of convex polyhedra in \(\mathbb R^3\)
• scientific article; zbMATH DE number 1786526

zbMATH Keywords

Delaunay triangulationvisibilityacyclic relationcell-complexin front of/behind-relationregular d-dimensional cell complex

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other designs, configurations (05B30) Combinatorial aspects of tessellation and tiling problems (05B45) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Tilings in (n) dimensions (aspects of discrete geometry) (52C22)

Cites Work

• Title not available (Why is that?)
• Power Diagrams: Properties, Algorithms and Applications
• Title not available (Why is that?)
• On the shape of a set of points in the plane
• How to search in history
• On sorting triangles in a Delaunay tessellation

Cited In (13)

• General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
• The Delaunay triangulation for multidimensional surfaces and its approximative properties
• Incremental topological flipping works for regular triangulations
• 3D boundary recovery by constrained Delaunay tetrahedralization
• Weakly regular subdivisions
• Title not available (Why is that?)
• Acyclicity criteria for complexes associated with an alternating map
• WALKING IN A TRIANGULATION
• Power-cancellation of \(CW\)-complexes with few cells
• Classroom examples of robustness problems in geometric computations
• Overview of shelling for 2-manifold surface reconstruction based on 3D Delaunay triangulation
• Farthest neighbors, maximum spanning trees and related problems in higher dimensions
• Why is the 3D Delaunay triangulation difficult to construct?

This page was built for publication: An acyclicity theorem for cell complexes in d dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q756134)