235 search results - page 6 / 47 » The Complexity of Separating Points in the Plane |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We consider the problem of computing a triangulation of the real projective plane P2 , given a finite point set P = {p1, p2, . . . , pn} as input. We prove that a triangulation of...
INFORMS
1998
14 years 9 months ago
1998
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
IPCO
2007
14 years 11 months ago
2007
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Many surgical procedures could benefit from guiding a bevel-tip needle along circular arcs to multiple treatment points in a patient. At each treatment point, the needle...
MICS
2010
14 years 8 months ago
2010
We revisit the problem of computing the topology and geometry of a real algebraic plane curve. The topology is of prime interest but geometric information, such as the position of...