Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911348498104320 |
|---|---|
| author | Paoluzzi, Alberto Shapiro, Vadim DiCarlo, Antonio Scorzelli, Giorgio Onofri, Elia |
| author_facet | Paoluzzi, Alberto Shapiro, Vadim DiCarlo, Antonio Scorzelli, Giorgio Onofri, Elia |
| contents | The goal of this paper is to introduce a new method in computer-aided geometry of solid modeling. We put forth a novel algebraic technique to evaluate any variadic expression between polyhedral d-solids (d = 2, 3) with regularized operators of union, intersection, and difference, i.e., any CSG tree. The result is obtained in three steps: first, by computing an independent set of generators for the d-space partition induced by the input; then, by reducing the solid expression to an equivalent logical formula between Boolean terms made by zeros and ones; and, finally, by evaluating this expression using bitwise operators. This method is implemented in Julia using sparse arrays. The computational evaluation of every possible solid expression, usually denoted as CSG (Constructive Solid Geometry), is reduced to an equivalent logical expression of a finite set algebra over the cells of a space partition, and solved by native bitwise operators. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1910_11848 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays Paoluzzi, Alberto Shapiro, Vadim DiCarlo, Antonio Scorzelli, Giorgio Onofri, Elia Computational Geometry I.3.5; I.3.6 The goal of this paper is to introduce a new method in computer-aided geometry of solid modeling. We put forth a novel algebraic technique to evaluate any variadic expression between polyhedral d-solids (d = 2, 3) with regularized operators of union, intersection, and difference, i.e., any CSG tree. The result is obtained in three steps: first, by computing an independent set of generators for the d-space partition induced by the input; then, by reducing the solid expression to an equivalent logical formula between Boolean terms made by zeros and ones; and, finally, by evaluating this expression using bitwise operators. This method is implemented in Julia using sparse arrays. The computational evaluation of every possible solid expression, usually denoted as CSG (Constructive Solid Geometry), is reduced to an equivalent logical expression of a finite set algebra over the cells of a space partition, and solved by native bitwise operators. |
| title | Finite Boolean Algebras for Solid Geometry using Julia's Sparse Arrays |
| topic | Computational Geometry I.3.5; I.3.6 |
| url | https://arxiv.org/abs/1910.11848 |