ISSN:
1432-0541
Schlagwort(e):
Parallel algorithms
;
Computational geometry
;
Data structures
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Informatik
,
Mathematik
Notizen:
Abstract We present efficient parallel algorithms for several basic problems in computational geometry: convex hulls, Voronoi diagrams, detecting line segment intersections, triangulating simple polygons, minimizing a circumscribing triangle, and recursive data-structures for three-dimensional queries.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01762120
Permalink