Under the extra assumption that the boundary is of class C this was proven by S. Nakajima (= A. Matsumura) in 1926 Theorem 1 solves this problem. For convex bodies with C boundaries and positive curvature Nakajima’s result was generalized by Chakerian [?] in 1967 to “relative geometry” where the width and brightness are measured with with respect to some convex body K0 symmetric about the origi...

Vacuum.-By creating a vacuum the process of decalcification can be characterized as follows: Insoluble calciurn-salts+acid o-soluble calciumsalts+CO2. The carbon dioxide, rapidly extracted, will disturb the balance of the chemical equilibrium, and, according to Le Chatelier, result in an acceleration of the reaction. Waerhaug (1949), however, points out that there will be a more intensive conta...

TheMinkowski sum of two setsA,B ∈ IR, denotedA⊕B, is defined as {a+ b | a ∈ A, b ∈ B}. We describe an efficient and robust implementation for the construction of Minkowski sums of polygons in IR using the convolution of the polygon boundaries. This method allows for faster computation of the sum of non-convex polygons in comparison to the widely-used methods for Minkowski-sum computation that d...

This paper presents a new algorithm for computing the hit point and normal of a ray and a general convex object. The algorithm is loosely based on the the Gilbert-Johnson-Keerthi algorithm for computing the distance between convex objects in the sense that it is applicable to the same family of convex objects and uses the same subalgorithm for computing the closest point of a simplex. Since thi...

Asexual reproduction is one of the most important traits in the evolutionary history of corals. No real-time observations of asexual reproduction in azooxanthellate solitary scleractinian corals have been conducted to date. Here, we describe previously unknown aspects of asexual reproduction by using Truncatoflabellum spheniscus (Family Flabellidae) based on observations of transverse division ...

Data logics are logical formalisms that are used to specify properties on structures equipped with data (data words, data trees, runs from counter systems, timed words, etc.). In this survey talk, we shall see how satisfiability problems for such data logics are related to reachability problems for counter systems (including counter automata with errors, vector addition systems with states, etc...

We survey the connection between two results from rather different areas: failure of the 3-space property for local convexity (and other properties) within the category of quasiBanach spaces, and the irreducibility (in the sense of Minkowski difference) of large families of finite dimensional polytopes. Mathematics subject classification (2010): 46A16, 46B03, 52B15..