S - Space type.P - Point type.public class WelzlEncloser<S extends Space,P extends Point<S>> extends Object implements Encloser<S,P>
The class implements the algorithm described in paper Smallest Enclosing Disks (Balls and Ellipsoids) by Emo Welzl, Lecture Notes in Computer Science 555 (1991) 359-370. The pivoting improvement published in the paper Fast and Robust Smallest Enclosing Balls, by Bernd Gärtner and further modified in paper Efficient Computation of Smallest Enclosing Balls in Three Dimensions by Linus Källberg to avoid performing local copies of data have been included.
| Constructor and Description |
|---|
WelzlEncloser(double tolerance,
SupportBallGenerator<S,P> generator)
Simple constructor.
|
| Modifier and Type | Method and Description |
|---|---|
EnclosingBall<S,P> |
enclose(Iterable<P> points)
Find a ball enclosing a list of points.
|
P |
selectFarthest(Iterable<P> points,
EnclosingBall<S,P> ball)
Select the point farthest to the current ball.
|
public WelzlEncloser(double tolerance,
SupportBallGenerator<S,P> generator)
tolerance - below which points are consider to be identicalgenerator - generator for balls on supportpublic EnclosingBall<S,P> enclose(Iterable<P> points)
Copyright © 2003–2016 The Apache Software Foundation. All rights reserved.