FeiZhu
@aangel.piggytdm9nn_03v• Feb 24, 2023
Improvements in Path Tracing in VTK
vtkPStreamTracer,
vtkTemporalStreamTracer [1].
If particle paths are desired then the user has to connect an additional filter, vtkTemporalPathLineFilter, to run in tandem
Improvements in Path Tracing in VTKwww.kitware.com
FeiZhu
@aangel.piggytdm9nn_03v• Feb 24, 2023
VTK and ParaView Add Highly Configurable Particle Tracker
Tools such as the StreamTracer filter in ParaView have become widely used in the VTK and ParaView communities of users. Such tools have specific uses, and they are not quite configurable in terms of equations. VTK and ParaView have a new filter, however, called LagrangianParticleTracker, which offers a completely configurable implementation of the Lagrangian Particle Tracking (LPT) algorithm.
The inputs of the filter include the following: seed (source) input, flow input, and optional surface input. S
VTK and ParaView Add Highly Configurable Particle Trackerwww.kitware.com
FeiZhu
@aangel.piggytdm9nn_03v• Feb 24, 2023
Difference between ParticleTracer and LangrarianParticleTracker - ParaView Support - ParaView
The firs is the Particle Tracer filter
the LangrarianParticleTracker
Difference between ParticleTracer and LangrarianParticleTracker - ParaView Support - ParaViewdiscourse.paraview.org
FeiZhu
@aangel.piggytdm9nn_03v• Feb 7, 2023
feat: complete the function of strain and stress (#5810234) · simversus_fem · 云效 Codeup
feat: complete the function of strain and stress (#5810234) · simversus_fem · 云效 Codeupcodeup.aliyun.com
FeiZhu
@aangel.piggytdm9nn_03v• Dec 29, 2022
Multi-agent pathfinding - Wikipedia
MAPF is the multi-agent generalization of the pathfinding problem, and it is closely related to the shortest path problem in the context of graph theory.
Multi-agent pathfinding - Wikipediaen.wikipedia.org
FeiZhu
@aangel.piggytdm9nn_03v• Dec 28, 2022
A-Star(A*)寻路算法原理与实现 - 知乎
通过评估来找到合适路径的算法我们称之为启发式算法,即优先搜索最有可能产生最佳路径的格子。
曼哈顿距离简单来说就是只准水平或垂直移动的最短距离
曼哈顿距离肯定大于或等于格子n到终点的最短实际距离。
A-Star(A*)寻路算法原理与实现zhuanlan.zhihu.com
FeiZhu
@aangel.piggytdm9nn_03v• Dec 27, 2022
Pathfinding | Daniel Harabor
It can consistently speed up a classical search algorithm such as A* by an order of magnitude and more on a range of synthetic and realistic maps
SRC-dfs was the fastest algorithm at the 2014 Grid-based Path Planning Competition
Pathfinding | Daniel Haraborharabor.net
FeiZhu
@aangel.piggytdm9nn_03v• Dec 19, 2022
Serialization — physx 5.1.2 documentation
API-level serialization is not expected to be used in performance critical situations.
The primary purpose of cooking, however, is to translate from a user format to a format suitable for the SDK runtime, and so it is not considered a serialization mechanism.
If an object has dependencies on other PhysX objects, they need to be serialized as well. PxSerialization::complete adds all the required objects to the collection.
Serialization — physx 5.1.2 documentationnvidia-omniverse.github.io
FeiZhu
@aangel.piggytdm9nn_03v• Dec 17, 2022
Threading — physx 5.1.2 documentation
PhysX simulation is asynchronous by default
When this call returns, the simulation step has begun in a separate thread (if the CPU dispatcher has at least one thread in the thread pool).
PhysX includes a task system for managing compute resources.
Threading — physx 5.1.2 documentationnvidia-omniverse.github.io
FeiZhu
@aangel.piggytdm9nn_03v• Dec 16, 2022
Advanced Collision Detection — physx 5.1.1 documentation
Dynamic rigid bodies have collision shapes attached to them that are used for contact generation
Advanced Collision Detection — physx 5.1.1 documentationnvidia-omniverse.github.io