- 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.
Search results
Showing 1 to 10 of 35 (0.032 seconds)Spelling suggestions: "subject:"point set"" "subject:"joint set""
| 1 |
The set of eight self-associated points in spaceMusselman, John Rogers, January 1900 (has links)
Thesis (Ph. D.)--Johns Hopkins University, 1916. / Vita. "Reprinted from American journal of mathematics, vol. XL, no. 1, January, 1918."
|
| 2 |
Two geometrical representations of the symmetric correspondence C [subscript] n, n, with their interrelations,Galvin, Catharine Francis, January 1938 (has links)
Thesis--Catholic University of America.
|
| 3 |
Two geometrical representations of the symmetric correspondence C [subscript] n, n, with their interrelations,Galvin, Catharine Francis, January 1938 (has links)
Thesis--Catholic University of America.
|
| 4 |
Beiträge zur Theorie der konvexen PunktmengenStraszewicz, S. January 1914 (has links)
Inaug.-diss.--Universität Zürich. / Lebenslauf.
|
| 5 |
Convexe puntverzamelingenStoelinga, Theodorus Gerbrandus Dominicus. January 1932 (has links)
Academisch proefschrift--Amsterdam. / "Litteratuurlijst": p. [68].
|
| 6 |
Über gewisse räumliche Punktmengen die sich als stetige Flächen auffassen lassen /Mertens, Paul. January 1910 (has links)
Inaug.-diss.--Albertus-Universität.
|
| 7 |
A Relation for Point Sets in a Topological SpaceWarndof, Joseph C. 08 1900 (has links)
The purpose of this thesis is to investigate the relation Z for point sets in a topological space. There were two original goals which caused the study.
|
| 8 |
Embedding a Planar Graph on a Given Point SetMONDAL, DEBAJYOTI 02 1900 (has links)
A point-set embedding of a planar graph G with n vertices on a set S of n points is a planar straight-line drawing of G, where each vertex of G is mapped to a distinct point of S. We prove that the point-set embeddability problem is NP-complete for 3-connected planar graphs, answering a question of Cabello [20]. We give an O(nlog^3n)-time algorithm for testing point-set embeddability of plane 3-trees, improving the algorithm of Moosa and Rahman [60]. We prove that no set of 24 points can support all planar 3-trees with 24 vertices, partially answering a question of Kobourov [55]. We compute 2-bend point-set embeddings of plane 3-trees in O(W^2) area, where W is the length of longest edge of the bounding box of S. Finally, we design algorithms for testing convex point-set embeddability of klee graphs and arbitrary planar graphs.
|
| 9 |
Embedding a Planar Graph on a Given Point SetMONDAL, DEBAJYOTI 02 1900 (has links)
A point-set embedding of a planar graph G with n vertices on a set S of n points is a planar straight-line drawing of G, where each vertex of G is mapped to a distinct point of S. We prove that the point-set embeddability problem is NP-complete for 3-connected planar graphs, answering a question of Cabello [20]. We give an O(nlog^3n)-time algorithm for testing point-set embeddability of plane 3-trees, improving the algorithm of Moosa and Rahman [60]. We prove that no set of 24 points can support all planar 3-trees with 24 vertices, partially answering a question of Kobourov [55]. We compute 2-bend point-set embeddings of plane 3-trees in O(W^2) area, where W is the length of longest edge of the bounding box of S. Finally, we design algorithms for testing convex point-set embeddability of klee graphs and arbitrary planar graphs.
|
| 10 |
Parametric models of surfacesRobertson, Stewart Alexander January 1957 (has links)
No description available.
|
Page generated in 0.0363 seconds