Documentation
    Preparing search index...

    Interface Pickable

    A picking candidate: a node plus the box, in that node's local space, that stands in for its shape (§71's bounding-volume strategy).

    Local rather than world bounds is what makes the candidate list cheap to keep — see the module header — and what makes the hit test exact under rotation. BufferGeometry.computeBounds() returns exactly this pair; a candidate whose box is empty or inverted (min > max on any axis, the empty-geometry convention) is never hit.

    interface Pickable {
        alphaMask?: PickableAlphaMask;
        boundsMax: Vector3;
        boundsMin: Vector3;
        node: Node;
        triangles?: PickableTriangles;
    }
    Index
    alphaMask?: PickableAlphaMask

    §71's "pixel" refinement (RFC 0005 alternative D): confirm a box hit against these texels' alpha before reporting it. Absent — every candidate before this field existed — means the box alone decides, which keeps the bounds tier byte-for-byte what it was.

    boundsMax: Vector3

    Upper corner of the box, in node's local space.

    boundsMin: Vector3

    Lower corner of the box, in node's local space.

    node: Node

    The node the box belongs to, and the node a hit reports.

    triangles?: PickableTriangles

    §71's "geometry" refinement (A-11's analytic tier): confirm a box hit by exact ray/triangle intersection against these local-space triangles, refining the hit's distance and point to the actual surface. Absent — every candidate before this field existed — means the box (and any Pickable.alphaMask) decides as before. Consulted under hitTestMode null and "geometry"; see PickableTriangles.