Uses of Class
org.apache.lucene.spatial3d.geom.Plane

Packages that use Plane

Package	Description
org.apache.lucene.spatial3d.geom	Shapes implemented using 3D planar geometry.

Uses of Plane in org.apache.lucene.spatial3d.geom

Subclasses of Plane in org.apache.lucene.spatial3d.geom

Modifier and Type	Class	Description
class	SidedPlane	Combination of a plane, and a sign value indicating what evaluation values are on the correct side of the plane.

Fields in org.apache.lucene.spatial3d.geom declared as Plane

Modifier and Type	Field	Description
private final Plane	GeoComplexPolygon.FullLinearCrossingEdgeIterator.abovePlane
private final Plane	GeoComplexPolygon.SectorLinearCrossingEdgeIterator.abovePlane
private final Plane	GeoComplexPolygon.FullLinearCrossingEdgeIterator.belowPlane
private final Plane	GeoComplexPolygon.SectorLinearCrossingEdgeIterator.belowPlane
private final Plane	GeoComplexPolygon.TraversalStrategy.firstLegAbovePlane
private final Plane	GeoComplexPolygon.TraversalStrategy.firstLegBelowPlane
private final Plane	GeoComplexPolygon.TraversalStrategy.firstLegPlane
final Plane	GeoDegeneratePath.PathSegment.normalizedConnectingPlane	Normalized plane connecting the two points and going through world center
final Plane	GeoStandardPath.PathSegment.normalizedConnectingPlane	Normalized plane connecting the two points and going through world center
static final Plane	Plane.normalXPlane	A vertical plane normal to the X axis
static final Plane	Plane.normalYPlane	A vertical plane normal to the Y axis
static final Plane	Plane.normalZPlane	A vertical plane normal to the Z axis
final Plane	GeoComplexPolygon.Edge.plane
private final Plane	GeoComplexPolygon.FullLinearCrossingEdgeIterator.plane
private final Plane	GeoComplexPolygon.IntersectorEdgeIterator.plane
private final Plane	GeoComplexPolygon.SectorLinearCrossingEdgeIterator.plane
protected final Plane	GeoDegenerateHorizontalLine.plane	The plane describing the line
protected final Plane	GeoDegenerateLatitudeZone.plane	Plane describing the latitude zone
protected final Plane	GeoDegenerateLongitudeSlice.plane	The plane of the slice
protected final Plane	GeoDegenerateVerticalLine.plane	The vertical line plane
protected final Plane	GeoWideDegenerateHorizontalLine.plane	The plane the line is in
private final Plane	GeoComplexPolygon.TraversalStrategy.secondLegAbovePlane
private final Plane	GeoComplexPolygon.TraversalStrategy.secondLegBelowPlane
private final Plane	GeoComplexPolygon.TraversalStrategy.secondLegPlane
private final Plane	GeoComplexPolygon.testPoint1FixedXAbovePlane
private final Plane	GeoComplexPolygon.testPoint1FixedXBelowPlane
private final Plane	GeoComplexPolygon.testPoint1FixedXPlane
private final Plane	GeoComplexPolygon.testPoint1FixedYAbovePlane
private final Plane	GeoComplexPolygon.testPoint1FixedYBelowPlane
private final Plane	GeoComplexPolygon.testPoint1FixedYPlane
private final Plane	GeoComplexPolygon.testPoint1FixedZAbovePlane
private final Plane	GeoComplexPolygon.testPoint1FixedZBelowPlane
private final Plane	GeoComplexPolygon.testPoint1FixedZPlane
private final Plane	GeoComplexPolygon.DualCrossingEdgeIterator.testPointAbovePlane
private final Plane	GeoComplexPolygon.DualCrossingEdgeIterator.testPointBelowPlane
private Plane	GeoComplexPolygon.DualCrossingEdgeIterator.testPointInsidePlane
private Plane	GeoComplexPolygon.DualCrossingEdgeIterator.testPointOutsidePlane
private final Plane	GeoComplexPolygon.DualCrossingEdgeIterator.testPointPlane
private final Plane	GeoComplexPolygon.DualCrossingEdgeIterator.travelAbovePlane
private final Plane	GeoComplexPolygon.DualCrossingEdgeIterator.travelBelowPlane
private Plane	GeoComplexPolygon.DualCrossingEdgeIterator.travelInsidePlane
private Plane	GeoComplexPolygon.DualCrossingEdgeIterator.travelOutsidePlane
private final Plane	GeoComplexPolygon.DualCrossingEdgeIterator.travelPlane
protected final Plane	dXYZSolid.xPlane	X plane
protected static final Plane	BaseXYZSolid.xVerticalPlane	Vertical plane normal to x unit vector passing through origin
protected final Plane	XdYZSolid.yPlane	Y plane
protected static final Plane	BaseXYZSolid.yVerticalPlane	Vertical plane normal to y unit vector passing through origin
protected final Plane	XYdZSolid.zPlane	Z plane

