Di Giacomo, Emilio

Didimo, Walter

Liotta, Giuseppe

Wismath, Stephen K.

English

AbstractLet C be the family of 2D curves described by concave functions, let G be a planar graph, and let L be a linear ordering of the vertices of G. L is a curve embedding of G if for any given curve Λ∈C there exists a planar drawing of G such that: (i) the vertices are constrained to be on Λ with the same ordering as in L, and (ii) the edges are polylines with at most one bend. Informally speaking, a curve embedding can be regarded as a two-page book embedding in which the spine is bent. Although deciding whether a graph has a two-page book embedding is an NP-hard problem, in this paper it is proven that every planar graph has a curve embedding which can be computed in linear time. Applications of the concept of curve embedding to upward drawability and point-set embeddability problems are also presented

Elsevier - Publisher Connector 

Curve-constrained drawings of planar graphs 

Open Access Repository

Curve-constrained drawings of planar graphs

file:///data/remote/core/dit/data/elsevier/pdf/3f2/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDkyNTc3MjEwNDAwMDYxNg==.pdf

Curve-constrained drawings of planar graphs

Abstract

Similar works

Full text

Available Versions

Elsevier - Publisher Connector

Open Access Repository

Elsevier - Publisher Connector