Sequential and parallel algorithms for finding a maximum convex polygon
Paul Fischer
Computational Geometry Theory & Applications
7(3):187–200, Feb 1997
Cites:
Finding minimum area $k$-gons
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
