scholarly journals A Helly-type theorem on a sphere

1967 ◽  
Vol 7 (3) ◽  
pp. 323-326 ◽  
Author(s):  
M. J. C. Baker
Keyword(s):  
Euclidean Space ◽  
Convex Sets ◽  
Type Theorem ◽  
Dimensional Euclidean Space ◽  
Dimensional Sphere ◽  
Strongly Convex ◽  
Set Of Points

The purpose of this paper is to prove that if n+3, or more, strongly convex sets on an n dimensional sphere are such that each intersection of n+2 of them is empty, then the intersection of some n+1 of them is empty. (The n dimensional sphere is understood to be the set of points in n+1 dimensional Euclidean space satisfying x21+x22+ …+x2n+1 = 1.)

ON THE STEINER RATIO IN $\mathcal{R}_{n}$

2011 ◽  
Vol 03 (04) ◽  
pp. 473-489
Author(s):  
HAI DU ◽  
WEILI WU ◽  
ZAIXIN LU ◽  
YINFENG XU
Keyword(s):  
Euclidean Space ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Dimensional Euclidean Space ◽  
Minimum Length ◽  
Steiner Ratio ◽  
Line Segments ◽  
Finite Set ◽  
Steiner Minimum Tree ◽  
Set Of Points

The Steiner minimum tree and the minimum spanning tree are two important problems in combinatorial optimization. Let P denote a finite set of points, called terminals, in the Euclidean space. A Steiner minimum tree of P, denoted by SMT(P), is a network with minimum length to interconnect all terminals, and a minimum spanning tree of P, denoted by MST(P), is also a minimum network interconnecting all the points in P, however, subject to the constraint that all the line segments in it have to terminate at terminals. Therefore, SMT(P) may contain points not in P, but MST(P) cannot contain such kind of points. Let [Formula: see text] denote the n-dimensional Euclidean space. The Steiner ratio in [Formula: see text] is defined to be [Formula: see text], where Ls(P) and Lm(P), respectively, denote lengths of a Steiner minimum tree and a minimum spanning tree of P. The best previously known lower bound for [Formula: see text] in the literature is 0.615. In this paper, we show that [Formula: see text] for any n ≥ 2.

scholarly journals Cone asymptotes of convex sets

2021 ◽  
Vol 36 (1) ◽  
pp. 81-98
Author(s):  
V. Soltan
Keyword(s):  
Euclidean Space ◽  
Convex Sets ◽  
Dimensional Euclidean Space

Based on the notion of plane asymptote, we introduce the new concept of cone asymptote of a set in the n-dimensional Euclidean space. We discuss the existence and describe some families of cone asymptotes.

Minkowski spacetime

2018 ◽  
Author(s):  
Nathalie Deruelle ◽  
Jean-Philippe Uzan
Keyword(s):  
Euclidean Space ◽  
Special Relativity ◽  
Three Dimensional ◽  
Minkowski Spacetime ◽  
Dimensional Euclidean Space ◽  
Fourth Dimension ◽  
Relativistic Dynamics ◽  
Newtonian Theory ◽  
Space And Time ◽  
Set Of Points

This chapter presents the main features of the Minkowski spacetime, which is the geometrical framework in which the laws of relativistic dynamics are formulated. It is a very simple mathematical extension of three-dimensional Euclidean space. In special relativity, ‘relative, apparent, and common’ (in the words of Newton) space and time are represented by a mathematical set of points called events, which constitute the Minkowski spacetime. This chapter also stresses the interpretation of the fourth dimension, which in special relativity is time. Here, time now loses the ‘universal’ and ‘absolute’ nature that it had in the Newtonian theory.

scholarly journals Bounding the Size of an Almost-Equidistant Set in Euclidean Space

2018 ◽  
Vol 28 (2) ◽  
pp. 280-286 ◽  
Author(s):  
ANDREY KUPAVSKII ◽  
NABIL H. MUSTAFA ◽  
KONRAD J. SWANEPOEL
Keyword(s):  
Euclidean Space ◽  
Dimensional Euclidean Space ◽  
Set Of Points

A set of points in d-dimensional Euclidean space is almost equidistant if, among any three points of the set, some two are at distance 1. We show that an almost-equidistant set in ℝd has cardinality O(d4/3).

Cell Complexes, Valuations, and the Euler Relation

1970 ◽  
Vol 22 (2) ◽  
pp. 235-241 ◽  
Author(s):  
M. A. Perles ◽  
G. T. Sallee
Keyword(s):  
Euclidean Space ◽  
Hausdorff Metric ◽  
Dimensional Euclidean Space ◽  
Cell Complexes ◽  
Finite Dimensional ◽  
Finite Set ◽  
Euler Relation ◽  
Set Of Points ◽  
The Relationship ◽  
Dimensional Face

