A problem concerning three-dimensional convex bodies

Author(s):  
R. A. Rankin

1. The problem considered in this paper arose during an investigation of what Chabauty has called the ‘anomaly’ of convex bodies.Throughout the paper denotes a closed bounded convex body in three-dimensional Euclidean space , which is symmetric in the origin O and which contains O as an interior point. Such a body determines uniquely a distance-function f(x, y, z) which is defined and finite for each point (x, y, z) of and possesses the following properties

2009 ◽  
Vol 52 (3) ◽  
pp. 361-365 ◽  
Author(s):  
Fejes Tóth Gábor

AbstractA classical theorem of Rogers states that for any convex body K in n-dimensional Euclidean space there exists a covering of the space by translates of K with density not exceeding n log n + n log log n + 5n. Rogers’ theorem does not say anything about the structure of such a covering. We show that for sufficiently large values of n the same bound can be attained by a covering which is the union of O(log n) translates of a lattice arrangement of K.


2015 ◽  
Vol 52 (3) ◽  
pp. 386-422
Author(s):  
T. Bisztriczky ◽  
F. Fodor

The Separation Problem, originally posed by K. Bezdek in [1], asks for the minimum number s(O, K) of hyperplanes needed to strictly separate an interior point O in a convex body K from all faces of K. It is conjectured that s(O, K) ≦ 2d in d-dimensional Euclidean space. We prove this conjecture for the class of all totally-sewn neighbourly 4-dimensional polytopes.


1962 ◽  
Vol 58 (2) ◽  
pp. 217-220 ◽  
Author(s):  
E. Asplund ◽  
E. Grosswald ◽  
B. Grünbaum

In the present note we discuss some properties of a ‘measure of asymmetry’ of convex bodies in n-dimensional Euclidean space. Various measures of asymmetry have been treated in the literature (see, for example, (1), (6); references to most of the relevant results may be found in (4)). The measure introduced here has the somewhat surprising property that for n ≥ 3 the n-simplex is not the most asymmetric convex body in En. It seems to be the only measure of asymmetry for which this fact is known.


Author(s):  
H. T. Croft

We solve two problems on convex bodies stated on p. 38 of S. M. Ulam's book, A collection of mathematical problems (New York, 1960).Problem 1. This problem is due to Mazur. In three-dimensional Euclidean space there is given a convex surface W and a point O in its interior. Consider the set V of all points P defined by the requirement that the length of the interval OP is equal to the area of the plane section of W through O and perpendicular to OP. Is the (centrally symmetric) set V a convex surface?


2020 ◽  
Vol 26 (1) ◽  
pp. 67-77 ◽  
Author(s):  
Silvestru Sever Dragomir

AbstractIn this paper, by the use of the divergence theorem, we establish some integral inequalities of Hermite–Hadamard type for convex functions of several variables defined on closed and bounded convex bodies in the Euclidean space {\mathbb{R}^{n}} for any {n\geq 2}.


2008 ◽  
Vol 17 (4) ◽  
pp. 619-625 ◽  
Author(s):  
JÓZSEF SOLYMOSI ◽  
CSABA D. TÓTH

Given a set of s points and a set of n2 lines in three-dimensional Euclidean space such that each line is incident to n points but no n lines are coplanar, we show that s = Ω(n11/4). This is the first non-trivial answer to a question recently posed by Jean Bourgain.


1956 ◽  
Vol 8 ◽  
pp. 256-262 ◽  
Author(s):  
J. De Groot

1. Introduction. We consider the group of proper orthogonal transformations (rotations) in three-dimensional Euclidean space, represented by real orthogonal matrices (aik) (i, k = 1,2,3) with determinant + 1 . It is known that this rotation group contains free (non-abelian) subgroups; in fact Hausdorff (5) showed how to find two rotations P and Q generating a group with only two non-trivial relationsP2 = Q3 = I.


Robotica ◽  
2015 ◽  
Vol 34 (11) ◽  
pp. 2610-2628 ◽  
Author(s):  
Davood Naderi ◽  
Mehdi Tale-Masouleh ◽  
Payam Varshovi-Jaghargh

SUMMARYIn this paper, the forward kinematic analysis of 3-degree-of-freedom planar parallel robots with identical limb structures is presented. The proposed algorithm is based on Study's kinematic mapping (E. Study, “von den Bewegungen und Umlegungen,” Math. Ann.39, 441–565 (1891)), resultant method, and the Gröbner basis in seven-dimensional kinematic space. The obtained solution in seven-dimensional kinematic space of the forward kinematic problem is mapped into three-dimensional Euclidean space. An alternative solution of the forward kinematic problem is obtained using resultant method in three-dimensional Euclidean space, and the result is compared with the obtained mapping result from seven-dimensional kinematic space. Both approaches lead to the same maximum number of solutions: 2, 6, 6, 6, 2, 2, 2, 6, 2, and 2 for the forward kinematic problem of planar parallel robots; 3-RPR, 3-RPR, 3-RRR, 3-RRR, 3-RRP, 3-RPP, 3-RPP, 3-PRR, 3-PRR, and 3-PRP, respectively.


Sign in / Sign up

Export Citation Format

Share Document