No label defined (Q4945519)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1424306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1424306 |
Statements
7 October 2001
0 references
PRAM model
0 references
parallel computational geometry
0 references
randomization
0 references
parallel algorithms
0 references
random sampling
0 references
convex hulls
0 references
Voronoi diagrams
0 references
triangulation
0 references
point-location
0 references
arrangements
0 references
0.8312137126922607
0 references
The authors describe very general methods for designing efficient parallel algorithms for problems in computational geometry. The algorithm presented exploit random sampling and randomized techniques for solving a wide class of fundamental problems from computational geometry like convex hulls, Voronoi diagrams, triangulation, point-location and arrangements. For the entire collection see [Zbl 0930.65001].
0 references
