Algebraic Distance Optimization in Polyhedral Norms

Abstract

We consider the distance minimization problem to a real algebraic variety X ⊂eq n when the metric is induced by a polyhedral norm. Each point in the variety has a Voronoi cell whose geometry depends on the normal space at the point and the inner normal fan of the polyhedral ball. For codimension-one varieties, we decompose X into sets of points whose Voronoi cones have the same dimension, which is the expected dimension of their Voronoi cell. We prove that this decomposition is a stratification of X and that each strata is a semialgebraic set. We conclude by giving an algebraic description of the medial axis, which is the locus of points whose minimal distance to X is achieved at more than one point on X.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…