7351 search results - page 47 / 1471 » Segmenting Point Sets |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph D has an upward planar embedding into a point set S. W...
SCALESPACE
2007
Springer
14 years 4 months ago
2007
Springer
Scale space interest points capture important photometric and deep structure information of an image. The information content of such points can be made explicit using image recons...
COMPGEOM
2004
ACM
14 years 3 months ago
2004
ACM
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
SOFSEM
2007
Springer
14 years 4 months ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
DAM
2006
13 years 10 months ago
2006
To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...