Ломаные
и сегменты.

for i = 0 .. n-2: segment[i] = P[i] → P[i+1] geometry[i] = Compo2.01(segment[i]) segmentCount = n - 1 pathLengthPx = Σ geometry[i].lengthPx straightDistancePx = distance(P0, Pn) pathEfficiency = straightDistancePx / pathLengthPx

Line.pathGeometry = { geometryType: "polyline", pathLengthPx: Σ segment[i].lengthPx, pathLengthShortN: pathLengthPx / min(W,H), pathLengthDiagN: pathLengthPx / diagonalPx, chordLengthPx: distance(P0,Pn), boundsN: bounds(all vertices), spatialExtentX_N: boundsWidthPx / min(W,H), spatialExtentY_N: boundsHeightPx / min(W,H), spatialExtentShortN: max(boundsWidthPx,boundsHeightPx)/min(W,H), startPointN: P0, endPointN: Pn, startTangent: unit(segment[0]), endTangent: unit(segment[last]) }

localScore = w_valid * segment_validity + w_turn * turn_intent_score + w_ratio * segment_ratio_score + w_role * role_topology_fit + w_seg * segmentation_fit - w_self * self_intersection_penalty - w_near * near_touch_penalty - w_complex * complexity_excess // weights = STYLE_PRESET / engine defaults // localScore != final composition score

function analyzePolyline(polyline, scene): assert points.length >= 2 // 1. SEGMENTS segments = buildSegments(points) for each s in segments: geometry[s] = Compo2.01.compute(s) if !geometry[s].valid: return REPAIR_OR_REJECT // 2. TURNS for i = 0 .. segmentCount-2: turn[i] = signedAngle(unit[i], unit[i+1]) bend[i] = abs(turn[i]) // 3. REDUNDANT VERTICES if bend[i] < mergeThresholdDeg AND vertex[i+1] is not semanticAnchor: propose REMOVE_VERTEX(i+1) // 4. PROPORTIONS compute segmentRatio[] compute lengthCV detect microSegments // 5. TOPOLOGY count selfIntersections count nearTouches compute bendDensity // 6. ROLE POLICY apply connector / annotation / trajectory / accent / texture rules // 7. LOCAL SCORE score candidates // 8. CORRECTIONS candidates += simplify() candidates += moveVertex() candidates += removeVertex() candidates += orthogonalize() if style allows candidates += respaceDash() if segmented stroke // 9. CONTEXT request DEFERRED_INPUT metrics provide candidates to global solver

{ "module": "Compo 2.05", "name": "polyline_and_segmented_lines", "version": "1.0", "consumes": [ "Compo0.Canvas", "Compo0.ProtectedZones", "Compo2.00.Line.role", "Compo2.01.SegmentGeometry", "Polyline.points", "Line.directed", "StylePreset?" ], "owner_of": [ "polyline.segmentCount", "polyline.pathLengthPx", "polyline.pathEfficiency", "polyline.turnAngleDeg[]", "polyline.turnSign[]", "polyline.segmentRatio[]", "polyline.lengthCV", "polyline.bendDensity", "polyline.selfIntersectionCount", "polyline.nearTouchCount", "polyline.segmentationDescriptor", "line.pathGeometry(polyline-adapter)" ], "provides": [ "PolylineDescriptor", "PolylineRepairProposal[]", "PolylineCandidate[]", "SegmentedStrokeDescriptor", "Line.pathGeometry" ], "initial_heuristics": { "merge_bend_threshold_deg": 3, "weak_bend_upper_deg": 12, "near_reverse_deg": 160, "regular_length_cv_max": 0.08, "controlled_length_cv_max": 0.25, "expressive_length_cv_max": 0.55, "micro_segment_ratio": 0.10 }, "deferred_inputs": [ "global.eye_flow_score", "global.balance_score", "global.negative_space_score", "global.hierarchy_score", "global.rhythm_score" ], "turn_sign_convention": "cross>0 CLOCKWISE_RIGHT; cross<0 COUNTER_CLOCKWISE_LEFT in +Y down screen space", "hard_rules": [ "adjacent vertices must not coincide", "semantic anchors cannot be removed by simplification", "annotation self-intersection is forbidden by default", "connector protected-zone policy must be respected" ], "corrective_actions": [ "remove_redundant_vertex", "merge_micro_segment", "move_vertex", "orthogonalize_if_allowed", "reroute", "simplify", "respace_dash_pattern" ], "finality": "LOCAL_PROPOSAL_ONLY" }