bevy_prototype_sdf
An experimental crate for defining and using trees of signed distance primitives and operations.
Goals
- Provide a simple and perfomant way to define SDFs in a serializable and reusable way
Current limitations
Not many shapes are currently supported. Execution orders aren't optimized in any way yet.
License
All code in this repository is dual-licensed under either:
- MIT License (LICENSE-MIT or http://opensource.org/licenses/MIT)
- Apache License, Version 2.0 (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
at your option.