Functions — github.com/SarahWeiii/CoACD

CodeHub MCPcopy Create free account

hub / github.com/SarahWeiii/CoACD / functions

Functions600 in github.com/SarahWeiii/CoACD

⨍ Functions 600◇ Types & classes 111

Methodoperator+

src/quickhull/Structs/Vector3.hpp:81

Functionoperator-

@brief Return the difference between two vectors */

src/btConvexHull/btVector3.h:378

Methodoperator-

src/btConvexHull/btConvexHullComputer.cpp:139

Methodoperator-

src/btConvexHull/btConvexHullComputer.cpp:176

Methodoperator-

src/btConvexHull/btConvexHullComputer.cpp:450

Methodoperator-

src/quickhull/Structs/Vector3.hpp:77

Functionoperator/

@brief Return the vector inversely scaled by s */

src/btConvexHull/btVector3.h:405

Methodoperator/

src/quickhull/Structs/Vector3.hpp:121

Methodoperator<

identifier of the segment's end, 0 or 1

src/intersection.h:263

Methodoperator<

src/btConvexHull/btConvexHullComputer.cpp:252

Methodoperator=

Assignment operator definiton */

src/nanoflann.hpp:1699

Methodoperator=

src/mcts.cpp:14

Functionoperator==

src/btConvexHull/btVector3.h:289

Methodoperator==

src/btConvexHull/btConvexHullComputer.cpp:99

Methodoperator==

src/btConvexHull/btAlignedAllocator.h:101

Functionpi_const

src/nanoflann.hpp:81

MethodplaneSplit

* Subdivide the list of points by a plane perpendicular on axe corresponding * to the 'cutfeat' dimension at 'cutval' position. *

src/nanoflann.hpp:1089

Methodplane_box_overlap

Private methods

src/intersection.h:823

FunctionpointCmp

src/btConvexHull/btConvexHullComputer.cpp:1762

Methodpoint_in_tri

src/intersection.h:791

src/btConvexHull/btConvexHullComputer.cpp:442

src/btConvexHull/btConvexHullComputer.cpp:522

Methodprojection

Projection onto another vector

src/quickhull/Structs/Vector3.hpp:134

Functionpt_norm

Query for the \a num_closest closest points to a given point (entered as * query_point[0:dim-1]). Note that this is a short-cut method for

src/nanoflann.hpp:2203

MethodquickSortInternal

src/btConvexHull/btAlignedObjectArray.h:289

Functionr4_uniform_01

src/sobol.cpp:28181

Functionr8_uniform_01

src/sobol.cpp:28378

Functionr8mat_write

src/sobol.cpp:28479

MethodradiusSearch

* Find all the neighbors to \a query_point[0:dim-1] within a maximum radius. * The output is given as a vector of pairs, of which the first ele

src/nanoflann.hpp:1419

MethodradiusSearch

* Find all the neighbors to \a query_point[0:dim-1] within a maximum radius. * The output is given as a vector of pairs, of which the first ele

src/nanoflann.hpp:1806

MethodradiusSearchCustomCallback

src/nanoflann.hpp:1438

MethodradiusSearchCustomCallback

src/nanoflann.hpp:1825

MethodreclaimToIndexVectorPool

src/quickhull/QuickHull.hpp:196

src/btConvexHull/btAlignedObjectArray.h:420

MethodremoveEdgePair

src/btConvexHull/btConvexHullComputer.cpp:770

MethodremovePoint

Remove a point from the set (Lazy Deletion) */

src/nanoflann.hpp:2102

MethodreorderHorizonEdges

src/quickhull/QuickHull.cpp:386

Methodrestore_true_value_of_dx_max

looks for the largest value of orig_du and copies it to the corresponding value: either du0, du1 or du2.

src/intersection.h:963

src/btConvexHull/btVector3.h:485

MethodsaveIndex

Stores the index in a binary file. * IMPORTANT NOTE: The set of data points is NOT stored in the file, so when * loading the index objec

src/nanoflann.hpp:1580

MethodsaveIndex

Stores the index in a binary file. * IMPORTANT NOTE: The set of data points is NOT stored in the file, so when * loading the index objec

src/nanoflann.hpp:1948

Methodsave_tree

src/nanoflann.hpp:1153

Methodsave_value

src/nanoflann.hpp:311

MethodsearchLevel

src/nanoflann.hpp:1498

MethodsearchLevel

src/nanoflann.hpp:1873

Methodserialize

src/btConvexHull/btVector3.h:702

MethodserializeDouble

src/btConvexHull/btVector3.h:689

MethodserializeFloat