1. Recently a number of functions have been shown to satisfy relations on polytopes similar to the classic Euler relation. Much of this work has been done by Shephard, and an excellent summary of results of this type may be found in [11]. For such functions, only continuity (with respect to the Hausdorff metric) is required to assure that it is a valuation, and the relationship between these two concepts was explored in [8]. It is our aim in this paper to extend the results obtained there to illustrate the relationship between valuations and the Euler relation on cell complexes.To fix our notions, we will suppose that everything takes place in a given finite-dimensional Euclidean space X.A polytope is the convex hull of a finite set of points and will be referred to as a d-polytope if it has dimension d. Polytopes have faces of all dimensions from 0 to d – 1 and each of these is in turn a polytope. A k-dimensional face will be termed simply a k-face.

scholarly journals On the Irreducibility of Convex Bodies

1959 ◽  
Vol 11 ◽  
pp. 256-261 ◽  
Author(s):  
A. C. Woods
Keyword(s):  
Euclidean Space ◽  
Convex Bodies ◽  
Dimensional Euclidean Space ◽  
Star Body ◽  
Closed Set ◽  
Absolute Value ◽  
Linearly Independent ◽  
The Absolute ◽  
Set Of Points ◽  
Rational Integral

We select a Cartesian co-ordinate system in ndimensional Euclidean space Rn with origin 0 and employ the usual pointvector notation.By a lattice Λ in Rn we mean the set of all rational integral combinations of n linearly independent points X1, X2, … , Xn of Rn. The points X1 X2, … , Xn are said to form a basis of Λ. Let {X1, X2, … , Xn) denote the determinant formed when the co-ordinates of Xi are taken in order as the ith row of the determinant for i = 1,2, … , n. The absolute value of this determinant is called the determinant d(Λ) of Λ. It is well known that d(Λ) is independent of the particular basis one takes for Λ.A star body in Rn is a closed set of points K such that if X ∈ K then every point of the form tX where — 1 < t < 1 is an inner point of K.

The Relaxation Method for Linear Inequalities

1954 ◽  
Vol 6 ◽  
pp. 393-404 ◽  
Author(s):  
T. S. Motzkin ◽  
I. J. Schoenberg
Keyword(s):  
Euclidean Space ◽  
Relaxation Method ◽  
Linear Inequalities ◽  
Dimensional Euclidean Space ◽  
Closed Set ◽  
Image Position ◽  
Set Of Points

Let A be a closed set of points in the n-dimensional euclidean space En. If p and p1 are points of En such that1.1then p1 is said to be point-wise closer than p to the set A. If p is such that there is no point p1 which is point-wise closer than p to A, then p is called a closest point to the set A.

scholarly journals APPROXIMATE WEIGHTED FARTHEST NEIGHBORS AND MINIMUM DILATION STARS

2010 ◽  
Vol 02 (04) ◽  
pp. 553-565
Author(s):  
JOHN AUGUSTINE ◽  
DAVID EPPSTEIN ◽  
KEVIN A. WORTMAN
Keyword(s):  
Euclidean Space ◽  
Metric Space ◽  
Time Algorithm ◽  
Dimensional Euclidean Space ◽  
Star Topology ◽  
Expected Time ◽  
Efficient Reduction ◽  
Core Sets ◽  
Minimum Dilation ◽  
Set Of Points

We provide an efficient reduction from the problem of querying approximate multiplicatively weighted farthest neighbors in a metric space to the unweighted problem. Combining our techniques with core-sets for approximate unweighted farthest neighbors, we show how to find approximate farthest neighbors that are farther than a factor (1 - ∊) of optimal in time O( log n) per query in D-dimensional Euclidean space for any constants D and ∊. As an application, we find an O(n log n) expected time algorithm for choosing the center of a star topology network connecting a given set of points, so as to approximately minimize the maximum dilation between any pair of points.

The Steiner Point of a Convex Polytope

1966 ◽  
Vol 18 ◽  
pp. 1294-1300 ◽  
Author(s):  
G. C. Shephard
Keyword(s):  
Euclidean Space ◽  
Extremal Problem ◽  
Convex Sets ◽  
Convex Set ◽  
Convex Polytope ◽  
Steiner Point ◽  
Dimensional Euclidean Space ◽  
Vector Addition ◽  
Image Position ◽  
Bounded Convex

Associated with each bounded convex set K in n-dimensional euclidean space En is a point s(K) known as its Steiner point. First considered by Steiner in 1840 (6, p. 99) in connection with an extremal problem for convex regions, this point has been found useful in some recent investigations (for example, 4) because of the linearity property1Addition on the left is vector addition of convex sets.

Sign in / Sign up

Export Citation Format

Share Document