A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
New dynamic data structures are given that maintain a closest pair of S. For D ≥ 3, a structure of size O(n) is presented with amortized update time O((log n) D−1 log log n). ... This is the first dynamic data structure for this problem having close to linear size and polylogarithmic query and update times. ... We can transform DS into another data structure for the dynamic closest pair problem having Concluding remarks We have given new techniques for solving the dynamic approximate nearest-neighbor problem ...doi:10.1137/s0097539793259458 fatcat:z2qanvql6za4fgorobw2l2xb7m
New dynamic data structures are given that maintain a closest pair of S. For D ≥ 3, a structure of size O(n) is presented with amortized update time O((log n) D−1 log log n). ... This is the first dynamic data structure for this problem having close to linear size and polylogarithmic query and update times. ... We can transform DS into another data structure for the dynamic closest pair problem having Concluding remarks We have given new techniques for solving the dynamic approximate nearest-neighbor problem ...doi:10.1145/177424.177621 dblp:conf/compgeom/KapoorS94 fatcat:kbxc2olnoja4he6vsvzo45oxkq
Tsai, "A versatile camera calibration technique for high-accuracy 3D machine vision metrology using off-the-shelf tv cameras and lenses," Abstract-A new minimum-distance tracking algorithm is presented ... points is computed (i.e., the 2 of the least-squares approximation), as in . ... Gilbert and J. Grizzle and the helpful comments of anonymous reviewers. ...doi:10.1109/tro.2005.847569 fatcat:7v7dh5miqnaadnp72tbq5uisyq
In this paper we have presented a novel technique for the navigation and path formulation of wheeled mobile robot. ... This paper considers the problem of robot motion formulation in an environment having already known obstacles and unknown new moving objects. ... Distance at this closest point of approach is the distance separating mobile robot and object when closest point of approach has reached. ...doaj:0a928a8cfc314c2da4d11b724990bbc4 fatcat:u4rsx45benbshaj7ljswpqjgpe
The Hierarchical Cellular Tree (HCT), a MAM-based indexing technique, provides the starting point of our work. ... retrieval time and the retrieval accuracy. ... Acknowledgment This work was partially founded by the Catalan Broadcasting Corporation through the Spanish project CENIT-2009-1026 BuscaMedia, by TEC2010-18094 MuViPro project of the Spanish Government, and ...doi:10.1007/s11042-013-1686-3 fatcat:pfybxs2phrhzhhy3jrrkunrira
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including classification, clustering ... However, for many domains, the inherent streaming nature of time series demands online discovery and maintenance of time series motifs. ... We believe that for the general dynamic closest pair problem these are currently the best two choices. ...doi:10.1145/1835804.1835941 dblp:conf/kdd/MueenK10 fatcat:otdp2zqfrjgazimsz7w6q6mmsq
Lecture Notes in Computer Science
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally efficient procedures for finding objects similar to a query ... The first method considers the Riemannian geometry of the manifold and performs Spectral Hashing in the tangent space of the manifold at several points. ... Acknowledgments The authors would like to thank Kinh Tieu, Ashok Veeraraghavan and Oncel Tuzel for their comments and discussions that helped improve the presentation of this work. ...doi:10.1007/978-3-642-15552-9_53 fatcat:r3olrfaugnepfnxbv5rsiiiasq
polygon vertices.” 97¢:68157 68U05 Kapoor, Sanjiv (6-IITND-C; New Delhi); Smid, Michiel (D-MPI-1; Saarbriicken) New techniques for exact and approximate dynamic closest-point problems. ... This is the first dynamic data structure for this problem having close to linear size and polylogarithmic query and update times. ...
Ravi, A polylogarith- mic approximation algorithm for the group Steiner tree problem (253-259); Sergej Fialko and Petra Mutzel, A new approxima- tion algorithm for the planar augmentation problem (extended ... Eppstein, Fast hierarchical clustering and other applications of dynamic closest pairs (619-628). ...
Main Results: We present a novel algorithm to approximate global PDs between rigid objects for interactive applications using machine learning classification techniques. ... Our approach is applicable to all rigid models and can compute translational and gener- ... We are also grateful to the reviewers for their feedback. ...doi:10.1145/2508363.2508305 fatcat:gsxmbpv74nbu5lcnn6w5ndnrm4
For each sample point, we compute the closest site and the distance to that site using polygon scan-conversion and the Z-buffer depth comparison. ... We generalize to weighted and farthest-site Voronoi diagrams, and present efficient techniques for computing the Voronoi boundaries, Voronoi neighbors, and the Delaunay triangulation of points. ... We would also like to thank Sarah Hoff for extensive help with editing and color plates, Chris Weigle for suggesting mosaicing using 2D point Voronoi diagrams, the UNCwalkthrough group for the house model ...doi:10.1145/311535.311567 dblp:conf/siggraph/HoffKLMC99 fatcat:rt3plrqconhbddkbnjjhkeyroa
AbstractÐWe introduce a new algorithm for computing the distance from a point to an arbitrary polygonal mesh. ... We illustrate our algorithm with a simulation of particle dynamics and collisions with a deformable mesh, the computation of distance maps and offset surfaces, the computation of an approximation to the ... Thanks to Fausto Bernardini for providing an implementation of a hierarchical closest point method using an octree that was used for comparison purposes. ...doi:10.1109/2945.910820 fatcat:e6535pp2w5etna6wu6kxs7q7si
The VLDB journal
We present both the exact and approximate versions of the proposed techniques and provide error bounds for the approximate case. ... The sketch of the data is updated incrementally as the new data points are received. Then, the approximate wavelet-based summary is obtained as a batch process from this sketch. ... Since there is a model for solving this minimization problem recursively, we can compute and update the DFT coefficients dynamically as the new elements arrive. ...doi:10.1007/s00778-004-0149-x fatcat:dcdyaibydjd6jef2h5ry6pbxxy
Eurographics State of the Art Reports
Our novel closest point contouring algorithm (CPC) uses the full closest point field, and, thus, allows improving existing methods for high-quality triangle mesh reconstruction based on implicit function ... models: Since we select the vertex positions directly from the set of closest points, all triangle vertices are guaranteed to lie exactly on the zero-contour and no approximations are necessary. ... closest point (CP) on the continuous surface. ...doi:10.2312/conf/eg2013/short/001-004 fatcat:4dffwurnxvbavgg3srzmruzsre
The exact algorithm is capable finding the optimal result for small values of k (e.g., k = 2) in interactive time, while the approximation algorithm, which has a 5-approximation ratio, is suitable for ... To compute the query efficiently, we develop two algorithms, including an exact algorithm and an approximation algorithm. ... He has received several national and international awards for his research. ...doi:10.1109/tkde.2015.2509998 fatcat:ejiqnbnauzckba7m6xk7yhg34y
« Previous Showing results 1 — 15 out of 82,831 results