Sequential and parallel algorithms for finding a maximum convex polygon

DOI10.1016/0925-7721(95)00035-6zbMath0869.68114OpenAlexW2080255048MaRDI QIDQ676573

Paul Fischer

Publication date: 8 September 1997

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0925-7721(95)00035-6

zbMATH Keywords

convex polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

Peeling Potatoes Near-Optimally in Near-Linear Time ⋮ Computing optimal islands ⋮ Lower bounds for the number of hyperplanes separating two finite sets of points ⋮ New results on the coarseness of bicolored point sets ⋮ Approximation of convex sets by polytopes

Cites Work

• Minimum polygonal separation
• Finding minimum area \(k\)-gons
• Computing the Largest Empty Rectangle
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequential and parallel algorithms for finding a maximum convex polygon