Simploidals sets: Definitions, operations and comparison with simplicial sets

  • Authors:
  • Samuel Peltier;Laurent Fuchs;Pascal Lienhardt

  • Affiliations:
  • Vienna University of Technology, Faculty of Informatics, Pattern Recognition and Image Processing Group, Austria;Université de Poitiers, Laboratoire SIC, BP 30179 86962 Futuroscope, France;Université de Poitiers, Laboratoire SIC, BP 30179 86962 Futuroscope, France

  • Venue:
  • Discrete Applied Mathematics
  • Year:
  • 2009

Quantified Score

Hi-index 0.04

Visualization

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 Bezier simplicial patches are well suited for the embedding of simploidal sets.