2017/05/19 by Csaba Vincze, Vincze, Csaba
Mathematics · Computer Science · #Point processes and geometric inequalities #Computational Geometry and Mesh Generation #Mathematics and Applications
paper · pdf · doi:10.48550/arxiv.1705.07119
The equidistant set of two nonempty subsets K and L in the Euclidean plane is a set all of whose points have the same distance from K and L. Since the classical conics can be also given in this way, equidistant sets can be considered as a kind of their generalizations: K and L are called the focal sets. In their paper \citePS the authors posed the problem of the characterization of closed subsets in the Euclidean plane that can be realized as the equidistant set of two connected disjoint closed sets. We prove that any convex closed planar curve can be given as an equidistant set, i.e. the set of equidistant curves contains the entire class of convex closed planar curves. In this sense the equidistancy is a generalization of the convexity.