Related papers: On the Precision to Sort Line-Quadric Intersection…
Let $S$ be a set of $n$ points in general position in the plane. Join every pair of points in $S$ with a straight line segment. Let $\overline{cr}(S)$ be number of pairs of these edges that intersect in their interior. Suppose that this…
Given two curves in $\PP^3$, either implicitly or by a parameterization, we want to check if they intersect. For that purpose, we present and further develop generalized resultant techniques. Our aim is to provide a closed formula in the…
Let $L$ be a set of $n$ lines in the plane. The zone $Z(\ell)$ of a line $\ell$ in the arrangement $\mathcal{A}(L)$ of $L$ is the set of faces of $\mathcal{A}(L)$ whose closure intersects $\ell$. It is known that the combinatorial size of…
The Zernike radial polynomials are a system of orthogonal polynomials over the unit interval with weight x. They are used as basis functions in optics to expand fields over the cross section of circular pupils. To calculate the roots of…
The operations of data set, such as intersection, union and complement, are the fundamental calculation in mathematics. It's very significant that designing fast algorithm for set operation. In this paper, the quantum algorithm for…
This paper consists of a formal analysis and one solid solution to the knot finding problem given a source polyline and a parametric curve (e.g. circular arc, ellipse or biarc). We solve the problem using both a greedy algorithm to collect…
The aim of this paper is to construct a new non-uniform corner-cutting (NUCC) subdivision scheme that improves the accuracy of the classical (stationary and nonstationary) methods. The refinement rules are formulated via the reproducing…
We discuss the motivation for making predictions for jet cross sections at next-to-next-to-leading order. We describe the theoretical ingredients needed for such a calculation and briefly review the progress in the field.
In the standard approach, predictions of perturbative Quantum Chromodynamics for ratios of cross sections are computed as the ratio of fixed-order predictions for the numerator and the denominator. Beyond the lowest order in the…
We prove that a smooth complete intersection of two quadrics of dimension at least $2$ over a number field has index dividing $2$, i.e., that it possesses a rational $0$-cycle of degree $2$.
We study strong approximation for the intersection of two affine quadrics. As its application, we prove the fibration method for weak approximation over number fields of rank four with nonsplit fibers split by quadratic extensions.
The classic method for computing the spectral decomposition of a real symmetric matrix, the Jacobi algorithm, can be accelerated by using mixed precision arithmetic. The Jacobi algorithm is aiming to reduce the off-diagonal entries…
The task of approximating points with circular arcs is performed in many applications, such as polyline compression, noise filtering, and feature recognition. However, the development of algorithms that perform a significant amount of…
In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…
In this paper the fractional order logistic map in the sense of Caputo's fractional differences is numerically approached. It is shown that the necessary iterations number to avoid transients must be of order of thousand, not of order of…
A new method is proposed to deduce the neutron radii of neutron-rich nuclei. This method requires measuring the reaction cross sections of both the neutron-rich nucleus and its stable isotope at the same energy on a proton target. Using…
Streamline-based quad meshing algorithms use smooth cross fields to partition surfaces into quadrilateral regions by tracing cross field separatrices. In practice, re-entrant corners and misalignment of singularities lead to small regions…
We study the relationship between the areas of the consecutive quadrilaterals cut from a convex quadrilateral in the plane by means of a finite or infinite number of straight lines intersecting two of its opposite sides. Moreover, we obtain…
The expected number of pairwise comparisons needed to learn a partial order on n elements is shown to be at least n*n/4-o(n*n), and an algorithm is given that needs only n*n/4+o(n*n) comparisons on average. In addition, the optimal strategy…
On a smooth variety, Serre's intersection formula computes intersection multiplicities via an alternating sum of the lengths of Tor groups. When the variety is singular, the corresponding sum can be a divergent series. But there are…