Browsing by Author "Dujmovic, Vida"

A polynomial bound for untangling geometric planar graphs
Bose, Prosenjit; Dujmovic, Vida; Hurtado Díaz, Fernando Alfredo; Langerman, Stefan; Morin, Pat; Wood, David (200912)
Article
Open AccessTo 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 nvertex geometric planar ... 
Connectivitypreserving transformations of binary images
Bose, Prosenjit; Dujmovic, Vida; Hurtado Díaz, Fernando Alfredo; Morin, Pat (200910)
Article
Open AccessA 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 ... 
Coverage with ktransmitters in the presence of obstacles
Uehara, R.; Souvaine, D.; Sacristán Adinolfi, Vera; Morin, P.; Lubiw, A.; Iacono, J.; Ballinger, B.; Benbernou, N.; Bose, P.; Damian, M.; Demaine, E. D.; Dujmovic, Vida; Flatland, R.; Hurtado Díaz, Fernando Alfredo (Springer Verlag, 2010)
Conference report
Restricted access  publisher's policyFor a fixed integer k ≥ 0, a ktransmitter is an omnidirectional wireless transmitter with an infinite broadcast range that is able to penetrate up to k “walls”, represented as line segments in the plane. We develop lower ... 
Every large point set contains many collinear points or an empty pentagon
Wood, David; Por, Attila; Abel, Zachary; Ballinger, Brad; Bose, Prosenjit; Collette, Sébastien; Dujmovic, Vida; Hurtado Díaz, Fernando Alfredo; Kominers, Scott Duke; Langerman, Stefan (201101)
Article
Restricted access  publisher's policyWe prove the following generalised empty pentagon theorem for every integer ℓ ≥ 2, every sufficiently large set of points in the plane contains ℓ collinear points or an empty pentagon. As an application, we settle the next ...