Skip to content
GitLab
Projects Groups Topics Snippets
  • /
  • Help
    • Help
    • Support
    • Community forum
    • Submit feedback
    • Contribute to GitLab
  • Sign in
  • pyddg pyddg
  • Project information
    • Project information
    • Activity
    • Labels
    • Members
  • Repository
    • Repository
    • Files
    • Commits
    • Branches
    • Tags
    • Contributor statistics
    • Graph
    • Compare revisions
  • Issues 190
    • Issues 190
    • List
    • Boards
    • Service Desk
    • Milestones
  • Merge requests 8
    • Merge requests 8
  • CI/CD
    • CI/CD
    • Pipelines
    • Jobs
    • Schedules
  • Deployments
    • Deployments
    • Environments
    • Releases
  • Monitor
    • Monitor
    • Metrics
    • Incidents
  • Analytics
    • Analytics
    • Value stream
    • CI/CD
    • Repository
  • Wiki
    • Wiki
  • Activity
  • Graph
  • Create a new issue
  • Jobs
  • Commits
  • Issue Boards
Collapse sidebar
  • pyddg
  • pyddgpyddg
  • Issues
  • #480
Closed
Open
Issue created Oct 21, 2021 by Jan Techter@techterOwner

general combinatorics interface

Generic interface for all combinatorial objects (everything called datastructure at the moment: domains, half-edge, IFS). All datastructures should inherit from this interface.

Please divide into sub-issues as follows:

  1. create interface structure
  • attributes: vertices, edges, faces
  • methods: adjacent_vertices(cell), adjacent_edges(cell), adjacent_faces(cell)
  • integrate interface with IFS
  • for testing it should suffice that basic operations (and utils) of the corresponding datastructures is tested
  1. add methods to read and write attributes from cells:
  • set_vertex_attribute(self, cell, name, value)
  • get_vertex_attribute(self, name, cell)
  • utils that work for all datastructures should be placed in ddg.datastructures.utils:
    • implement set_valency_attr for the interface (see current version in `ddg.datastructures.halfedge.utils.set.)
  1. integrate interface with half-edge

  2. adapt all utils to interface (see ddg.datastructures.halfedge.utils.set, get)

  • if the util is best implemented on half-edge, the util function should use the half-edge implemtation in case a half-edge surface is given
  1. add general attribute mechanism #515

  2. add example of creating a gauss map from faces

Edited Sep 28, 2022 by Nina Smeenk
Assignee
Assign to
Time tracking