3092 search results - page 37 / 619 » Where are you pointing |
CCCG
2006
13 years 10 months ago
2006
In this paper, we propose an algorithm for computing the farthest-segment Voronoi diagram for the edges of a convex polygon and apply this to obtain an O(n log n) algorithm for th...
SODA
1996
ACM
13 years 10 months ago
1996
ACM
Given a convex polygon P with m vertices and a set S of n points in the plane, we consider the problem of nding a placement of P that contains the maximum number of points in S. W...
ICPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Correspondence algorithms typically struggle with shapes that display part-based variation. We present a probabilistic approach that matches shapes using independent part transfor...
VLDB
2004
ACM
14 years 2 months ago
2004
ACM
In this paper, we address the maintenance of spatial semijoin queries over continuously moving points, where points are modeled as linear functions of time. This is analogous to t...
CCCG
2010
13 years 10 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...