import type { CellGroup } from './cell-complex.js';
/**
 * Finds cells in one homogeneous group that contain every queried vertex.
 *
 * The result contains local cell ordinals in the same order as `group.indices`.
 * Containment is combinatorial and orientation-independent: the query
 * `[4, 1, 7]` matches a cell whenever all three vertex ids occur in its tuple.
 * The function does not infer geometric intersection or ancestry across a
 * refinement; callers must carry that lineage separately.
 *
 * This is the small topology bridge needed after resolving a rendered simplex
 * to source vertices. For example, a projected source triangle can be related
 * to every tetrahedron that has it as a face, after which an exact section can
 * highlight only those tetrahedra.
 *
 * @param group - Homogeneous target cells to search.
 * @param vertices - Non-empty, duplicate-free source vertex ids that every
 * returned cell must contain.
 *
 * @example
 * ```ts
 * const solid = tetrahedralizeCuboidCells(
 *   createHypercube({ dim: 4, maxCellDimension: 3 })
 * );
 * const tetrahedra = solid
 *   .cellsOfDim(3)
 *   .find((group) => group.kind === 'simplex');
 * if (!tetrahedra) throw new Error('nothing was tetrahedralized');
 *
 * // Local tetrahedron ordinals incident to this retained source triangle.
 * const incident = findIncidentCellsN(tetrahedra, [0, 1, 3]);
 * ```
 */
export declare function findIncidentCellsN(group: CellGroup, vertices: ArrayLike<number>): Uint32Array;
//# sourceMappingURL=cell-incidence.d.ts.map