Showing papers by "Ivana Kolingerová published in 2009"
TL;DR: This paper shows the results of their elimination by using constrained edges in the triangulation, and finds two algorithms suitable for automatic detection and removal of artefacts caused by flat triangle areas.
6 citations
TL;DR: The paper focuses on the boundary representation, although some ideas are more general and can be used for other representations, too.
6 citations
23 Apr 2009
TL;DR: A randomized algorithm that allows to delete a point in three--dimensional regular or Delaunay triangulation by a sequence of flips by a combination of local and global regularity tests.
Abstract: In this paper, we propose a randomized algorithm that allows to delete a point in three--dimensional regular or Delaunay triangulation by a sequence of flips. All the previous algorithms check regularity of each new tetrahedron globally, i.e. with respect to all vertices of tetrahedra incident to the point, which is being deleted. In contrast, the proposed hybrid algorithm uses a combination of local and global regularity tests. First, the proposed algorithm tries to delete a point by a randomized sequence of flips of faces satisfying a certain local condition. This simple approach will always delete the point successfully, but theoretically in an unbounded time in the worst case. Therefore we combine it with the global regularity tests -- if the point is not deleted after a certain number of flips, the proposed algorithm replaces the local regularity test by the global regularity test. In practice, the local regularity tests are sufficient in most cases and the global regularity tests are used only rarely. In consequence, the proposed algorithm needs less tests of regularity in average than the previous algorithms.
4 citations
01 Jan 2009
TL;DR: This chapter surveys existing research and main achievements of simulated annealing and genetic algorithms for triangulating based problems, such as generation of an optimal triangulation, improvement of a shape of triangles or tetrahedra and positions of their vertices, the use of triangulations for digital image representation, registration of 3D models and their textures, etc.
Abstract: This chapter surveys existing research and main achievements of simulated annealing and genetic algorithms for triangulation based problems, such as generation of an optimal triangulation, improvement of a shape of triangles or tetrahedra and positions of their vertices, the use of triangulations for digital image representation, registration of 3D models and their textures, etc. Main features of the methods, their results and typical problems are pointed out.