P. Agarwal and M. Sharir, Arrangements and their applications, Handbook of Computational Geometry, pp.49-119, 1998.

G. Bernstein and D. Fussell, Fast, Exact, Linear Booleans, Computer Graphics Forum, vol.13, issue.1, pp.1269-1278, 2009.
DOI : 10.1111/j.1467-8659.2009.01504.x

B. Bruderlin, Robust regularized set operations on polyhedra, Proceedings of the Twenty-Fourth Annual Hawaii International Conference on System Sciences, pp.691-700, 1991.
DOI : 10.1109/HICSS.1991.183943

M. Campen and L. Kobbelt, Exact and Robust (Self-)Intersections for Polygonal Meshes, Computer Graphics Forum, vol.28, issue.3, pp.397-406, 2010.
DOI : 10.1111/j.1467-8659.2009.01609.x

A. Fabri and S. Pion, A generic lazy evaluation scheme for exact geometric computations, Proc. 2nd Library-Centric Software Design, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00089229

E. Ferley, M. P. Cani, and J. D. Gascuel, Practical volumetric sculpting. The Visual Computer 16, pp.469-480, 2000.
URL : https://hal.archives-ouvertes.fr/inria-00510075

S. Fortune, Polyhedral modelling with multiprecision integer arithmetic, Computer-Aided Design, vol.29, issue.2, pp.123-133, 1997.
DOI : 10.1016/S0010-4485(96)00041-3

S. Fortune and C. Van-wyk, Static analysis yields efficient exact integer arithmetic for computational geometry, ACM Transactions on Graphics, vol.15, issue.3, pp.223-248, 1996.
DOI : 10.1145/231731.231735

S. Frisken, R. Perry, A. Rockwood, and T. Jones, Adaptively sampled distance fields, Proceedings of the 27th annual conference on Computer graphics and interactive techniques , SIGGRAPH '00, pp.249-254, 2000.
DOI : 10.1145/344779.344899

P. Hachenberger, L. Kettner, and K. Mehlhorn, Boolean operations on 3D selective Nef complexes: Data structure, algorithms, optimized implementation and experiments, Computational Geometry, vol.38, issue.1-2, pp.64-99, 2007.
DOI : 10.1016/j.comgeo.2006.11.009

C. Hoffmann, Geometric and solid modeling: an introduction, 1989.

C. Hoffmann, J. Hopcroft, and M. Karasick, Robust set operations on polyhedral solids, IEEE Computer Graphics and Applications, vol.9, issue.6, pp.50-59, 1989.
DOI : 10.1109/38.41469

T. Ju, F. Losasso, S. Schaefer, and J. Warren, Dual contouring of hermite data, ACM Trans. Graph, vol.21, 2002.

L. Kobbelt, M. Botsch, U. Schwanecke, and H. P. Seidel, Feature sensitive surface extraction from volume data, Proceedings of the 28th annual conference on Computer graphics and interactive techniques , SIGGRAPH '01, pp.57-66, 2001.
DOI : 10.1145/383259.383265

D. Laidlaw, W. Trumbore, and J. Hughes, Constructive solid geometry for polyhedral objects, ACM SIGGRAPH Computer Graphics, vol.20, issue.4, pp.161-170, 1986.
DOI : 10.1145/15886.15904

M. Mäntylä, An Introduction to Solid Modeling, 1988.

A. Meyer and S. Pion, FPG: A code generator for fast and certified geometric predicates, Real Numbers and Computers, pp.47-60, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00344297

K. Museth, D. Breen, R. Whitaker, and A. Barr, Level set surface editing operators, ACM Trans. Graph, vol.21, 2002.
DOI : 10.1145/566570.566585

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

B. Naylor, J. Amanatides, and W. Thibault, Merging BSP trees yields polyhedral set operations, ACM SIGGRAPH Computer Graphics, vol.24, issue.4, pp.115-124, 1990.
DOI : 10.1145/97880.97892

D. Pavi´cpavi´c, M. Campen, and L. Kobbelt, Hybrid Booleans, Computer Graphics Forum, vol.24, issue.2, pp.75-87, 2010.
DOI : 10.1111/j.1467-8659.2009.01545.x

A. Requicha, Representations for Rigid Solids: Theory, Methods, and Systems, ACM Computing Surveys, vol.12, issue.4, pp.437-464, 1980.
DOI : 10.1145/356827.356833

A. Requicha and H. Voelcker, Boolean operations in solid modeling: Boundary evaluation and merging algorithms, Proceedings of the IEEE, pp.30-44, 1985.
DOI : 10.1109/PROC.1985.13108

F. Romeiro, L. Velho, and L. H. De-figueiredo, Scalable GPU rendering of CSG models, Computers & Graphics, vol.32, issue.5, pp.526-539, 2008.
DOI : 10.1016/j.cag.2008.06.002

/. Indicate-boundedness and . Unboundedness, Note the rich topology (unboundedness, disconnectedness, non-manifoldness) of the handled input/output meshes. Models Armadillo52kf' and NonManifoldGrid3kf' are rotated version of the original ones

M. Segal, Using tolerances to guarantee valid polyhedral modeling results, ACM SIGGRAPH Computer Graphics, vol.24, issue.4, pp.105-114, 1990.
DOI : 10.1145/97880.97891

R. Seidel, The nature and meaning of perturbations in geometric computing, Discrete & Computational Geometry, vol.19, 1998.

V. Shapiro, G. Farin, J. Hoschek, M. S. Kim, and J. Hoschek, Chapter 20 -Solid Modeling, Handbook of Computer Aided Geometric Design, pp.473-518, 2002.

J. Shewchuk, Adaptive Precision Floating-Point Arithmetic and Fast Robust Geometric Predicates, Discrete & Computational Geometry, vol.18, issue.3, pp.305-363, 1997.
DOI : 10.1007/PL00009321

J. Shewchuk, Lecture notes on geometric robustness, 2009.

K. Sugihara and M. Iri, A solid modelling system free from topological inconsistency, Journal of Information Processing, vol.12, pp.380-393, 1990.

W. Thibault and B. Naylor, Set operations on polyhedra using binary space partitioning trees, ACM SIGGRAPH Computer Graphics, vol.21, issue.4, pp.153-162, 1987.
DOI : 10.1145/37402.37421

C. Wang, Approximate boolean operations on large polyhedral solids with partial mesh reconstruction. Visualization and Computer Graphics, IEEE Transactions on, vol.17, pp.836-849, 2011.

H. Zhao, C. Wang, Y. Chen, and X. Jin, Parallel and efficient Boolean on polygonal solids, The Visual Computer, vol.42, issue.6, pp.507-517, 2011.
DOI : 10.1007/s00371-011-0571-1

A. Zomorodian and H. Edelsbrunner, FAST SOFTWARE FOR BOX INTERSECTIONS, International Journal of Computational Geometry & Applications, vol.12, issue.01n02, pp.143-172, 2002.
DOI : 10.1142/S0218195902000785