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 76 for “"Delaunay"”.
-
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 …
-
Sliver -Free Three Dimensional Delaunay Mesh Generation
… Any tetrahedron will disappear from the Delaunay triangulation if a point is added inside the circumsphere of the tetrahedron. Among the tetrahedra created by inserting this new point there could be tetrahedra with large radius-edge ratios, or slivers, or both. However, the new point is …
-
Parallel Delaunay Refinement and Space -Time Meshing
A tetrahedron is acute if all its dihedral angles are less than 90°. Triangulations of three-dimensional domains with acute tetrahedra are useful in mesh generation. We give several constructions for tiling space with acute tetrahedra.
-
Delaunay-Laguerre Geometry For Macromolecular Modeling And Implicit Solvation
… of the molecules and their interactions. Delaunay and Laguerre methods, which concern sets of overlapping spheres and their interrelationships, are well suited to the study of molecules. We discuss and implement algorithms for the calculation of molecular volume, atomic solvent accessible …
-
Parallel Two-Dimensional Unstructured Anisotropic Delaunay Mesh Generation for Aerospace Applications
… of point-insertion, triangulation, and Delaunay refinement. Applications focusing on high-lift design or dynamic stall, or numerical methods and modeling test cases focus on two-dimensional domains. This push-button parallel mesh generation approach can generate high-fidelity …
-
Scalable Parallel Delaunay Image-to-Mesh Conversion for Shared and Distributed Memory Architectures
<p>Mesh generation is an essential component for many engineering applications. The ability to generate meshes in parallel is critical for the scalability of the entire Finite Element Method (FEM) pipeline. However, parallel mesh generation applications belong to the broader class of adaptive and …
-
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 …
-
Tetrahedral Mesh Improvement, Algorithms and Experiments
… appearance of slivers in large three-dimensional Delaunay meshes has been reported as early as 1985. They persist even after treatment with the Delaunay refinement algorithm. Cheng et al. proposed to remove slivers by assigning real weights to the points and change the Delaunay to the weighted …
-
Three Novel Algorithms for Triangle Mesh Processing: Progressive Delaunay Refinement Mesh Generation, Mls-Based Scattered Data Interpolation and Constrained Centroid Voronoi-Based Quadrangulation
The last problem I address in the thesis is the conversion of triangle meshes to quadrilateral meshes. Although triangle meshes are preferred in most of applications, quadrilateral meshes show more stability in scientific computation. Because most of acquisition and mesh generation methods result …
-
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 …
-
Interpolants, Error Bounds, and Mathematical Software for Modeling and Predicting Variability in Computer Systems
… perceptrons, Shepard variants, and the Delaunay mesh are investigated in the context of computer variability modeling. New methods of approximation using Box splines, Voronoi cells, and Delaunay for interpolating distributions of data with moderately high dimension are presented and …
-
A clustered back-bone for routing in ad-hoc networks
… the nodes to construct local variations of the Delaunay Triangulation and undertake several complicated steps for ensuring the planarity of the back-bone graph. The construction of the Delaunay Triangulation is very complex and time-consuming. This work achieves the objective of constructing a …
-
Angle constrained paths in sensor networks
… for computing length-reduced d-monotone paths in Delaunay Triangulation networks; The proposed algorithms are implemented in the Java programming language. Performances of the proposed algorithms are evaluated by examining the routes constructed by them on several randomly-generated Delaunay …
-
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 …
-
Discrete modelling of heat transfer
… of the lattice elements is determined by the Delaunay triangulation and the Voronoi tessellation. The objective of the present work is to investigate in more detail this type of lattice model for heat transfer. In the lattice models studied here the domain to be analysed is discretised by a …
-
From Cubism to Non-Objective Art: Sonia and Robert Delaunay's Exchange with Russian Artists
… the artistic exchange between Sonia and Robert Delaunay and Russian avant-garde artists. Previous scholars have studied the work of the Delaunays primarily within the context of isolated movements and geographical confines. This approach has prevented us from fully grasping the ways in which the …
-
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.
-
Shapes and implementations in three-dimensional geometry
… is a well-defined polytope, derived from the Delaunay triangulation of the point set, with a real parameter controlling the desired level of detail. Algorithms and data structures are presented that construct and store the entire family of shapes, with a quadratic time and space complexity, in …
-
Equilibrium graphs on the flat torus or finding zen amidst the bull
… equilibrium if and only if it is a weighted Delaunay graph of its point set. We derive some partial generalizations of this correspondence in the toroidal setting. In particular, we show that, whereas weighted Delaunay still implies positive equilibrium on flat tori, the converse is not …
-
An Algorithm for Triangulating 3D Polygons
… experimentally that the triangles in the Delaunay tetrahedralization of the polygon vertices offer a reasonable trade off between performance and optimality.
Page 1 of 4