Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 71 for “"Convex hull"”.
-
Fault-tolerant consensus in directed graphs and convex hull consensus
… • We propose a new consensus problem – convex hull consensus – in which the input is a vector of reals in the d-dimensional space, and the output is a convex polytope contained within the convex hull of all inputs at fault-free nodes. For asynchronous systems, we present an approximate …
-
Painted Trees and Pterahedra
Associahedra can be realized by taking the convex hull of coordinates derived from binary trees. Similarly, permutahedra can be found using leveled trees. In this paper we will introduce a new type of painted tree, (T ◦ Y)<sub><i>n</i></sub> where <i>n</i> is the number of interior nodes. We create …
-
The application of optimal transputer architecture to concurrent processing in the implementation of vision processing algorithms
… system. The Features extracted, involving Convex Hull, Convex Hull Deficiencies, Areas and Perimeters, and Shape Factors were used to build a Feature Vector. The use of this Feature Vector in Scene Interpretation, to realise Learn and Recognise functions has been investigated.<br/><br/>The …
-
A new hierarchy of relaxations for 0-1 mixed integer problems with application to some specially structured problems
… from the linear programming relaxation to the convex hull representation for linear mixed integer 0-1 problems, and is particularly designed to exploit explicit or implicit special structures defined by the constraints of a problem. Specifically, inherent special structures are exploited by …
-
Computational geometry through the information lens
… algorithms with running time 9 ... ) for 3-d convex hull, 2-d Voronoi diagram, 2-d line segment intersection, and a variety of related problems. * a data structure for 2-d dynamic convex hull, with O ( ... )query time, and O ( ... ) update time. More generally, this thesis develops a suite of …
-
Sensing and filtering for localization tasks
… furthermore, demonstrate example tasks, such as convex hull computation, that can be performed using this information.
-
A new reformulation-linearization technique for the bilinear programming and related problems, with applications to risk management
… (BlP). BLP's are a class of nonlinear, non convex problems that belong to a higher class known as Biconvex Programming Problems (BCP). These problems find numerous applications in engineering, industrial, and management environments. The new algorithm develops a novel …
-
Topological modeling with simplicial complexes
… contained in S and whose underlying space is the convex hull of S. In this thesis we study different approaches for constructing subcomplexes of a geometric triangulation to obtain a good model of a given domain. The work described in this thesis is about regular triangulations, weighted …
-
A Geometric Approach to Least Squares
… are discovering an algorithm to compute the convex hull and outlining how lines are mapped onto the cylinder.
-
Observations on Convexity
<p>This thesis will explore convexity as it pertains to sets of complex-valued functions. These include preliminary looks at established linear and polynomially convex hulls, along with the development of new types of convex hulls. These types will include, but are not limited to the hulls …
-
The Hahn-Banach Separation Theorem in Free Convexity
… theorems on separation in the context of free convexity and matrix convex sets. After presenting a proof of the Hahn-Banach Separation Theorem, the main work in this thesis is a treatment of the Effros-Winkler Hahn-Banach Separation Theorem in the setting of matrix convex sets. This result is …
-
An exponential interpolation series
… the Borel transform of f(Z) and Γ encloses the convex hull of the singularities of F(ω). It is further shown that the series ∑<sup>∞</sup><sub>0</sub> U<sub>n</sub>(Z)/n! (e<sup>ω</sup> - 1)<sup>(n)</sup> forms a uniformly convergent Gregory-Newton series, convergent to e<sup>Zω</sup> in any …
-
Moment sequences and their applications
… upper functions V±(ð₁,... ð <sub>n</sub>) on the convex hull of the curve Γ<sub>n</sub> = {(t,.·.,t<sup>n</sup>): t ∈ [0,1] } for each positive integer n. Explicit formulas of these functions are derived and applied to the study of the subnormal completion problem in operator theory. Last, we …
-
Classification of species and color of finished wooden components
… linear discriminant functions using the convex hull is introduced. The effect of removing wood grain on texture and color identification is also considered. The classification system developed in this thesis has been successfully tested in the laboratory with a large number of samples.
-
Workspace Generation for Wire-Actuated Parallel Manipulators
… following methods. This thesis presents that the convex hull workspace formulation method, a geometric analysis of the manipulator’s Jacobian matrix, can be extended to manipulators that have an external wrench and/or gravity applied to the mobile platform. The convex hull method is applied to the …
-
Investigation into the stability of low-inertia micro-grids
… method to study the MG stability is a proposed convex hull-based trajectory reversing method. The proposed method estimates and enlarges the ROA of grid connected VSGs MG, regardless of complexity of its model or control scheme. A family of trajectories initiated close to the VSG equilibrium …
-
Design and operation of electricity markets: dynamics, uncertainty, pricing and competition
… mechanisms for electricity markets with nonconvexities are discussed. An extreme-point subdifferential (EPSD) algorithm for obtaining a global maximizer of the Lagrangian dual problem, interpreted as the convex hull price with the potential to reduce or eliminate uplift payments, is …
-
O-Minimal Fields With Standard Part Map
Let R be an o-minimal field and V a proper convex subring of R with residue field k. Let kind be the expansion of the residue field by the standard parts of definable relations on R. We investigate the definable sets in kind and conditions on (R,V) which imply o-minimality of kind. We also show …
-
Computing Interesting Topological Features
… takes each k-simplex in the Rips complex to the convex hull of the original points in the plane induces an isomorphism between the fundamental groups of both spaces. Since the union of these convex hulls is a polygonal region in the plane, possibly with holes, our result implies that the …
Page 1 of 4