Uses of Interface
cz.fidentis.analyst.data.kdtree.KdTreeVisitor
Packages that use KdTreeVisitor
Package
Description
K-d tree space partitioning structure.
-
Uses of KdTreeVisitor in cz.fidentis.analyst.data.kdtree
Methods in cz.fidentis.analyst.data.kdtree with parameters of type KdTreeVisitor -
Uses of KdTreeVisitor in cz.fidentis.analyst.data.kdtree.impl
Methods in cz.fidentis.analyst.data.kdtree.impl with parameters of type KdTreeVisitor -
Uses of KdTreeVisitor in cz.fidentis.analyst.engines.avgmesh
Subinterfaces of KdTreeVisitor in cz.fidentis.analyst.engines.avgmeshModifier and TypeInterfaceDescriptioninterface
An interface declaring the ability to deform a template mesh into an average mesh based on visiting other meshes. -
Uses of KdTreeVisitor in cz.fidentis.analyst.engines.avgmesh.impl
Classes in cz.fidentis.analyst.engines.avgmesh.impl that implement KdTreeVisitorModifier and TypeClassDescriptionclass
Visitor capable to create an average face by deforming given face template so that its vertices are in the "average position" with respect to the visited faces.class
Visitor capable to create an average face by deforming main face template so that its vertices are in the "average position" with respect to the visited faces.class
GPU acceleratedAvgMeshVisitorRC
. -
Uses of KdTreeVisitor in cz.fidentis.analyst.engines.distance.impl
Methods in cz.fidentis.analyst.engines.distance.impl that return KdTreeVisitorModifier and TypeMethodDescriptionprotected KdTreeVisitor
MeshDistanceNN.instantiateVisitor
(javax.vecmath.Point3d inspectedPoint) -
Uses of KdTreeVisitor in cz.fidentis.analyst.engines.point2surface
Subinterfaces of KdTreeVisitor in cz.fidentis.analyst.engines.point2surfaceModifier and TypeInterfaceDescriptioninterface
Classes implementing this interface can compute minimal distance between a 3D point (set in a constructor) to a mesh facets. -
Uses of KdTreeVisitor in cz.fidentis.analyst.engines.point2surface.impl
Classes in cz.fidentis.analyst.engines.point2surface.impl that implement KdTreeVisitorModifier and TypeClassDescriptionclass
This visitor finds the minimal distance between the given 3D point and points (e.g., mesh vertices) stored in visited k-d trees.class
For a given 3D point, this visitor returns the closest node(s) and its/their distance to the point.class
This visitor finds the minimal distance between a given 3D point and triangular meshes The minimal distance is computed between the 3D point and triangles of the mesh facets, i.e., the closest point at the triangle surface is found.