999 search results - page 140 / 200 » Finding shapes in a set of points |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
125
click to vote
CVPR
2010
IEEE
14 years 7 months ago
2010
IEEE
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
SSD
2001
Springer
15 years 2 months ago
2001
Springer
Recently there is much interest in moving objects databases, and data models and query languages have been proposed offering data types such as moving point and moving region toge...
163
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
142
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...