The following software compute the intersections between 3D convex polygonal cells in a (hopefully)  efficient and fast way.
 	
 * DISCLAIMER:
 *
 * THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. 
 * EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES 
 * PROVIDE THE PROGRAM “AS IS” WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, 
 * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND 
 * FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE 
 * OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME 
 * THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
 	
Licence
-------
 	
This software is free to use in the extent given by the file "LICENCE.txt" which must always accompany this software and all its attached files.
  	
Install
-------
 	
Under Linux use the following commands.
 	
mkdir build
cd build
cmake ../
make
  	
Under other operating systems, use "cmake" for the corresponding OS and appropriate options.
cmake can be found here: http://www.cmake.org/
 	
Examples
--------
  	
The following examples of how to use this code can be found in ./src/test/
  	
simple_cut:  simple intersection between two overlapping cubes.
simple_cut2: simple intersection between two overlapping octahedra.
multiple_cuts: speed benchmark for multiple cuts between randomly generated octahedra.
 	
Copyright (c) Christophe Leblanc A. D.
cleblancad@gmail.com