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 6 of 6 for “"polygonal path"”.

  1. Combinatorial Models for DNA Rearrangements in Ciliates

    … recombination sites. We introduce a notion of polygonal path in assembly graph as a model for a single gene. Polygonal paths are defined as paths that make “90◦ -turn” at each vertex of the assembly graph and define smoothing of the vertices visited by the paths. Such vertex smoothing models a …

    usf Repository record for Combinatorial Models for DNA Rearrangements in Ciliates (opens in a new tab)

  2. Computational geometry on an integer grid

    … convex hull of n points, finding a simple closed polygonal path through n points, finding the diameter of a set of n points, deciding the separability question for two point sets, finding the smallest enclosing circle for a set of points, finding a triangulation of a set of n points and finding …

    ubc Repository record for Computational geometry on an integer grid (opens in a new tab) Download PDF for Computational geometry on an integer grid (opens in a new tab)

  3. Hamiltonian Sets of Polygonal Paths in 4-Valent Spatial Graphs

    … Recombined genes are modeled by certain types of paths in an assembly graph that make a ”oper pendicular ” turn at each 4–valent vertex of the graph called polygonal paths. The assembly number of an assembly graph is the minimum number of polygonal paths that visit each vertex exactly once. In …

    usf Repository record for Hamiltonian Sets of Polygonal Paths in 4-Valent Spatial Graphs (opens in a new tab)

  4. Motion Planning with Discrete Geodesics

    … the environment. This thesis considers discrete path planning problems for unmanned vehicles. The shortest continuous path for a constant speed vehicle from any arbitrary initial location and orientation to any arbitrary final location and orientation in the absence of obstacles takes the form of …

    tamu Repository record for Motion Planning with Discrete Geodesics (opens in a new tab)

  5. Shape Matching in Higher Dimensions

    … represented as sets of simplicial objects or as polygonal curves with a given parametrization. The considered distance measures are mainly the Hausdorff distance and the Fréchet distance. In the literature most matching algorithms either attack two-dimensional problems, or consider finite point …

    fu-berlin Repository record for Shape Matching in Higher Dimensions (opens in a new tab)

  6. Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability

    … corresponds to a directed Hamiltonian polygonal path within a directed assembly graph. Starting from a given assembly graph, we construct all the associated micronuclear arrangements. Another way of modeling genetic rearrangement is to represent precursor and product genes as a sequence …

    usf Repository record for Recursive Methods in Number Theory, Combinatorial Graph Theory, and Probability (opens in a new tab)