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 735 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.
-
Generating Kernel Aware Polygons
Problems dealing with the generation of random polygons has important applications for evaluating the performance of algorithms on polygonal domain. We review existing algorithms for generating random polygons. We present an algorithm for generating polygons admitting visibility properties. In …
-
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 …
-
Construction of regular polygons.
Typewritten sheets in cover. Thesis (M.A.)--Boston University, 1931. Bibliography: p. 57-58
-
Pursuit Evasion in Simple Polygons
Pursuit evasion in simple polygons is fundamentally searching for an evader in a simple polygon. Popular problems in polygon searching include the room search problem and the two guard problem. Many practical applications, such as search for an evader in a dark house, rescue of a victim in a …
-
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.) This software architecture includes "building blocks" which specify the actual manipulations and …
-
Shortest paths in weighted polygons.
… q. We solve this problem in O(n) time for convex polygons. For simple polygons, we show two algorithms. The first algorithm runs in O(E log n) time using O(E) space (where E is the size of the visibility of P). The second algorithm has two variations which both require O(n E log n) preprocessing …
-
Area of polygons in hyperbolic geometry
Consider the Poincare model for hyperbolic geometry on the unit disc and an arbitrary n-gon in this geometry. Chapter I gives a brief introduction to the conformal metric, which generates hyperbolic geometry. In Chapter H, there is an analytic derivation of a convenient computational formula for …
-
Spatial-temporal analysis of moving polygons
… method for spatial-temporal analysis of moving polygons (STAMP). Using an event-based framework, polygons from neighboring time periods are related by spatial overlap and proximity. The proximity spatial relation is defined by an application specific distance threshold. STAMP is demonstrated in …
-
Studies on Kernels of Simple Polygons
… a strongly monotone polygon into star-polygons. This decomposition is applied for developing an efficient algorithm for placing a small number of vertical towers to cover the entire given 1.5D terrain. We also present an experimental investigation of the proposed algorithm. The …
-
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 …
-
Partitioning polygons into disjoint axisparallel strips
A relevant problem for manufacturing is that of finding a minimum-turn path that covers a surface. One way of doing this is by converting the surface into a grid adhering polygon and partitioning it into single-width rectangles, or “strips”. The focus of this thesis is on finding such a partition …
-
Generalized star polygons and star polygrams
We extend the definition of regular star polygons and other regular star polygrams to be drawn within some non self-intersecting polygon instead of just regular polygons. Instead of only connecting corners some constant apart, we allow any two corners of the polygon to be connected to form a …
-
Symplectic Structures on Spaces of Polygons
… their lengths are called its side lengths. All polygons of fixed side lengths make up a space, and one may put symplectic structures on this space. In this text we shall describe two ways to do this; these ways, making use of a method called symplectic reduction, are due to Haussmann-Knutson [5] …
Page 1 of 37