Related papers: Relationship between the 2n-points binary and (3n-…
Stationary subdivision schemes have been extensively studied and have numerous applications in CAGD and wavelet analysis. To have high-order smoothness of the scheme, it is usually inevitable to enlarge the support of the mask that is used,…
Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…
In this paper, we introduce two generalizations of midpoint subdivision and analyze the smoothness of the resulting subdivision surfaces at regular and extraordinary points. The smoothing operators used in midpoint and mid-edge subdivision…
Based on the superconvergent approximation at some point (depending on the fractional order $\alpha$, but not belonging to the mesh points) for Gr\"{u}nwald discretization to fractional derivative, we develop a series of high order…
We use a geometric method to derive (two-dimensional) separation functions amongst pairs of objects within populations of specified position function $\mathrm{d} N/\mathrm{d} \vec{R}$. We present analytic solutions for separation functions…
We provide a randomized linear time approximation scheme for a generic problem about clustering of binary vectors subject to additional constrains. The new constrained clustering problem encompasses a number of problems and by solving it,…
We present a novel and effective binary representation for convex shapes. We show the equivalence between the shape convexity and some properties of the associated indicator function. The proposed method has two advantages. Firstly, the…
Partitionings (or segmentations) divide a given domain into disjoint connected regions whose union forms again the entire domain. Multi-dimensional partitionings occur, for example, when analyzing parameter spaces of simulation models,…
Lines and circles pose significant scalability challenges in synthetic geometry. A line with $n$ points implies ${n \choose 3}$ collinearity atoms, or alternatively, when lines are represented as functions, equality among ${n \choose 2}$…
In this article, we present a new method to construct a family of (2N+2)-point binary subdivision schemes with one tension parameter where N is a non-negative integer. The construction of the family of schemes is based on repeated local…
In this paper we define a family of nonlinear, stationary, interpolatory subdivision schemes with the capability of reproducing conic shapes including polynomials upto second order. Linear, non-stationary, subdivision schemes do also…
Almost para-quaternionic structures on smooth manifolds of dimension $2n$ are equivalent to almost Grassmannian structures of type $(2,n)$. We remind the equivalence and exhibit some interrelations between subjects that were previously…
Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain Diophantine equations. We look at a number of such questions including the question of approximating arbitrary…
This article continues the investigation started in [9] on subdivision schemes refining 2D point-normal pairs, obtained by modifying linear subdivision schemes using the circle average. While in [9] the convergence of the Modified…
In this paper we extend the 2D circle average of [11] to a 3D binary average of point-normal pairs, and study its properties. We modify classical surface-generating linear subdivision schemes with this average obtaining surface-generating…
Rough set theory is a new mathematical approach to imperfect knowledge. The notion of rough sets is generalized by using an arbitrary binary relation on attribute values in information systems, instead of the trivial equality relation. The…
The aim of this paper is to investigate an attempt to build a binary classification algorithm using principles of geometry such as vectors, planes, and vector algebra. The basic idea behind the proposed algorithm is that a hyperplane can be…
In this paper we characterize the approximation schemes that satisfy Shapiro's theorem and we use this result for several classical approximation processes. In particular, we study approximation of operators by finite rank operators and…
The interior structure of arbitrary sets of quaternion units is analyzed using general methods of the theory of matrices. It is shown that the units are composed of quadratic combinations of fundamental objects having a dual mathematical…
A standard construction in approximation theory is mesh refinement. For a simplicial or polyhedral mesh D in R^k, we study the subdivision D' obtained by subdividing a maximal cell of D. We give sufficient conditions for the module of…