100 search results - page 4 / 20 » Planar Visibility Counting |
CSR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract. While visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages, the complexity of their members...
ENDM
2007
14 years 10 months ago
2007
Fix a family T of 3-connected graphs, and let G be the class of graphs whose 3connected components are the graphs in T . We present a general framework for analyzing such graph cl...
85
Voted
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
A new approach is presented for 3D shape recovery of local planar surface patches from two shift/spacevariant defocused images. It is based on a recently proposed technique for in...
CDC
2010
IEEE
14 years 5 months ago
2010
IEEE
In this paper we consider visual feedback attitude synchronization in leader-follower type visibility structures in SE(3). We first define visual robotic networks consisting of the...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Reachability and distance computation are known to be NL-complete in general graphs, but within UL co-UL if the graphs are planar. However, finding longest paths is known to be N...