-
Notifications
You must be signed in to change notification settings - Fork 13
Home
SAnsell edited this page Sep 5, 2014
·
1 revision
## Boolean algebra optimizations
Currently the boolean algebra optimization is a complete patchwork of stuff.
- level-1/level 2 spliting system. Implemented in HeadRule and used e.g. Reflector rods
- factorization [weak] factors for algebra
- DNF / CNF possible for all objects but due to speed only for small.
We need to move some of those details into generic optimizations :
Want to implement redundant surface removal on a formal mathematical level.
To implement :
- convert algebra [done already -- mostly]
- intersect join using implies [plane / plane parallel rules etc]
- Use Shannon determinate method to isolate all literals 1 by 1.
- Eliminate all literates that provide a tortology