Sciweavers

401 search results - page 13 / 81
» Algorithms for a Simple Point Placement Problem
Sort
View
ISAAC
2004
Springer
135views Algorithms» more  ISAAC 2004»
14 years 23 days ago
Geometric Optimization Problems Over Sliding Windows
Abstract. We study the problem of maintaining a (1+ )-factor approximation of the diameter of a stream of points under the sliding window model. In one dimension, we give a simple ...
Timothy M. Chan, Bashir S. Sadjad
BMCBI
2008
121views more  BMCBI 2008»
13 years 7 months ago
A simple and fast heuristic for protein structure comparison
Background: Protein structure comparison is a key problem in bioinformatics. There exist several methods for doing protein comparison, being the solution of the Maximum Contact Ma...
David A. Pelta, Juan Ramón González,...
ICPR
2002
IEEE
14 years 8 months ago
The Trimmed Iterative Closest Point Algorithm
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 o...
Dmitry Chetverikov, D. Svirko, Dmitry Stepanov, Pa...
ICRA
2006
IEEE
174views Robotics» more  ICRA 2006»
14 years 1 months ago
Multi-scale point and line range data algorithms for mapping and localization
— This paper presents a multi-scale point and line based representation of two-dimensional range scan data. The techniques are based on a multi-scale Hough transform and a tree r...
Samuel T. Pfister, Joel W. Burdick
WADS
2005
Springer
95views Algorithms» more  WADS 2005»
14 years 26 days ago
Improved Approximation Bounds for Planar Point Pattern Matching
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
Minkyoung Cho, David M. Mount