M. Gavrilov, P. Indyk, R. Motwani, and S. Venkatasubramanian. Geometric pattern matching: A performance study. In Proc. of the 15th Annual ACM Symposium on Computational Geometry, pages 79--85, 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Dense Point Sets Have Sparse Delaunay Triangulations or ". . .. - Erickson (2002) (2 citations) (Correct)
....dense point sets in IR d , which have spread O(n 1=d ) Valtr and others [33, 59, 60, 61, 62] have established several combinatorial results for dense point sets that improve corresponding bounds for arbitrary point sets. For other combinatorial and algorithmic results related to spread, see [15, 23, 37, 41, 42, 47]. In Section 2, we prove that the Delaunay triangulation of any set of n points in IR 3 with spread has complexity O( 3 ) In particular, the Delaunay triangulation of any dense point set in IR 3 has only linear complexity. This bound is tight in the worst case for all = O( p n) and ....
M. Gavrilov, P. Indyk, R. Motwani, and S. Venkatasubramanian. Geometric pattern matching: A performance study. Proc. 15th Annu. ACM Sympos. Comput. Geom., 79-85, 1999.
A Sweep Line Algorithm for Nearest Neighbour Queries - Joao Dinis Departamento (Correct)
No context found.
M. Gavrilov, P. Indyk, R. Motwani, and S. Venkatasubramanian. Geometric pattern matching: A performance study. In Proc. of the 15th Annual ACM Symposium on Computational Geometry, pages 79--85, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC