• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 54
  • 7
  • 5
  • 1
  • Tagged with
  • 80
  • 21
  • 16
  • 13
  • 10
  • 9
  • 9
  • 9
  • 8
  • 8
  • 7
  • 7
  • 7
  • 6
  • 6
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

From geometry to groups and back : the study of highly symmetric polytopes /

Hubard, Isabel A. January 2007 (has links)
Thesis (Ph.D.)--York University, 2007. Graduate Programme in Mathematics and Statistics. / Typescript. Includes bibliographical references (leaves 161-166). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:NR45997
2

The semiregular polytopes of the hyperspaces

Elte, Emanuel Lodewijk. January 1900 (has links)
Proefschrift--Groningen.
3

An efficient collision detection algorithm for polytopes in virtual environments

鍾達良, Chung, Tat-leung, Kelvin. January 1996 (has links)
published_or_final_version / Computer Science / Master / Master of Philosophy
4

Some contributions to the study of regular polytopes

Coxeter, Harold Scott Macdonald January 1931 (has links)
No description available.
5

An efficient collision detection algorithm for polytopes in virtual environments /

Chung, Tat-leung, Kelvin. January 1996 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1996. / Includes bibliographical references.
6

Petrie schemes /

Williams, Gordon, January 2002 (has links)
Thesis (Ph. D.)--University of Washington, 2002. / Vita. Includes bibliographical references (leaves 51-53).
7

Deletion-Induced Triangulations

Taylor, Clifford T 01 January 2015 (has links)
Let d > 0 be a fixed integer and let A ⊆ ℝd be a collection of n ≥ d + 2 points which we lift into ℝd+1. Further let k be an integer satisfying 0 ≤ k ≤ n-(d+2) and assign to each k-subset of the points of A a (regular) triangulation obtained by deleting the specified k-subset and projecting down the lower hull of the convex hull of the resulting lifting. Next, for each triangulation we form the characteristic vector defined by Gelfand, Kapranov, and Zelevinsky by assigning to each vertex the sum of the volumes of all adjacent simplices. We then form a vector for the lifting, which we call the k-compound GKZ-vector, by summing all the characteristic vectors. Lastly, we construct a polytope Σk(A) ⊆ ℝ|A| by taking the convex hull of all obtainable k-compound GKZ-vectors by various liftings of A, and note that $\Sigma_0(\A)$ is the well-studied secondary polytope corresponding to A. We will see that by varying k, we obtain a family of polytopes with interesting properties relating to Minkowski sums, Gale transforms, and Lawrence constructions, with the member of the family with maximal k corresponding to a zonotope studied by Billera, Fillamen, and Sturmfels. We will also discuss the case k = d = 1, in which we can provide a combinatorial description of the vertices allowing us to better understand the graph of the polytope and to obtain formulas for the numbers of vertices and edges present.
8

Polyhedral structure of the K-median problem

Zhao, Wenhui, January 2007 (has links)
Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 119-120).
9

Linear Time Approximation of 3D Convex Polytopes

Mario A. Lopez, Shlomo Reisner, reisner@math.haifa.ac.il 05 March 2001 (has links)
No description available.
10

Stabilité et commande robuste des systèmes à commutation

Hetel, Laurentiu Daafouz, Jamal. Iung, Claude January 2007 (has links) (PDF)
Thèse de doctorat : Automatique et traitement du signal : INPL : 2007. / Titre provenant de l'écran-titre.

Page generated in 0.0381 seconds