Related papers: Fast and Accurate Intersections on a Sphere
Existing methods for rotation estimation between two spherical ($\mathbb{S}^2$) patterns typically rely on spherical cross-correlation maximization between two spherical function. However, these approaches exhibit computational complexities…
Numerous approximation algorithms for problems on unit disk graphs have been proposed in the literature, exhibiting a sharp trade-off between running times and approximation ratios. We introduce a variation of the known shifting strategy…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
In this letter, a fast Fourier transform (FFT)-enhanced low-complexity super-resolution sensing algorithm for near-field source localization with both angle and range estimation is proposed. Most traditional near-field source localization…
The boundary integral method is an efficient approach for solving time-harmonic acoustic obstacle scattering problems. The main computational task is the evaluation of an oscillatory boundary integral at each discretization point of the…
We propose a linear time and constant space algorithm for computing Euclidean projections onto sets on which a normalized sparseness measure attains a constant value. These non-convex target sets can be characterized as intersections of a…
Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in…
An efficient technique to solve precision problems consists in using exact computations. For geometric predicates, using systematically expensive exact computations can be avoided by the use of filters. The predicate is first evaluated…
We present an algorithm for evaluating a linear ``intersection transform'' of a function defined on the lattice of subsets of an $n$-element set. In particular, the algorithm constructs an arithmetic circuit for evaluating the transform in…
This paper describes a 2-D graphics algorithm that uses shifts and adds to precisely plot a series of points on an ellipse of any shape and orientation. The algorithm can also plot an elliptic arc that starts and ends at arbitrary angles.…
We present a robust and fast algorithm for performing astrometry and source cross-identification on two dimensional point lists, such as between a catalogue and an astronomical image, or between two images. The method is based on minimal…
For elliptic interface problems with discontinuous coefficients, the maximum accuracy order for compact 9-point finite difference scheme in irregular points is three [7]. The discontinuous coefficients usually have abrupt jumps across the…
Collision between rigid three-dimensional objects is a very common modelling problem in a wide spectrum of scientific disciplines, including Computer Science and Physics. It spans from realistic animation of polyhedral shapes for computer…
In this paper, we present an improved numerical algorithm for computing the intersection area of multiple circles and a complex polygon efficiently. This geometric problem is fundamental to applications such as wireless sensor networks and…
We present an efficient algorithm designed for and capable of detecting elongated, thin features such as lines and curves in astronomical images, and its application to the automatic detection of gravitational arcs. The algorithm is…
Fast convolution algorithms, including Winograd and FFT, can efficiently accelerate convolution operations in deep models. However, these algorithms depend on high-precision arithmetic to maintain inference accuracy, which conflicts with…
A significant challenge in object detection is accurate identification of an object's position in image space, whereas one algorithm with one set of parameters is usually not enough, and the fusion of multiple algorithms and/or parameters…
This work illustrates the possibility to apply the Fast Fourier Transformation to obtain the integrals of the Boundary Element Method (BEM) on arbitrary shapes. The procedure is inspired by the technique used with great success within the…
We consider the problem of minimizing a convex function over the intersection of finitely many simple sets which are easy to project onto. This is an important problem arising in various domains such as machine learning. The main difficulty…
Fourier transform methods are used to analyze functions and data sets to provide frequencies, amplitudes, and phases of underlying oscillatory components. Fast Fourier transform (FFT) methods offer speed advantages over evaluation of…