Results 1  10
of
475,195
Computing closest points for segments
 Int. J. Comput. Geom. Appl
"... Abstract We consider the proximity problem of computing for each of n line segments the closest point from a given set of n points in the plane. It generalizes Hopcroft's problem [11] and the nearest foreign neighbors problem [15]. We show that it can be solved in O(n ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract We consider the proximity problem of computing for each of n line segments the closest point from a given set of n points in the plane. It generalizes Hopcroft's problem [11] and the nearest foreign neighbors problem [15]. We show that it can be solved in O(n
Computing Closest Points for Segments
"... Abstract We consider the proximity problem of computing for each of n line segments the closest point from a given set of n points in the plane. We show that it can be solved in (i) O(n4=32O(log\Lambda n)) time, and (ii) O(n log2 n) time for the case of disjoint segments. ..."
Abstract
 Add to MetaCart
Abstract We consider the proximity problem of computing for each of n line segments the closest point from a given set of n points in the plane. We show that it can be solved in (i) O(n4=32O(log\Lambda n)) time, and (ii) O(n log2 n) time for the case of disjoint segments.
The Trimmed Iterative Closest Point Algorithm
 In International Conference on Pattern Recognition
, 2002
"... The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm [1] is presented, called the Trimmed ICP (TrICP). The new algorithm ..."
Abstract

Cited by 68 (4 self)
 Add to MetaCart
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension of the popular Iterative Closest Point (ICP) algorithm [1] is presented, called the Trimmed ICP (TrICP). The new
Closestpoint queries for complex objects
"... In this paper we report on the implementation of a heuristic for computing the closest of a set of n given points in the plane to a complex query object, to wit a triangle, a circle, a rectangle etc. Our results indicate that the heuristic is effective for query objects with small perimeter relative ..."
Abstract
 Add to MetaCart
In this paper we report on the implementation of a heuristic for computing the closest of a set of n given points in the plane to a complex query object, to wit a triangle, a circle, a rectangle etc. Our results indicate that the heuristic is effective for query objects with small perimeter
CLOSESTPOINT PROBLEMS
"... A number of seemingly unrelated problems involving the proximity of N points in the plane are studied, such as finding a Euclidean minimum spanning tree, the smallest circle enclosing the set, k nearest and farthest neighbors, the two closest points, and a proper straightline triangulation. For mos ..."
Abstract
 Add to MetaCart
A number of seemingly unrelated problems involving the proximity of N points in the plane are studied, such as finding a Euclidean minimum spanning tree, the smallest circle enclosing the set, k nearest and farthest neighbors, the two closest points, and a proper straightline triangulation
Morphological Iterative Closest Point Algorithm
 IEEE Trans. On Image Processing
, 1999
"... . This paper describes a method for accurate and computationally efficient registration of 3\GammaD shapes including curves and surfaces. The method is based on the iterative closest point (ICP) algorithm. The real strength of our algorithm is the use of Morphological Voronoi tessellation method to ..."
Abstract
 Add to MetaCart
. This paper describes a method for accurate and computationally efficient registration of 3\GammaD shapes including curves and surfaces. The method is based on the iterative closest point (ICP) algorithm. The real strength of our algorithm is the use of Morphological Voronoi tessellation method
A multiresolution ICP with heuristic closest Point search for fast and robust 3D Registration of range images
 in Proc. IEEE Conf. on 3D Imaging and Modeling
, 2003
"... The iterative closest point (ICP) algorithm is widely used for the registration of 3D geometric data. One of the main drawbacks of the algorithm is its quadratic time complexity O(N 2) with the number of points N. Consequently, several methods have been proposed to accelerate the process. This paper ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
to successively improve the registration using finer levels of representation and the neighbor search algorithm speeds up the closest point search by using a heuristic approach. Both multiresolution scheme and neighbor search algorithm main features are presented in this paper. Confirming the success
Closest Pair and the Post Office Problem for Stochastic Points
"... Abstract. Given a (master) set M of n points in ddimensional Euclidean space, consider drawing a random subset that includes each point mi ∈ M with an independent probability pi. How difficult is it to compute elementary statistics about the closest pair of points in such a subset? For instance, wh ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
, what is the probability that the distance between the closest pair of points in the random subset is no more than ℓ, for a given value ℓ? Or, can we preprocess the master set M such that given a query point q, we can efficiently estimate the expected distance from q to its nearest neighbor
SEGMENTATION ON SURFACES WITH THE CLOSEST POINT METHOD
"... We propose a method to detect objects and patterns in textures on general surfaces. Our approach applies the Chan–Vese variational model for active contours without edges to the problem of segmentation of scalar surface data. This leads to gradient descent equations which are level set equations o ..."
Abstract
 Add to MetaCart
on surfaces. These equations are evolved using the Closest Point Method, which is a recent technique for solving partial differential equations (PDEs) on surfaces. The final algorithm has a particularly simple form: it merely alternates a time step of the usual Chan–Vese model in a small 3D neighborhood
Results 1  10
of
475,195