Connected Rectilinear Graphs on Point Sets

Authors:
Maarten Löffler;Elena Mumford
Affiliations:
Dept. Information and Computing Sciences, Utrecht University, The Netherlands;Dept. of Mathematics and Computer Science, TU Eindhoven, The Netherlands
Venue:
Graph Drawing
Year:
2009

Citing 5
Cited 0

Embedding rectilinear graphs in linear time

Information Processing Letters
Topologically sweeping an arrangement

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Angle-restricted tours in the plane

Computational Geometry: Theory and Applications
On the Computational Complexity of Upward and Rectilinear Planarity Testing

SIAM Journal on Computing
Embedding Planar Graphs at Fixed Vertex Locations

GD '98 Proceedings of the 6th International Symposium on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

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.