AbstractIn this study we address the problem of efficient parallel triangulation methods for a finite set of points in the plane. The main goals of the research were to identify scalable algorithms which achieve a significant speedup over the sequential solutions and to implement and evaluate their performance on a parallel machine. Two approaches for parallel triangulation, one of which relies on global sorting, are fully described and implemented on a hypercube. Extensive performance evaluation in expected average and worst cases is reported for both methods
RightsThis Item is protected by copyright and/or related rights.You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use.For other uses you need to obtain permission from the rights-holder(s).
