Corpus ID: 208157952

Topological computing of arrangements with (co)chains

  title={Topological computing of arrangements with (co)chains},
  author={A. Paoluzzi and V. Shapiro and A. DiCarlo and Francesco Furiani and G. Martella and G. Scorzelli},
  • A. Paoluzzi, V. Shapiro, +3 authors G. Scorzelli
  • Published 2019
  • Mathematics, Computer Science
  • ArXiv
  • In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences, adjacencies and ordering of cells, generally using disparate and often incompatible data structures and algorithms. This paper introduces computational topology algorithms to discover the 2D/3D space partition induced by a collection of geometric objects of… CONTINUE READING
    Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays
    • 1
    • Open Access
    Local congruence of chain complexes
    • 1
    • Open Access
    My JuliaCon proceeding


    Publications referenced by this paper.
    Representations for Rigid Solids: Theory, Methods, and Systems
    • 1,476
    • Open Access
    Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
    • 2,185
    • Open Access
    Geometric and Solid Modeling: An Introduction
    • 688
    Introduction to Algorithms, Third Edition
    • 2,635
    • Open Access
    Delaunay refinement algorithms for triangular mesh generation
    • 1,034
    • Open Access
    Representing geometric structures ind dimensions: Topology and order
    • 151
    • Open Access
    Introduction to Piecewise-Linear Topology
    • 973
    Topological structures for geometric modeling
    • 285
    Introduction to Algorithms
    • 11,371
    • Open Access
    Dimension-independent modeling with simplicial complexes
    • 138