Digital Modeling and Movement Resolution of Rubber Ballon Analogy for 3D Packing Problem

2013 ◽  
Vol 753-755 ◽  
pp. 1670-1674
Author(s):  
Jun Yan Ma ◽  
Feng Ying Long ◽  
Xiao Ping Liao ◽  
Biao Chen ◽  
Juan Lu ◽  
...  
Keyword(s):  
Convex Hull ◽  
Extreme Points ◽  
Packing Problem ◽  
Maximum Distance ◽  
Distance Method ◽  
Resultant Vector ◽  
Digital Modeling ◽  
3D Packing ◽  
Volume Decrease ◽  
Modeling Algorithm

Packing problem is how to arrange the components in available spaces to make the layout compact. This paper adopts a digital modeling algorithm to establish a novel rubber ballon convex hull model to solve this problem. A visible point puls maximum distance method analogy QuickHull algorithm is presented to get extreme points of rubber ballon convex hull. Movement resolution aim at force analyze and calculate the resultant vector to translate, rotate and slide the component to make the volume decrease in detail. An experiment proved this digital modeling algorithm effective.

Digital Modeling and Movement Resolution of Rubber Band Analogy for 2D Packing Problem

2012 ◽  
Vol 220-223 ◽  
pp. 2466-2470 ◽  
Author(s):  
Jun Yan Ma ◽  
Xiao Ping Liao ◽  
Juan Lu ◽  
Hong Yao
Keyword(s):  
Convex Hull ◽  
Extreme Points ◽  
Packing Problem ◽  
Rubber Band ◽  
Scanning Method ◽  
Resultant Vector ◽  
Digital Modeling ◽  
Volume Decrease ◽  
Modeling Algorithm

Packing problem is how to arrange the components in available spaces to make the layout compact. This paper adopts a digital modeling algorithm to establish a novel rubber band convex hull model to solve this problem. A ray scanning method analogy QuickHull algorithm is presented to get extreme points of rubber band convex hull. A plural vector expression approach is adopted to movement resolution,which calculate the resultant vector to translate, rotate and slide the subbody to make the volume decrease. An experiment proved this digital modeling algorithm effective.

A Fast 3D-BSG Algorithm for 3D Packing Problem

2007 ◽  
Author(s):  
Lingyi Zhang ◽  
Sheqin Dong ◽  
Xianlong Hong ◽  
Yuchun Ma
Keyword(s):  
Packing Problem ◽  
3D Packing

The Min-Max Load Criteria as a Measure of Machining Fixture Performance

1994 ◽  
Vol 116 (4) ◽  
pp. 500-507 ◽  
Author(s):  
E. C. DeMeter
Keyword(s):  
Convex Hull ◽  
Linear Model ◽  
Model Validation ◽  
Contact Region ◽  
Extreme Points ◽  
Simulation Experiments ◽  
Machining Operations ◽  
The Impact ◽  
External Loads ◽  
The Continuum

Spherical-tipped locators and clamps are often used for the restraint of castings during machining. For structurally rigid castings, contact region deformation and micro-slippage are the predominant modes of workpiece displacement. In turn contact region deformation and micro-slippage are heavily influenced by contact region loading. This paper presents a linear model for predicting the impact of locator and clamp placement on workpiece displacement throughout a series of machining operations. It illustrates how the continuum of external loads exerted on a workpiece during machining can be bounded within a convex hull, and how the extreme points of this hull are used within the model. Finally it describes the simulation experiments which were used for model validation.

scholarly journals Some results on isometric composition operators on Lipschitz spaces

2021 ◽  
Author(s):  
Abraham Rueda Zoca
Keyword(s):  
Convex Hull ◽  
Composition Operator ◽  
Metric Spaces ◽  
Composition Operators ◽  
Extreme Points ◽  
Necessary Condition ◽  
Closed Convex Hull ◽  
Lipschitz Spaces ◽  
Complete Characterisation

