A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES

DOI10.1142/S0218195992000123MaRDI QIDQ4017523zbMATH OpenFDO

Authors Sharat Chandran, David M. Mount

Publication date 16 January 1993

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

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

zbMATH Keywords

convex polygonCRCW PRAMminimum enclosuresrotating calipers

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed algorithms (68W15)

Recommendations

• An optimal algorithm for finding minimal enclosing triangles
• Sequential and parallel algorithms for finding a maximum convex polygon
• scientific article; zbMATH DE number 219273
• Triangulating a polygon in parallel

Cited in

(21)

• An optimal parallel algorithm for triangulating a set of points in the plane
• Parallel enclosing rectangle on SIMD machines
• 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.
• Optimizing squares covering a set of points
• Largest \(j\)-simplices in \(n\)-polytopes
• Largest and smallest area triangles on imprecise points
• Implementation of linear minimum area enclosing triangle algorithm. Application note
• Extremal convex polygons inscribed in a given convex polygon
• Largest triangle inside a terrain
• Translating a convex polygon to contain a maximum number of points.
• On rainbow quadrilaterals in colored point sets
• Optimizing squares covering a set of points
• ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
• An optimal algorithm for finding minimal enclosing triangles
• scientific article; zbMATH DE number 4065021 (Why is no real title available?)
• scientific article; zbMATH DE number 4184294 (Why is no real title available?)
• Finding a largest-area triangle in a terrain in near-linear time
• Maximum-area triangle in a convex polygon, revisited
• Finding a largest-area triangle in a terrain in near-linear time

This page was built for publication: A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES

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