Corpus ID: 19400713

Geometric Computing with Chain Complexes: Design and Features of a Julia Package

  title={Geometric Computing with Chain Complexes: Design and Features of a Julia Package},
  author={Francesco Furiani and Giulio Martella and Alberto Paoluzzi},
  • Francesco Furiani, Giulio Martella, Alberto Paoluzzi
  • Published 2017
  • Mathematics, Computer Science
  • ArXiv
  • Geometric computing with chain complexes allows for the computation of the whole chain of linear spaces and (co)boundary operators generated by a space decomposition into a cell complex. The space decomposition is stored and handled with LAR (Linear Algebraic Representation), i.e. with sparse integer arrays, and allows for using cells of a very general type, even non convex and with internal holes. In this paper we discuss the features and the merits of this approach, and describe the goals and… CONTINUE READING

    Figures and Topics from this paper.

    Topological computing of arrangements with (co)chains
    • 3
    • PDF


    Publications referenced by this paper.
    Chain-Based Representations for Solid and Physical Modeling
    • 28
    • PDF
    Linear algebraic representation for topological structures
    • 19
    • PDF
    Regularized arrangements of cellular complexes
    • 2
    • PDF
    Discrete exterior calculus
    • 511
    • PDF
    On the design of CGAL a computational geometry algorithms library
    • 135
    • PDF
    Building your own DEC at home
    • 32
    Mesh arrangements for solid geometry
    • 65
    • PDF
    Representations for Rigid Solids: Theory, Methods, and Systems
    • 1,476
    • PDF