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 4029 for “"Triangulation"”.
-
Optimal area triangulation
… in the Euclidean plane, we are interested in its triangulations, i.e., the maximal sets of non-overlapping triangles with vertices in the given points whose union is the convex hull of the point set. With respect to the area of the triangles in a triangulation, several optimality criteria can be …
-
Degree Constrained Triangulation
Triangulation of simple polygons or sets of points in two dimensions is a widely investigated problem in computational geometry. Some researchers have considered variations of triangulation problems that include minimum weight triangulation, de-launay triangulation and triangulation refinement. In …
-
Visualization of 3D Triangulation
No abstract prepared.
-
Image Approximation using Triangulation
An image is a set of quantized intensity values that are sampled at a finite set of sample points on a two-dimensional plane. Images are crucial to many application areas, such as computer graphics and pattern recognition, because they discretely represent the information that the human eyes …
-
Roaming region for Delaunay triangulation
Delaunay graphs have been used in CAD/CAM, sensor network and geographic information systems. We investigate the reliability properties of nodes in Delaunay graphs. For measuring the reliability we formulate the concept of roaming-region for nodes. A node v with large roaming-region r(v) such that …
-
Protocol design for dynamic Delaunay triangulation
Delaunay triangulation (DT) is a useful geometric structure for net-working applications. We define a distributed DT and present a necessary and sufficient condition for a distributed DT to be correct. This condition is used as a guide for protocol design. We investigate the design of join, leave, …
-
Triangulation of the Gray Tensor Product
… has a colimit structure similar to the geometric triangulation of products of geometric simplices. We use Steiner’s theory of strong Steiner complexes, and develop a criterion when a pushout diagram of strong Steiner complexes is preserved under the right adjoint functor to the category of …
-
Improved algorithms for ear-clipping triangulation
… technique for generating “good-quality” triangulation. The first approach is based on searching for the best triangle along the boundary. The second approach considers polygon partitioning on a pre-process before applying the ear-slicing. Experimental investigation reveals that both …
-
Seifert fibered spaces: triangulation and recognition
… topological structures in an arbitrary triangulation. To that end, we first study the size of minimal triangulations of Seifert fibered spaces. We show that we can realise certain important curves, the <em>singular fibres</em>, as subcomplexes by increasing the size of an arbitrary …
-
Triangulation of a Hierarchical Hexagon Mesh
… multi-resolution, hierarchical hexagon mesh. The triangulation provides good triangle strips, which result in efficient rendering of the hexagon mesh, and well-proportioned triangles, which avoid rendering artifacts. This algorithm was designed for the rendering of hexagon meshes on the globe, …
-
Donald Davidson: meaning, triangulation, and convention
This thesis examines a narrow portion of Donald Davidson's work in the philosophy of language, specifically his theory of utterance meaning put forward in the essay "The Second Person". In light of certain counterexamples I first attempt to adjust Davidson's theory, guided by a comment that …
-
A triangulation method for passive ranging
… for passive ranging based on the principle of triangulation is considered In the basic triangulation scheme that is a single baseline model the precision in the bearing readings can be related to the precision in the range estimation. For some target orienta- tions the precision in the …
-
Merging meshes using dynamic regular triangulation
Malhas simpliciais são utilizadas em várias áreas da Computação Gráfica e Engenharia, como por exemplo, em vizualização, simulação, prototipação, além de outras aplicações. Este tipo de malha é, geralmente, utilizada como aproximações discretas de espaços contínuos, onde eles oferecem …
Page 1 of 202