450 search results - page 26 / 90 » Quadrangulations of Planar Sets |
ESA
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
IPL
2006
14 years 11 months ago
2006
Let TS be the set of all crossing-free straight line spanning trees of a planar n-point set S. Consider the graph TS where two members T and T of TS are adjacent if T intersects T...
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
We present a focus-based method to recover the orientation
of a textured planar surface patch from a single image.
The method exploits the relationship between the orientation
o...
103
click to vote
GMP
2008
IEEE
15 years 6 months ago
2008
IEEE
We propose a method to identify planar regions in volume data using a specialized version of the discrete Radon transform operating on a structured or unstructured grid. The algori...
WG
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...