Parallel triangulation of a polygon in two calls to the trapezoidal map (Q1104087)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel triangulation of a polygon in two calls to the trapezoidal map |
scientific article; zbMATH DE number 4055043
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel triangulation of a polygon in two calls to the trapezoidal map |
scientific article; zbMATH DE number 4055043 |
Statements
Parallel triangulation of a polygon in two calls to the trapezoidal map (English)
0 references
1988
0 references
We give a parallel method for triangulating a simple polygon by two (parallel) calls to the trapezoidal map computation. The method is simpler and more elegant than previous methods. Along the way we obtain an interesting partition of one-sided monotone polygons. Using the best known trapezoidal map algorithm, ours run in time O(log n) using O(n) CREW PRAM processors.
0 references
parallel algorithm
0 references
triangulation of simple polygon
0 references
computational geometry
0 references
trapezoidal map algorithm
0 references
0 references
0 references
0 references
0.85345894
0 references
0.84993327
0 references
0.84993327
0 references
0.8488679
0 references
