Sequential and parallel algorithms for finding a maximum convex polygon
From MaRDI portal
Recommendations
Cites work
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Computing the Largest Empty Rectangle
- Finding minimum area \(k\)-gons
- scientific article; zbMATH DE number 3744018 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 522850 (Why is no real title available?)
- Minimum polygonal separation
Cited in
(13)- Approximation of convex sets by polytopes
- scientific article; zbMATH DE number 4050997 (Why is no real title available?)
- A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
- Linear algorithm to find the largest intriangles of a planar convex polygon
- scientific article; zbMATH DE number 522850 (Why is no real title available?)
- Computing optimal islands
- Lower bounds for the number of hyperplanes separating two finite sets of points
- Maximum rectilinear convex subsets
- New results on the coarseness of bicolored point sets
- Peeling potatoes near-optimally in near-linear time
- Optimal BSR solutions to several convex polygon problems
- Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
This page was built for publication: Sequential and parallel algorithms for finding a maximum convex polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q676573)
