A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
From MaRDI portal
Publication:4017523
DOI10.1142/S0218195992000123zbMath0762.68061MaRDI QIDQ4017523
David M. Mount, Sharat Chandran
Publication date: 16 January 1993
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
52A10: Convex sets in (2) dimensions (including convex curves)
68W15: Distributed algorithms
Related Items
Optimal placement of convex polygons to maximize point containment, On the complexity of some basic problems in computational convexity. I. Containment problems, Polynomial-time approximation of largest simplices in \(V\)-polytopes., Largest \(j\)-simplices in \(n\)-polytopes, Translating a convex polygon to contain a maximum number of points.