pith. sign in

arxiv: 1506.04092 · v3 · pith:72SEZSVJnew · submitted 2015-06-12 · 💻 cs.CG · math.CO

The Utility of Untangling

classification 💻 cs.CG math.CO
keywords discretegeometryresultssomeuntanglinganswerbosecolumn
0
0 comments X
read the original abstract

In this note we show how techniques developed for untangling planar graphs by Bose et al. [Discrete & Computational Geometry 42(4): 570-585 (2009)] and Goaoc et al. [Discrete & Com- putational Geometry 42(4): 542-569 (2009)] imply new results about some recent graph drawing models. These include column planarity, universal point subsets, and partial simultaneous geometric embeddings (with or without mappings). Some of these results answer open problems posed in previous papers.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.