553 search results - page 31 / 111 » On Planar Path Transformation |
118
click to vote
PR
2000
15 years 14 days ago
2000
A novel method based on shape morphing is proposed for 2D shape recognition. In this framework, the shape of objects is described by using their contour. Shape recognition involve...
96
Voted
ASPDAC
2007
ACM
15 years 4 months ago
2007
ACM
Abstract-- We present the short-circuit code transformation technique, intended for embedded compilers. The transformation technique optimizes conditional blocks in high-level prog...
108
Voted
GD
2009
Springer
15 years 5 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
119
Voted
FCT
2009
Springer
15 years 4 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
117
click to vote
SIAMCOMP
1998
15 years 10 days ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...