|
Algorithm Development Kit 1.0 |
||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectalgs.model.problems.segmentIntersection.IntersectionDetection
algs.model.problems.segmentIntersection.BruteForceAlgorithm
public class BruteForceAlgorithm
Brute-force implementation of Line Segment intersection.
Can be used as a benchmark for improvements when using LineSweep; alternatively, can show the degenerate cases where a brute force approach is faster.
Field Summary |
---|
Fields inherited from class algs.model.problems.segmentIntersection.IntersectionDetection |
---|
report |
Constructor Summary | |
---|---|
BruteForceAlgorithm()
Default constructor. |
Method Summary | |
---|---|
java.util.Hashtable<IPoint,ILineSegment[]> |
intersections(ILineSegment[] segments)
Check each possible pair of line segments and record its intersection. |
Methods inherited from class algs.model.problems.segmentIntersection.IntersectionDetection |
---|
computeTime, initialize, intersections, intersections, output, record, record, sameWithinEpsilon, startTime, time |
Methods inherited from class java.lang.Object |
---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public BruteForceAlgorithm()
Method Detail |
---|
public java.util.Hashtable<IPoint,ILineSegment[]> intersections(ILineSegment[] segments)
intersections
in class IntersectionDetection
segments
- segments to be evaluated.
|
Algorithm Development Kit 1.0 | ||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |