Point-in-convex polygon and point-in-convex polyhedron algorithms with O(1) complexity using space subdivision

2016 ◽  
Author(s):  
Vaclav Skala
Keyword(s):  
Convex Polyhedron ◽  
Convex Polygon ◽  
Space Subdivision

scholarly journals Data-based polyhedron model for optimization of engineering structures involving uncertainties

2021 ◽  
Vol 2 ◽  
Author(s):  
Zhiping Qiu ◽  
Han Wu ◽  
Isaac Elishakoff ◽  
Dongliang Liu
Keyword(s):  
Linear Programming ◽  
Convex Polyhedron ◽  
Linear Optimization ◽  
Optimal Solution ◽  
Composite Plates ◽  
Convex Polyhedra ◽  
Chebyshev Inequality ◽  
Engineering Structures ◽  
Load Bearing ◽  
Polyhedron Model

Abstract This paper studies the data-based polyhedron model and its application in uncertain linear optimization of engineering structures, especially in the absence of information either on probabilistic properties or about membership functions in the fussy sets-based approach, in which situation it is more appropriate to quantify the uncertainties by convex polyhedra. Firstly, we introduce the uncertainty quantification method of the convex polyhedron approach and the model modification method by Chebyshev inequality. Secondly, the characteristics of the optimal solution of convex polyhedron linear programming are investigated. Then the vertex solution of convex polyhedron linear programming is presented and proven. Next, the application of convex polyhedron linear programming in the static load-bearing capacity problem is introduced. Finally, the effectiveness of the vertex solution is verified by an example of the plane truss bearing problem, and the efficiency is verified by a load-bearing problem of stiffened composite plates.

scholarly journals Convex Polyhedron Method to Stability of Continuous Systems with Two Additive Time-Varying Delay Components

2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Tiejun Li ◽  
Junkang Tian
Keyword(s):  
Stability Criterion ◽  
Convex Polyhedron ◽  
Linear Matrix ◽  
Continuous Systems ◽  
Time Varying ◽  
Time Varying Delay ◽  
Polyhedron Method ◽  
Delay Dependent ◽  
Delay Dependent Stability ◽  
Varying Delay

This paper is concerned with delay-dependent stability for continuous systems with two additive time-varying delay components. By constructing a new class of Lyapunov functional and using a new convex polyhedron method, a new delay-dependent stability criterion is derived in terms of linear matrix inequalities. The obtained stability criterion is less conservative than some existing ones. Finally, numerical examples are given to illustrate the effectiveness of the proposed method.

Learning gradual rules to model convex polygon-shaped classes

2010 ◽  
Author(s):  
Lavinia Darlea ◽  
Sylvie Galichet ◽  
Lionel Valet ◽  
Gabriel Vasile ◽  
Emmanuel Trouve
Keyword(s):  
Convex Polygon
Sign in / Sign up

Export Citation Format

Share Document