Related papers: Developing a General algorithm for Ball Curve with…
We study the problem of efficiently constructing a curve C of genus 2 over a finite field F for which either the curve C itself or its Jacobian has a prescribed number N of F-rational points. In the case of the Jacobian, we show that any…
In this paper we introduce an algorithm of construction of cyclic space-filling curves. One particular construction provides a family of space-filling curves in all dimensions (H-curves). They are compared here with the Hilbert curve in the…
A new global basis of B-splines is defined in the space of generalized quadratic splines (GQS) generated by Merrien subdivision algorithm. Then, refinement equations for these B-splines and the associated corner-cutting algorithm are given.…
The implementation of reliable and efficient geometric algorithms is a challenging task. The reason is the following conflict: On the one hand, computing with rounded arithmetic may question the reliability of programs while, on the other…
An approach to defining quadratic implicit curves is to prescribe two tangent lines and a secant line going through the points of tangency. This paper will show that this method can be generalized to a higher number of tangents, resulting…
A method to construct transition curves using a family of the quartic Bezier spiral is described. The transition curves discussed are S-shape and C-shape of contact, between two separated circles. A spiral is a curve of monotone increasing…
A proof of convergence is given for a novel evolving surface finite element semi-discretization of Willmore flow of closed two-dimensional surfaces, and also of surface diffusion flow. The numerical method proposed and studied here…
We construct inducing schemes for general multi-dimensional piecewise expanding maps where the base transformation is Gibbs-Markov and the return times have exponential tails. Such structures are a crucial tool in proving statistical…
In this article, we introduce a variational algorithm, in the spirit of the minimizing movements scheme, to model the volume-preserving anisotropic mean curvature flow in 2D. We show that this algorithm can be used to prove the existence of…
We propose a clustering-based approach for identifying coherent flow structures in continuous dynamical systems. We first treat a particle trajectory over a finite time interval as a high-dimensional data point and then cluster these data…
Discretizations of the mean curvature and extrinsic curvature components are constructed on piecewise flat simplicial manifolds, giving approximations for smooth curvature values in a mostly mesh-independent way. These constructions are…
We propose a simple, geometrically-motivated construction of smooth random paths in the plane. The construction is such that, with probability one, the paths have finite curvature everywhere (and the realizations are visually pleasing when…
The component-by-component construction is the standard method of finding good lattice rules or polynomial lattice rules for numerical integration. Several authors have reported that in numerical experiments the generating vector sometimes…
Given two curves in $\PP^3$, either implicitly or by a parameterization, we want to check if they intersect. For that purpose, we present and further develop generalized resultant techniques. Our aim is to provide a closed formula in the…
A subgradient method is presented for solving general convex optimization problems, the main requirement being that a strictly-feasible point is known. A feasible sequence of iterates is generated, which converges to within user-specified…
We consider the problem of bounding the dimension of the linear system of curves in ${\bf P}^2$ of degree $d$ with prescribed multiplicities $m_1,...,m_n$ at $n$ general points (\cite{Hir1},\cite{Hir2}). We propose a new method, based on…
We develop a general notion of orthogonal wavelets `centered' on an irregular knot sequence. We present two families of orthogonal wavelets that are continuous and piecewise polynomial. We develop efficient algorithms to implement these…
The problem of construction of the surfaces with given sets of the points with horizontal tangential planes is considered. Such considerations are of interest in the problem of computer simulations of the waved ocean surfaces.
This paper investigates the combinatorial $\alpha$-curvature for vertex scaling of piecewise hyperbolic metrics on polyhedral surfaces, which is a parameterized generalization of the classical combinatorial curvature. A discrete…
The curvature regularities are well-known for providing strong priors in the continuity of edges, which have been applied to a wide range of applications in image processing and computer vision. However, these models are usually non-convex,…