Approximate decision algorithms for point set congruence

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Approximation Algorithms for Point-set Diameter in Higher Dimensions

We study the problem of computing the diameter of a  set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+varepsilon)$-approximation algorithm with $O(n+ 1/varepsilon^{d-1})$ time and $O(n)$ space, where $0 < varepsilonleqslant 1$. We also show that the proposed algorithm can be modified to a $(1+O(varepsilon))$-approximation algorithm with $O(n+...

متن کامل

Approximate fixed point theorems for Geraghty-contractions

The purpose of this paper is to obtain necessary and suffcient conditionsfor existence approximate fixed point on Geraghty-contraction. In this paper,denitions of approximate -pair fixed point for two maps Tα , Sα and theirdiameters are given in a metric space.

متن کامل

Fast Approximate Point Set Matching for Information Retrieval

We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consisting of m points, find the largest match for a subset of the pattern in the data set. This problem is known to be 3-SUM hard and so unlikely to be solvable exactly in subquadratic time. We present an efficient bit-para...

متن کامل

Approximate Point Set Match for Partial Protein Structure Alignments

We present a practical algorithm and its implementation which is able to find partial and approximative matches of patterns, such as small parts of molecules, in large search spaces, such as complete proteins. The search pattern can be matched in a flexible way including torsion of parts of the pattern. The alignment of the pattern in the search space can be based on distance functions other th...

متن کامل

Applications of Fixed Point and Approximate Algorithms

As very powerful and important tools in the study of nonlinear sciences, fixed point methods have attracted so much attention. Over the last decades, fixed point techniques have been applied extensively in such diverse fields as biology, chemistry, economics, engineering, game theory, physics, and so on. The thorough study of the fixed point theory and its approach methods contained in the lite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Geometry

سال: 1994

ISSN: 0925-7721

DOI: 10.1016/0925-7721(94)90004-3