相关论文: A Condition Number Analysis of a Line-Surface Inte…

In the calculation of thermodynamic properties and three dimensional structures of macromolecules, such as proteins, it is important to have a good algorithm for computing solvent accessible surface area of macromolecules. Here we propose a…

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

Given the equations of the first and the second order surfaces in multidimensional space, our goal is to construct a univariate polynomial one of the zeros of which coincides with the square of the distance between these surfaces. To…

We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…

This paper shows a polynomial-time algorithm, that given a general matroid $M_1 = (X, \mathcal{I}_1)$ and $k-1$ partition matroids $ M_2, \ldots, M_k$, produces a coloring of the intersection $M = \cap_{i=1}^k M_i$ using at most…

The problem deals with an exact calculation of the intersection area of a circle arbitrary placed on a grid of square shaped elements with gaps between them (finite fill factor). Usually an approximation is used for the calculation of the…

The goal of this paper is to study the path-following method for univariate polynomials. We propose to study the complexity and condition properties when the Newton method is applied as a correction operator. Then we study the geodesics and…

Given an ordered sequence of $N$-choose-2 integers, we give necessary and sufficient conditions to have an ordered collection of $N$ simple closed curves on a torus such that the algebraic pairwise intersections of those curves are the…

A metro-line crossing minimization problem is to draw multiple lines on an underlying graph that models stations and rail tracks so that the number of crossings of lines becomes minimum. It has several variations by adding restrictions on…

A numerical scheme is described for accurately accommodating oblique, non-aligned, boundaries, on a three-dimensional cartesian grid. The scheme gives second-order accuracy in the solution for potential of Poisson's equation using compact…

We study the probability for a random line to intersect a given plane curve, defined over a finite field, in a given number of points defined over the same field. In particular, we focus on the limits of these probabilities under successive…

Under conditions that prevent tangential intersection, we prove quadratic convergence of a projection algorithm for the feasibility problem of finding a point in the intersection of a smooth curve and line in $\mathbb{R}^2$. This nonconvex…

Locating the zeros of quaternionic polynomials is a fundamental problem with significant implications across scientific and engineering disciplines, yet the noncommutative nature of quaternion multiplication makes it fundamentally more…

In this paper, we propose a globally convergent method for solving constrained nonlinear systems. The method combines an efficient Newton conditional gradient method with a derivative-free and nonmonotone linesearch strategy. The global…

We give an algorithmic and lower-bound framework that facilitates the construction of subexponential algorithms and matching conditional complexity bounds. It can be applied to intersection graphs of similarly-sized fat objects, yielding…

We study spaces of lines that meet a smooth hypersurface X in P^n to high order. As an application, we give a polynomial upper bound on the number of planes contained in a smooth degree d hypersurface in P^5 and provide a proof of a result…

Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…

This article presents numerical methods in order to solve problems of tolerance analysis. A geometric specification, a contact specification and a functional requirement can be respectively characterized by a finite set of geometric…

For an arrangement of $n$ pseudolines in the real projective plane let us denote by $t_i$ the number of vertices incident to $i$ lines. We obtain a linear on $t_i$ inequality similar to the Hirzebruch one, but with an elementary proof. We…

Collision evaluation is of vital importance in various applications. However, existing methods are either cumbersome to calculate or have a gap with the actual value. In this paper, we propose a zero-gap whole-body collision evaluation…