Recursion and parallel algorithms in geometric modeling problems
From MaRDI portal
Publication:1956990
DOI10.1007/s10559-010-9196-zzbMath1207.68439MaRDI QIDQ1956990
V. N. Tereshchenko, Anatoly V. Anisimov
Publication date: 24 September 2010
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-010-9196-z
geometric modeling; generalized parallel-recursive algorithm; interrelated problems; weighted concatenable queue
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W10: Parallel algorithms in computer science
Cites Work
- Unnamed Item
- Unnamed Item
- Planar separators and parallel polygon triangulation.
- Sorting in \(c \log n\) parallel steps
- Parallel computational geometry
- Maintenance of configurations in the plane
- Optimal parallel algorithms for point-set and polygon problems
- Probabilistic parallel prefix computation
- Efficient parallel convex hull algorithms
- Cascading Divide-and-Conquer: A Technique for Designing Parallel Algorithms
- A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET