Kiss, Gergely and Marichal, Jean-Luc (2023) Nonstandard N-distances based on Certain Geometric Constructions. BEITRÄGE ZUR ALGEBRA UND GEOMETRIE, 64 (1). pp. 107-126. ISSN 0138-4821 (print); 2191-0383 (online)
Text
s13366-022-00623-5.pdf Restricted to Registered users only Download (423kB) |
Abstract
The concept of n-distance was recently introduced to generalize the classical definition of distance to functions of n arguments. In this paper we investigate this concept through a number of examples based on certain geometrical constructions. In particular, our study shows to which extent the computation of the best constant associated with an n-distance may sometimes be difficult and tricky. It also reveals that two important graph theoretical concepts, namely the total length of the Euclidean Steiner tree and the total length of the minimal spanning tree constructed on n points, are instances of n-distances.
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Metric geometry, n-distance, Simplex inequality, Chebyshev ball, Euclidean minimal spanning tree, Euclidean Steiner tree, Smallest enclosing ball |
Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA73 Geometry / geometria |
SWORD Depositor: | MTMT SWORD |
Depositing User: | MTMT SWORD |
Date Deposited: | 30 Jan 2024 09:10 |
Last Modified: | 30 Jan 2024 09:10 |
URI: | http://real.mtak.hu/id/eprint/186637 |
Actions (login required)
Edit Item |