Related papers: Computable planar paths intersect in a computable …
A suitable measure for the similarity of shapes represented by parameterized curves or surfaces is the Fr\'echet distance. Whereas efficient algorithms are known for computing the Fr\'echet distance of polygonal curves, the same problem for…
The development of computational techniques in the last decade has made possible to attack some classical problems of algebraic geometry. In this survey, we briefly describe some open problems related to algebraic curves which can be…
Frames play an important role in various practical problems related to signal and image processing. In this paper, we define computable frames in computable Hilbert spaces and obtain computable versions of some of their characterizations.…
We consider two mixed curve $C,C'\subset {\Bbb C}^2$ which are defined by mixed functions of two variables $\bf z=(z_1,z_2)$. We have shown in \cite{MC}, that they have canonical orientations. If $C$ and $C'$ are smooth and intersect…
The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a feasible point does not exist. However,…
We investigate the maximum number of intersections between two polygons with p and q vertices, respectively, in the plane. The cases where p or q is even or the polygons do not have to be simple are quite easy and already known, but when p…
We establish a close connection between a reversible programming language based on type isomorphisms and a formally presented univalent universe. The correspondence relates combinators witnessing type isomorphisms in the programming…
The geometric intersection number of a curve on a surface is the minimal number of self-intersections of any homotopic curve, i.e. of any curve obtained by continuous deformation. Given a curve $c$ represented by a closed walk of length at…
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.…
In this paper we consider Contact graphs of Paths on a Grid (CPG graphs), i.e. graphs for which there exists a family of interiorly disjoint paths on a grid in one-to-one correspondence with their vertex set such that two vertices are…
For a smooth plane cubic $B$, we count curves $C$ of degree $d$ such that the normalizations of $C\backslash B$ are isomorphic to $\Bbb A^1$, for $d\leq7$ (for $d=7$ under some assumption). We also count plane rational quartic curves…
Computational problems are classified into computable and uncomputable problems. If there exists an effective procedure (algorithm) to compute a problem then the problem is computable otherwise it is uncomputable. Turing machines can…
A computable graph $\mathcal{G}$ is computably categorical relative to a degree $\mathbf{d}$ if and only if for all $\mathbf{d}$-computable copies $\mathcal{B}$ of $\mathcal{G}$, there is a $\mathbf{d}$-computable isomorphism…
In this paper we give a complete characterization of the intersections between the Norm-Trace curve over $\mathbb{F}_{q^3}$ and the curves of the form $y=ax^3+bx^2+cx+d$, generalizing a previous result by Bonini and Sala, providing more…
A graph is path-pairable if for any pairing of its vertices there exist edge-disjoint paths joining the vertices in each pair. We investigate the behaviour of the maximum degree in path-pairable planar graphs. We show that any $n$-vertex…
A graph is path-pairable if for any pairing of its vertices there exist edge disjoint paths joining the vertices in each pair. We obtain sharp bounds on the maximum possible diameter of path-pairable graphs which either have a given number…
We exhibit a polynomial time computable plane curve GAMMA that has finite length, does not intersect itself, and is smooth except at one endpoint, but has the following property. For every computable parametrization f of GAMMA and every…
A circle pattern is a configuration of circles in the plane whose combinatorics is given by a planar graph G such that to each vertex of G corresponds a circle. If two vertices are connected by an edge in G, the corresponding circles…
introduce {\sc Planar Disjoint Paths Completion}, a completion counterpart of the Disjoint Paths problem, and study its parameterized complexity. The problem can be stated as follows: given a, not necessarily connected, plane graph $G,$ $k$…
A family of plane oriented continuous paths depending on a fixed real positive number $R$ is considered. For any point $x$ on the path, the previous points lie out of any circle of radius $R$ having at $x$ interior normal in a suitable…