src/btConvexHull/btVector3.h:676

src/intersection.h:409

src/btConvexHull/btVector3.h:57

FunctionsetInterpolate3

src/btConvexHull/btVector3.h:230

@brief Set each element to the max of the current values and the values of another btVector3 * @param other The other btVector3 to compare with

src/btConvexHull/btVector3.h:302

@brief Set each element to the min of the current values and the values of another btVector3 * @param other The other btVector3 to compare with

src/btConvexHull/btVector3.h:312

@brief Set the w value */

src/btConvexHull/btVector3.h:273

@brief Set the x value */

src/btConvexHull/btVector3.h:267

@brief Set the y value */

src/btConvexHull/btVector3.h:269

@brief Set the z value */

src/btConvexHull/btVector3.h:271

FunctionsetZero

src/btConvexHull/btVector3.h:335

Methodset_current_round

src/mcts.cpp:106

Methodset_current_value

src/mcts.cpp:98

Methodset_quality_value

src/mcts.cpp:238

Methodset_visit_times

src/mcts.cpp:230

MethodsetupInitialTetrahedron

src/quickhull/QuickHull.cpp:422

MethodshiftFace

src/btConvexHull/btConvexHullComputer.cpp:1972

src/btConvexHull/btConvexHullComputer.cpp:585

Methodsin_approximated

src/intersection.h:176

src/nanoflann.hpp:270

Returns number of points in dataset */

src/nanoflann.hpp:917

vector subtraction

src/intersection.h:388

src/btConvexHull/btAlignedObjectArray.h:353

Functiontau_sobol

src/sobol.cpp:28549

Methodtest_deterministic

run_tests.py:22

Functiontimestamp

src/sobol.cpp:28648

MethodtoBtVector

src/btConvexHull/btConvexHullComputer.cpp:1844

src/btConvexHull/btConvexHullComputer.cpp:320

src/btConvexHull/btConvexHullComputer.cpp:376

Methodtri_box_overlap

src/intersection.h:850

Methodtri_tri_intersect_with_isectline

V0, V1, V2 are vertices of face 1 U0, U1, U2 are vertices of face 2 coplanar is passed back as true iff faces 1 and 2 are found to be coplanar isectpt

src/intersection.h:1249

returns true iff two triangles are intersecting or touching actually does not seem to be used in WTA

src/intersection.h:188

Methodtriline_triline_self_intersect_and_isectline

returns true iff two trilines (colinear triangles) self intersect also computes and returns: coplanarity, isectpot1, isectpt2

src/intersection.h:990

Methodtriline_triline_self_intersect_and_isectline_0

returns true iff two trilines (colinear triangles) sharing 0 vertices self-intersect verifies if the trilines are colinear (coplanarity) may return is

src/intersection.h:1024

Methodtriline_triline_self_intersect_and_isectline_1

returns true iff two trilines (colinear triangles) sharing 1 vertex self-intersect verifies if the trilines are colinear (coplanarity) may return isec

src/intersection.h:1172

Methodtriline_triline_self_intersect_and_isectline_2

returns true iff two trilines (colinear triangles) sharing 2 vertices self-intersect verifies if the trilines are colinear (coplanarity) may return is

src/intersection.h:1201

src/btConvexHull/btVector3.h:201

MethodusedMemory

* Computes the inde memory usage * Returns: memory used by the index */

src/nanoflann.hpp:936

Returns the length of each point in the dataset */

src/nanoflann.hpp:920

MethodworstDist

src/nanoflann.hpp:286

Methodworst_item

* Find the worst result (furtherest neighbor) without copying or sorting * Pre-conditions: size() > 0 */

src/nanoflann.hpp:292

MethodwriteWaveformOBJ

Export the mesh to a Waveform OBJ file

src/quickhull/ConvexHull.hpp:198

src/btConvexHull/btConvexHullComputer.cpp:401

src/btConvexHull/btConvexHullComputer.cpp:406

src/btConvexHull/btConvexHullComputer.cpp:411

src/btConvexHull/btConvexHullComputer.cpp:505

Method~KDTreeEigenMatrixAdaptor

src/nanoflann.hpp:2193

src/mcts.cpp:189

src/btConvexHull/btConvexHullComputer.cpp:703

Method~PoolArray

src/btConvexHull/btConvexHullComputer.cpp:671

Method~PooledAllocator

* Destructor. Frees all the memory allocated in this pool. */

src/nanoflann.hpp:717

Method~btAlignedObjectArray

src/btConvexHull/btAlignedObjectArray.h:122

← previous501–600 of 600, ranked by callers