Attributes | Values |
---|
rdf:type
| |
Description
| - 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 consequence, the proposed algorithm needs less tests of regularity in average than the previous algorithms.
- 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 consequence, the proposed algorithm needs less tests of regularity in average than the previous algorithms. (en)
|
Title
| - Hybrid algorithm for delection of a point regular and Delaunay triangulation
- Hybrid algorithm for delection of a point regular and Delaunay triangulation (en)
|
skos:prefLabel
| - Hybrid algorithm for delection of a point regular and Delaunay triangulation
- Hybrid algorithm for delection of a point regular and Delaunay triangulation (en)
|
skos:notation
| - RIV/49777513:23520/09:00502516!RIV10-GA0-23520___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/49777513:23520/09:00502516
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - detection of a point; flipping; regular trangulation; Delaunay triangulation (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Spring Conference on Computer Graphics SCCG 2009
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Kolingerová, Ivana
- Zemek, Michal
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
number of pages
| |
http://purl.org/ne...btex#hasPublisher
| - Univerzita Komenského v Bratislave
|
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |
is http://linked.open...avai/riv/vysledek
of | |