Sequential and parallel algorithms for finding a maximum convex polygon
From MaRDI portal
Publication:676573
DOI10.1016/0925-7721(95)00035-6zbMATH Open0869.68114OpenAlexW2080255048MaRDI QIDQ676573FDOQ676573
Authors: 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Title not available (Why is that?)
- Finding minimum area \(k\)-gons
- Computing the Largest Empty Rectangle
- Minimum polygonal separation
- Title not available (Why is that?)
Cited In (12)
- Parallel algorithms for separation of two sets of points and recognition of digital convex polygons
- Linear algorithm to find the largest intriangles of a planar convex polygon
- Optimal BSR solutions to several convex polygon problems
- Computing optimal islands
- Title not available (Why is that?)
- Finding all nearest neighbors for convex polygons in parallel: A new lower bound technique and a matching algorithm
- A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
- Approximation of convex sets by polytopes
- Peeling Potatoes Near-Optimally in Near-Linear Time
- Lower bounds for the number of hyperplanes separating two finite sets of points
- Title not available (Why is that?)
- New results on the coarseness of bicolored point sets
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)
