- Constructs a complete scene hierarchy
- Adds volume clusters above input polygons (preprocessing)
- Subdivides below input polygons (during solution)

- Algorithm is O(k logk + n)
- k is the number of input polygons
- n is the number of elements used by the solution

Previous slide | Next slide | Back to first slide | View graphic version |