- 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 44 (0.119 seconds)Spelling suggestions: "subject:"eometry - data processing"" "subject:"eometry - mata processing""
| 1 |
Practical Delaunay triangulation algorithms for surface reconstruction and related problemsChoi, Sunghee 28 August 2008 (has links)
Not available / text
|
| 2 |
Various stabbing problems in computational geometryDoskas, Michael. January 1987 (has links)
No description available.
|
| 3 |
An NP-hardness result for moving robot arms with rectangular links /Zhao, Rongyao. January 1986 (has links)
No description available.
|
| 4 |
Hierarchical decomposition of polygons with applicationsElGindy, Hossam A. January 1985 (has links)
No description available.
|
| 5 |
The complexity of computing simple circuits in the plane /Rappaport, David, 1955- January 1986 (has links)
As far back as Euclid's ruler and compass constructions, computation and geometry have been domains for the exploration and development of fundamental mathematical concepts and ideas. The invention of computers has spurred new research in computation, and now with a variety of applications couched in the fundamentals of Euclidean geometry, the study of geometric algorithms has again become a popular mathematical pursuit. / In this thesis, the computational aspects of a fundamental problem in Euclidean geometry is examined. Given a set of line segments in the Euclidean plane, one is asked to connect all the segments to form a simple closed circuit. It is shown that for some sets of line segments it is impossible to perform this task. The problem of deciding whether a set of line segments admits a simple circuit is proved to be NP-complete. A restriction of the class of permissible input allows a polynomial time solution to the simple circuit decision problem. It is also shown that a polynomial solution can be realized by restricting the class of simple circuit in the output. All the polynomial time decision algorithms exhibited deliver a simple circuit if one exists. Furthermore, in all cases the simple circuit obtained can be optimized with respect to area or perimeter.
|
| 6 |
Hierarchical decomposition of polygons with applicationsElGindy, Hossam A. January 1985 (has links)
No description available.
|
| 7 |
The complexity of computing simple circuits in the plane /Rappaport, David, 1955- January 1986 (has links)
No description available.
|
| 8 |
Various stabbing problems in computational geometryDoskas, Michael. January 1987 (has links)
No description available.
|
| 9 |
An NP-hardness result for moving robot arms with rectangular links /Zhao, Rongyao. January 1986 (has links)
No description available.
|
| 10 |
Tight bound edge guard results on art gallery problems姚兆明, Yiu, Siu-ming. January 1996 (has links)
published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy
|
Page generated in 0.1255 seconds