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.
Original language | English (US) |
---|---|
Pages (from-to) | 293-327 |
Number of pages | 35 |
Journal | Algorithmica |
Volume | 3 |
Issue number | 1-4 |
DOIs | |
State | Published - Nov 1988 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- General Computer Science
- Computer Science Applications
- Applied Mathematics
Keywords
- Computational geometry
- Data structures
- Parallel algorithms