Fetching the paper…
Reading the bibliography…
The generic number of critical points of the Euclidean distance function from a data point to a variety is called the Euclidean distance degree.
I.M. Gelfand, M.M. Kapranov, and A.V. Zelevinsky: Discriminants, Resultants and Multidimensional Determinants
1994
Earlier work this paper cites.
M. Laurent and S. Poljak, On the facial structure of the set of correlation matrices
1996
Earlier work this paper cites.
C. Trifogli, Focal loci of algebraic hypersurfaces: a general theory
1998
Earlier work this paper cites.
F. Catanese and C. Trifogli, Focal loci of algebraic varieties I
2000
Cited alongside, same era.
R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision
2003
Cited alongside, same era.
P. Rostalski and B. Sturmfels, Dualities
2013
Cited alongside, same era.
Cited in the paper.
D. Grayson and M. Stillman: Macaulay2, a software system for research in algebraic geometry
Cited in the paper.
M. Michalek, B. Sturmfels, C. Uhler and P. Zwiernik, Exponential Varieties
Cited in the paper.
B. Anderson and U. Helmke: Counting critical formations on a line
2014
Later among the works it cites.
J. Draisma, E. Horobeţ, G. Ottaviani, B. Sturmfels, R.R. Thomas, The Euclidean Distance Degree of an Algebraic Variety
2014
Later among the works it cites.
A. Josse and F. Pène, On the degree of caustics by reflection
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…