Uses of Class
org.apache.lucene.geo.Tessellator.Triangle

Packages that use Tessellator.Triangle

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

Uses of Tessellator.Triangle in org.apache.lucene.document

Constructors in org.apache.lucene.document with parameters of type Tessellator.Triangle

Modifier	Constructor	Description
(package private)	Triangle(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 final List<Tessellator.Triangle>	Tessellator.earcutLinkedList(Object polygon, Tessellator.Node currEar, List<Tessellator.Triangle> tessellation, Tessellator.State state, boolean mortonOptimized, Tessellator.Monitor monitor, int depth)	Main ear slicing loop which triangulates the vertices of a polygon, provided as a doubly-linked list.
static List<Tessellator.Triangle>	Tessellator.tessellate(Polygon polygon, boolean checkSelfIntersections)
static List<Tessellator.Triangle>	Tessellator.tessellate(Polygon polygon, boolean checkSelfIntersections, Tessellator.Monitor monitor)
static List<Tessellator.Triangle>	Tessellator.tessellate(XYPolygon polygon, boolean checkSelfIntersections)
static List<Tessellator.Triangle>	Tessellator.tessellate(XYPolygon polygon, boolean checkSelfIntersections, Tessellator.Monitor monitor)

Method parameters in org.apache.lucene.geo with type arguments of type Tessellator.Triangle

Modifier and Type	Method	Description
private static final Tessellator.Node	Tessellator.cureLocalIntersections(Tessellator.Node startNode, List<Tessellator.Triangle> tessellation, boolean mortonOptimized)	Iterate through all polygon nodes and remove small local self-intersections *
private static final List<Tessellator.Triangle>	Tessellator.earcutLinkedList(Object polygon, Tessellator.Node currEar, List<Tessellator.Triangle> tessellation, Tessellator.State state, boolean mortonOptimized, Tessellator.Monitor monitor, int depth)	Main ear slicing loop which triangulates the vertices of a polygon, provided as a doubly-linked list.
private static void	Tessellator.notifyMonitor(String status, Tessellator.Monitor monitor, Tessellator.Node start, List<Tessellator.Triangle> tessellation)
private static void	Tessellator.notifyMonitor(Tessellator.State state, int depth, Tessellator.Monitor monitor, Tessellator.Node start, List<Tessellator.Triangle> tessellation)
static final boolean	Tessellator.pointInPolygon(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 final boolean	Tessellator.splitEarcut(Object polygon, Tessellator.Node start, List<Tessellator.Triangle> tessellation, boolean mortonOptimized, Tessellator.Monitor monitor, int depth)	Attempt to split a polygon and independently triangulate each side.