import { Planar } from '../generation/spec/geometric.js';
import { AnalyzerGraph, ComputePolicy } from './types.js';
/**
 * Compute Planar property from graph structure.
 * A graph is planar if it can be drawn in the plane without edge crossings.
 *
 * Uses Kuratowski's theorem: A graph is planar iff it contains no subdivision
 * of K5 or K3,3 (complete graph on 5 vertices or complete bipartite 3,3).
 *
 * Detection strategy:
 * 1. Trivial cases (n < 5): Always planar
 * 2. Edge count heuristic: If m > 3n - 6, then nonplanar (necessary condition)
 * 3. For small graphs (n <= 10): Check for K5 and K3,3 subgraphs
 * 4. For large graphs: Return unconstrained if heuristic passes
 *
 * @param g - Analyzer graph
 * @param _policy - Computation policy (unused)
 * @returns Planar property: "planar", "nonplanar", or "unconstrained"
 */
export declare const computePlanar: (g: AnalyzerGraph, _policy?: ComputePolicy) => Planar;
//# sourceMappingURL=geometric.d.ts.map