641 search results - page 59 / 129 » On Planar Quasi-Parity Graphs |
143
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which the mapping between the vertices of the two graphs is given...
151
click to vote
ENDM
2008
15 years 6 months ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
150
click to vote
IPL
2007
15 years 6 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
178
click to vote
ISPD
2010
ACM
16 years 1 months ago
2010
ACM
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
157
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
We present a new algorithm that enables a convex shaped robot to explore an unknown planar workspace, i.e., an unknown configuration space diffeomorphic to SE(2). This new algor...