MCPcopy Create free account

hub / github.com/davideberly/GeometricTools / functions

Functions9,004 in github.com/davideberly/GeometricTools

↓ 3 callersMethodSetLengthC
GTE/Samples/Physics/MassSprings3D/CpuMassSpringVolume.cpp:73
↓ 3 callersMethodSetLengthR
GTE/Samples/Physics/MassSprings3D/CpuMassSpringVolume.cpp:83
↓ 3 callersMethodSetLevel
GTE/Mathematics/AdaptiveSkeletonClimbing3.h:395
↓ 3 callersMethodSetLinearVelocity
GTE/Mathematics/RigidBody.h:352
↓ 3 callersMethodSetNumActiveElements
GTE/Graphics/GL46/GL46StructuredBuffer.cpp:103
↓ 3 callersMethodSetObject
GTE/Graphics/Controller.cpp:42
↓ 3 callersMethodSetPixelShader
GTE/Graphics/VisualProgram.h:47
↓ 3 callersMethodSetPosition
GTE/Mathematics/RigidBody.h:327
↓ 3 callersMethodSetPostProjectionMatrix
GTE/Graphics/Camera.cpp:30
↓ 3 callersMethodSetSegment
GTE/Graphics/IndexBuffer.cpp:114
↓ 3 callersMethodSetTimeInterval
This function applies only when the first constructor is used (two times rather than a sequence of three or more times).
GTE/Mathematics/ParametricCurve.h:92
↓ 3 callersMethodSetVertexShader
GTE/Graphics/VisualProgram.h:38
↓ 3 callersMethodSub
GTE/Mathematics/APInterval.h:104
↓ 3 callersMethodToCoefficients
Construct the coefficients in the quadratic equation that represents the hyperellipsoid.
GTE/Mathematics/Hyperellipsoid.h:99
↓ 3 callersMethodToLine
Given a line with origin V0 and direction <V0,V1> and a query point P, ToLine returns +1, P on right of line -1, P on left of line 0, P on the line
GTE/Mathematics/ConstrainedDelaunay2.h:776
↓ 3 callersFunctionTrace
GTE/Mathematics/Matrix2x2.h:106
↓ 3 callersMethodUpdatePlanes
GTE/Samples/Intersection/IntersectConvexPolyhedra/ConvexPolyhedron.h:199
↓ 3 callersMethodWrite
Disk input/output. The fstream objects should be created using std::ios::binary. The return value is 'true' iff the operation was successful.
GTE/Mathematics/BSNumber.h:661
↓ 3 callersFunctionfmod
GTE/Mathematics/BSNumber.h:1330
↓ 3 callersFunctionglClearColor
GTE/Graphics/GL46/GL46.cpp:1648
↓ 3 callersFunctionglClearDepth
GTE/Graphics/GL46/GL46.cpp:1674
↓ 3 callersFunctionglClearStencil
GTE/Graphics/GL46/GL46.cpp:1661
↓ 3 callersFunctionglGetDoublev
GTE/Graphics/GL46/GL46.cpp:1908
↓ 3 callersFunctionglGetError
GTE/Graphics/GL46/GL46.cpp:1921
↓ 3 callersFunctionglGetTexImage
GTE/Graphics/GL46/GL46.cpp:1978
↓ 3 callersFunctionglSamplerParameterf
GTE/Graphics/GL46/GL46.cpp:7826
↓ 3 callersFunctionglTexStorage2D
GTE/Graphics/GL46/GL46.cpp:11099
↓ 3 callersFunctionglTexStorage3D
GTE/Graphics/GL46/GL46.cpp:11118
↓ 3 callersFunctionglTexSubImage3D
GTE/Graphics/GL46/GL46.cpp:2406
↓ 3 callersFunctionremainder
GTE/Mathematics/BSNumber.h:1385
↓ 2 callersMethodAdjustVerticalDistance
GTE/Samples/SceneGraphs/Castle/CastleWindow3.cpp:921
↓ 2 callersMethodApplyImpulse
Call ApplyImpulse for each rigid body in your simulation at the the current simulation time. After all such calls are made, then iterate over all your
GTE/Mathematics/RigidBody.h:540
↓ 2 callersMethodAutogenerateRTMipmaps
GTE/Graphics/DrawTarget.cpp:85
↓ 2 callersMethodCaptureFrame
GTE/Samples/Imagics/VideoStreams/VideoStream.cpp:22
↓ 2 callersMethodCompute
GTE/Samples/Mathematics/ShortestPath/GpuShortestPath.cpp:96
↓ 2 callersMethodComputeCentroid
GTE/Mathematics/Tetrahedron3.h:224
↓ 2 callersMethodComputeDerivative
GTE/Mathematics/IntpAkima1.h:118
↓ 2 callersMethodComputeFromData
This function is valid only for 3-channel points (x,y,z) or 4-channel vectors (x,y,z,0) or 4-channel points (x,y,z,1). In all cases, the function acc
GTE/Graphics/BoundingSphere.h:178
↓ 2 callersMethodComputeGeodesic
Returns a polyline approximation to a geodesic curve connecting the points.
GTE/Mathematics/RiemannianGeodesic.h:154
↓ 2 callersMethodComputePosition
GTE/Mathematics/EllipsoidGeodesic.h:59
↓ 2 callersMethodComputeTotalCurvature
Compute the total curvature of the polyline. The curvatures of the segments are computed relative to the metric tensor.
GTE/Mathematics/RiemannianGeodesic.h:333
↓ 2 callersMethodComputeTotalLength
Compute the total length of the polyline. The lengths of the segments are computed relative to the metric tensor.
GTE/Mathematics/RiemannianGeodesic.h:141
↓ 2 callersMethodComputeWeight
The weight depends on the area of the triangles sharing the vertex and the lengths of the projections of the adjacent vertices onto the vertex normal
GTE/Mathematics/VertexCollapseMesh.h:257
↓ 2 callersFunctionConvert
GTE/Mathematics/BSRational.h:622
↓ 2 callersMethodCopy
GTE/Mathematics/LCPSolver.h:434
↓ 2 callersMethodCreate
GTE/Samples/Intersection/IntersectConvexPolyhedra/ConvexPolyhedron.h:51
↓ 2 callersMethodCreateTriangle
GTE/Graphics/MeshFactory.cpp:144
↓ 2 callersMethodDetachChild
GTE/Graphics/Node.cpp:55
↓ 2 callersMethodDetachChildAt
GTE/Graphics/Node.cpp:74
↓ 2 callersMethodEvaluate
Evaluation of the B-spline curve. It is defined for 0 <= t <= 1. If a t-value is outside [0,1], an open spline clamps it to [0,1]. The caller must en
GTE/Mathematics/BSplineCurveFit.h:203
↓ 2 callersMethodEvaluateCaching
GTE/Mathematics/IntpBSplineUniform.h:534
↓ 2 callersMethodEvaluateNoCaching
Evaluate the interpolator. Each element of 'order' indicates the order of the derivative you want to compute. For the function value itself, pass in
GTE/Mathematics/IntpBSplineUniform.h:461
↓ 2 callersMethodExecute
GTE/Samples/Mathematics/RootFinding/RootFindingConsole.cpp:25
↓ 2 callersMethodExecute
GTE/Samples/Graphics/IEEEFloatingPoint/IEEEFloatingPointConsole.cpp:22
↓ 2 callersMethodExecute
GTE/Samples/Physics/BeadSlide/BeadSlideConsole.cpp:20
↓ 2 callersMethodFactor
The matrix A must be positive definite. The implementation uses only the lower-triangular portion of A. On output, L is lower unit triangular and D is
GTE/Mathematics/LDLTDecomposition.h:147
↓ 2 callersMethodFactor
On input, A is symmetric. Only the lower-triangular portion is modified. On output, the lower-triangular portion is L where A = L * L^T.
GTE/Mathematics/CholeskyDecomposition.h:39
↓ 2 callersMethodFindIntersection
Compute the polyhedron of intersection.
GTE/Samples/Intersection/IntersectConvexPolyhedra/ConvexPolyhedron.h:320
↓ 2 callersMethodFromCoefficients
Construct C, U[i], and e[i] from the equation. The return value is 'true' if and only if the input coefficients represent a hyperellipsoid. If the f
GTE/Mathematics/Hyperellipsoid.h:158
↓ 2 callersMethodGenerateLayout
GTE/Graphics/DX11/HLSLBaseBuffer.cpp:42
↓ 2 callersMethodGenerateParticles
GTE/Graphics/Particles.cpp:95
↓ 2 callersMethodGetActive
GTE/Mathematics/IncrementalDelaunay2.h:1363
↓ 2 callersMethodGetActive
GTE/Applications/TrackObject.h:83
↓ 2 callersMethodGetActiveChild
GTE/Graphics/SwitchNode.h:24
↓ 2 callersMethodGetAdjacencies
GTE/Mathematics/Delaunay2Mesh.h:204
↓ 2 callersMethodGetAdjacencies
GTE/Mathematics/Delaunay3Mesh.h:189
↓ 2 callersMethodGetAdjacencies
GTE/Mathematics/PlanarMesh.h:240
↓ 2 callersMethodGetAdjacentOfEdge
GTE/Mathematics/ETManifoldMesh.h:106
↓ 2 callersMethodGetAmplitude
GTE/Samples/Physics/BouncingBall/DeformableBall.h:50
↓ 2 callersMethodGetBack
GTE/Mathematics/UIntegerAP32.h:176
↓ 2 callersMethodGetBoolean
GTE/Applications/Command.cpp:110
↓ 2 callersMethodGetCBuffers
GTE/Graphics/DX11/HLSLShaderFactory.cpp:263
↓ 2 callersMethodGetChildPtr
GTE/Graphics/Node.cpp:140
↓ 2 callersMethodGetContainingTetrahedron
If the point is in a tetrahedron, the return value is the index of the tetrahedron. If the point is not in a tetrahedron, the return value isstd::nume
GTE/Mathematics/Delaunay3.h:1334
↓ 2 callersMethodGetContainingTriangle
Containment queries. The function GetContainingTriangle works correctly when the planar mesh is a convex set. If the mesh is not convex, it is possi
GTE/Mathematics/PlanarMesh.h:255
↓ 2 callersMethodGetCopy
GTE/Mathematics/BSPPolygon2.h:351
↓ 2 callersMethodGetCurrentY1
Member access.
GTE/Samples/Physics/MassPulleySpringSystem/PhysicsModule.h:41
↓ 2 callersMethodGetCurrentY2
GTE/Samples/Physics/MassPulleySpringSystem/PhysicsModule.h:46
↓ 2 callersMethodGetDepthStencilState
Member access.
GTE/Graphics/GL46/GL46DepthStencilState.h:24
↓ 2 callersMethodGetExtremeVertices
Compute the extreme vertices in the specified direction and return the indices of the vertices in the polyhedron vertex array.
GTE/Mathematics/ExtremalQuery3PRJ.h:37
↓ 2 callersMethodGetFrame
GTE/Graphics/ViewVolume.cpp:105
↓ 2 callersMethodGetFrustum
GTE/Graphics/ViewVolume.cpp:143
↓ 2 callersMethodGetHandle
Member access.
GTE/Applications/MSW/Window.h:58
↓ 2 callersMethodGetIndex
Conversions between n-dim and 1-dim structures. The 'coord' arrays must have GetNumDimensions() elements.
GTE/Mathematics/Image.h:143
↓ 2 callersMethodGetInternalFormat
Get the GL4 internal format for the specified Texture data format.
GTE/Graphics/GL46/GL46Texture.h:42
↓ 2 callersMethodGetItemIndexFor
Faces for all the of the cubes are stored contiguously in one large array so GetNumItems() will return a number that is the same as 6*GetNumCubes().
GTE/Graphics/TextureCubeArray.h:40
↓ 2 callersMethodGetKeepInternalCount
GTE/Graphics/StructuredBuffer.h:61
↓ 2 callersMethodGetLevelOfDetail
GTE/Mathematics/CLODPolyline.h:92
↓ 2 callersMethodGetMInverse
Compute M^{-1} = sum_{d=0}^{N-1} U[d]*U[d]^T*e[d]^2.
GTE/Mathematics/Hyperellipsoid.h:87
↓ 2 callersMethodGetNormal
GTE/Graphics/Terrain.cpp:96
↓ 2 callersMethodGetNumActive
GTE/Mathematics/IncrementalDelaunay2.h:1358
↓ 2 callersMethodGetNumActive
GTE/Graphics/Particles.h:67
↓ 2 callersMethodGetNumActiveElements
GTE/Graphics/DX11/DX11Engine.cpp:1805
↓ 2 callersMethodGetNumActiveIndices
GTE/Graphics/IndexBuffer.cpp:43
↓ 2 callersMethodGetNumRecords
Member access.
GTE/Graphics/CLODMesh.h:22
↓ 2 callersMethodGetNumSlices
Member access.
GTE/Mathematics/MassSpringVolume.h:58
↓ 2 callersMethodGetNumSupport
Member access.
GTE/Mathematics/MinimumAreaCircle2.h:168
↓ 2 callersFunctionGetOpenGLFunctionPointer
GTE/Graphics/GL46/WGL/WGLExtensions.cpp:13
↓ 2 callersMethodGetOppositeVertexOfEdge
GTE/Mathematics/ETManifoldMesh.h:118
↓ 2 callersMethodGetPlanes
Construct the planes of the faces. The planes have outer pointing normal vectors. The plane indexing is the same as the face indexing mentioned previo
GTE/Mathematics/Tetrahedron3.h:195
← previousnext →601–700 of 9,004, ranked by callers