Crate reference

Axiolid publishes 63 crates, each versioned and released on its own. The axiolid facade re-exports them behind features; every crate can also be used directly. Selecting a package says which to start from.

Every page here is generated from the crate itself: its manifest, its crate documentation and its changelog. Sections follow the layers of the crate map.

Foundation

Crate	Role	Latest release	Description
axiolid-core	foundation.values	0.3.5	Geometry data types and tolerance policy. No algorithms, no backends.

Representations

Crate	Role	Latest release	Description
axiolid-brep	representation.composed	0.3.7	Exact analytic B-rep result contracts over neutral topology
axiolid-curve	representation.atomic	0.3.12	Exact, format-neutral curve values: lines, conics, B-splines, natural-equation and elevated curves.
axiolid-field	representation.sampled	0.3.4	Frame-neutral layered spatial-field values and validated sampling configuration.
axiolid-fixtures	representation.fixtures	0.3.3	Shared adversarial and degenerate geometry fixtures with provenance
axiolid-linear	representation.atomic	0.3.5	Format-neutral line, ray, segment, and polyline representations
axiolid-mesh	representation.discrete	0.3.6	Triangle meshes: the discrete representation every backend consumes.
axiolid-model	representation.graph	0.3.19	Format-neutral geometry item tree. The currency between a format reader and a kernel.
axiolid-pointcloud	representation.discrete	0.3.4	Portable point-sampled geometry values with optional per-point channels.
axiolid-primitive	representation.atomic	0.3.5	Exact parametric primitive solids used as CSG leaves
axiolid-profile	representation.region	0.3.4	Exact 2D profile representations for sweeps and sectioned solids
axiolid-surface	representation.atomic	0.3.6	Exact, format-neutral surface values: planes, quadrics, tori, and B-spline patches.
axiolid-topology	representation.topology	0.3.4	Typed-handle B-rep topology independent of curve and surface implementations

Contracts

Crate	Role	Latest release	Description
axiolid-contracts	contract.common	0.3.7	Common backend-neutral execution and diagnostic contracts
axiolid-curve-evaluate-contract	contract.operation	0.3.9	Portable curve evaluation capability contract: point, tangent and oriented frame at a distance
axiolid-exact-compile-contract	contract.operation	0.3.3	Portable graph-to-exact-B-rep compilation contract
axiolid-guarantees	contract.guarantees	0.3.3	Certified-value and escalation vocabulary for geometry contracts
axiolid-mesh-boolean-contract	contract.operation	0.3.5	Portable mesh boolean request, result, evidence, and conformance contract
axiolid-mesh-compile-contract	contract.operation	0.3.6	Portable graph-to-mesh compilation contract
axiolid-mesh-contracts	contract.common.mesh	0.3.3	Shared mesh admissibility contracts
axiolid-mesh-hidden-lines-contract	contract.operation	0.1.6	Portable hidden-line drawing request, result, and conformance contract for triangle meshes
axiolid-mesh-section-contract	contract.operation	0.3.9	Portable mesh plane-section request, result, and evidence contract
axiolid-pointcloud-reconstruction-contract	contract.operation	0.3.4	Portable pointcloud-to-surface reconstruction contract, evidence, and conformance suite.
axiolid-tessellation-contract	contract.operation	0.3.4	Curves, surfaces and B-reps to triangles under an explicit tolerance.

Algorithms

