Simploidal Sets

Abstract : Simplicial sets and cubical sets are combinatorial structures studied since a long time in Algebraic Topology, and they are used for many applications in Computational Topology, Geometric Modeling, CAD, Computer Graphics, etc. Simploidal sets are defined in this paper in order to homogenize and generalize simplicial and cubical sets. Basic operations are also defined here, which extend basic simplicial and cubical operations (cone, identification, cartesian product). In order to associate shapes with structures, structural relations between simploidal sets and Bézier spaces are provided. It is then possible to (simultaneously) handle through a single formalism: simplices, cubes, and more generally cells corresponding to products of simplices, with a very low additional cost, regarding space (data structure), time (construction or computation operations) or software development.
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger
Contributeur : Pascal Lienhardt <>
Soumis le : mardi 16 février 2016 - 12:57:22
Dernière modification le : jeudi 11 janvier 2018 - 06:27:35
Document(s) archivé(s) le : mardi 17 mai 2016 - 17:22:03


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01274880, version 1


Pascal Lienhardt, Samuel Peltier. Simploidal Sets. 2016. 〈hal-01274880v1〉



Consultations de la notice


Téléchargements de fichiers