Simploidal sets: A data structure for handling simploidal Bézier spaces.

Saved in:
Bibliographic Details
Title: Simploidal sets: A data structure for handling simploidal Bézier spaces.
Authors: Peltier, Samuel1 samuel.peltier@univ-poitiers.fr, Lienhardt, Pascal1 pascal.lienhardt@univ-poitiers.fr
Source: Computer Aided Geometric Design. May2018, Vol. 62, p44-62. 19p.
Subjects: Algebraic topology, Data structures, Geometric modeling, CAD/CAM systems, Computer graphics, Combinatorics, Computational topology
Abstract: Simplicial sets and cubical sets are combinatorial structures which have been studied for a long time in Algebraic Topology. These structures describe sets of regular cells, respectively simplices and cubes, and any kind of assembly of cells can be represented. They are used for many applications in Computational Topology, Geometric Modeling, CAD/CAM, Computer Graphics, etc. For instance, simplicial and cubical sets are ”naturally” associated with simplicial and cubical Bézier spaces. In this paper, a new combinatorial structure, namely simploidal sets is defined for representing and handling Bézier simploids. Simploidal sets describe sets of simploids, which are also regular cells corresponding to Cartesian product of simplices. Simplices and cubes are then particular simploids. In order to associate shapes with structures, structural relations between simploidal sets and simploidal Bézier spaces are also stated. In fact, simploidal sets generalize and homogenize simplicial and cubical sets. Construction operations are also defined, extending all those of simplicial and cubical sets: cone, Cartesian product, degeneracy, and identification. In their basic version, the first three operations allow to create any simploid, and the last one, to create any assembly of simploids. It is then possible to simultaneously handle through a single formalism any assembly of simplices, cubes, and other simploids, with a very low additional cost, regarding space (data structure), time (construction or computation operations) or software development. [ABSTRACT FROM AUTHOR]
Copyright of Computer Aided Geometric Design is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 129626017
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Simploidal sets: A data structure for handling simploidal Bézier spaces.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Peltier%2C+Samuel%22">Peltier, Samuel</searchLink><relatesTo>1</relatesTo><i> samuel.peltier@univ-poitiers.fr</i><br /><searchLink fieldCode="AR" term="%22Lienhardt%2C+Pascal%22">Lienhardt, Pascal</searchLink><relatesTo>1</relatesTo><i> pascal.lienhardt@univ-poitiers.fr</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Computer+Aided+Geometric+Design%22">Computer Aided Geometric Design</searchLink>. May2018, Vol. 62, p44-62. 19p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Algebraic+topology%22">Algebraic topology</searchLink><br /><searchLink fieldCode="DE" term="%22Data+structures%22">Data structures</searchLink><br /><searchLink fieldCode="DE" term="%22Geometric+modeling%22">Geometric modeling</searchLink><br /><searchLink fieldCode="DE" term="%22CAD%2FCAM+systems%22">CAD/CAM systems</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+graphics%22">Computer graphics</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatorics%22">Combinatorics</searchLink><br /><searchLink fieldCode="DE" term="%22Computational+topology%22">Computational topology</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Simplicial sets and cubical sets are combinatorial structures which have been studied for a long time in Algebraic Topology. These structures describe sets of regular cells, respectively simplices and cubes, and any kind of assembly of cells can be represented. They are used for many applications in Computational Topology, Geometric Modeling, CAD/CAM, Computer Graphics, etc. For instance, simplicial and cubical sets are ”naturally” associated with simplicial and cubical Bézier spaces. In this paper, a new combinatorial structure, namely simploidal sets is defined for representing and handling Bézier simploids. Simploidal sets describe sets of simploids, which are also regular cells corresponding to Cartesian product of simplices. Simplices and cubes are then particular simploids. In order to associate shapes with structures, structural relations between simploidal sets and simploidal Bézier spaces are also stated. In fact, simploidal sets generalize and homogenize simplicial and cubical sets. Construction operations are also defined, extending all those of simplicial and cubical sets: cone, Cartesian product, degeneracy, and identification. In their basic version, the first three operations allow to create any simploid, and the last one, to create any assembly of simploids. It is then possible to simultaneously handle through a single formalism any assembly of simplices, cubes, and other simploids, with a very low additional cost, regarding space (data structure), time (construction or computation operations) or software development. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Computer Aided Geometric Design is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=129626017
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1016/j.cagd.2018.03.010
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 19
        StartPage: 44
    Subjects:
      – SubjectFull: Algebraic topology
        Type: general
      – SubjectFull: Data structures
        Type: general
      – SubjectFull: Geometric modeling
        Type: general
      – SubjectFull: CAD/CAM systems
        Type: general
      – SubjectFull: Computer graphics
        Type: general
      – SubjectFull: Combinatorics
        Type: general
      – SubjectFull: Computational topology
        Type: general
    Titles:
      – TitleFull: Simploidal sets: A data structure for handling simploidal Bézier spaces.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Peltier, Samuel
      – PersonEntity:
          Name:
            NameFull: Lienhardt, Pascal
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: May2018
              Type: published
              Y: 2018
          Identifiers:
            – Type: issn-print
              Value: 01678396
          Numbering:
            – Type: volume
              Value: 62
          Titles:
            – TitleFull: Computer Aided Geometric Design
              Type: main
ResultId 1