Back to search

University of North Texas

A New Algorithm for Finding the Minimum Distance between Two Convex Hulls

Abstract

dc:description

The problem of computing the minimum distance between two convex hulls has applications to many areas including robotics, computer graphics and path planning. Moreover, determining the minimum distance between two convex hulls plays a significant role in support vector machines (SVM). In this study, a new algorithm for finding the minimum distance between two convex hulls is proposed and investigated. A convergence of the algorithm is proved and applicability of the algorithm to support vector machines is demostrated. The performance of the new algorithm is compared with the performance of one of the most popular algorithms, the sequential minimal optimization (SMO) method. The new algorithm is simple to understand, easy to implement, and can be more efficient than the SMO method for many SVM problems.

Degree

thesis:*
Grantor dc:publisher
University of North Texas
Year dc:date
2009

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Kaown, Dougsoo
Contributors dc:contributor
  • Liu, Jianguo
  • Neuberger, John
  • Yuan, Xiaohui

Subjects

dc:subject × 7

Rights

dc:rights
Statement dc:rights
  • Public
  • Copyright
  • Kaown, Dougsoo
  • Copyright is held by the author, unless otherwise noted. All rights reserved.
Language dc:language
English

Identifiers

dc:identifier.*
Identifier
oclc: 449247160
untcat: b4055201
https://digital.library.unt.edu/ark:/67531/metadc9845/
ark: ark:/67531/metadc9845

Chain of custody

source
Harvested from
University of North Texas
Base URL
digital.library.unt.edu/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Kaown, Dougsoo. A New Algorithm for Finding the Minimum Distance between Two Convex Hulls. University of North Texas, 2009. https://doi.org/10.12794/metadc9845