Abstract
Given n points in d-dimensional space, we would like to connect the points with straight line segments to form a connected graph whose edges use d pairwise perpendicular directions. We prove that there exists at most one such set of directions. For d∈=∈2 we present an algorithm for computing these directions (if they exist) in O (n 2) time. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Löffler, M., & Mumford, E. (2009). Connected rectilinear graphs on point sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5417 LNCS, pp. 313–318). Springer Verlag. https://doi.org/10.1007/978-3-642-00219-9_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
