|
Algorithm Development Kit 1.0 |
||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
IBinaryTreeNode<T> | Base structure for a BinaryTree ensures there is a typed left and right child. |
ICircle | A circle point has an IPoint origin and a radius >= 0. |
IHypercube | Represents a hypercube in the n-dimensional Cartesian plane. |
IInterval | A segment has a left and a right index and is understood to represent a semi-closed range [left, right). |
ILineSegment | A Line Segment between two-dimensional points. |
IMultiLineSegment | A Line Segment between two multidimensional points. |
IMultiPoint | A multi-dimensional point has a set of coordinates in d-dimensional space. |
IPoint | A point has an x- and y-coordinate over the cartesian plane. |
IRectangle | Represents a rectangle in the Cartesian plane. |
Class Summary | |
---|---|
FloatingPoint | Provides a standard API for evaluating double numbers when dealing with floating point rounding error. |
Defines a set of interfaces for core entities used by various algorithms. Contains the FloatingPoint class which is used to normalize numerous floating point computations to deal with round-off error that occurs. Throughout the code in this repository, we have endeavored to write each algorithm in an independent way from the arbitrary means by which the input is structured. While this is easy to do when arrays are the standard means of input, it becomes challenging when working with Computational Geometry. Thus, in this package you will find interfaces for the most common elements in 2- and n-dimensions. All of the interfaces to the Computational Geometry algorithms are designed to work with these interfaces. Such an approach should make it easy for you to adapt the existing algorithms to your own needs.
|
Algorithm Development Kit 1.0 | ||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |