132 search results - page 10 / 27 » Vanishing Point Detection with an Intersection Point Neighbo... |
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
JCT
2008
14 years 11 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
CAD
1999
Springer
14 years 11 months ago
1999
Springer
This article presents an efficient and robust algorithm that computes the intersection curve of two ruled surfaces. The surface intersection problem is reformulated as a zero-set ...
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
Scene flow represents the 3-D motion of points in the scene, just as optical flow is related to their 2-D motion in the images. As opposed to classical methods which compute scene...
ICIP
2009
IEEE
16 years 22 days ago
2009
IEEE
We propose a method to detect objects and patterns in textures on general surfaces. Our approach applies the Chan?Vese variational model for active contours without edges to the p...