English
Related papers

Related papers: Mean distance in polyhedra

200 papers

We investigate the folding problem that asks if a polygon P can be folded to a polyhedron Q for given P and Q. Recently, an efficient algorithm for this problem has been developed when Q is a box. We extend this idea to regular polyhedra,…

Computational Geometry · Computer Science 2021-06-01 Tonan Kamata , Akira Kadoguchi , Takashi Horiyama , Ryuhei Uehara

This paper defines a distance function that measures the dissimilarity between planar geometric figures formed with straight lines. This function can in turn be used in partial matching of different geometric figures. For a given pair of…

Computer Vision and Pattern Recognition · Computer Science 2016-12-06 Apoorva Honnegowda Roopa , Shrisha Rao

The geometric median, a notion of center for multivariate distributions, has gained recent attention in robust statistics and machine learning. Although conceptually distinct from the mean (i.e., expectation), we demonstrate that both are…

Statistics Theory · Mathematics 2026-02-19 Richard Schwank , Mathias Drton

In the following paper we continue the work of Bimonte-Lizzi-Sparano on distances on a one dimensional lattice. We succeed in proving analytically the exact formulae for such distances. We find that the distance to an even point on the…

High Energy Physics - Theory · Physics 2009-10-28 E. Atzmon

In this article, we prove a theorem comparing the dihedral angles of simplices in the hyperbolic, spherical and Euclidean geometries.

Differential Geometry · Mathematics 2007-05-23 Thomas Kwok-keung Au , Feng Luo , Richard Stong

For two non-congruent regular polygons of the same type, the method of finding the points in the plane at the equal distances to the vertices, is established. The existence of two points with this property is proved for two polygons with a…

General Mathematics · Mathematics 2022-06-22 Mamuka Meskhishvili

We study the Riemannian distance function from a fixed point (a point-wise target) of Euclidean space in the presence of a compact obstacle bounded by a smooth hypersurface. First, we show that such a function is locally semiconcave with a…

Optimization and Control · Mathematics 2021-10-25 Paolo Albano , Vincenzo Basco , Piermarco Cannarsa

We prove that there exists a norm in the plane under which no n-point set determines more than O(n log n log log n) unit distances. Actually, most norms have this property, in the sense that their complement is a meager set in the metric…

Combinatorics · Mathematics 2010-07-08 Jiří Matoušek

Given a regular $n$-gon on the plane, it is evident that from any point on the plane, taken as a center, one can draw $n$ concentric circles such that each circle passes through one of the vertices of the polygon. Naturally, this raises the…

General Mathematics · Mathematics 2026-04-17 Mamuka Meskhishvili

This paper is devoted to the study the $m$-point homogeneity property and the point homogeneity degree for finite metric spaces. Since the vertex sets of regular polytopes, as well as of some their generalizations, are homogeneous, we pay…

Metric Geometry · Mathematics 2024-06-13 Valerii N. Berestovskii , Yurii G. Nikonorov

The calculation of Euclidean distance between points is generalized to one-dimensional objects such as strings or polymers. Necessary and sufficient conditions for the minimal transformation between two polymer configurations are derived.…

Soft Condensed Matter · Physics 2009-11-13 Ali R. Mohazab , Steven S. Plotkin

We present some formulae for the moments of inertia of homogeneous solids of revolution in terms of the functions that generate the solids. The development of these expressions exploits the cylindrical symmetry of these objects, and avoids…

Physics Education · Physics 2007-05-23 Rodolfo A. Diaz , William J. Herrera , R. Martinez

The Apollonius theorem gives the length of a median of a triangle in terms of the lengths of its sides. The straightforward generalization of this theorem obtained for m-simplices in the n-dimensional Euclidean space for n greater than or…

Geometric Topology · Mathematics 2024-01-09 Michael N. Vrahatis

An elementary general result is proved that allows for simple characterizations of well-known location/consensus functions (median, mean and center) on the n-cube. In addition, alternate new characterizations are given for the median and…

Combinatorics · Mathematics 2016-06-15 C. Garcia-Martinez , F. R. McMorris , O. Ortega , R. C. Powers

The notion of a spiral unfolding of a convex polyhedron, resulting by flattening a special type of Hamiltonian cut-path, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although among generic…

Computational Geometry · Computer Science 2015-10-20 Joseph O'Rourke

We present a proof of the folklore result that any length metric on $\mathbb R^d$ can be approximated by conformally flat Riemannian distance functions in the uniform distance. This result is used to study Liouville quantum gravity in…

Differential Geometry · Mathematics 2024-11-01 Andres A. Contreras Hip , Ewain Gwynne

We study the footprint function, with respect to a monomial order, of complete intersection graded ideals in a polynomial ring with coefficients in a field. For graded ideals of dimension one, whose initial ideal is a complete intersection,…

Commutative Algebra · Mathematics 2019-06-07 Yuriko Pitones , Jose Martinez-Bernal , Rafael H. Villarreal

We characterize Yoneda completeness for non-symmetric distances by combinations of metric and directed completeness. One of these generalizes the Kostanek-Waszkiewicz theorem on formal balls.

General Topology · Mathematics 2019-11-19 Tristan Bice

Average distance between two points in a unit-volume body $K \subset \mathbb{R}^n$ tends to infinity as $n \to \infty$. However, for two small subsets of volume $\varepsilon > 0$ the situation is different. For unit-volume cubes and…

Metric Geometry · Mathematics 2024-01-17 Abdulamin Ismailov , Alexei Kanel-Belov , Fyodor Ivlev

An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron…

Computational Geometry · Computer Science 2007-05-23 Mirela Damian , Robin Flatland , Joseph O'Rourke