Crate	Role	Latest release	Description
axiolid-arrangement	algorithm.planar	0.3.3	Editable planar subdivision with persistent half-edge topology
axiolid-brep-audit	algorithm.repair	0.3.4	Geometric consistency auditing for exact boundary representations
axiolid-brep-boolean	algorithm.construction	0.1.15	General exact B-rep booleans over analytic faces (ADR 0075)
axiolid-collide	algorithm.query	0.3.3	Convex collision queries: separating axis, overlap, and separation distance
axiolid-constraint2d	algorithm.planar	0.1.3	Apollonius and tangent-circle constructions: circles tangent to three points, lines or circles in any combination
axiolid-construct	algorithm.construction	0.4.0	Solid generation: profiles, lofts, sweeps, revolutions and half-space clipping
axiolid-decimate	algorithm.discrete	0.3.4	Edge-collapse mesh decimation with a bounded, reported deviation
axiolid-decompose	algorithm.discrete	0.3.3	Convex decomposition of a solid, exact or approximate and always labelled
axiolid-evaluate	algorithm.parametric	0.3.22	Analytic and spline curve/surface evaluation, jets, and inversion
axiolid-exact	algorithm.reference	0.1.4	Filtered exact arithmetic: interval filter, dyadic big integers, a + b*sqrt(c)
axiolid-exact-arrangement	algorithm.planar	0.1.2	Exact arrangement of straight segments on rational points, with face tracing
axiolid-field-ops	algorithm.sampled	0.3.4	Sampling, morphology, clearance, and navigation over Axiolid layered fields.
axiolid-heal	algorithm.repair	0.3.4	Explicit diagnosis and opt-in repair contracts for dirty geometry
axiolid-hidden-lines	algorithm.discrete	0.1.5	Exact scalar hidden-line drawings of triangle meshes in orthographic and perspective views, and visible face regions in orthographic views
axiolid-inspect	algorithm.query	0.3.10	Mesh queries: clearance, containment, ray casting, and genus
axiolid-levelset	algorithm.sampled	0.3.3	Level-set extraction: a closed manifold mesh from a sampled scalar field
axiolid-linear-intersection	algorithm.query	0.3.3	Portable, deterministic intersections for linear geometry
axiolid-measure	algorithm.query	0.3.15	Metric properties: area, volume, centroid, moments of inertia.
axiolid-minkowski	algorithm.discrete	0.3.3	Minkowski sum and difference of planar-faced solids
axiolid-numeric	algorithm.numeric	0.1.4	Numeric substrate: bracketed and polynomial root finding, adaptive quadrature, dense least squares, and minimisation, each with error estimates
axiolid-nurbs	algorithm.parametric	0.3.10	General polynomial and rational B-spline analysis and transformation algorithms
axiolid-overlay	algorithm.planar	0.4.1	Deterministic validated planar overlay contract
axiolid-predicates	algorithm.reference	0.3.5	Certified exact-arithmetic geometric predicates
axiolid-project	algorithm.planar	0.4.0	Projection of triangle meshes onto a plane, and prism intersection
axiolid-ray-mesh	algorithm.query	0.4.2	Narrow-phase ray/triangle-mesh nearest-hit intersection
axiolid-reference	algorithm.reference	0.3.18	Portable scalar reference implementation and certified predicates
axiolid-refine	algorithm.discrete	0.3.4	Mesh refinement, smoothing, isotropic remeshing, hole filling, fairing and subdivision surfaces
axiolid-route	algorithm.planar	0.4.0	Exact planar shortest path over a visibility graph
axiolid-spatial	algorithm.query	0.3.6	Acceleration structures: BVH and uniform point grid, and their queries; barycentric and mean-value coordinates.
axiolid-tetrahedralize	algorithm.discrete	0.1.2	Exact 3D Delaunay tetrahedralization with symbolic perturbation
axiolid-triangulate	algorithm.planar	0.3.7	Constrained Delaunay triangulation with bounded quality refinement

Providers

Crate	Role	Latest release	Description
axiolid-mesh-boolean-boolmesh	provider.mesh	0.3.7	boolmesh-backed MeshBoolean provider
axiolid-pointcloud-reconstruction-sdf	provider.pointcloud	0.3.4	Reference pointcloud reconstruction: signed-distance field from samples, extracted as a level set.

Execution

Crate	Role	Latest release	Description
axiolid-backend-cpu	execution.context	0.3.4	Portable and runtime-optimized CPU execution context for Axiolid geometry
axiolid-backend-gpu	execution.context	0.3.3	GPU executor adapter contract for batched Axiolid geometry
axiolid-dispatch	execution.dispatch	0.3.13	Provider registration, ordering, fallback, and execution policy
axiolid-mesh-compile	execution.orchestration	0.3.46	Scalar reference MeshCompiler: profiles, extrusion, transforms, boolean dispatch.

Facade

Crate	Role	Latest release	Description
axiolid	facade	0.5.1	Feature-gated facade for Axiolid's format-neutral geometry stack
axiolid-capi	facade.native-c	0.4.0	Versioned, memory-safe C ABI for the Axiolid application facade.