Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/SarahWeiii/CoACD
/ functions
Functions
600 in github.com/SarahWeiii/CoACD
⨍
Functions
600
◇
Types & classes
111
Method
dot
src/btConvexHull/btConvexHullComputer.cpp:74
Method
dot
src/btConvexHull/btConvexHullComputer.cpp:124
Method
downHeap
src/btConvexHull/btAlignedObjectArray.h:327
Method
edge_against_tri_edge
V0, V1 define an edge U0, U1, U2 define a triangle i0, i1 \in {0,1,2} define the plane (x-y, x-z or y-z) onto which all five vertices are projected
src/intersection.h:613
Method
edge_edge_test
Tests whether edge U0, U1 intersects with the edge whose origin is V0 and the coordinates of the vector pointing towards the second vertex are Ax (alo
src/intersection.h:551
Method
evalMetric
src/nanoflann.hpp:432
Method
evalMetric
src/nanoflann.hpp:487
Method
evalMetric
src/nanoflann.hpp:522
Method
evalMetric
src/nanoflann.hpp:561
Method
findBinarySearch
non-recursive binary search, assumes sorted array
src/btConvexHull/btAlignedObjectArray.h:388
Method
findEdgeForCoplanarFaces
src/btConvexHull/btConvexHullComputer.cpp:1369
Method
findLinearSearch
src/btConvexHull/btAlignedObjectArray.h:406
Method
findMaxAngle
src/btConvexHull/btConvexHullComputer.cpp:1325
Method
findNeighbors
src/nanoflann.hpp:2123
Method
find_min_max
src/intersection.h:416
Method
full
src/nanoflann.hpp:272
Function
furthestAxis
src/btConvexHull/btVector3.h:220
Function
fuzzyZero
src/btConvexHull/btVector3.h:345
Function
get128
src/btConvexHull/btVector3.h:53
Method
getBtNormal
src/btConvexHull/btConvexHullComputer.cpp:1853
Method
getConvexHullAsMesh
src/quickhull/QuickHull.cpp:81
Method
getDistanceTo
src/quickhull/Structs/Vector3.hpp:147
Method
getExtremeValues
src/quickhull/QuickHull.cpp:351
Method
getIndexVectorFromPool
src/quickhull/QuickHull.hpp:189
Method
getNormalized
src/quickhull/Structs/Vector3.hpp:68
Method
getObjectType
src/btConvexHull/btScalar.h:528
Method
getOrientation
src/btConvexHull/btConvexHullComputer.cpp:1303
Method
getReverseEdge
src/btConvexHull/btConvexHullComputer.h:62
Method
getScale
src/quickhull/QuickHull.cpp:408
Function
getSkewSymmetricMatrix
src/btConvexHull/btVector3.h:328
Method
getW
src/btConvexHull/btVector3.h:517
Method
get_current_round
src/mcts.cpp:110
Method
get_current_value
src/mcts.cpp:102
Method
get_parent
src/mcts.cpp:218
Method
get_tag
(self)
setup.py:13
Method
get_tolerance
distances smaller than get_tolerance() may be treated as 0
src/intersection.h:155
Method
get_value
src/intersection.h:47
Method
guarded_cross_product
src/intersection.h:344
Method
heapSort
src/btConvexHull/btAlignedObjectArray.h:368
Method
high
src/btConvexHull/btConvexHullComputer.cpp:570
Function
i4_sobol_generate
src/sobol.cpp:13899
Function
i4_uniform
src/sobol.cpp:13947
Function
i8_bit_hi1
src/sobol.cpp:14045
Function
i8_sobol_generate
src/sobol.cpp:27861
Function
i8_uniform
src/sobol.cpp:27987
Method
index_into_largest_component_abs
returns the index into the the largest-magnitude component of the argument
src/intersection.h:274
Method
index_into_smallest_component_abs
returns the index into the the largest-magnitude component of the argument
src/intersection.h:303
Method
init
src/nanoflann.hpp:267
Method
init
Creates multiple empty trees to handle dynamic support */
src/nanoflann.hpp:2021
Method
init
src/btConvexHull/btConvexHullComputer.cpp:676
Method
init
src/btConvexHull/btAlignedObjectArray.h:82
Method
init_vind
Make sure the auxiliary list \a vind has the same size than the current * dataset, and re-generate if size has changed. */
src/nanoflann.hpp:1451
Method
initializeFromBuffer
PCK: whole function
src/btConvexHull/btAlignedObjectArray.h:431
Method
internal_init
src/nanoflann.hpp:697
Method
isDisabled
src/quickhull/Structs/Mesh.hpp:67
Function
isZero
src/btConvexHull/btVector3.h:340
Method
isZero
src/btConvexHull/btConvexHullComputer.cpp:109
Method
is_wedge_colinear
src/intersection.h:229
Method
isect2
Computes extreme intersection points (endpoints) between a triangle and the plane of another triangle. It must have been already established that such
src/intersection.h:649
Method
isect2_shared_at_v0
Similar to isect2, but called when it is certain that V0 is the shared vertex and neither V1 nor V2 lies closer to the target plane than detail::Toler
src/intersection.h:704
Method
isect2_shared_at_v1
Similar to isect2, but called when it is certain that V1 is the shared vertex There's no way to verify this condition within the function
src/intersection.h:719
Method
kdtree_get_bbox
src/shape.h:182
Method
kdtree_get_point_count
Must return the number of data points
src/shape.h:163
Method
kdtree_get_pt
Returns the dim'th component of the idx'th point in the class: Since this is inlined and the "dim" argument is typically an immediate value, the "if/e
src/shape.h:168
Method
knnSearch
* Find the "num_closest" nearest neighbors to the \a query_point[0:dim-1]. * Their indices are stored inside the result object. \sa radiusSearch
src/nanoflann.hpp:1780
Function
lerp
@brief Return the linear interpolation between this and another vector * @param v The other vector * @param t The ration of this to v (t = 0
src/btConvexHull/btVector3.h:243
Method
loadIndex
Loads a previous index from a binary file. * IMPORTANT NOTE: The set of data points is NOT stored in the file, so the * index object mus
src/nanoflann.hpp:1587
Method
loadIndex
Loads a previous index from a binary file. * IMPORTANT NOTE: The set of data points is NOT stored in the file, so the * index object mus
src/nanoflann.hpp:1955
Method
load_tree
src/nanoflann.hpp:1166
Method
load_value
src/nanoflann.hpp:325
Method
low
src/btConvexHull/btConvexHullComputer.cpp:575
Function
main
main.cpp:16
Function
maxAxis
@brief Return the axis with the largest value * Note return values are 0,1,2 for x, y, or z */
src/btConvexHull/btVector3.h:215
Method
merge
src/btConvexHull/btConvexHullComputer.cpp:1522
Method
mergeProjection
src/btConvexHull/btConvexHullComputer.cpp:988
Method
middleSplit_
src/nanoflann.hpp:1026
Function
minAxis
@brief Return the axis with the smallest value * Note return values are 0,1,2 for x, y, or z */
src/btConvexHull/btVector3.h:208
Method
minAxis4
src/btConvexHull/btVector3.h:541
Method
mul
src/btConvexHull/btConvexHullComputer.cpp:580
Method
mul
src/btConvexHull/btConvexHullComputer.cpp:837
Method
mult
vector product by scalar
src/intersection.h:402
Method
newEdgePair
src/btConvexHull/btConvexHullComputer.cpp:968
Method
norm
src/intersection.h:371
Method
normal_to_line_and_within_plane
The function returns a vector to a line defined by LineVec N is a vector normal to another (reference) plane N is the preferred result
src/intersection.h:241
Method
normalize
src/quickhull/Structs/Vector3.hpp:61
Method
one_move
src/mcts.cpp:125
Function
operator btScalar*
SIMD_FORCE_INLINE btScalar& operator[](int32_t i) { return (&m_floats[0])[i]; } SIMD_FORCE_INLINE const btScalar& operator[](int32_t i) co
src/btConvexHull/btVector3.h:286
Function
operator const btScalar*
src/btConvexHull/btVector3.h:287
Function
operator!=
src/btConvexHull/btVector3.h:294
Method
operator!=
src/btConvexHull/btConvexHullComputer.cpp:104
Method
operator!=
src/quickhull/Structs/Vector3.hpp:129
Method
operator()
src/nanoflann.hpp:238
Method
operator()
src/btConvexHull/btAlignedObjectArray.h:282
Function
operator*
@brief Return the elementwise product of two vectors */
src/btConvexHull/btVector3.h:371
Function
operator*
src/quickhull/Structs/Vector3.hpp:169
Method
operator*
src/btConvexHull/btConvexHullComputer.cpp:824
Method
operator*
src/quickhull/Structs/Vector3.hpp:116
Function
operator+
@brief Return the sum of two vectors (Point symantics)*/
src/btConvexHull/btVector3.h:364
Method
operator+
src/btConvexHull/btConvexHullComputer.cpp:134
Method
operator+
src/btConvexHull/btConvexHullComputer.cpp:181
← previous
next →
401–500 of 600, ranked by callers