Related papers: Cyclic space-filling curves and their clustering p…
We present a characterisation of blenders based on mapping properties of certain sets of curves that can be rigorously verified by computer-assisted methods. We develop an algorithm to construct these sets of curves that requires only a…
Approximating complex curves with simple parametric curves is widely used in CAGD, CG, and CNC. This paper presents an algorithm to compute a certified approximation to a given parametric space curve with cubic B-spline curves. By…
We establish a twistor correspondence between a cuspidal cubic curve in a complex projective plane, and a co-calibrated homogeneous $G_2$ structure on the seven--dimensional parameter space of such cubics. Imposing the Riemannian reality…
We construct a new compactification of the moduli space H_g of smooth hyperelliptic curves of genus g. We compare our compactification with other well-known remarkable compactifications of H_g .
We study the method of cyclic projections when applied to closed and linear subspaces $M_i$, $i=1,\ldots,m$, of a real Hilbert space $\mathcal H$. We show that the average distance to individual sets enjoys a polynomial behaviour…
The procedure of Least Square-Errors curve fitting is extensively used in many computer applications for fitting a polynomial curve of a given degree to approximate a set of data. Although various methodologies exist to carry out curve…
We introduce the notion of an orthocomplemented subspace of a Hilbert space H, that is, a pair of orthogonal closed subspaces of H, as a two-dimensional counterpart to the one-dimensional notion of a closed subspace of H. Orthocomplemented…
The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a…
We consider the Cohen-Macaulay compactification of the space of twisted cubics in projective n-space. This compactification is the fine moduli scheme representing the functor of CM-curves with Hilbert polynomial 3t+1. We show that the…
This is a paper about triangle cubics and conics in classical geometry with elements of projective geometry. In recent years, N.J. Wildberger has actively dealt with this topic using an algebraic perspective. Triangle conics were also…
Clustering is one of the fundamental tasks in data analytics and machine learning. In many situations, different clusterings of the same data set become relevant. For example, different algorithms for the same clustering task may return…
In this paper we show how, under surprisingly weak assumptions, one can split a planar curve into three arcs and rearrange them (matching tangent directions) to obtain a closed curve. We also generalize this construction to curves split…
An examples of solutions of the equation for curvature of congruence of cycles are constructed. Their properties are discussed.
We consider two algebras of curves associated to an oriented surface of finite type - the cluster algebra from combinatorial algebra, and the skein algebra from quantum topology. We focus on generalizations of cluster algebras and…
These results complete our paper in Hiroshima Mathematical Journal, vol. 42, pp. 37-75. Let C be a covering of the plane by disjoint complete folding curves which satisfies the local isomorphism property. We show that C is locally…
The Hilbert basis is fundamental in describing the structure of the integer points of a polyhedral cone. The face-centered cubic grid is one of the densest packing of the 3-dimensional space. The cycles of a grid satisfy the constraint set…
Based on further studying the low-rank subspace clustering (LRSC) and L2-graph subspace clustering algorithms, we propose a F-graph subspace clustering algorithm with a symmetric constraint (FSSC), which constructs a new objective function…
Clustering is one of the major tasks in data mining. In the last few years, Clustering of spatial data has received a lot of research attention. Spatial databases are components of many advanced information systems like geographic…
We introduce a new class of algebras, which we call cluster-tilted. They are by definition the endomorphism algebras of tilting objects in a cluster category. We show that their representation theory is very close to the representation…
Clustering is one of the most fundamental tasks in machine learning, and the k-means clustering algorithm is perhaps one of the most widely used clustering algorithms. However, it suffers from several limitations, such as sensitivity to…