Methods in org.apache.lucene.spatial3d.geom that return Plane

Modifier and Type	Method	Description
static Plane	Plane.constructNormalizedXPlane(double y, double z, double DValue)	Construct a normalized plane through a y-z point and parallel to the X axis.
static Plane	Plane.constructNormalizedXPlane(Vector... planePoints)	Construct the most accurate normalized plane through an y-z point and including the X axis.
static Plane	Plane.constructNormalizedYPlane(double x, double z, double DValue)	Construct a normalized plane through an x-z point and parallel to the Y axis.
static Plane	Plane.constructNormalizedYPlane(Vector... planePoints)	Construct the most accurate normalized plane through an x-z point and including the Y axis.
static Plane	Plane.constructNormalizedZPlane(double x, double y)	Construct a normalized plane through an x-y point and including the Z axis.
static Plane	Plane.constructNormalizedZPlane(Vector... planePoints)	Construct the most accurate normalized plane through an x-y point and including the Z axis.
static Plane	Plane.constructPerpendicularCenterPlaneOnePoint(Plane plane, Vector M)	Given a plane and one point that is on that plane, find a perpendicular plane that goes through both the origin and the point.
static Plane	Plane.constructPerpendicularCenterPlaneTwoPoints(Vector M, Vector N)	Given two points, construct a plane that goes through them and the origin.
Plane	Plane.normalize()	Build a normalized plane, so that the vector is normalized.

Methods in org.apache.lucene.spatial3d.geom with parameters of type Plane

