OPTIMAL PARALLEL ALGORITHMS FOR TRIANGULATED SIMPLE POLYGONS

DOI10.1142/S021819599500009XzbMATH Open0941.68822OpenAlexW2124012370MaRDI QIDQ4698356FDOQ4698356

John Hershberger

Publication date: 26 February 1996

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021819599500009x

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (1)

• Least squares methods for solving partial differential equations by using Bézier control points

This page was built for publication: OPTIMAL PARALLEL ALGORITHMS FOR TRIANGULATED SIMPLE POLYGONS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698356)