24 search results - page 1 / 5 » Rubberband Algorithms for Solving Various 2D or 3D Shortest ... |
ICCTA
2007
IEEE
13 years 8 months ago
2007
IEEE
CCCG
2010
13 years 6 months ago
2010
So far, the best result in running time for solving the fixed watchman route problem (i.e., shortest path for viewing any point in a simple polygon with given start point) is O(n3...
PAMI
2010
13 years 3 months ago
2010
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
ECCV
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
CAINE
2008
13 years 6 months ago
2008
This paper describes an algorithm that pieces together 2D fragments of an object. Matching fragments of an object is useful for solving puzzles or reassembling archaeological frag...