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 G. Martella and A. Paoluzzi},
  • Francesco Furiani, G. Martella, A. 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
    1 Citations

    Figures and Topics from this paper.

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


    Chain-Based Representations for Solid and Physical Modeling
    • 28
    • PDF
    Regularized arrangements of cellular complexes
    • 3
    • PDF
    Linear algebraic representation for topological structures
    • 19
    • PDF
    On the design of CGAL a computational geometry algorithms library
    • 157
    • PDF
    Building your own DEC at home
    • 32
    Discrete exterior calculus
    • 516
    • PDF
    Mesh arrangements for solid geometry
    • 66
    • PDF
    The Combinatorial BLAS: design, implementation, and applications
    • 324
    • PDF