Related papers: Cyclic space-filling curves and their clustering p…
A taming symplectic structure provides an upper bound on the area of an approximately pseudoholomorphic curve in terms of its homology class. We prove that, conversely, an almost complex manifold with such an area bound admits a taming…
This article defines a new family of curves in space, whose graphs generate shapes similar to whirls. An intrinsic equation is found, in terms of curvature and torsion, which gives necessary and sufficient conditions for the existence of…
It is well-known that the constructions of space-filling curves depend on certain substitution rules. For a given self-similar set, finding such rules is somehow mysterious, and it is the main concern of the present paper. Our first idea is…
Skeleton is a new notion designed for constructing space-filling curves of self-similar sets. It is shown in [Dai, Rao and Zhang, Space-filling curves of self-similar sets (II): Edge-to-trail substitution…
T-curves are piecewise linear curves which have been used with success since the beginning of the 1990's to construct new real algebraic curves with prescribed topology mainly on the real projective plane. In fact T-curves can be used on…
In this paper, we present a cluster algorithm for the simulation of hard spheres and related systems. In this algorithm, a copy of the configuration is rotated with respect to a randomly chosen pivot point. The two systems are then…
Homogeneous Hilbert curves (HHC) in two dimensions are generalized by introducing the construction of the space filling curves from the same affine transformations but using an arbitrary kernel, we call such curves HHCK. The new curves are…
We provide an algorithm to check whether two rational space curves are related by a similarity. The algorithm exploits the relationship between the curvatures and torsions of two similar curves, which is formulated in a computer algebra…
We examine space-filling curves, which are surjective continuous maps from $[0,1]$ to some higher-dimensional space, usually the unit square $[0,1]^2$. In particular, we define Peano's curve and Lebesgue's curve, and state some of their…
We propose a nearest neighbor based clustering algorithm that results in a naturally defined hierarchy of clusters. In contrast to the agglomerative and divisive hierarchical clustering algorithms, our approach is not dependent on the…
This paper continues a geometric study of Harvey's Complex of Curves, whose ultimate goal is to apply the theory of hyperbolic spaces and groups to algorithmic questions for the Mapping Class Group and geometric properties of Kleinian…
We study the relative Hilbert scheme of a family of nodal (or smooth) curves, over a base of arbitrary dimension, via its (birational) cycle map, going to the relative symmetric product. We show the cycle map is the blowing up of the…
We consider flat families of reduced curves on a smooth surface S such that each member C has the same number of singularities of fixed singularity types and the corresponding (locally closed) subscheme H of the Hilbert scheme of S. We are…
We study the relative Hilbert scheme of a family of nodal (or smooth) curves, over a base of arbitrary dimension, via its (birational) cycle map, going to the relative symmetric product. We show the cycle map is the blowing up of the…
We consider the problem of subspace clustering: given points that lie on or near the union of many low-dimensional linear subspaces, recover the subspaces. To this end, one first identifies sets of points close to the same subspace and uses…
We study completely the Hilbert scheme and punctual Hilbert scheme of a nodal curve, and the relative Hilbert scheme of a family of curves acquiring a node. The results are then extended, less completely, to flag Hilbert schemes,…
In this article we study polyharmonic curves of constant curvature where we mostly focus on the case of curves on the sphere. We classify polyharmonic curves of constant curvature in three-dimensional space forms and derive an explicit…
In this paper, we propose an efficient clustering technique to solve the problem of clustering in the presence of obstacles. The proposed algorithm divides the spatial area into rectangular cells. Each cell is associated with statistical…
This article is devoted to studying complex algebraic sets under (global) blow-spherical equivalence. The main results of this article are complete classifications of complex algebraic curves. Firstly, we present a complete classification…
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…