Algorithm
Development Kit 1.0

Package algs.model.problems.segmentIntersection

Defines the classes needed to implement the LineSweep algorithm.

See:
          Description

Class Summary
AugmentedBalancedTree<K> The Balanced Binary Tree for this algorithm required internal nodes to store (min, max) links to the leaf nodes, where actual segments are to be stored.
AugmentedNode<K> The line sweep intersection algorithm stores information with internal nodes, and the leaf nodes contain the actual segments.
BruteForceAlgorithm Brute-force implementation of Line Segment intersection.
EventPoint The EventPoint is the basic element of the EventQueue.
EventQueue The EventQueue for a horizontal-sweep line algorithm for line segment intersection.
IntersectionDetection This superclass has been designed to enable the side-by-side comparison of a number of line segment variations, where different data structures are used to support the core algorithm.
LineState Manages the state of segments in a balanced binary tree whose leaf nodes are used to store segments while the interior nodes are used to guide searches and insertions to the appropriate leaf nodes.
LineSweep Contains LineSweep algorithm to detect all intersections among an array of line segments.
 

Package algs.model.problems.segmentIntersection Description

Defines the classes needed to implement the LineSweep algorithm.


Algorithm Development Kit 1.0

This code supports the Algorithms in a Nutshell book, published by O'Reilly Media, Inc. in November 2008. Please visit the book web page to learn of any changes to the code repository or to record a potential defect.