Buscar
Mostrando ítems 1-2 de 2
Ponencia
Planar embeddability of the vertices of a graph using a fixed point set is NP-hard
(2004)
Let G = (V, E) be a graph with n vertices and let P be a set of n points in the plane. We show that deciding whether there is a planar straight-line embedding of G such that the vertices V are embedded onto the points P is ...
Ponencia
Maximizing the area of overlap of two unions of disks under rigid motion
(2004)
Let A and B be two sets of n resp. m (m ≥ n) disjoint unit disks in the plane. We consider the problem of finding a rigid motion of A that maximizes the total area of its overlap with B. The function describing the area ...