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 2292 for “"euclidean"”.

  1. Using non-Euclidean geometry in the Euclidean classroom

    … the ramifications of supplementing the basic Euclidean geometry, with spherical geometry, a non-Eugledian geometry curriculum. This project examined different aspects of the impact of spherical geometry on the high school geometry classroom.

    csusb Repository record for Using non-Euclidean geometry in the Euclidean classroom (opens in a new tab)

  2. Using non-Euclidean geometry in the Euclidean classroom

    … the ramifications of supplementing the basic Euclidean geometry, with spherical geometry, a non-Eugledian geometry curriculum. This project examined different aspects of the impact of spherical geometry on the high school geometry classroom.

    csusb-retro Repository record for Using non-Euclidean geometry in the Euclidean classroom (opens in a new tab)

  3. Euclidean Rings

    … of equivalence classes of primes in non-trivial Euclidean domains is discussed with reference to the categories "finite" and "infinite." It is shown that no Euclidean domains exist for which both of these sets are finite. The other three combinations are possible and examples are given. For the …

    unt Repository record for Euclidean Rings (opens in a new tab)

  4. Euclidean Domains

    In the usual definition of a Euclidean domain, a ring has a norm function whose codomain is the positive integers. It was noticed by Motzkin in 1949 that the codomain could be replaced by any well-ordered set. This motivated the study of transfinite Euclidean domains in which the codomain of the …

    byu Repository record for Euclidean Domains (opens in a new tab) Download PDF for Euclidean Domains (opens in a new tab)

  5. Euclidean N-space

    This study of the Euclidean N-space looks at some definitions and their characteristics, some comparisons, boundedness and compactness, and transformations and mappings.

    unt Repository record for Euclidean N-space (opens in a new tab)

  6. Registration of Diffusion Tensor Images in Log-Euclidean and Euclidean Space

    Diffusion Tensor Imaging is a type of Magnetic Resonance Imaging that allows for the examination of brain connectivity and axonal integrity. Diffusion Tensor Images are created by capturing Diffusion-Weighted MRI images with specific RF pulses, inputing the images and the RF pulse gradient vectors …

    rit Repository record for Registration of Diffusion Tensor Images in Log-Euclidean and Euclidean Space (opens in a new tab)

  7. The Euclidean arborescence problem

    The Euclidean arborescence problem involves the creation of rooted trees embedded in the plane using the L2 distance metric. These trees are interesting in that they have a low cost yet offer responsive service from the root to any other vertex. As such, arborescences have their cost compared to …

    sask Repository record for The Euclidean arborescence problem (opens in a new tab)

  8. Duality in Euclidean geometry

    Thesis (M.A.)--University of Kansas, Mathematics, 1928.

    ku Repository record for Duality in Euclidean geometry (opens in a new tab)

  9. Using geometric algebra to interactively model the geometry of Euclidean and non-Euclidean spaces.

    … software for exploring 2-dimensional non-Euclidean spaces. The conformal model of space extends the standard projective model – instead of adding just one extra dimension to standard Euclidean space, a second one is added that results in a Minkowski space similar to that of relativistic …

    middlesex Download PDF for Using geometric algebra to interactively model the geometry of Euclidean and non-Euclidean spaces. (opens in a new tab)

  10. HENSTOCK INTEGRATION ON EUCLIDEAN SPACES

    The Henstock integral is designed to integrate highly oscillatory functions which the Lebesgue integral fails to do so. It is known that the multidimensional Henstock integral includes the Lebesgue integral. The main purpose of this thesis is to provide some recent development in the m--dimensional …

    nus Repository record for HENSTOCK INTEGRATION ON EUCLIDEAN SPACES (opens in a new tab) Download file for HENSTOCK INTEGRATION ON EUCLIDEAN SPACES (opens in a new tab)

  11. Fault Tolerant Euclidean K-Centers

    The Euclidean \emph{k}-center problem is a fundamental question in computational geometry and facility location. Given a set $P$ of $n$ points in $\mathbb{R}^d$, the goal is to choose a set $F$ of $k$ center points such that the maximum distance from any point in $P$ to its nearest center in $F$ is …

    manitoba Repository record for Fault Tolerant Euclidean K-Centers (opens in a new tab)

  12. Fault tolerant Euclidean K-Centers

    The Euclidean k -center problem is a fundamental question in computational geometry and facility location. Given a set P of n points in Rd, the goal is to choose a set F of k center points such that the maximum distance from any point in P to its nearest center in F is minimized. Geometrically, …

    manitoba Repository record for Fault tolerant Euclidean K-Centers (opens in a new tab)

  13. Geometric algebras for Euclidean geometry

    Doktorská práce sjednocuje matematickou teorii geometrických algeber G_3, PGA, CGA a jejich 2D alternativ. Je popsáno vnoření těchto algeber, včetně sjednocení reprezentací geometrických objektů a transformací. Vlastnosti 2D algeber jsou využity k řešení planárních problémů v obecné rovině v 3D. …

    brno-tech Repository record for Geometric algebras for Euclidean geometry (opens in a new tab)

  14. On Nearly Euclidean Thurston Maps

    Nearly Euclidean Thurston maps are simple generalizations of rational Lattes maps. A Thurston map is called nearly Euclidean if its local degree at each critical point is 2 and it has exactly four postcritical points. We investigate when such a map has the property that the associated pullback map …

    vt Repository record for On Nearly Euclidean Thurston Maps (opens in a new tab)

  15. Binary Frames, Codes and Euclidean Embeddings

    … parts. The first part is concerned with using Euclidean embeddings and random hyperplane tessellations to construct binary block codes. The construction proceeds in two stages. First, an auxiliary ternary code is chosen which consists of vectors in the union of coordinate subspaces. The …

    houston Repository record for Binary Frames, Codes and Euclidean Embeddings (opens in a new tab)

  16. Clustering moving entities in euclidean space

    Clustering is a fundamental problem of spatio-temporal data analysis. Given a set X of n moving entities, each of which corresponds to a sequence of tau time-stamped points in R^d, a k-clustering of X is a partition of X into k disjoint subsets that optimizes a given objective function. In this …

    manitoba Repository record for Clustering moving entities in euclidean space (opens in a new tab)

Page 1 of 115