About: Parallel Delaunay triangulation in E2 and E3 for computers with shared memory

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

About: Parallel Delaunay triangulation in E2 and E3 for computers with shared memory 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	Není k dispozici (cs) This paper presents several parallel algorithms for the construction of the Delaunay triangulation in E2 and E3-one of the fundamental problems in computer graphics. The proposed algorithms are designed for parallel systems with shared memory and several processors. Such a hardware configuration (especially the case with two-processors) became widely spread in the last few years in the computer graphics area. Some of the proposed algorithms are easy to be implemented but not very efficient, while some of them prove opposite characteristics. Some of them are usable in E2 only, other work in E3 as well. The algorithms themselves were already published in computer graphics where the computer graphics criteria were highlighted. This paper concentrates on parallel and systematic point of view and gives detailed information about the parallelization of a computational geometry application to parallel and distributed computation oriented community. This paper presents several parallel algorithms for the construction of the Delaunay triangulation in E2 and E3-one of the fundamental problems in computer graphics. The proposed algorithms are designed for parallel systems with shared memory and several processors. Such a hardware configuration (especially the case with two-processors) became widely spread in the last few years in the computer graphics area. Some of the proposed algorithms are easy to be implemented but not very efficient, while some of them prove opposite characteristics. Some of them are usable in E2 only, other work in E3 as well. The algorithms themselves were already published in computer graphics where the computer graphics criteria were highlighted. This paper concentrates on parallel and systematic point of view and gives detailed information about the parallelization of a computational geometry application to parallel and distributed computation oriented community. (en)
Title	Parallel Delaunay triangulation in E2 and E3 for computers with shared memory Paralelní Delauného triangulace v E2 a E3 pro počítače se sdílenou pamětí (cs) Parallel Delaunay triangulation in E2 and E3 for computers with shared memory (en)
skos:prefLabel	Parallel Delaunay triangulation in E2 and E3 for computers with shared memory Paralelní Delauného triangulace v E2 a E3 pro počítače se sdílenou pamětí (cs) Parallel Delaunay triangulation in E2 and E3 for computers with shared memory (en)
skos:notation	RIV/68407700:21230/05:03108549!RIV08-MSM-21230___
http://linked.open.../vavai/riv/strany	491;522
http://linked.open...avai/riv/aktivita	Z
http://linked.open...avai/riv/aktivity	Z(MSM 235200005), Z(MSM6840770014)
http://linked.open...iv/cisloPeriodika	5
http://linked.open...vai/riv/dodaniDat	2008
http://linked.open...aciTvurceVysledku	Žára, Jiří
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
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	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	535385
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/05:03108549
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	computational geometry; incremental insertion; parallel Delaunay triangulation (en)
http://linked.open.../riv/klicoveSlovo	computational geometry incremental insertion parallel Delaunay triangulation
http://linked.open...odStatuVydavatele	NL - Nizozemsko
http://linked.open...ontrolniKodProRIV	[A7D17A45B0D4]
http://linked.open...i/riv/nazevZdroje	Parallel Computing
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...UplatneniVysledku	2005
http://linked.open...v/svazekPeriodika	31
http://linked.open...iv/tvurceVysledku	Žára, Jiří Kohout, J. Kolingerová, I.
http://linked.open...n/vavai/riv/zamer	Výzkum perspektivních informačních a komunikačních technologií http://linked.opendata.cz/resource/domain/vavai/zamer/MSM%20235200005
issn	0167-8191
number of pages	32 (xsd:int)
http://localhost/t...ganizacniJednotka	21230
is http://linked.open...avai/riv/vysledek of	Parallel Delaunay triangulation in E2 and E3 for computers with shared memory

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, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software