Implicitization of Parametric Hypersurfaces via Points

Ferruccio Orecchia; Isabella Ramella

Displaying similar documents to “Implicitization of Parametric Hypersurfaces via Points”

On the weighted Euclidean matching problem in $ℝ^{d}$

Birgit Anthes, Ludger Rüschendorf (2001)

Applicationes Mathematicae

Similarity:

A partitioning algorithm for the Euclidean matching problem in $ℝ^{d}$ is introduced and analyzed in a probabilistic model. The algorithm uses elements from the fixed dissection algorithm of Karp and Steele (1985) and the Zig-Zag algorithm of Halton and Terada (1982) for the traveling salesman problem. The algorithm runs in expected time $n {(l o g n)}^{p - 1}$ and approximates the optimal matching in the probabilistic sense.

The general methods of finding the sum $S_{n}$ for all kinds of series

K. Orlov (1981)

Matematički Vesnik

Similarity:

The adaptation of the $k$ -means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm

Rudolf Scitovski, Kristian Sabo (2019)

Applications of Mathematics

Similarity:

We consider the multiple ellipses detection problem on the basis of a data points set coming from a number of ellipses in the plane not known in advance, whereby an ellipse $E$ is viewed as a Mahalanobis circle with center $S$ , radius $r$ , and some positive definite matrix $Σ$ . A very efficient method for solving this problem is proposed. The method uses a modification of the $k$ -means algorithm for Mahalanobis-circle centers. The initial approximation consists of the set of circles whose centers...

On Some Family of Contractible Hypersurfaces in $C^{4}$

S. Kaliman, L. Makar-Limanov (1993)

Cours de l'institut Fourier

Similarity:

An improvement of Euclid's algorithm

Zítko, Jan, Kuřátko, Jan

Similarity:

The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid’s algorithm can be easily simulated by the reduction of the Sylvester matrix to an upper triangular form. This is performed by using $c$ - $s$ transformation and $Q R$ -factorization methods. Both procedures are described and numerically compared. Computations are performed in the floating point environment.

Uniform convergence of the greedy algorithm with respect to the Walsh system

Martin Grigoryan (2010)

Studia Mathematica

Similarity:

For any 0 < ϵ < 1, p ≥ 1 and each function $f \in L^{p} [0, 1]$ one can find a function $g \in L^{\infty} [0, 1)$ with mesx ∈ [0,1): g ≠ f < ϵ such that its greedy algorithm with respect to the Walsh system converges uniformly on [0,1) and the sequence $| c_{k} (g) | : k \in s p e c (g)$ is decreasing, where $c_{k} (g)$ is the sequence of Fourier coefficients of g with respect to the Walsh system.

A characterization of a certain real hypersurface of type $(A_{2})$ in a complex projective space

Byung Hak Kim, In-Bae Kim, Sadahiro Maeda (2017)

Czechoslovak Mathematical Journal

Similarity:

In the class of real hypersurfaces $M^{2 n - 1}$ isometrically immersed into a nonflat complex space form ${\tilde{M}}_{n} (c)$ of constant holomorphic sectional curvature $c$ $(\neq 0)$ which is either a complex projective space $ℂ P^{n} (c)$ or a complex hyperbolic space $ℂ H^{n} (c)$ according as $c > 0$ or $c < 0$ , there are two typical examples. One is the class of all real hypersurfaces of type (A) and the other is the class of all ruled real hypersurfaces. Note that the former example are Hopf manifolds and the latter are non-Hopf manifolds....

A genericity theorem for algebraic stacks and essential dimension of hypersurfaces

Zinovy Reichstein, Angelo Vistoli (2013)

Journal of the European Mathematical Society

Similarity:

We compute the essential dimension of the functors Forms $_{n, d}$ and Hypersurf $_{n, d}$ of equivalence classes of homogeneous polynomials in $n$ variables and hypersurfaces in $ℙ^{n - 1}$ , respectively, over any base field $k$ of characteristic $0$ . Here two polynomials (or hypersurfaces) over $K$ are considered equivalent if they are related by a linear change of coordinates with coefficients in $K$ . Our proof is based on a new Genericity Theorem for algebraic stacks, which is of independent interest. As another application...

A short note on $f$ -biharmonic hypersurfaces

Selcen Y. Perktaş, Bilal E. Acet, Adara M. Blaga (2020)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In the present paper we give some properties of $f$ -biharmonic hypersurfaces in real space forms. By using the $f$ -biharmonic equation for a hypersurface of a Riemannian manifold, we characterize the $f$ -biharmonicity of constant mean curvature and totally umbilical hypersurfaces in a Riemannian manifold and, in particular, in a real space form. As an example, we consider $f$ -biharmonic vertical cylinders in $S^{2} \times ℝ$ .

Seasonal time-series imputation of gap missing algorithm (STIGMA)

Eduardo Rangel-Heras, Pavel Zuniga, Alma Y. Alanis, Esteban A. Hernandez-Vargas, Oscar D. Sanchez (2023)

Kybernetika

Similarity:

This work presents a new approach for the imputation of missing data in weather time-series from a seasonal pattern; the seasonal time-series imputation of gap missing algorithm (STIGMA). The algorithm takes advantage from a seasonal pattern for the imputation of unknown data by averaging available data. We test the algorithm using data measured every $10$ minutes over a period of $365$ days during the year 2010; the variables include global irradiance, diffuse irradiance, ultraviolet irradiance,...

A descent algorithm for $ε$ - approximation of continuous functions with values in unitary space

M. Janc (1982)

Matematički Vesnik

Similarity: