Bump contains TableBasedExtractor, a base class for clipping and cutting operations.
Performance
Comparisons with quest marching cubes indicate that there is a 2-3x performance penalty using the Bump algorithm. I suspect this is largely due to the sorting in vertex-welding present in the Bump algorithm.
- Create a comparison benchmark that times quest and bump implementations of marching cubes
- Add an option to Bump's implementation to turn off vertex-welding, allowing it to skip costly sorting
- Make other Bump performance improvements to close the performance gap
Tables
Bump's algorithms use polygon-based tables, though the triangle tables are still present.
- Make it possible to build in either the triangle or polygon-based tables
- Add a runtime option to select the triangle-based tables for Bump for cutting tables
Bump contains
TableBasedExtractor, a base class for clipping and cutting operations.Performance
Comparisons with quest marching cubes indicate that there is a 2-3x performance penalty using the Bump algorithm. I suspect this is largely due to the sorting in vertex-welding present in the Bump algorithm.
Tables
Bump's algorithms use polygon-based tables, though the triangle tables are still present.