Uses of Class
htm.core.Vector3d

Packages that use Vector3d

Package	Description
htm.core

Uses of Vector3d in htm.core

Fields in htm.core declared as Vector3d

Modifier and Type	Field and Description
Vector3d	Constraint.a_

Methods in htm.core that return Vector3d

Modifier and Type	Method and Description
Vector3d	Vector3d.add(Vector3d v) vector addition
Vector3d	Vector3d.cross(Vector3d v) vector cross product
Vector3d	Convex.getCorner(int c)
(package private) Vector3d	HTMindexImp.getVertex(int x)
Vector3d	HTMindex.idToPoint(long htmId) return center vector of the tringle which htmId relates to
Vector3d	HTMindexImp.idToPoint(long htmId) for the given id return the vector at the center of the triangle calls HTMfunc
Vector3d	HTMindex.idToPoint(String htmName) return center vector of the tringle which htmName relates to
Vector3d	HTMindexImp.idToPoint(String htmName) for the given id return the vector at the center of the triangle calls HTMfunc
Vector3d	Vector3d.mul(double n) multiply with a number
Vector3d[]	HTMindexImp.nodeVertex(int leaf) nodeVertex: return the vectors of the vertices, based on a bitlist leaf index
Vector3d	Vector3d.sub(Vector3d v) vector subtraction
Vector3d	Constraint.v() give back constraint direction
(package private) Vector3d	HTMindexImp.V(int index, int x)

Methods in htm.core with parameters of type Vector3d

Modifier and Type	Method and Description
Vector3d	Vector3d.add(Vector3d v) vector addition
(package private) void	HTMindexImp.add(Vector3d v, int i)
double	HTMindexImp.area(Vector3d n0, Vector3d n1, Vector3d n2) area: routine to precompute the area of a node using AREA = 4*arctan sqrt(tan(s/2)tan((s-a)/2)tan((s-b)/2)tan((s-c)/2)) with s = (a+b+c)/2 (with many thanks to Eduard Masana @ University of Barcelona)
boolean	HTMindex.contains(Domain d, Vector3d p) does the domain coaintain thie given point
boolean	HTMindexImp.contains(Domain d, Vector3d p)
boolean	Constraint.contains(Vector3d vector) check whether a vector is inside this constraint
boolean	Domain.contains(Vector3d p)
boolean	Convex.contains(Vector3d p)
Vector3d	Vector3d.cross(Vector3d v) vector cross product
boolean	Vector3d.equal(Vector3d v) comparison
(package private) boolean	Convex.eSolve(Vector3d v1, Vector3d v2, int cIndex) eSolve: solve the quadratic equation for the edge v1,v2 of constraint[cIndex]
(package private) boolean	HTMindexImp.isInside(Vector3d v, Vector3d v0, Vector3d v1, Vector3d v2) Test whether a vector v is inside a triangle v0,v1,v2.
String	HTMindex.lookup(Vector3d point) return a HTM name like N2121 for a given vector
String	HTMindexImp.lookup(Vector3d v) find a node by giving a vector.
long	HTMindex.lookupId(Vector3d point) return a HTM id number for a given vector
long	HTMindexImp.lookupId(Vector3d v) find a node by giving a vector.
double	Vector3d.mul(Vector3d v) dot product
Vector3d	Vector3d.sub(Vector3d v) vector subtraction
(package private) boolean	Convex.testBoundingCircle(Vector3d v0, Vector3d v1, Vector3d v2) Test if bounding circle intersects with a constraint
(package private) boolean	Convex.testConstraintInside(Vector3d v0, Vector3d v1, Vector3d v2, int cIndex) Test for a constraint lying inside or outside of triangle
(package private) boolean	Convex.testEdge(Vector3d v0, Vector3d v1, Vector3d v2) testEdge: look whether one of the constraints intersects with one of the edges of node with the corners v0,v1,v2.
(package private) boolean	Convex.testEdge0(Vector3d v0, Vector3d v1, Vector3d v2) testEdge0: test the edges of the triangle against the edges of the zERO convex.
(package private) boolean	Convex.testEdgeConstraint(Vector3d v0, Vector3d v1, Vector3d v2, int cIndex) Test if a constraint intersects the edges
(package private) boolean	Convex.testHole(Vector3d v0, Vector3d v1, Vector3d v2) testHole : look for 'holes', i.e.
(package private) short	Convex.testNode(Vector3d v0, Vector3d v1, Vector3d v2) test each QuadNode for intersections.
(package private) int	Convex.testOtherPosNone(Vector3d v0, Vector3d v1, Vector3d v2) Look for any positive constraint that does not intersect the edges
(package private) void	Convex.testPartial(int level, long id, Vector3d v0, Vector3d v1, Vector3d v2, int PPrev, HTMindexImp idx, HTMrange range, boolean varlen) test a triangle's subtriangles whether they are partial.
(package private) short	Convex.testTriangle(Vector3d v0, Vector3d v1, Vector3d v2, int vsum) testTriangle: tests a triangle given by 3 vertices if it intersects the convex.
(package private) boolean	Convex.testVectorInside(Vector3d v0, Vector3d v1, Vector3d v2, Vector3d v) Test for a vector lying inside or outside of triangle For vectors abc, if (a ^ b * c) < 0, abc are ordered clockwise.
(package private) int	Convex.testVertex(Vector3d v) Test if vertices are inside the convex

Constructors in htm.core with parameters of type Vector3d

Constructor and Description
Constraint(Vector3d vector, double distance) Initialization constructor
Convex(Vector3d v1, Vector3d v2, Vector3d v3) Constructor from a triangle Initialize domain from a triangle.
Convex(Vector3d v1, Vector3d v2, Vector3d v3, Vector3d v4) Constructor from a rectangle Initialize convex from a rectangle.
Vector3d(Vector3d copy) Copy constructor