tiny.geometry

Overview · API · Code relationships · Verification · Audit

Overview

Collision geometry over f32: primitive shapes, closest points, intersection and sweep queries, indexed triangle meshes, and a static bounding volume hierarchy, with no allocation after a tree is built.

Definitions

Actions

Public operations.

• FixedStorage: Storage with room for capacity triangles inline, for a caller that sizes its tree at compile time and keeps it in static memory.

Types and contracts

Public types and contracts.

• Aabb: An axis-aligned box.
• Plane: The points p with normal · p = offset.
• Storage: Caller-owned memory for one tree.
• Capsule: The points within radius of the segment from a to b.
• Error
• Node: A node box with its payload.
• Obb: A box rotated by axes, whose columns are orthonormal, around center.
• Overlap: How many triangle indices an overlap query wrote, and whether those were all the triangles it touched.
• Ray: A half-line from origin along direction.
• RayHit: A ray meeting a mesh triangle: the ray parameter, the barycentric weights of vertices b and c, and the triangle index in the mesh.
• Segment: The points a + (b - a) * t for t in [0, 1].
• Stats: Work a query did, for comparing against its floor.
• SweepHit: A sweep's first contact with a mesh triangle, as sweep.Hit reports it, with the triangle index in the mesh.
• Triangle: A triangle with counter-clockwise winding around its normal.
• Sphere
• Bvh
• Mesh: A borrowed triangle list: triangle i joins the positions named by indices[3 i .. 3 i + 3].

Namespaces

Public namespaces.

• tolerance: Every tolerance the package compares against, in one place.
• intersect: Ray casts and overlap tests between shapes.
• closest: Closest points between shapes, after Ericson, Real-Time Collision Detection, chapter 5.
• sweep: Swept shapes against triangles.

Values and defaults

Public values and defaults.

• depth_limit: Every node sits at a depth below this, and every query stack holds this many entries.
• leaf_capacity: The most triangles one leaf holds.
• max_triangles: The most triangles a mesh may hold, so that every tree node index fits in a u32.

Code relationships

Direct static dependencies extracted from parsed source by semantic graph analysis.

Uses: tiny.bench, tiny.hypothesis, tiny.linear
Used by: tiny.choir, tiny.sdfii

Verification

No verification records are cataloged for this module in this build.

Audit