Space-Filling Trees

James Kuffner and Steven M. LaValle
tech. report CMU-RI-TR-09-47, Robotics Institute, Carnegie Mellon University, December, 2009


Download
  • Adobe portable document format (pdf) (2MB)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract
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 interesting parallels in nature, including fluid distribution systems, vascular networks, and fractal plant growth, and may have many uses in engineering and computer science. We provide basic examples, general definitions and constructions, characterizations of some tree properties, and leave many open mathematical questions.

Notes
Number of pages: 8

Text Reference
James Kuffner and Steven M. LaValle, "Space-Filling Trees," tech. report CMU-RI-TR-09-47, Robotics Institute, Carnegie Mellon University, December, 2009

BibTeX Reference
@techreport{Kuffner_2009_6539,
   author = "James Kuffner and Steven M. LaValle",
   title = "Space-Filling Trees",
   booktitle = "",
   institution = "Robotics Institute",
   month = "December",
   year = "2009",
   number= "CMU-RI-TR-09-47",
   address= "Pittsburgh, PA",
}