Sökning: "Delaunay triangulation"
Hittade 5 avhandlingar innehållade orden Delaunay triangulation.
1. Progress in Hierarchical Clustering & Minimum Weight Triangulation
Sammanfattning : In this thesis we study efficient computational methods for geometrical problems of practical importance and theoretical interest. The problems that we consider are primarily complete linkage clustering, minimum spanning trees, and approximating minimum weight triangulation. Below is a list of the main results proved in the thesis. LÄS MER
2. From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry
Sammanfattning : We give approximation and online algorithms as well as data structures for some well studied problems in computational geometry. The thesis is divided into three parts. In part one, we study problems related to guarding, exploring and searching geometric environments. LÄS MER
3. Geometric Decompositions and Networks - Approximation Bounds and Algorithms
Sammanfattning : In this thesis we focus on four problems in computational geometry: In the first four chapters we consider the problem of covering an arbitrary polygon with simpler polygons, i.e., rectangles. LÄS MER
4. Advancing Front Mesh Generation Techniques with Application to the Finite Element Method
Sammanfattning : The present study deals with automatic mesh generation with application to finite element methods. We focus our interest on unstructured mesh generation, and in particular on advancing front methods for which algorithms for meshing of two and three dimensional domains as well as of free-form surfaces are devised. LÄS MER
5. Geometry linking the art of building and the Universe: Geometric patterns on shells and grid shells
Sammanfattning : Geometry links the art of building and the physics of space-time. Mathematical breakthroughs in geometry have led to new ways of designing our structures and our ability to visualise and describe the world, phenomena in nature and the universe. LÄS MER