QuickCSG is a generic multiple polyhedra CSG algorithm. It was developed for Kinovis as an extension of the EPVH visual hull-based reconstruction algorithm. It turns out that without impacting performance the algorithm can be generalized to any boolean operation on multiple polyhedra (ie. not just two).

A project page, including binaries and usage examples are available here: QuickCSG project page.

The algorithm is described in this technical report: QuickCSG: Arbitrary and Faster Boolean Combinations of N Solids.




  1. Is there any source of your software to grab? I do understand if you want to patent your stuff, but since it’s a research it would be great to show it to public.

  2. Hi Kinovis team,

    My name is Pedro Cidreiro. I am a PhD student at Purdue University and I am using CSG on my research. I am currently using the method present on this paper:
    Mesh arrangements for solid geometry*** (https://dl.acm.org/citation.cfm?id=2925901). However, we need to improve the speed of out calculations, for this purpose quickCSG got out attention, as reported in the paper.

    I have tried the .exe files you provide on the website and seems to work fine for what we need. However, the I/O option makes it completely inefficient, since write and read an .off file consumes a lot of computation time. I would like to know if you can provide, for research purposes, the sources of quickSCG for linux. If so, what kind of dependencies does it has?

    ***: Mesh arrangements for solid geometry.
    Zhou, Qingnan ; Grinspun, Eitan ; Zorin, Denis ; Jacobson, Alec ;
    ACM Transactions on Graphics, 2016, Vol.35 (4), p.1-16


    Pedro Cidreiro

  3. The situation of the software has evolved favorably for this to happen, we are planning a GPL release in the coming months.

Leave a Reply