Skip to content

matlab/matlab-agentic-toolkit / skills-catalog/automotive/roadrunner-build-rrhd-map

roadrunner-build-rrhd-map

Verified

Build, convert, and import RoadRunner HD Maps (.rrhd) in MATLAB. Author lanes, lane boundaries, markings, junctions, signs, barriers, and speed limits with roadrunnerHDMap; convert Lanelet2 (.osm, Autoware) maps to RRHD; resolve RoadRunner road asset paths for markings, crosswalks, signs, signals, and barriers; and import or build .rrhd or OpenDRIVE (.xodr) files into a RoadRunner scene. Use when creating road networks for driving simulation, converting Lanelet2 or other HD map sources to RRHD, looking up road asset paths, or loading and verifying a map in RoadRunner or RoadRunner Scene Builder. Not for building scenes from recorded sensor data, running simulations, or recreating OpenSCENARIO (.xosc) scenarios.

FileKindSize
SKILL.mdskill md15.5 KB
manifest.yamlconfig557 B
references/assets/assetCatalog.mdmarkdown7.4 KB
references/assets/barriers.mdmarkdown3.6 KB
references/assets/laneMarkings.mdmarkdown5.8 KB
references/assets/laneTypes.mdmarkdown2.2 KB
references/assets/signs.mdmarkdown5.0 KB
references/assets/staticObjects.mdmarkdown5.1 KB
references/authoring/alignmentRules.mdmarkdown10.3 KB
references/authoring/apiReference.mdmarkdown9.0 KB
references/authoring/authoringWorkflow.mdmarkdown20.4 KB
references/authoring/deduplicateBoundaries.mdmarkdown4.9 KB
references/authoring/junctionPolygon.mdmarkdown6.8 KB
references/authoring/leftGapFilter.mdmarkdown6.5 KB
references/authoring/orthogonalSplit.mdmarkdown7.7 KB
references/authoring/resolveHeights.mdmarkdown2.4 KB
references/authoring/snapEndpoints.mdmarkdown4.0 KB
references/authoring/splitClosedGeometry.mdmarkdown3.8 KB
references/authoring/synthesizeCenterLine.mdmarkdown4.6 KB
references/authoring/validateMap.mdmarkdown1.1 KB
references/import/buildOptions.mdmarkdown4.0 KB
references/import/importScene.mdmarkdown12.9 KB
references/lanelet2/buildRRHD.mdmarkdown14.2 KB
references/lanelet2/conversionPipeline.mdmarkdown13.3 KB
references/lanelet2/coordinates.mdmarkdown4.9 KB
references/lanelet2/discoverRelations.mdmarkdown2.4 KB
references/lanelet2/enforcementGate.mdmarkdown3.3 KB
references/lanelet2/extractGeometry.mdmarkdown3.4 KB
references/lanelet2/extractJunctions.mdmarkdown5.0 KB
references/lanelet2/extractLanelets.mdmarkdown2.6 KB
references/lanelet2/extractNonLaneElements.mdmarkdown14.4 KB
references/lanelet2/extractSemantics.mdmarkdown4.4 KB
references/lanelet2/extractTopology.mdmarkdown5.4 KB
references/lanelet2/placedObjects.mdmarkdown4.4 KB
references/lanelet2/readOSM.mdmarkdown4.0 KB
references/lanelet2/splitClosedRoads.mdmarkdown3.0 KB
scripts/detectAlignment.mother3.3 KB
scripts/detectClosedLoop.mother5.8 KB
scripts/detectJunctions.mother12.4 KB
scripts/discoverWayTypes.mother4.8 KB
scripts/parseOSM.mother4.0 KB
scripts/resolveHeightConflicts.mother6.8 KB
scripts/resolveSignAsset.mother7.2 KB
scripts/snapConnectedEndpoints.mother4.0 KB
scripts/validateRRHD.mother6.3 KB

references/authoring/synthesizeCenterLine.md

View on GitHub
# Center Line Synthesis Algorithm

Computes a center line from left and right boundary geometry using **arc-length parameterization** with orthogonal endpoint enforcement. Correctly handles boundaries with different point counts and curvature distributions. Must NOT use uniform `linspace` — arc-length is required.

## Inputs
| Parameter | Type | Description |
|-----------|------|-------------|
| `leftPts` | Nx3 double | Left boundary coordinates |
| `rightPts` | Mx3 double | Right boundary coordinates |

## Output
`centerPts` — Kx3 double, center line (K = max(10, round(avgLen), N, M)).

## Algorithm

### Step 1: Density-Based Point Count
```matlab
dL = diff(leftPts); segLenL = sqrt(sum(dL.^2, 2)); cumLenL = [0; cumsum(segLenL)];
dR = diff(rightPts); segLenR = sqrt(sum(dR.^2, 2)); cumLenR = [0; cumsum(segLenR)];
avgLen = (cumLenL(end) + cumLenR(end)) / 2;
nTarget = max([10, round(avgLen), size(leftPts,1), size(rightPts,1)]);
```

**Critical:** Use `max(10, round(avgLen), nLeft, nRight)` — 1 point per meter minimum. NEVER use just `max(nLeft, nRight)` which gives too few points for short lanes with sparse nodes.

