|
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.priorityqueue.SlowLineSweep
public class SlowLineSweep
Uses slow event queue to show degradation of performance when using just a standard priority queue implementation.
| Field Summary |
|---|
| Fields inherited from class algs.model.problems.segmentIntersection.IntersectionDetection |
|---|
report |
| Constructor Summary | |
|---|---|
SlowLineSweep()
|
|
| Method Summary | |
|---|---|
void |
initialize()
Initialize algorithm. |
java.util.Hashtable<IPoint,ILineSegment[]> |
intersections(ILineSegment[] segs)
Compute the intersection of all segments when given an array of segments. |
| Methods inherited from class algs.model.problems.segmentIntersection.IntersectionDetection |
|---|
computeTime, 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 SlowLineSweep()
| Method Detail |
|---|
public void initialize()
initialize in class IntersectionDetectionpublic java.util.Hashtable<IPoint,ILineSegment[]> intersections(ILineSegment[] segs)
Returns the report which is maintained by the superclass
intersections in class IntersectionDetectionsegs - Line segments to be checked for intersections.
|
Algorithm Development Kit 1.0 | ||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||