Simploidal Sets - Synthèse et analyse d'images Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2016

Simploidal Sets

Pascal Lienhardt
Samuel Peltier

Résumé

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.
Fichier principal
Vignette du fichier
main-spm.pdf (644.62 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01274880 , version 1 (16-02-2016)
hal-01274880 , version 2 (07-11-2017)
hal-01274880 , version 3 (31-08-2018)

Identifiants

  • HAL Id : hal-01274880 , version 1

Citer

Pascal Lienhardt, Samuel Peltier. Simploidal Sets. 2016. ⟨hal-01274880v1⟩
432 Consultations
485 Téléchargements

Partager

Gmail Facebook X LinkedIn More