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 166 for “"Point sets"”.
-
Organizing Point Sets
… Delaunay Tessellations and flow complexes of point sets. For space-filling curve orders and Delaunay Tessellations the emphasis lies on an average-case analysis of the algorithms. For flow complexes the emphasis lies on their computation in higher dimensions. In a space-filling curve order of …
-
Concerning Scattered Point Sets
Made available in DSpace on 2015-05-12T17:09:35Z (GMT). No. of bitstreams: 2 license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5) 6200536.PDF: 1305698 bytes, checksum: 39f68772311df4d3e9ccc5af1bba6ca0 (MD5) Previous issue date: 1961
-
Concerning Locally Compact and Closed Point Sets.
… Axioms 0 and 13, no locally compact and perfect point set is countable.
-
Optimal Point Sets With Few Distinct Triangles
In this thesis we consider the maximum number of points in $mathbb{R}^d$ which form exactly $t$ distinct triangles, which we denote by $F_d(t)$. We determine the values of $F_d(1)$ for all $dgeq3$, as well as determining $F_3(2)$. It was known from the work of Epstein et al. cite{Epstein} that …
-
Geometric and arithmetic structure in finite point sets
… Chapter 4, we prove that if a finite set of points in the real plane determines, up to multiplicative constants, the smallest possible number of congruency classes of triangles, then it must have a large intersection with a line or a circle.<br/><br/>In Chapter 5, we develop upon the …
-
Congruence Testing for Point Sets in 4-Space
… high regularities are forced in the structure of point sets. This lets us encounter beautiful mathematical structures on a 3-sphere and the symmetry group of finite points: the Hopf fibration of a 3-sphere and the Coxeter group of four-dimensional point groups. We also give an elementary and …
-
Computing Exact Bottleneck Distance on Random Point Sets
Given a complete bipartite graph on two sets of points containing n points each, in a bottleneck matching problem, we want to find an one-to-one correspondence, also called a matching, that minimizes the length of its largest edge; the length of an edge is simply the Euclidean distance between its …
-
Concerning the Covering of Closed and Compact Point Sets.
… to prove that every closed and compact point set which is covered by a collection of domains is covered by a finite subcollection of those domains.
-
A Covering Theorem for Closed and Compact Point Sets.
… 0 and Axiom 13 that if M is a closed and compact point set and Gis a collection of domains covering M, then there is a finite subcollection of G which covers M. All of the work presented in this thesis, including the proofs of all of the theorems, is my own.
-
On Continuity of Functions Defined on Unrestricted Point Sets
This thesis is concerned with an investigation of the generalizations of continuous real functions of a real variable. In particular, the relationship between uniform continuity and ordinary continuity is concerned. The concept of uniform continuity was first introduced by Heine about 1900.
-
A Relation for Point Sets in a Topological Space
… this thesis is to investigate the relation Z for point sets in a topological space. There were two original goals which caused the study.
-
Optimal Bichromatic Plane Spanning Trees For Special Point Sets
Given a point set S=RꓴB, where R is a set of red points and B is a set of blue points, we desire to find T*, a minimum weight spanning tree such that every edge has one red endpoint and one blue endpoint and no two edges cross. We call T* a bichromatic plane minimum spanning tree (MinBPST). We say …
-
Tent-maps, two-point sets, and the self-Tietze property
… <p>A subset of the plane is a <em>two-point set</em> if it meets every straight line in exactly two points. We show that a two-point set cannot contain a dense <em>G<sub>δ</sub></em> subset of an arc. We also show that the complement of a two-point set is necessarily path-connected. …
-
Novel algorithms for optimal triangulation and polygonization of planar point sets
… Minimum Weight Triangulation of Planar Point Sets We introduce a novel heuristic for the problem of finding close approximations to Minimum Weight Triangulation (MWT) of a planar point set, a classical problem of computational geometry with many applications. Our algorithm constructs …
-
A convex hull algorithm optimal for point sets in even dimensions
Finding the convex hull of a finite set of points is important not only for practical applications but also for theoretical reasons: a number of geometrical problems, such as constructing Voronoi diagrams or intersecting hyperspheres, can be reduced to the convex hull problem, and a fast convex …
Page 1 of 9