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)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex sets in (2) dimensions (including convex curves) (52A10) Distributed algorithms (68W15)
Related Items (14)
Finding a largest-area triangle in a terrain in near-linear time ⋮ On the complexity of some basic problems in computational convexity. I. Containment problems ⋮ Largest \(j\)-simplices in \(n\)-polytopes ⋮ Optimizing Squares Covering a Set of Points ⋮ On rainbow quadrilaterals in colored point sets ⋮ Polynomial-time approximation of largest simplices in \(V\)-polytopes. ⋮ Largest triangle inside a terrain ⋮ Largest and smallest area triangles on imprecise points ⋮ Optimizing squares covering a set of points ⋮ Translating a convex polygon to contain a maximum number of points. ⋮ Implementation of linear minimum area enclosing triangle algorithm. Application note ⋮ Optimal placement of convex polygons to maximize point containment ⋮ Extremal convex polygons inscribed in a given convex polygon ⋮ Maximum-area triangle in a convex polygon, revisited
This page was built for publication: A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
