Corpus ID: 32546860

# Regularized arrangements of cellular complexes

@article{Paoluzzi2017RegularizedAO,
title={Regularized arrangements of cellular complexes},
author={A. Paoluzzi and V. Shapiro and A. DiCarlo},
journal={arXiv: Computational Geometry},
year={2017}
}
• 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

#### References

##### Publications referenced by this paper.
SHOWING 1-10 OF 47 REFERENCES
Introduction to Algorithms
• 11,384
• PDF
Discrete exterior calculus
• Mathematics
• 2003
• 511
• PDF
Julia: A Fresh Approach to Numerical Computing
• Computer Science, Mathematics
• 2017
• 1,511
• Highly Influential
• PDF
Algebraic Topology
• 6,043
• Highly Influential
• PDF
Object representation by means of nonminimal division quadtrees and octrees
• Mathematics, Computer Science
• 1985
• 161
• Highly Influential
Algorithm 447: efficient algorithms for graph manipulation
• Computer Science
• 1973
• 568
• Highly Influential