maliput / maliput/maliput_sparse
Automatically fill up the branchpoints based on the start and end points of the lanes
Nobody has claimed this yet.
- Dominant language
- C++
- Stars
- 0
- Forks
- 1
- PR merge metrics
- No merged PRs in 30d
Description
### Context
The user is expected to provide the connections between the lanes using the builder api for that.
```cpp
...
.StartBranchPoints()
.Connect(kLaneAId, finish, kLaneBId, start)
.Connect(kLaneAId, finish, kLaneCId, start)
.Connect(kLaneAId, finish, kLaneDId, start)
.EndBranchPoints()
...
```
### Request
User should:
- A: Manually add the connections
- B: Let the builder automatically find connections and fill up branchpoints.
A and B should be mutually exclusive
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
Start with the builder API usage in the issue, especially StartBranchPoints(), Connect(), and EndBranchPoints(). Determine how connections can be inferred from lane start and end points, and define how automatic and manual modes remain mutually exclusive. Done means the builder supports the requested automatic behavior without allowing both connection modes together.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- cpp
- Domain
- backend-api-design
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Mostly clear
- Newbie friendliness
- 35/100