AbstractGiven two metric spaces M and N we study, motivated by a question of N. Weaver, conditions under which a composition operator $$C_\phi :{\mathrm {Lip}}_0(M)\longrightarrow {\mathrm {Lip}}_0(N)$$ C ϕ : Lip 0 ( M ) ⟶ Lip 0 ( N ) is an isometry depending on the properties of $$\phi $$ ϕ . We obtain a complete characterisation of those operators $$C_\phi $$ C ϕ in terms of a property of the function $$\phi $$ ϕ in the case that $$B_{{\mathcal {F}}(M)}$$ B F ( M ) is the closed convex hull of its preserved extreme points. Also, we obtain necessary condition for $$C_\phi $$ C ϕ being an isometry in the case that M is geodesic.

Development of youth diplomacy on the example of modeling international organizations

2021 ◽  
Author(s):  
N.N. Popova ◽  
A.I. Potapkina
Keyword(s):  
International Relations ◽  
United Nations ◽  
International Organizations ◽  
Digital Technologies ◽  
Youth Movement ◽  
Digital Modeling ◽  
The United Nations ◽  
Foreign Ministry ◽  
Modeling Algorithm

The article highlights the importance of the youth movement and international organizations as one of the practical areas of implementation of youth diplomacy. The authors describe the development of the International Youth Model of the UN in the Diplomatic Academy of the Russian Foreign Ministry. Special attention is paid to the transformation of the traditional modeling algorithm in the context of the development of digital technologies. The development of a new stage of the youth model movement in the fi eld of international relations — digital modeling of the United Nations-was announced.

scholarly journals Smart Packing Simulator for 3D Packing Problem Using Genetic Algorithm

2020 ◽  
Vol 1447 ◽  
pp. 012041
Author(s):  
U. Khairuddin ◽  
N. A. Z. M. Razi ◽  
M. S. Z. Abidin ◽  
R. Yusof
Keyword(s):  
Genetic Algorithm ◽  
Packing Problem ◽  
3D Packing

The number of extreme points in the convex hull of a random sample

1991 ◽  
Vol 28 (02) ◽  
pp. 287-304 ◽  
Author(s):  
David J. Aldous ◽  
Bert Fristedt ◽  
Philip S. Griffin ◽  
William E. Pruitt
Keyword(s):  
Convex Hull ◽  
Random Sample ◽  
Limit Distribution ◽  
Extreme Points ◽  
Radial Component ◽  
Limiting Distribution ◽  
Precise Information ◽  
Mean And Variance ◽  
The Mean

Let {Xk} be an i.i.d. sequence taking values in ℝ2with the radial and spherical components independent and the radial component having a distribution with slowly varying tail. The number of extreme points in the convex hull of {X1, · ··,Xn} is shown to have a limiting distribution which is obtained explicitly. Precise information about the mean and variance of the limit distribution is obtained.

A Multi-Objective Simulated Annealing Approach Towards 3D Packing Problems With Strong Constraints: CMOSA

2015 ◽  
Author(s):  
Pei Cao ◽  
Zhaoyan Fan ◽  
Robert Gao ◽  
Jiong Tang
Keyword(s):  
Simulated Annealing ◽  
Additive Manufacturing ◽  
Engineering Design ◽  
Packing Problem ◽  
Line Length ◽  
Structural Components ◽  
Packing Problems ◽  
3D Packing ◽  
Analytical Expressions

This research concerns the packing problem frequently encountered in engineering design, where the volume and weight of a number of structural components such as valves and plumbing lines need to be minimized. Since in real applications the constraints are usually complex, the formulation of computationally tractable optimization becomes challenging. In this research, we propose a novel multiobjective simulated annealing (MOSA) approach towards the design optimization, i.e., optimizing the placement of valves under prescribed constraints to minimize the volume occupied, and the estimated plumbing line length. The objectives and constraints are described by analytical expressions. Our case study indicates that the new MOSA algorithm has relatively better performance towards 3D packing with strong constraints and the design can indeed be automated. The outcome of this research may benefit both existing manufacturing practice and future additive manufacturing.

Sign in / Sign up

Export Citation Format

Share Document