Related papers: Tools for analyzing the intersection curve between…
An analytic center cutting plane method is an iterative algorithm based on the computation of analytic centers. In this paper, we propose some analytic center cutting plane methods for solving quasimonotone or pseudomonotone variational…
The square root velocity transformation provides a convenient and numerically efficient approach to functional and shape data analysis of curves. We study fundamental geometric properties of curves under this transformation. Moreover,…
Based on high precision computation of periods and lattice reduction techniques, we compute the Picard group of smooth surfaces. We also study the lattice reduction technique that is employed in order to quantify the possibility of…
Given a real hyperelliptic algebraic curve $X$ with non-empty real part and a real effective divisor $\mc{D}$ arising via pullback from $\mathbb{P}^1$ under the hyperelliptic structure map, we study the real inflection points of the…
A triangulation of a punctured or pinched surface is irreducible if no edge can be shrunk without producing multiple edges or changing the topological type of the surface. The finiteness of the set of (non-isomorphic) irreducible…
The order in which plane-filling curves visit points in the plane can be exploited to design efficient algorithms. Typically, the curves are useful because they preserve locality: points that are close to each other along the curve tend to…
Using a quadratic version of the Bott residue theorem, we give a quadratic refinement of the count of twisted cubic curves on hypersurfaces and complete intersections in a projective space.
In this paper we collect the main properties of free curves in the complex projective plane and a lot of conjectures and open problems, both old and new. In the quest to understand the mystery of free curves, many tools were developed and…
We provide algorithms to reconstruct rational ruled surfaces in three-dimensional projective space from the `apparent contour' of a single projection to the projective plane. We deal with the case of tangent developables and of general…
We consider random Gaussian eigenfunctions of the Laplacian on the three-dimensional flat torus, and investigate the number of nodal intersections against a straight line segment. The expected intersection number, against any smooth curve,…
We discuss the theorem on the existence of six points on a convex closed plane curve in which the curve has a contact of order six with the osculating conic. (This is the ``projective version'' of the well known four vertices theorem for a…
We propose algorithms and software for computing projections onto the intersection of multiple convex and non-convex constraint sets. The software package, called SetIntersectionProjection, is intended for the regularization of inverse…
We consider the convergence rate of the alternating projection method for the nontransversal intersection of a semialgebraic set and a linear subspace. For such an intersection, the convergence rate is known as sublinear in the worst case.…
We are introducing two methods for revealing the true inflection point of data that contains or not error. The starting point is a set of geometrical properties that follow the existence of an inflection point p for a smooth function. These…
A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and…
We investigate the geometry of holomorphic curves and complex surfaces from the perspective of singularity theory. We show that, with a suitable choice of a complex bilinear symmetric form, the families of functions and mappings that…
We describe the behaviour of a free reduced plane projective curve with respect to the deletion, respectively addition, of a smooth conic. These results apply in particular to conic-line arrangements. We present some obstructions to the…
Given two rational, properly parametrized space curves ${\mathcal C}_1$ and ${\mathcal C}_2$, where $\CCC_2$ is contained in some plane $\Pi$, we provide an algorithm to check whether or not there exist perspective or parallel projections…
Interference detection of arbitrary geometric objects is not a trivial task due to the heavy computational load imposed by implementation issues. The hierarchically structured bounding boxes help us to quickly isolate the contour of…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…