About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Abstract
The authors provide almost optimal parallel algorithms in the following areas of computational geometry: (1) convex hulls in two and three dimensions; (2) Voronoi diagrams and proximity problems; (3) detecting segment intersections and triangulating a polygon; (4) geometric optimization problems; and (5) creating data structures in two and three dimensions to answer some standard queries.