Pathway Straight Curved Zigzag Pattern Classifier
Classify actual sampled local planar dance path by caller turn tolerance and alternating-turn count; sampling-dependent screen, no spline curvature proof, coordinate transformation or collision safety.
Description
Sampled path turns provide a caller-defined straight/curved/zigzag screen.
Sampled path turns provide a caller-defined straight/curved/zigzag screen. Classification depends on sampling and tolerance.1
Enter at least three planar local meter points, tolerance 0≤value<90 degrees and integer minimum changes 1–126. Require nonzero finite consecutive segments; normalize them and retain turns strictly beyond tolerance. Return turns, direction-change count and class.
When to use Pathway Straight Curved Zigzag Pattern Classifier
Use Pathway Straight Curved Zigzag Pattern Classifier when you need to evaluate the supplied records under the calculation and evidence rules below. No spline curvature, coordinate transform, collision safety or continuous-path proof is supplied.
Prepare the annotated dance, timing, rehearsal or inventory records requested. Supply caller rules, evidence flags and local reference values; distinguish beats, bars, counts and seconds.
How to use Pathway Straight Curved Zigzag Pattern Classifier and understand its results
- Prepare the annotated dance, timing, rehearsal or inventory records requested. Supply caller rules, evidence flags and local reference values; distinguish beats, bars, counts and seconds.
- Enter observedLocalPathPointsM, callerStraightTurnToleranceDegrees, callerMinimumZigzagDirectionChanges using the field table and calculation rules, then run the tool.
- Read signedInteriorPathTurnsDegrees, pathTurnDirectionChanges, callerPathShapeClass. The explanation below defines the units, signs, ordering and any flags or placeholder values.
- If the tool reports an input issue, correct the values and run it again. Apply the stated assumptions when interpreting a successfully returned result.
| Input field | Meaning | Value type; see rules below | Requirement |
|---|---|---|---|
| observedLocalPathPointsM | Observed local path points m | list of list of number | Required |
| callerStraightTurnToleranceDegrees | Caller straight turn tolerance degrees | number | Required |
| callerMinimumZigzagDirectionChanges | Caller minimum zigzag direction changes | number | Required |
Enter at least three planar local meter points, tolerance 0≤value<90 degrees and integer minimum changes 1–126. Require nonzero finite consecutive segments; normalize them and retain turns strictly beyond tolerance. Return turns, direction-change count and class.
turn=atan2(segmentCross,segmentDot); zigzag=signChanges≥minimum Units, indexing, boundary conditions and exceptional cases are defined in the calculation rules above.
| Output field | Meaning | Value type |
|---|---|---|
| signedInteriorPathTurnsDegrees | Signed interior path turns degrees | list of number |
| pathTurnDirectionChanges | Path turn direction changes | number |
| callerPathShapeClass | Caller path shape class | string |
{
"input": {
"observedLocalPathPointsM": [
[
0,
0
],
[
1,
0
],
[
1,
1
],
[
2,
1
]
],
"callerStraightTurnToleranceDegrees": 5,
"callerMinimumZigzagDirectionChanges": 1
},
"output": {
"signedInteriorPathTurnsDegrees": [
90,
-90
],
"pathTurnDirectionChanges": 1,
"callerPathShapeClass": "zigzag"
}
}Limitations and assumptions
No spline curvature, coordinate transform, collision safety or continuous-path proof is supplied.
Numeric inputs, where present, must be finite. Follow the calculation-specific rules for overflow, underflow and exceptional cases. Matrices are limited to 128 rows and 128 entries per row. Numeric lists are limited to 10,000 entries; string lists to 128 strings of at most 128 characters each. The rules above may impose smaller limits. Missing required fields, extra fields, wrong value types and violations of the calculation rules are input errors.
Alternative or Complementary methods
Use Line Spacing Even Interval Checker: Even line spacing is checked from ordered one-axis positions. Signed errors show compressed and enlarged gaps. For a complementary task, use Formation Swap Minimum Position Moves Solver: A fixed-identity formation permutation has a minimum unrestricted pair-swap count. It does not minimize physical travel.
References
Similar or alternative tools
- Line Spacing Even Interval Checker
Even line spacing is checked from ordered one-axis positions. Signed errors show compressed and enlarged gaps.
- Formation Swap Minimum Position Moves Solver
A fixed-identity formation permutation has a minimum unrestricted pair-swap count. It does not minimize physical travel.