Package | Description |
---|---|
org.apache.lucene.document |
The logical representation of a
Document for indexing and searching. |
org.apache.lucene.geo |
Geospatial Utility Implementations for Lucene Core
|
Constructor and Description |
---|
LatLonTriangle(java.lang.String name,
Tessellator.Triangle t) |
Modifier and Type | Method and Description |
---|---|
private static java.util.List<Tessellator.Triangle> |
Tessellator.earcutLinkedList(Tessellator.Node currEar,
java.util.List<Tessellator.Triangle> tessellation,
Tessellator.State state,
boolean mortonOptimized)
Main ear slicing loop which triangulates the vertices of a polygon, provided as a doubly-linked list.
|
static java.util.List<Tessellator.Triangle> |
Tessellator.tessellate(Polygon polygon)
Produces an array of vertices representing the triangulated result set of the Points array
|
Modifier and Type | Method and Description |
---|---|
private static Tessellator.Node |
Tessellator.cureLocalIntersections(Tessellator.Node startNode,
java.util.List<Tessellator.Triangle> tessellation)
Iterate through all polygon nodes and remove small local self-intersections
|
private static java.util.List<Tessellator.Triangle> |
Tessellator.earcutLinkedList(Tessellator.Node currEar,
java.util.List<Tessellator.Triangle> tessellation,
Tessellator.State state,
boolean mortonOptimized)
Main ear slicing loop which triangulates the vertices of a polygon, provided as a doubly-linked list.
|
static boolean |
Tessellator.pointInPolygon(java.util.List<Tessellator.Triangle> tessellation,
double lat,
double lon)
Brute force compute if a point is in the polygon by traversing entire triangulation
todo: speed this up using either binary tree or prefix coding (filtering by bounding box of triangle)
|
private static boolean |
Tessellator.splitEarcut(Tessellator.Node start,
java.util.List<Tessellator.Triangle> tessellation,
boolean mortonIndexed)
Attempt to split a polygon and independently triangulate each side.
|