### Step 2: Arc-Length Pchip Resampling
```matlab
tNormL = cumLenL / cumLenL(end);
tTarget = linspace(0, 1, nTarget)';
leftRes = zeros(nTarget, 3);
for dim = 1:3
    leftRes(:,dim) = interp1(tNormL, leftPts(:,dim), tTarget, 'pchip');
end

tNormR = cumLenR / cumLenR(end);
rightRes = zeros(nTarget, 3);
for dim = 1:3
    rightRes(:,dim) = interp1(tNormR, rightPts(:,dim), tTarget, 'pchip');
end
```

### Step 3: Midpoint Averaging
```matlab
centerPts = (leftRes + rightRes) / 2;
```

### Step 4: Orthogonal Endpoint Enforcement

**Skip for closed-loop lanes** — start and end within 1.0 m **and** length > 10 m (short sub-meter connector lanes are not loops). For all others with >= 4 points, enforce perpendicular start/end via 50% tangent blending:

```matlab
isClosedLoop = norm(centerPts(1,:) - centerPts(end,:)) < 1.0 && sum(vecnorm(diff(centerPts), 2, 2)) > 10;
if ~isClosedLoop && nTarget >= 4
    centerPts(1,:) = (leftRes(1,:) + rightRes(1,:)) / 2;
    centerPts(end,:) = (leftRes(end,:) + rightRes(end,:)) / 2;
    laneOverall = centerPts(end,1:2) - centerPts(1,1:2);

    % Start tangent: blend 50% toward perpendicular-to-cross-lane
    crossStart = rightRes(1,:) - leftRes(1,:);
    crossNorm = norm(crossStart(1:2));
    if crossNorm > 1e-6
        crossStart2D = crossStart(1:2) / crossNorm;
        desiredTan = [-crossStart2D(2), crossStart2D(1)];
        if dot(desiredTan, laneOverall) < 0, desiredTan = -desiredTan; end
        origVec = centerPts(2,:) - centerPts(1,:);
        origDist = norm(origVec);
        if origDist > 1e-6
            origDir2D = origVec(1:2) / norm(origVec(1:2));
            blended2D = 0.5*origDir2D + 0.5*desiredTan;
            blended2D = blended2D / norm(blended2D);
            centerPts(2,:) = centerPts(1,:) + [blended2D*origDist, origVec(3)];
        end
    end

    % End tangent: same blend (mirror)
    crossEnd = rightRes(end,:) - leftRes(end,:);
    crossNorm = norm(crossEnd(1:2));
    if crossNorm > 1e-6
        crossEnd2D = crossEnd(1:2) / crossNorm;
        desiredTan = [-crossEnd2D(2), crossEnd2D(1)];
        if dot(desiredTan, laneOverall) < 0, desiredTan = -desiredTan; end
        origVec = centerPts(end,:) - centerPts(end-1,:);
        origDist = norm(origVec);
        if origDist > 1e-6
            origDir2D = origVec(1:2) / norm(origVec(1:2));
            blended2D = 0.5*origDir2D + 0.5*desiredTan;
            blended2D = blended2D / norm(blended2D);
            centerPts(end-1,:) = centerPts(end,:) - [blended2D*origDist, origVec(3)];
        end
    end
end
```

**Why tangent blending?** Simple midpoint placement (Step 3) creates correct endpoint positions but the tangent at the endpoint may not be perpendicular to the lane cross-section. The 50% blend toward the perpendicular direction ensures smooth, orthogonal connections with successor/predecessor lanes.

**NEVER use simple `min(nPts)` truncation** — this loses curve information and produces non-smooth center lines.

## Common Failures This Prevents
| Failure Mode | Root Cause |
|---|---|
| Center line overshoots boundary at curved ends | Simple truncation lost curve info |
| Grass/gap at lane connections | Non-orthogonal endpoint misaligns with successor |
| Center line zigzags at mismatched boundaries | Linear interp instead of pchip |
| Lane has fewer points than its longest boundary | Used min(nPts) instead of density-based |

## Example
```matlab
leftPts  = [0 1 0; 50 1.5 0; 100 1 0];
rightPts = [0 -1 0; 30 -1.2 0; 60 -1.5 0; 100 -1 0];
% Apply Steps 1-4 above to compute centerPts from leftPts, rightPts
```

----

Copyright 2026 The MathWorks, Inc.

----
slack-gif-creatoranthropics/skillsKnowledge and utilities for creating animated GIFs optimized for Slack. Provides constraints, validation tools, and animation concepts. Use when users request animated GIFs for Slack like "make me a GIF of X doing Y for Slack."Stars: 198kUpdated Claude CodeCodexVerifiedInstall
ponytailDietrichGebert/ponytailLazy senior dev mode for any coding task: the smallest change that fully solves it, and a reply a busy human understands in one read.Stars: 194kUpdated Claude CodeCodexVerifiedInstall
ponytail-debtDietrichGebert/ponytailHarvest every shortcut: comment into one debt ledger, so deferrals get tracked instead of forgotten. One-shot report.Stars: 194kUpdated Claude CodeCodexVerifiedInstall
ponytail-debtDietrichGebert/ponytailList every `shortcut:` comment (and older `ponytail:` ones) as a debt ledger. One-shot report, changes nothing. Use for "ponytail debt", "what did ponytail defer", "list the shortcuts", /ponytail-debt.Stars: 194kUpdated Claude CodeCodexVerifiedInstall