Changes for version 1.0.6
- fix tests on 32 bit systems
Modules
Perl interface for GEOS C++ library
Fundamental computational geometry algorithms.
Homogeneous coordinate in a 2-D coordinate space.
test whether two line segments intersect and compute the intersection point if they do.
Computes the minimum diameter of a Geometry
The lightweight class used to store coordinates.
Represents dimensions of a point, a curve and a surface.
Defines a rectangulare region of the 2D coordinate plane
Basic implementation of Geometry
Represents a collection of heterogeneous Geometry objects.
Supplies a set of utility methods for building Geometry objects.
Partition the segments of a linestring to allow for fast searching of intersections.
The action for the internal iterator for performing overlap queries.
A spatial index structure for efficient querying of 2D rectangles.
A spatial index structure which uses the Sort-Tile-Recursive (STR) algorithm.
Abstract class for spatial index algorithms.
Dimensionally Extended Nine-Intersection Model (DE-9IM) matrix.
Represents a line segment defined by two Coordinates.
Models an OGC-style LineString.
Models an OGC SFS LinearRing.
Models a collection of LineStrings.
Models a collection of Point objects.
Models a collection of Polygons.
Noding support functions.
Represents a list of contiguous line segments, and supports noding the segments.
Computes the intersections between two line segments in SegmentString and adds them to each string.
Finds proper and interior intersections and adds them as nodes.
Nodes a set of SegmentStrings completely.
Represents a list of contiguous line segments, and supports noding the segments.
Computes all intersections between segments in a set of SegmentString.
Wraps a Noder and transforms its input into the integer domain.
Detects and records an intersection between two SegmentStrings, if one exists.
Processes possible intersections detected by a Noder.
Represents an intersection point between two NodedSegmentString.
An interface for classes which represent a sequence of contiguous line segments.
Nodes a set of SegmentStrings by performing a brute-force comparison of every segment to every other one.
Uses Snap Rounding to compute a rounded, fully noded arrangement from a set of SegmentStrings.
inds an interior intersection in a set of SegmentString, if one exists.
Base class for Noders which make a single pass to find intersections.
Provides methods for implementing operations on geometries.
Implementation of Point
Represents a linear polygon, which may include holes.
Provides methods for manipulating the precision model of Geometries.
Reduces the precision of a Geometry.
Reduces the precision of a Geometry.
Specifies the precision model of the Coordinate in a Geometry.
Geometry with optimized performance for specific geometric operations
A factory for creating PreparedGeometrys.
Represents a planar triangle.
Extracts triangulation edges or triangles.
Creates Voronoi Diagrams.
Represents dimensions of a point, a curve and a surface.
Reads a Geometry from Well-Known Binary format.
Writes a Geometry into Well-Known Binary format.
Reads a Geometry from Well-Known Text format.
Writes a Geometry into Well-Known Text format.
Provides
in lib/Geo/Geos/Triangulate.pm