Connected Rectilinear Graphs on Point Sets

DOI10.1007/978-3-642-00219-9_30zbMath1213.68466OpenAlexW2207772844MaRDI QIDQ3611865

Maarten Löffler, Elena Mumford

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_30

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Covering points with minimum/maximum area orthogonally convex polygons ⋮ Reconstructing orthogonal polyhedra from putative vertex sets ⋮ Covering points with orthogonal polygons ⋮ Covering points with orthogonally convex polygons ⋮ Connected Rectilinear Graphs on Point Sets

Cites Work

• Unnamed Item
• Embedding rectilinear graphs in linear time
• Topologically sweeping an arrangement
• How good is the information theory bound in sorting?
• The complexity of detecting crossingfree configurations in the plane
• Angle-restricted tours in the plane.
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Connected Rectilinear Graphs on Point Sets
• Rectilinear Graphs and Their Embeddings
• Graph Drawing

This page was built for publication: Connected Rectilinear Graphs on Point Sets