Corpus ID: 32546860

Regularized arrangements of cellular complexes

  title={Regularized arrangements of cellular complexes},
  author={A. Paoluzzi and V. Shapiro and A. DiCarlo},
  journal={arXiv: Computational Geometry},
  • A. Paoluzzi, V. Shapiro, A. DiCarlo
  • Published 2017
  • Computer Science, Mathematics
  • arXiv: Computational Geometry
  • In this paper we propose a novel algorithm to combine two or more cellular complexes, providing a minimal fragmentation of the cells of the resulting complex. We introduce here the idea of arrangement generated by a collection of cellular complexes, producing a cellular decomposition of the embedding space. The algorithm that executes this computation is called \emph{Merge} of complexes. The arrangements of line segments in 2D and polygons in 3D are special cases, as well as the combination of… CONTINUE READING
    Geometric Computing with Chain Complexes: Design and Features of a Julia Package
    • 1
    • PDF
    Local congruence of chain complexes
    • 1
    • PDF


    Publications referenced by this paper.
    Computational Geometry: An Introduction
    • 6,734
    Multidimensional binary search trees used for associative searching
    • 5,969
    • Highly Influential
    • PDF
    Representations for Rigid Solids: Theory, Methods, and Systems
    • 1,476
    • PDF
    Introduction to Algorithms
    • 11,384
    • PDF
    Discrete exterior calculus
    • 511
    • PDF
    Julia: A Fresh Approach to Numerical Computing
    • 1,511
    • Highly Influential
    • PDF
    Algebraic Topology
    • 6,043
    • Highly Influential
    • PDF
    Set operations on polyhedra using binary space partitioning trees
    • 357
    • PDF
    Object representation by means of nonminimal division quadtrees and octrees
    • 161
    • Highly Influential
    Algorithm 447: efficient algorithms for graph manipulation
    • 568
    • Highly Influential