ISSN:
1432-0541
Keywords:
Parallel algorithms
;
Computational geometry
;
Data structures
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01762120
Permalink