Corpus ID: 2989693

Space-Filling Trees

@inproceedings{Kuffner2009SpaceFillingT,
  title={Space-Filling Trees},
  author={James J. Kuffner and Steven M. LaValle},
  year={2009}
}
This paper introduces the notion of space-filling trees, which are analogous to space-filling curves, but have a branching, tree-like structure and are rooted. A space-filling tree is defined by an incremental process that results in a tree for which every point in the space has a finite-length path that converges to it. In contrast to space-filling curves, individual paths in the tree are short, allowing any part of the space to be quickly reached from the root. These structures have… CONTINUE READING

Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

Citations

Publications citing this paper.
SHOWING 1-4 OF 4 CITATIONS

Covering space with simple robots: From chains to random trees

VIEW 5 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Modelling angiogenesis in three dimensions

VIEW 1 EXCERPT
CITES BACKGROUND

Sampling-based algorithms for optimal motion planning

VIEW 1 EXCERPT
CITES BACKGROUND

Incremental Sampling-based Algorithms for Optimal Motion Planning

VIEW 1 EXCERPT
CITES BACKGROUND

References

Publications referenced by this paper.
SHOWING 1-10 OF 25 REFERENCES

Randomized Kinodynamic Planning

VIEW 8 EXCERPTS

Path planning in 1000+ dimensions using a task-space Voronoi bias

VIEW 1 EXCERPT

Planning algorithms

VIEW 2 EXCERPTS

Maneuver-based motion planning for nonlinear systems with symmetries

VIEW 1 EXCERPT

Analysis of Multi-Dimensional Space-Filling Curves

VIEW 1 EXCERPT

RRTs for nonlinear, discrete, and hybrid planning and control

VIEW 1 EXCERPT