نتایج جستجو برای: rigid and open boundaries

تعداد نتایج: 16882375  

1999
Takashi Kanai Hiromasa Suzuki Jun Mitani Fumihiko Kimura

This paper proposes a new mesh modeling scheme, called mesh fusion, based on three-dimensional (3D) meshbased metamorphosis. We establish the attachment from a part of one mesh to a part of another with smooth boundaries, employing the traditional cutting and pasting operation in conjunction with a combination of meshes, applying the idea of 3D metamorphosis. We also offer an algorithm for adju...

2012
Olivier Glass Franck Sueur Takéo Takahashi

We consider the motion of a rigid body immersed in an incompressible perfect fluid which occupies a threedimensional bounded domain. For such a system the Cauchy problem is well-posed locally in time if the initial velocity of the fluid is in the Hölder space C. In this paper we prove that the smoothness of the motion of the rigid body may be only limited by the smoothness of the boundaries (of...

2008
J. W. van Holten

The dynamical behaviour of domain boundaries between different realizations of the vacuum of scalar fields with spontaneously broken phases is investigated. They correspond to zero-modes of the Goldstone fields, moving with the speed of light, and turn out to be accompanied by strongly oscillating gravitational fields. In certain space-time topologies this leads to a quantization condition for ...

Journal: :Journal of the Korea Academia-Industrial cooperation Society 2013

Journal: :Discrete Applied Mathematics 2013
Bill Jackson Tibor Jordán Csaba Király

Tensegrity frameworks are defined on a set of points in Rd and consist of bars, cables, and struts, which provide upper and/or lower bounds for the distance between their endpoints. The graph of the framework, in which edges are labeled as bars, cables, and struts, is called a tensegrity graph. It is said to be strongly rigid in Rd if every generic realization in Rd as a tensegrity framework is...

Journal: :Discrete & Computational Geometry 2011
Bill Jackson Peter Keevash

A direction-length framework is a pair (G, p), where G = (V ;D,L) is a ‘mixed’ graph whose edges are labeled as ‘direction’ or ‘length’ edges, and p is a map from V to R for some d. The label of an edge uv represents a direction or length constraint between p(u) and p(v). Let G be obtained from G by adding, for each length edge e of G, a direction edge with the same end vertices as e. We show t...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید