Class and Description |
---|
BoundaryNodeRule
An interface for rules which determine whether node points
which are in boundaries of
Lineal geometry components
are in the boundary of the parent geometry collection. |
CGAlgorithms
Specifies and implements various fundamental Computational Geometric
algorithms.
|
HCoordinate
Represents a homogeneous coordinate in a 2-D coordinate space.
|
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
NotRepresentableException
Indicates that a
HCoordinate has been computed which is
not representable on the Cartesian plane. |
PointInRing
An interface for classes which test whether a
Coordinate lies inside
a ring. |
Class and Description |
---|
HCoordinate
Represents a homogeneous coordinate in a 2-D coordinate space.
|
Class and Description |
---|
BoundaryNodeRule
An interface for rules which determine whether node points
which are in boundaries of
Lineal geometry components
are in the boundary of the parent geometry collection. |
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
Class and Description |
---|
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
Class and Description |
---|
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
Class and Description |
---|
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
Class and Description |
---|
BoundaryNodeRule
An interface for rules which determine whether node points
which are in boundaries of
Lineal geometry components
are in the boundary of the parent geometry collection. |
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
Class and Description |
---|
LineIntersector
A
LineIntersector is an algorithm that can both test whether
two line segments intersect and compute the intersection point(s)
if they do. |
PointLocator |
Class and Description |
---|
BoundaryNodeRule
An interface for rules which determine whether node points
which are in boundaries of
Lineal geometry components
are in the boundary of the parent geometry collection. |
Copyright © 2016. All rights reserved.