@inproceedings{f8a3b476a7f64c26bdb9414f97a61b5d,

title = "Connected rectilinear graphs on point sets",

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.",

author = "M. L{\"o}ffler and E. Mumford",

year = "2009",

doi = "10.1007/978-3-642-00219-9_30",

language = "English",

isbn = "978-3-642-00218-2",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "313--318",

editor = "I.G. Tollis and M. Patrignani",

booktitle = "Graph Drawing (16th International Symposium, GD'08, Heraklion, Crete, Greece, September 21-24, 2008, Revised Papers)",

address = "Germany",

}