About: Hybrid algorithm for delection of a point regular and Delaunay triangulation

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Hybrid algorithm for delection of a point regular and Delaunay triangulation Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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	P
http://linked.open...avai/riv/aktivity	P(GA201/09/0097)
http://linked.open...vai/riv/dodaniDat	2010
http://linked.open...aciTvurceVysledku	Zemek, Michal Kolingerová, Ivana
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Západočeská univerzita v Plzni / Fakulta aplikovaných věd
http://linked.open...dnocenehoVysledku	318079
http://linked.open...ai/riv/idVysledku	RIV/49777513:23520/09:00502516
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	detection of a point; flipping; regular trangulation; Delaunay triangulation (en)
http://linked.open.../riv/klicoveSlovo	flipping Delaunay triangulation detection of a point regular trangulation
http://linked.open...ontrolniKodProRIV	[1904474ECA09]
http://linked.open...v/mistoKonaniAkce	Budmerice
http://linked.open...i/riv/mistoVydani	Bratislava
http://linked.open...i/riv/nazevZdroje	Spring Conference on Computer Graphics SCCG 2009
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Triangulated models in service of haptic and virtual reality
http://linked.open...UplatneniVysledku	2009
http://linked.open...iv/tvurceVysledku	Kolingerová, Ivana Zemek, Michal
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2009-04-25 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Univerzita Komenského v Bratislave
https://schema.org/isbn	978-80-223-2644-5
http://localhost/t...ganizacniJednotka	23520
is http://linked.open...avai/riv/vysledek of	Hybrid algorithm for delection of a point regular and Delaunay triangulation Hybrid algorithm for delection of a point regular and Delaunay triangulation Hybrid algorithm for delection of a point regular and Delaunay triangulation Hybrid algorithm for delection of a point regular and Delaunay triangulation

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software