We consider a variation of a problem stated by Erd˝os and Szekeres in 1935 about the existence of a number fES (k) such that any set S of at least fES (k) points in general posit...
Oswin Aichholzer, Thomas Hackl, Clemens Huemer, Fe...
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
We consider the separability of two point sets inside a polygon by means of chords or geodesic lines. Specifically, given a set of red points and a set of blue points in the inte...
Erik D. Demaine, Jeff Erickson, Ferran Hurtado, Jo...
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
—The Support Vector Machine is a widely employed machine learning model due to its repeatedly demonstrated superior generalization performance. The Sequential Minimal Optimizatio...
Christopher Sentelle, Michael Georgiopoulos, Georg...