From returns to connected lanes
Explore the graphTwo illustrative lane boundaries over a synthetic point cloud.
Current work
My focus is lane detection from LiDAR using graph theory.
Explore the idea
In this illustration, each return becomes a node. Nearby nodes connect into a directed graph, and paths through that graph trace two candidate lane boundaries. A smaller connection radius can break a path; a larger radius introduces more possible connections.
The experiment demonstrates the idea of graph connectivity. It is not a reconstruction of the project’s implementation or a claim about detection accuracy.