AI Chat AI Image Generator AI Video Text to Speech

Nearest Points on Toric Varieties

03/21/2016

∙

by Martin Helmer, et al.

∙

∙

We determine the Euclidean distance degree of a projective toric variety. This extends the formula of Matsui and Takeuchi for the degree of the A-discriminant in terms of Euler obstructions. Our primary goal is the development of reliable algorithmic tools for computing the points on a real toric variety that are closest to a given data point.

Martin Helmer
12 publications
Bernd Sturmfels
38 publications

page 1

page 2

page 3

page 4

research

∙ 10/08/2019

Computational complexity in algebraic regression

We analyze the complexity of fitting a variety, coming from a class of v...

0 Oliver Gäfvert, et al. ∙

research

∙ 06/07/2020

On Hermitian varieties in PG(6,q^2)

In this paper we characterize the non-singular Hermitian variety ℋ(6,q^2...

0 Angela Aguglia, et al. ∙

research

∙ 05/11/2021

Compact Euler Tours of Trees with Small Maximum Degree

We show how an Euler tour for a tree on n vertices with maximum degree d...

0 Travis Gagie, et al. ∙

research

∙ 01/06/2022

Simple algorithm for GCD of polynomials

Based on the Bezout approach we propose a simple algorithm to determine ...

0 Pasquale Nardone, et al. ∙

research

∙ 06/07/2021

The Distance Transform and its Computation

Distance transformation is an image processing technique used for many d...

0 Tilo Strutz, et al. ∙

research

∙ 05/02/2023

On the Growth of Lebesgue Constants for Degree One Fekete Points in terms of the Dimension

We discuss the growth of the Lebesgue constants for polynomial interpola...

0 Len Bos, et al. ∙

research

∙ 09/10/2015

Rigid Multiview Varieties

The multiview variety from computer vision is generalized to images by n...

0 Michael Joswig, et al. ∙