# 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} }

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

2 Citations

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

- Mathematics, Computer Science
- 2017

- 1
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 47 REFERENCES

Multidimensional binary search trees used for associative searching

- Computer Science
- 1975

- 5,969
- Highly Influential
- PDF

Julia: A Fresh Approach to Numerical Computing

- Computer Science, Mathematics
- 2017

- 1,511
- Highly Influential
- PDF

Object representation by means of nonminimal division quadtrees and octrees

- Mathematics, Computer Science
- 1985

- 161
- Highly Influential