Modifier and Type	Method	Description
Bounds	Bounds.addHorizontalPlane(PlanetModel planetModel, double latitude, Plane horizontalPlane, Membership... bounds)	Add a horizontal plane to the bounds description.
Bounds	LatLonBounds.addHorizontalPlane(PlanetModel planetModel, double latitude, Plane horizontalPlane, Membership... bounds)
Bounds	XYZBounds.addHorizontalPlane(PlanetModel planetModel, double latitude, Plane horizontalPlane, Membership... bounds)	Add a horizontal plane to the bounds description.
Bounds	Bounds.addIntersection(PlanetModel planetModel, Plane plane1, Plane plane2, Membership... bounds)	Add the intersection between two planes to the bounds description.
Bounds	LatLonBounds.addIntersection(PlanetModel planetModel, Plane plane1, Plane plane2, Membership... bounds)
Bounds	XYZBounds.addIntersection(PlanetModel planetModel, Plane plane1, Plane plane2, Membership... bounds)
Bounds	Bounds.addPlane(PlanetModel planetModel, Plane plane, Membership... bounds)	Add a general plane to the bounds description.
Bounds	LatLonBounds.addPlane(PlanetModel planetModel, Plane plane, Membership... bounds)
Bounds	XYZBounds.addPlane(PlanetModel planetModel, Plane plane, Membership... bounds)
Bounds	Bounds.addVerticalPlane(PlanetModel planetModel, double longitude, Plane verticalPlane, Membership... bounds)	Add a vertical plane to the bounds description.
Bounds	LatLonBounds.addVerticalPlane(PlanetModel planetModel, double longitude, Plane verticalPlane, Membership... bounds)
Bounds	XYZBounds.addVerticalPlane(PlanetModel planetModel, double longitude, Plane verticalPlane, Membership... bounds)	Add a vertical plane to the bounds description.
double	ArcDistance.computeDistance(PlanetModel planetModel, Plane plane, double x, double y, double z, Membership... bounds)
double	ArcDistance.computeDistance(PlanetModel planetModel, Plane plane, GeoPoint point, Membership... bounds)
double	DistanceStyle.computeDistance(PlanetModel planetModel, Plane plane, double x, double y, double z, Membership... bounds)	Compute the distance from a plane to a point.
default double	DistanceStyle.computeDistance(PlanetModel planetModel, Plane plane, GeoPoint point, Membership... bounds)	Compute the distance from a plane to a point.
double	LinearDistance.computeDistance(PlanetModel planetModel, Plane plane, double x, double y, double z, Membership... bounds)
double	LinearDistance.computeDistance(PlanetModel planetModel, Plane plane, GeoPoint point, Membership... bounds)
double	LinearSquaredDistance.computeDistance(PlanetModel planetModel, Plane plane, double x, double y, double z, Membership... bounds)
double	LinearSquaredDistance.computeDistance(PlanetModel planetModel, Plane plane, GeoPoint point, Membership... bounds)
double	NormalDistance.computeDistance(PlanetModel planetModel, Plane plane, double x, double y, double z, Membership... bounds)
double	NormalDistance.computeDistance(PlanetModel planetModel, Plane plane, GeoPoint point, Membership... bounds)
double	NormalSquaredDistance.computeDistance(PlanetModel planetModel, Plane plane, double x, double y, double z, Membership... bounds)
double	NormalSquaredDistance.computeDistance(PlanetModel planetModel, Plane plane, GeoPoint point, Membership... bounds)
static Plane	Plane.constructPerpendicularCenterPlaneOnePoint(Plane plane, Vector M)	Given a plane and one point that is on that plane, find a perpendicular plane that goes through both the origin and the point.
static SidedPlane	SidedPlane.constructSidedPlaneFromOnePoint(Vector insidePoint, Plane plane, Vector intersectionPoint)	Construct sided plane from a plane and one point.
private int	GeoComplexPolygon.DualCrossingEdgeIterator.countCrossings(GeoComplexPolygon.Edge edge, Plane travelEnvelopePlane, Membership travelEnvelopeBound1, Membership travelEnvelopeBound2, Plane testPointEnvelopePlane, Membership testPointEnvelopeBound1, Membership testPointEnvelopeBound2)	Find the intersections with a pair of envelope planes, and assess those intersections for duplication and for whether they truly describe crossings.
private int	GeoComplexPolygon.FullLinearCrossingEdgeIterator.countCrossings(GeoComplexPolygon.Edge edge, Plane envelopePlane, Membership envelopeBound)	Find the intersections with an envelope plane, and assess those intersections for whether they truly describe crossings.
private int	GeoComplexPolygon.SectorLinearCrossingEdgeIterator.countCrossings(GeoComplexPolygon.Edge edge, Plane envelopePlane, Membership envelopeBound1, Membership envelopeBound2)	Find the intersections with an envelope plane, and assess those intersections for whether they truly describe crossings.
private GeoComplexPolygon.CountingEdgeIterator	GeoComplexPolygon.createLinearCrossingEdgeIterator(GeoPoint testPoint, Plane plane, Plane abovePlane, Plane belowPlane, double thePointX, double thePointY, double thePointZ)	Create a linear crossing edge iterator with the appropriate cutoff planes given the geometry.
boolean	Plane.crosses(PlanetModel planetModel, Plane q, GeoPoint[] notablePoints, GeoPoint[] moreNotablePoints, Membership[] bounds, Membership... moreBounds)	Determine whether the plane crosses another plane within the bounds provided.
private boolean	GeoComplexPolygon.DualCrossingEdgeIterator.edgeCrossesEnvelope(Plane edgePlane, GeoPoint intersectionPoint, Plane envelopePlane)	Return true if the edge crosses the envelope plane, given the envelope intersection point.
private boolean	GeoComplexPolygon.FullLinearCrossingEdgeIterator.edgeCrossesEnvelope(Plane edgePlane, GeoPoint intersectionPoint, Plane envelopePlane)
private boolean	GeoComplexPolygon.SectorLinearCrossingEdgeIterator.edgeCrossesEnvelope(Plane edgePlane, GeoPoint intersectionPoint, Plane envelopePlane)
private GeoPoint[]	GeoComplexPolygon.findAdjoiningPoints(Plane plane, GeoPoint pointOnPlane, Plane envelopePlane)	Given a point on the plane and the ellipsoid, this method looks for a pair of adjoining points on either side of the plane, which are about MINIMUM_RESOLUTION away from the given point.
GeoPoint[]	Plane.findCrossings(PlanetModel planetModel, Plane q, Membership... bounds)	Find the points between two planes, where one plane crosses the other, given a set of bounds.
protected GeoPoint[]	Plane.findCrossings(PlanetModel planetModel, Plane q, Membership[] bounds, Membership[] moreBounds)	Find the points between two planes, where one plane crosses the other, given a set of bounds.
GeoPoint[]	ArcDistance.findDistancePoints(PlanetModel planetModel, double distanceValue, GeoPoint startPoint, Plane plane, Membership... bounds)
GeoPoint[]	DistanceStyle.findDistancePoints(PlanetModel planetModel, double distanceValue, GeoPoint startPoint, Plane plane, Membership... bounds)	Find a GeoPoint, at a specified distance from a starting point, within the specified bounds.
GeoPoint[]	LinearDistance.findDistancePoints(PlanetModel planetModel, double distanceValue, GeoPoint startPoint, Plane plane, Membership... bounds)
GeoPoint[]	LinearSquaredDistance.findDistancePoints(PlanetModel planetModel, double distanceValue, GeoPoint startPoint, Plane plane, Membership... bounds)
GeoPoint[]	NormalDistance.findDistancePoints(PlanetModel planetModel, double distanceValue, GeoPoint startPoint, Plane plane, Membership... bounds)
GeoPoint[]	NormalSquaredDistance.findDistancePoints(PlanetModel planetModel, double distanceValue, GeoPoint startPoint, Plane plane, Membership... bounds)
protected void	Plane.findIntersectionBounds(PlanetModel planetModel, Bounds boundsInfo, Plane q, Membership... bounds)	Record intersection points for planes with error bounds.
GeoPoint[]	Plane.findIntersections(PlanetModel planetModel, Plane q, Membership... bounds)	Find the intersection points between two planes, given a set of bounds.
protected GeoPoint[]	Plane.findIntersections(PlanetModel planetModel, Plane q, Membership[] bounds, Membership[] moreBounds)	Find the intersection points between two planes, given a set of bounds.
GeoPoint	Plane.getSampleIntersectionPoint(PlanetModel planetModel, Plane q)	Find a sample point on the intersection between two planes and the world.
boolean	GeoBaseCompositeShape.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoComplexPolygon.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoConcavePolygon.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoConvexPolygon.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoDegenerateHorizontalLine.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoDegenerateLatitudeZone.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoDegenerateLongitudeSlice.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoDegeneratePath.intersects(Plane plane, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoDegeneratePath.PathSegment.intersects(Plane p, GeoPoint[] notablePoints, Membership[] bounds)	Determine if this endpoint intersects a specified plane.
boolean	GeoDegeneratePath.SegmentEndpoint.intersects(Plane p, GeoPoint[] notablePoints, Membership[] bounds)	Determine if this endpoint intersects a specified plane.
boolean	GeoDegeneratePoint.intersects(Plane plane, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoDegenerateVerticalLine.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoExactCircle.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoLatitudeZone.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoLongitudeSlice.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoNorthLatitudeZone.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoNorthRectangle.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoRectangle.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoS2Shape.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoShape.intersects(Plane plane, GeoPoint[] notablePoints, Membership... bounds)	Assess whether a plane, within the provided bounds, intersects with the shape's edges.
boolean	GeoSouthLatitudeZone.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoSouthRectangle.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoStandardCircle.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoStandardPath.BaseSegmentEndpoint.intersects(Plane p, XYZBounds planeBounds, GeoPoint[] notablePoints, Membership[] bounds)
boolean	GeoStandardPath.CircleSegmentEndpoint.intersects(Plane p, XYZBounds planeBounds, GeoPoint[] notablePoints, Membership[] bounds)
boolean	GeoStandardPath.CutoffDualCircleSegmentEndpoint.intersects(Plane p, XYZBounds planeBounds, GeoPoint[] notablePoints, Membership[] bounds)
boolean	GeoStandardPath.CutoffSingleCircleSegmentEndpoint.intersects(Plane p, XYZBounds planeBounds, GeoPoint[] notablePoints, Membership[] bounds)
boolean	GeoStandardPath.intersects(Plane plane, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoStandardPath.PathComponent.intersects(Plane p, XYZBounds planeBounds, GeoPoint[] notablePoints, Membership[] bounds)	Determine if this endpoint intersects a specified plane.
boolean	GeoStandardPath.PathNode.intersects(Plane p, XYZBounds planeBounds, GeoPoint[] notablePoints, Membership[] bounds)
boolean	GeoStandardPath.PathSegment.intersects(Plane p, XYZBounds planeBounds, GeoPoint[] notablePoints, Membership[] bounds)
boolean	GeoWideDegenerateHorizontalLine.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoWideLongitudeSlice.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoWideNorthRectangle.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoWideRectangle.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoWideSouthRectangle.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	GeoWorld.intersects(Plane p, GeoPoint[] notablePoints, Membership... bounds)
boolean	Plane.intersects(PlanetModel planetModel, Plane q, GeoPoint[] notablePoints, GeoPoint[] moreNotablePoints, Membership[] bounds, Membership... moreBounds)	Determine whether the plane intersects another plane within the bounds provided.
boolean	Plane.isFunctionallyIdentical(Plane p)	Returns true if this plane and the other plane are functionally identical within the margin of error.
private boolean	GeoComplexPolygon.isInSet(double x, double y, double z, GeoPoint testPoint, boolean testPointInSet, Plane testPointFixedXPlane, Plane testPointFixedXAbovePlane, Plane testPointFixedXBelowPlane, Plane testPointFixedYPlane, Plane testPointFixedYAbovePlane, Plane testPointFixedYBelowPlane, Plane testPointFixedZPlane, Plane testPointFixedZAbovePlane, Plane testPointFixedZBelowPlane)	Given a test point, whether it is in set, and the associated planes, figure out if another point is in set or not.
boolean	Plane.isNumericallyIdentical(Plane p)	Returns true if this plane and the other plane are identical within the margin of error.
void	Plane.recordBounds(PlanetModel planetModel, LatLonBounds boundsInfo, Plane p, Membership... bounds)	Accumulate bounds information for this plane, intersected with another plane and the world.
void	Plane.recordBounds(PlanetModel planetModel, XYZBounds boundsInfo, Plane p, Membership... bounds)	Accumulate (x,y,z) bounds information for this plane, intersected with another and the world.

Constructors in org.apache.lucene.spatial3d.geom with parameters of type Plane

Modifier	Constructor	Description
	CircleSegmentEndpoint(PlanetModel planetModel, GeoStandardPath.PathComponent previous, GeoPoint point, Plane normalPlane, GeoPoint upperPoint, GeoPoint lowerPoint)	Constructor for case (1).
	DualCrossingEdgeIterator(GeoPoint testPoint, Plane testPointPlane, Plane testPointAbovePlane, Plane testPointBelowPlane, Plane travelPlane, Plane travelAbovePlane, Plane travelBelowPlane, double thePointX, double thePointY, double thePointZ, GeoPoint intersectionPoint)
	FullLinearCrossingEdgeIterator(GeoPoint testPoint, Plane plane, Plane abovePlane, Plane belowPlane, double thePointX, double thePointY, double thePointZ)
	IntersectorEdgeIterator(Plane plane, GeoPoint[] notablePoints, Membership... bounds)
	PathSegment(PlanetModel planetModel, GeoPoint start, GeoPoint end, Plane normalizedConnectingPlane)	Construct a path segment.
	PathSegment(PlanetModel planetModel, GeoStandardPath.PathComponent previous, GeoPoint start, GeoPoint end, Plane normalizedConnectingPlane, double planeBoundingOffset)	Construct a path segment.
	Plane(Plane basePlane, boolean above)	Construct a plane that is parallel to the one provided, but which is just barely numerically distinguishable from it, in the direction desired.
	SafePath(GeoPolygonFactory.SafePath previous, GeoPoint lastPoint, int lastPointIndex, Plane lastPlane)	Create a new safe end point.
	SectorLinearCrossingEdgeIterator(GeoPoint testPoint, Plane plane, Plane abovePlane, Plane belowPlane, double thePointX, double thePointY, double thePointZ)
	TraversalStrategy(double traversalDistance, double firstLegValue, double secondLegValue, Plane firstLegPlane, Plane firstLegAbovePlane, Plane firstLegBelowPlane, Plane secondLegPlane, Plane secondLegAbovePlane, Plane secondLegBelowPlane, GeoComplexPolygon.Tree firstLegTree, GeoComplexPolygon.Tree secondLegTree, GeoPoint intersectionPoint)