Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Maur, Pavel | |
| dc.date.accessioned | 2016-06-27T06:55:51Z | |
| dc.date.available | 2016-06-27T06:55:51Z | |
| dc.date.issued | 2002 | |
| dc.identifier.uri | http://www.kiv.zcu.cz/publications/ | |
| dc.identifier.uri | http://hdl.handle.net/11025/21617 | |
| dc.format | 55 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en |
| dc.publisher | University of West Bohemia in Pilsen | en |
| dc.rights | © University of West Bohemia in Pilsen | en |
| dc.subject | Delaunayho triangulace | cs |
| dc.subject | 3D | cs |
| dc.subject | čtyřstěn | cs |
| dc.subject | plovoucí desetinná čárka | cs |
| dc.title | Delaunay triangulation in 3D: technical report no. DCSE/TR-2002-02 | en |
| dc.type | zpráva | cs |
| dc.type | report | en |
| dc.rights.access | openAccess | en |
| dc.type.version | publishedVersion | en |
| dc.description.abstract-translated | The Delaunay triangulation is one of the most popular and most often used methods in problems related to the generation of meshes. A lot of the optimal properties of Delaunay triangulation are known in 2D, where it has been intensively studied during the last twenty years, although the fundamentals were formulated early in the twentieth century (Voronoi, 1908 and Delaunay, 1934). This thesis presents Delaunay triangulation without addition or displacement of points in 3D space. It focuses on its properties and on a summarization of existing sequential algorithms. Also our experience with the implementation of the incremental insertion algorithm is presented and observed features are discussed. The properties of Delaunay triangulation in 3D (or generally in higher dimensions) are not as good as in 2D and different kinds of methods are used mainly to remove the tetrahedra of undesirable shape. Although this area of research was not within our main scope, we present an existing simple method for tetrahedra shape improvement. We have implemented this method and our results are presented and discussed. In the implementation of algorithms, which have to deal with inprecise floating-point arithemtic on real computers, the question of numerical stability becomes very important for the proper function of the implementation. We introduce several existing approaches for increasing the numerical stability of algorithms, two of them for an exact evaluation of geometric predicates are presented in more details. We made a comparison of them and we mention the results of incorporating one of them in our implementation. | en |
| dc.subject.translated | Delaunay triangulation | en |
| dc.subject.translated | 3D | en |
| dc.subject.translated | tetrahedron | en |
| dc.subject.translated | floating point | en |
| Appears in Collections: | Zprávy / Reports (KIV) | |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/21617Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.