Related papers: Old and new about equidistant sets and generalized…
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…
An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Since there is no effective formula to compute the distance of a point and a set, it is hard to…
The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the image of a non-closed geodesic has 0 distance from the set of conical points.…
The usual notion of set-convexity, valid in the classical Euclidean context, metamorphoses into several distinct convexity types in the more general Riemannian setting. By studying this phenomenon in reverse, we characterize complete…
An equidistant set in the Euclidean space consists of points having equal distances to both members of a given pair of sets, called focal sets. Having no effective formulas to compute the distance of a point and a set, it is hard to…
We examine properties of equidistant sets determined by nonempty disjoint compact subsets of a compact 2-dimensional Alexandrov space (of curvature bounded below). The work here generalizes many of the known results for equidistant sets…
Conics in the Euclidean space have been known for their geometrical beauty and also for their power to model several phenomena in real life. It usually happens that when thinking about the conics in a semi-Riemannian manifold, the equations…
We study relations of some classes of $k$-convex, $k$-visible bodies in Euclidean spaces. We introduce and study \textrm{circular projections} in normed linear spaces and classes of bodies related with families of such maps, in particular,…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
The geometry of closed surfaces equipped with a Euclidean metric with finitely many conical points of arbitrary angle is studied. The main result is that the set of closed geodesics is dense in the space of geodesics.
Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…
Here we analyze three dimensional analogues of the classical Crofton's formula for planar compact convex sets. In this formula a fundamental role is played by the visual angle of the convex set from an exterior point. A generalization of…
The concept of a visible point of a convex set relative to a given point is introduced. A number of basic properties of such visible point sets is developed. In particular, it is shown that this concept is useful in the study of best…
We consider a generalized angle in complex normed vector spaces. Its definition corresponds to the definition of the well known Euclidean angle in real inner product spaces. Not surprisingly it yields complex values as `angles'. This…
We survey the distributional properties of progressively dilating sets under projection by covering maps, focusing on manifolds of constant sectional curvature. In the Euclidean case, we review previously known results and formulate some…
Efficiently learning expectation values of unknown quantum states via classical shadows has become an important primitive in both theoretical and experimental aspects of quantum computation. Typically, classical shadow protocols involve…
Euclidean geometry is among the earliest forms of mathematical thinking. While the geometric primitives underlying its constructions, such as perfect lines and circles, do not often occur in the natural world, humans rarely struggle to…
The initial techniques developed in Euclid's Elements, well before the use of the parallel postulate, are reexamined in order to clarify even the most obscure details, particularly those related to equality, superposition and angle…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
We study the generalized analogues of conics for normed planes by using the following natural approach: It is well known that there are different metrical definitions of conics in the Euclidean plane. We investigate how these definitions…