1 Hit in 2.7 sec

cMinMax: A Fast Algorithm to Find the Corners of an N-dimensional Convex Polytope [article]

Dimitrios Chamzas, Constantinos Chamzas, Konstantinos Moustakas
2020 arXiv   pre-print
Many times the border of the image is a convex polygon. For thisspecial, but quite common case, we have developed a specific algorithm, cMinMax.  ...  also be extended to N-dimensional polyhedrons.  ...  ACKNOWLEDGMENTS The authors wish to thank the members of the  ... 
arXiv:2011.14035v1 fatcat:a7j7ex44mjg2nbbwmoeb57slj4