/**
 * Walk from a given tetrahedron in the mesh towards tetrahedron that contains input point
 * This is an essential method for incrementally finding the next tetrahedron for cavity computation
 *
 * @see https://git.immc.ucl.ac.be/hextreme/hxt_seqdel/-/blob/master/src/hxt_tetrahedra.c#L330
 * @see p3 "One machine, one minute, three billion tetrahedra" by Célestin Marot, Jeanne Pellerin, Jean-François Remacle
 * @param {TetrahedralMesh} mesh
 * @param {number[]|Float32Array} points
 * @param {number} hint_tetrahedron we will start here and walk towards our target
 * @param {number} search_vertex_index resolved by indexing into {@link points} array
 * @returns {number}
 */
export function tetrahedral_mesh_walk_towards_containing_tetrahedron(mesh: TetrahedralMesh, points: number[] | Float32Array, hint_tetrahedron: number, search_vertex_index: number): number;
//# sourceMappingURL=tetrahedral_mesh_walk_towards_containing_tetrahedron.d.ts.map