| Summary: | Let <em>V</em> be a set of <em>n</em> points in R<sup><em>d</em></sup>. We study the question whether there exists an orientation such that <em>V</em> is the vertex set of a connected rectilinear graph in that orientation. A graph is rectilinear if its edges are straight line segments in <em>d</em> pairwise perpendicular directions. We prove that at most one such orientation can be possible, up to trivial rotations of 90 degrees around some axis. In addition, we present an algorithm for computing this orientation (if it exists) in <em>O</em>(<em>n</em><sup><em>d</em></sup>) time when <em>d</em>≥2.
|
|---|
