Simploidals sets: Definitions, Operations and Comparison with Simplicial Sets - Archive ouverte HAL Access content directly
Journal Articles Discrete Applied Mathematics Year : 2009

Simploidals sets: Definitions, Operations and Comparison with Simplicial Sets

Laurent Fuchs
SIC
Pascal Lienhardt
SIC

Abstract

The combinatorial structure of simploidal sets generalizes both simplicial complexes and cubical complexes. More precisely, cells of simploidal sets are cartesian product of simplices. This structure can be useful for geometric modeling (e.g. for handling hybrid meshes) or image analysis (e.g. for computing topological properties of parts of n-dimensional images). In this paper, definitions and basic constructions are detailed. The homology of simploidal sets is defined and it is shown to be equivalent to the classical homology. It is also shown that products of Bézier simplicial patches are well suited for the embedding of simploidal sets.

Dates and versions

hal-00366069 , version 1 (05-03-2009)

Identifiers

Cite

Samuel Peltier, Laurent Fuchs, Pascal Lienhardt. Simploidals sets: Definitions, Operations and Comparison with Simplicial Sets. Discrete Applied Mathematics, 2009, 157, pp.542--557. ⟨10.1016/j.dam.2008.05.032⟩. ⟨hal-00366069⟩
191 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More