7351 search results - page 155 / 1471 » Segmenting Point Sets |
143
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
136
click to vote
ESOP
1994
Springer
15 years 8 months ago
1994
Springer
Abstract. We convert, via a version that uses constraints, a type inference system for strictness analysis into an algorithm which given an expression finds the set of possible typ...
IJBC
2010
15 years 1 months ago
2010
Curves of parameter values for which an asymptotic value of F,(z) = 1 + e-z lies on a pre-pole of arbitrary order are found through an iterative method. Some of these curves are sh...
175
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
152
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
This paper presents GeoS, a new algorithm for the efficient segmentation of n-dimensional image and video data. The segmentation problem is cast as approximate energy minimization ...