An acyclicity theorem for cell complexes in d dimensions

DOI10.1007/BF02122779zbMath0722.52004MaRDI QIDQ756134

Herbert Edelsbrunner

Publication date: 1990

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

visibilityDelaunay triangulationacyclic 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)

Related Items (10)

Incremental topological flipping works for regular triangulations ⋮ Overview of shelling for 2-manifold surface reconstruction based on 3D Delaunay triangulation ⋮ Weakly regular subdivisions ⋮ Why is the 3D Delaunay triangulation difficult to construct? ⋮ Farthest neighbors, maximum spanning trees and related problems in higher dimensions ⋮ 3D boundary recovery by constrained Delaunay tetrahedralization ⋮ WALKING IN A TRIANGULATION ⋮ Classroom examples of robustness problems in geometric computations ⋮ The Delaunay triangulation for multidimensional surfaces and its approximative properties ⋮ General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties

Cites Work

• On sorting triangles in a Delaunay tessellation
• On the shape of a set of points in the plane
• How to search in history
• Power Diagrams: Properties, Algorithms and Applications
• Unnamed Item
• Unnamed Item

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