Now showing items 1-2 of 2

• #### A polynomial bound for untangling geometric planar graphs ﻿

(2009-12)
Article
Open Access
To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos (Discrete Comput. Geom. 28(4): 585–592, 2002) asked if every n-vertex geometric planar ...
• #### Connectivity-preserving transformations of binary images ﻿

(2009-10)
Article
Open Access
A binary image $\emph{I}$ is $B_a$, $W_b$-connected, where $\emph{a,b}$ ∊ {4,8}, if its foreground is $\emph{a}$-connected and its background is $\emph{b}$-connected. We consider a local modification of a $B_a$, $W_b$-connected ...