A method for solving the n-dimensional convex hull problem

被引：2

作者：

Jozwik, Adam ^{[1
]}

机构：

[1] Polish Acad Sci, Inst Biocybernet & Biomed Engn, PL-00818 Warsaw, Poland

来源：

PATTERN RECOGNITION LETTERS | 1983年 / 2卷 / 01期

关键词：

Convex hull; linear separability; learning algorithm; linear classifier;

D O I：

10.1016/0167-8655(83)90018-1

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A method is presented for finding all vertices and all hyperplanes containing the faces of a convex polyhedron spanned by a given finite set X in Euclidean space E-n. The present paper indicates how this method can be applied to the investigation of linear separability of two given finite sets X-1 and X-2 in E-n. In the case of linear separability of these sets the proposed method makes it possible to find the separating hyperplane.

引用

页码：23 / 25

页数：3