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 6 of 6 for “"Delaunay triangulations"”.
-
Partial Delaunay triangulations based routing, address configuration and date-centric storage in ad hock network
… We propose to apply recently proposed Partial Delaunay triangulation (PDT) instead of Gabriel Graph (GG) used in the original GFG. PDT is locally defined without any message exchange in addition to those needed to learn the locations of neighbors. Routing is further enhanced by applying …
-
Geometric Decompositions and Networks - Approximation Bounds and Algorithms
… thesis we introduce the concept of higher-order Delaunay triangulations. We give an algorithm to compute which edges can be included in a higher-order Delaunay triangulation. We show that for 1-order Delaunay triangulations, most of the criteria we study can be optimized in O(n log n) time, for …
-
Compass routing on geometric graphs.
… routing" based routing algorithms for trees, Delaunay triangulations and orthogonal convexly embedded geometric graphs. Several related results on various types of geometric graphs were also studied.
-
The Hydraulic Spline: Comparisons of Existing Surface Modeling Techniques and Development of a Spline-Based Approach for Hydrographic and Topographic Surface Modeling
… topographic surface models are synthesized from Delaunay triangulations or interpolated raster grids. Although these techniques are adequate in most general situations, they do not effectively address the specific case where topographic data is available only as cross-section and profile …
-
Delaunay Configuration B-Splines
… and drawbacks. A promising approach using Delaunay configurations and simplex splines is due to Neamtu. After recalling fundamentals of univariate splines, simplex splines, and the wellknown, multivariate DMS-splines, we address Neamtu’s DCB-splines. He defined two variants that we refer to …
-
Mathematical Software for Multiobjective Optimization Problems
… only a sparse subset of the elements in the Delaunay triangulation, as needed to compute the Delaunay interpolant. For high-dimensional data, this reduces the time and space complexity of Delaunay interpolation from exponential time to polynomial time in practice. For each of the above …