141 search results - page 4 / 29 » Self-improving Algorithms for Convex Hulls |
WADS
2009
Springer
15 years 4 months ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
COMPUTING
2004
14 years 9 months ago
2004
We present an algorithm for computing the convex hull of freeform rational surfaces. The convex hull problem is reformulated as one of finding the zero-sets of polynomial equation...
EUSFLAT
2007
14 years 11 months ago
2007
We consider a digital fuzzy set placed in Oxyplane, with support which is a set of digital points (centroids) in Z2 . We consider two kinds of convexity of a fuzzy set, namely qua...
ICML
2000
IEEE
15 years 10 months ago
2000
IEEE
We develop an intuitive geometric interpretation of the standard support vector machine (SVM) for classification of both linearly separable and inseparable data and provide a rigo...
CCCG
2007
14 years 11 months ago
2007
We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n2 )) intersection points in an arrangement of n line segments in the plane. We also show an a...