Uses of Class
org.apache.lucene.geo.Tessellator.Triangle
-
Packages that use Tessellator.Triangle Package Description org.apache.lucene.document The logical representation of aDocument
for indexing and searching.org.apache.lucene.geo Geospatial Utility Implementations for Lucene Core -
-
Uses of Tessellator.Triangle in org.apache.lucene.document
Constructors in org.apache.lucene.document with parameters of type Tessellator.Triangle Constructor Description Triangle(java.lang.String name, Tessellator.Triangle t)
xtor from a given Tessellated Triangle object -
Uses of Tessellator.Triangle in org.apache.lucene.geo
Methods in org.apache.lucene.geo that return types with arguments of type Tessellator.Triangle Modifier and Type Method Description private static java.util.List<Tessellator.Triangle>
Tessellator. earcutLinkedList(java.lang.Object polygon, 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)
static java.util.List<Tessellator.Triangle>
Tessellator. tessellate(XYPolygon polygon)
Method parameters in org.apache.lucene.geo with type arguments of type Tessellator.Triangle Modifier and Type Method Description private static Tessellator.Node
Tessellator. cureLocalIntersections(Tessellator.Node startNode, java.util.List<Tessellator.Triangle> tessellation, boolean mortonOptimized)
Iterate through all polygon nodes and remove small local self-intersectionsprivate static java.util.List<Tessellator.Triangle>
Tessellator. earcutLinkedList(java.lang.Object polygon, 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(java.lang.Object polygon, Tessellator.Node start, java.util.List<Tessellator.Triangle> tessellation, boolean mortonOptimized)
Attempt to split a polygon and independently triangulate each side.
-