//! # rita
//!
//! An implementation of 2D and 3D weighted delaunay triangulation via incremental algorithms.
//!
//! ## Features
//! - `std` (default) - enables anyhow and nalgebra's std features
//! - `timing` - enables timing of function run time, this requires std
//! - `logging` - uses `log` to record errors and warnings, along with some extra information
//! - `log_timing` - enables logging and timing, to record timing info
extern crate alloc;
pub use VertexNode;
pub use Tetrahedralization;
pub use Triangulation;