Related papers: Deciding when two curves are of the same type
In many situations it could be interesting to ascertain whether nonparametric regression curves can be grouped, especially when confronted with a considerable number of curves. The proposed testing procedure allows to determine groups with…
We examine an equivalence relation between free homotopy classes of closed curves on the pair of pants known as k-equivalence, a generalization of a concept previously defined by Leininger. We prove that two classes of closed curves on the…
We answer an open question proposed by P\'{o}lik and Terlaky in 2007 that: {\it how we can decide whether two quadratic surfaces intersect without actually computing the intersections?}
We consider the relations between different measures of complexity for free homotopy classes of curves on a surface $\Sigma$, including the minimum number of self-intersections, the minimum length of the words representing them in a…
The ruled surface is a typical modeling surface in computer aided geometric design. It is usually given in the standard parametric form. However, it can also be in the forms than the standard one. For these forms, it is necessary to…
This paper is devoted to presenting a new approach to determine the intersection of two quadrics based on the detailed analysis of its projection in the plane (the so called cutcurve) allowing to perform the corresponding lifting correctly.…
Classification of curves in a projective space occupies minds of many mathematicians. First step in doing so is classification of curves on a given surface. This brings us to consideration of the nonsingular Del Pezzo Surface in $P^4_k.$ We…
Suppose X is a (smooth projective irreducible algebraic) curve over a finite field k. Counting the number of points on X over all finite field extensions of k will not determine the curve uniquely. Actually, a famous theorem of Tate implies…
A quadric in $\R P^3$ cuts a curve of degree 6 on a cubic surface in $\R P^3$. The papers classifies the nonsingular curves cut in this way on non-singular cubic surfaces up to homeomorphism. Two issues new in the study related to the first…
We present an algorithm for detecting basepoints of linear series of curves in the plane. Moreover, we give an algorithm for constructing a linear series of curves in the plane for given basepoints. The underlying method of these algorithms…
We give necessary and sufficient conditions on the curvature and the torsion of a regular curve of the space forms $\h^3$ and $\s^3$ to be contained in a totally umbilical surface. In case that the curve has constant torsion, we obtain the…
We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good…
The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjective and parametric optimization, computational geometry, and…
We describe efficient algorithms to search for cases in which binomial coefficients are equal or almost equal, give a conjecturally complete list of all cases where two binomial coefficients differ by 1, and give some identities for…
In the realm of computer-aided design (CAD) software, the intersection of B-spline surfaces stands as a fundamental operation. Despite the extensive history of surface intersection algorithms, the challenge of handling complex intersection…
To determine that two given undirected graphs are isomorphic, we construct for them auxiliary graphs, using the breadth-first search. This makes capability to position vertices in each digraph with respect to each other. If the given graphs…
When approximating a space curve, it is natural to consider whether the knot type of the original curve is preserved in the approximant. This preservation is of strong contemporary interest in computer graphics and visualization. We…
A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.
We investigate the following problem: Given two embeddings G_1 and G_2 of the same abstract graph G on an orientable surface S, decide whether G_1 and G_2 are isotopic; in other words, whether there exists a continuous family of embeddings…
We give a complete answer to the question of when two curves in two different Riemannian manifolds can be seen as trajectories of rolling one manifold on the other without twisting or slipping. We show that up to technical hypotheses, a…