A Polynomial Bound for Untangling Geometric Planar Graphs

Authors:
Prosenjit Bose;Vida Dujmović;Ferran Hurtado;Stefan Langerman;Pat Morin;David R. Wood
Affiliations:
Carleton University, School of Computer Science, Ottawa, Canada;McGill University, Department of Mathematics and Statistics, Montreal, Canada;Universitat Politècnica de Catalunya, Departament de Matemàtica Aplicada II, Barcelona, Spain;Université Libre de Bruxelles, FNRS, Département d’Informatique, Brussels, Belgium;Carleton University, School of Computer Science, Ottawa, Canada;The University of Melbourne, Department of Mathematics and Statistics, Melbourne, Australia
Venue:
Discrete & Computational Geometry
Year:
2009

Citing 0
Cited 4

Untangling planar graphs from a specified vertex position-Hard cases

Discrete Applied Mathematics
A center transversal theorem for hyperplanes and applications to graph drawing

Proceedings of the twenty-seventh annual symposium on Computational geometry
On collinear sets in straight-line drawings

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Upper bound constructions for untangling planar geometric graphs

GD'11 Proceedings of the 19th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

LP-type problems is a successful axiomatic framework for optimization problems capturing, e.g., linear programming and the smallest enclosing ball of a point set. In Matoušek and Škovroň (Theory Comput. 3:159–177, 2007), ...