pegsym op• Data kinds: matrix × matrix → table
• Call: import fullseye as fs; fs.ledger.polygon_fit_check(peg_points, hole_vertices) -> 'dict' (to call the implementation directly, import pegsym; pegsym.polygon_fit_check(peg_points, hole_vertices) -> 'dict'; from the registry, opsdrive.get("polygon_fit_check"))
Whether a point set (peg vertices, or projected vertices of a tilted peg) can be put into a convex polygonal hole by translation alone — solves the linear program maximizing the margin m, max m s.t. n_j·(p + t) ≤ h_j − m (all points, all edges), exactly by enumerating vertices where 3 constraints hold with equality (at most a dozen or so edges; the combinations are solved together). Returns fit (m ≥ 0), margin [m] (if negative, the minimum penetration), t (optimal translation (2,)) and active (indices of the equality edges). Raises ValueError: point set is not (N ≥ 1, 2) or not finite, hole is not a convex polygon, hole normals do not enclose all directions (unbounded).
• Sample-data catalog (download URLs / licences) — 2-D uses skimage.data (BSD/public domain) plus synthetic images; 3-D lists download URLs for real data sources (Stanford, PDS, …).
• Operator provenance and references — the sources of the research/methods this op family came from.
• The canonical algorithm (author, year) and its uses are named in the family usage guide above.
• poc_peg_symmetry_search — py -3.11 examples/poc_peg_symmetry_search.py
table as input)course_layout · course_occupancy · course_contains · world_build · world_camera · world_move · lidar_scan · rss_longitudinal_same
pegsym)polygon_peg · polygon_offset · rotation_window · polygon_two_point_depth · polygon_coverage_image · plane_topview · polygon_yaw_read · relative_yaw_from_images
*Provenance: pegsym.py — DRIVE operator registry. This per-op note is generated by tools/opdocs.py md (do not hand-edit).*
© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.