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 39 for “"Point sets"”.

  1. 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

    uiuc Repository record for Concerning Scattered Point Sets (opens in a new tab)

  2. Diffraction of point sets with structural disorder

    Die vorliegende Arbeit behandelt Diffraktionseigenschaften gewisser zufälliger Strukturen. Hierbei sind die Strukturen beschrieben durch (gewichtete) Zählmaße. Untersucht werden dann die zugehörigen Diffraktionsmaße, die durch die Fourier-Transformierten der jeweiligen Autokorrelationsmaße gegeben …

    bielefeld Repository record for Diffraction of point sets with structural disorder (opens in a new tab)

  3. Concerning Locally Compact and Closed Point Sets.

    … Axioms 0 and 13, no locally compact and perfect point set is countable.</p>

    uab Repository record for Concerning Locally Compact and Closed Point Sets. (opens in a new tab)

  4. 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 …

    vt Repository record for Optimal Point Sets With Few Distinct Triangles (opens in a new tab)

  5. 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 …

    vt Repository record for Computing Exact Bottleneck Distance on Random Point Sets (opens in a new tab)

  6. 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.

    uab Repository record for Concerning the Covering of Closed and Compact Point Sets. (opens in a new tab)

  7. 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.

    uab Repository record for A Covering Theorem for Closed and Compact Point Sets. (opens in a new tab)

  8. Concerning the Covering Theorem for Closed and Perfectly Compact Point Sets.

    … the following is a theorem: If M is a closed point set, then M is perfectly compact if, and only if, when G is a collection of regions covering M, then some finite subcollection of G covers M.&#xa0;

    uab Repository record for Concerning the Covering Theorem for Closed and Perfectly Compact Point Sets. (opens in a new tab)

  9. Topology of the nodal and critical point sets for eigenfunctions of elliptic operators,

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1971.

    mit Repository record for Topology of the nodal and critical point sets for eigenfunctions of elliptic operators, (opens in a new tab)

  10. Graphs of integral distance and their properties

    Understanding the geometries of points in space has been attractive to mathematicians for ages. As a model, twelve years ago, Kurz and Meyer [32] considered point sets in the m-dimensional a ne space Fmq over a nite eld Fq with q = pr elements, p prime, where each squared Euclidean distance of two …

    western-cape Repository record for Graphs of integral distance and their properties (opens in a new tab)

  11. Parametric curve and Partial Differential Equation-based parametric surface reconstruction from point clouds

    … while implicit representations encom- pass level sets, distance functions, and Constructive Solid Ge- ometry (CSG), among others. Parametric models are especially popular in 3D modelling, design, and manufacturing because they are mathematically defined, making them easy to edit, transmit, and …

    bournemouth Repository record for Parametric curve and Partial Differential Equation-based parametric surface reconstruction from point clouds (opens in a new tab)

  12. The power of random information for numerical approximation and integration

    … information given by function values at sampling point sets. We obtain an asymptotic characterization of the radius of information in terms of a geometric measure of equidistribution, the distortion, which is well known in the theory of quantization of measures. This holds for isotropic Sobolev as …

    passau-thes Repository record for The power of random information for numerical approximation and integration (opens in a new tab)

  13. Concerning the Dedekind Cut Proposition.

    … the set to which P belongs if and only if P is a point.The statement that the collection G of point sets covers the point set M means that if P is a point of M, then P belongs to some set of the collection G.

    uab Repository record for Concerning the Dedekind Cut Proposition. (opens in a new tab)

  14. Small and Stable Descriptors of Distributions for Geometric Statistical Problems

    … how to sparsely represent distributions of points for geometric statistical problems. A <italic>coreset<italic> C is a small summary of a point set P such that if a certain statistic is computed on P and C, then the difference in the results is guaranteed to be bounded by a parameter …

    duke Repository record for Small and Stable Descriptors of Distributions for Geometric Statistical Problems (opens in a new tab)

  15. Multimodal data analysis applied to a medical setting

    … spatial distribution patterns of individual point sets and interactions between multiple point sets. We propose to improve the histopathology image features by incorporating this descriptor to capture the spatial distribution of the cells, and interactions between lymphocytes and epithelial …

    uiuc Repository record for Multimodal data analysis applied to a medical setting (opens in a new tab)

  16. Homoclinic Points in the Composition of Two Reflections

    … that guarantees the existence of homoclinic points. To be more precise, let $f,g:R \to R$ be $C^1$ functions with domain all of $R$. Let $F:R^2 \to R^2$ denote a horizontal reflection in the curve $x=-f(y)$, and let $G:R^2 \to R^2$ denote a vertical reflection in the curve $y=g(x)$. We …

    queens Repository record for Homoclinic Points in the Composition of Two Reflections (opens in a new tab)

  17. Concerning the Dedekind Cut Proposition.

    … Proposition states that if H and K are two subsets of the arc AB such that each point of AB belongs to H or K in the order from A to B on AB, then either H has a last point or K has a first point in that order.

    uab Repository record for Concerning the Dedekind Cut Proposition. (opens in a new tab)

  18. Fibonacci Sets In Discrepancy Theory and Numerical Integration

    <p> We study the Fibonacci Sets from the point of view of their quantity with respect to discrepancy and numerical integration. We give a Fourier analytic proof of the fact that symmetrized Fibonacci Set has asymptotically minimal L2 discrepancy. This approach also yields an exact formula for this …

    south-carolina Repository record for Fibonacci Sets In Discrepancy Theory and Numerical Integration (opens in a new tab)

Page 1 of 2