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 3 of 3 for “"Intersection algorithms"”.
-
Intersection Algorithms Based On Geometric Intervals
<p>This thesis introduces new algorithms for solving curve/curve and ray/surface intersections. These algorithms introduce the concept of a geometric interval to extend the technique of Bézier clipping. A geometric interval is used to tightly bound a curve or surface or to contain a point on a …
-
Matchings, matroids and submodular functions
… optimization: non-bipartite matching, matroid intersection, and submodular function minimization. We develop simple, efficient, randomized algorithms for the first two problems, and prove new lower bounds for the last two problems. For the matching problem, we give an algorithm for constructing …
-
Identification of desired operational spaces via numerical methods
… in non feasible optimisation. A numerical intersection algorithm has been developed that identifies the feasible region of operation known as the desired operational space. This is accomplished by finding the intersection of the required operational space and the achievable output …