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 161 for “"Polygons"”.
-
Convex lattice polygons
… three main extremal problems on convex lattice polygons in the plane. A convex lattice polygon is the intersection of a compact convex set with the integer lattice (the set of all points with integer coordinates). Let P represent a convex lattice polygon.
-
Visibility properties of polygons
Two problems dealing with visibility in the interior of a polygon are investigated. We present a linear time algorithm for computing the stair-case visibility polygon from a point inside a simple polygon, which is optimal within a constant factor. We show that the problem of locating the minimum …
-
Polygons, stars, and clusters
… which people categorize information presented as polygons. Variables included background information of the display, shading, and form. Subjects performed a categorization task on two sets of data; the results are analyzed for consistency between individuals and for consistency with certain …
-
Manipulation of 3D knotted polygons
… the computational investigation of random polygons in 3 space. The random polygons themselves are a simple model of long polymer chains. (A DNA molecule is one example of a polymer.)</p> <p>This software architecture includes "building blocks" which specify the actual manipulations and …
-
An Algorithm for Triangulating 3D Polygons
… a triangulation of multiple, non-planar 3D polygons. The output minimizes additive weights, such as the total triangle areas or the total dihedral angles between adjacent triangles. Our algorithm generalizes a classical method for optimally triangulating a single polygon. The key novelty is …
-
Guarding Polygons With Mutually Visible π-Guards
… proving that ²ⁿ−²/₃ ≤ g(n) ≤ ⁴ⁿ/₅ for simple polygons. As for orthogonal polygons, we define ḡ(n) analogously and prove that ³ⁿ−⁴/₇ ≤ ḡ(n) ≤ ⁿ/₂. These lower bounds are existential, as we construct specific polygon families requiring the stated number of guards. Our methodology involves …
-
Variations on Zombies and Survivor in Simple Polygons
… a survivor on point visibility graphs of simple polygons. A zombie has one objective: catch a survivor by occupying the vertex occupied by the survivor. On its turn, a zombie can only move on the first edge of a \textit{geodesic} path to the survivor's location. A survivor may choose to move to …
-
Evaluating methods for characterizing slope conditions within polygons
… determining and characterizing slope values in polygons and how these methods affect natural resource models. Eight different previously used methods for determining cell slope values were compared using elevation data from the USGS Big Stone Gap, Virginia, Digital Elevation Model. The 28 …
-
Generating Random Walks and Polygons with Thickness in Confinement
… of unit-length, freely-jointed segments) and polygons (closed walks) in spherical confinements have been developed in the last few years. These algorithms generate polygons inside spherical confinement based on their mathematically derived probability distributions. The generated polygons do …
-
Illuminating triangles, quadrilaterals and convex polygons with vertex floodlights.
This work presents the solution to three problems in Computational Geometry. First we introduce a theorem to illuminate every triangle with three p6 vertex-floodlights and we provide three proofs. Secondly we show that three p4 vertex-floodlights suffice to illuminate every quadrilateral. Finally …
-
Closed quasigeodesics, escaping from polygons, and conflict-free graph coloring
… and an edge not containing it. Escaping from polygons. You move continuously at speed 1 in the interior of a polygon P, trying to reach the boundary. A zombie moves continuously at speed r outside P, trying to be at the boundary when you reach it. For what r can you escape and for what r can …
-
Tomographic reconstruction of polygons from knot locations and chord length measurements
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.
-
Purity of the stratification by Newton polygons and Frobenius-periodic vector bundles
… a purity theorem for stratifications by Newton polygons coming from crystalline cohomology, which says that the family of Newton polygons over a noetherian scheme have a common break point if this is true outside a subscheme of codimension bigger than 1. The proof is similar to the proof of …
-
Boundary perturbation of the Laplace eigenvalues and applications to electron bubbles and polygons
… the expansion of simple eigenvalues on regular polygons in powers of 1/N.
-
A Transfer Matrix Approach to Studying the Entanglement Complexity of Self-Avoiding Polygons in Lattice Tubes
Self-avoiding polygons (SAPs) are a well-established useful model of ring polymers and they have also proved useful for addressing DNA topology questions. Motivated by exploring the effects of confinement on DNA topology, in this thesis, SAPs are confined to a tubular sublattice of the simple cubic …
Page 1 of 9