Pith. sign in

REVIEW 1 cited by

Neural Implicit Surfaces for Efficient and Accurate Collisions in Physically Based Simulations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2110.01614 v1 pith:GITCV43Q submitted 2021-10-03 cs.GR cs.LG

classification cs.GRcs.LG
keywords physicallysimulationscollisioncomputationalparallelizationaccurateapproachescomplexity
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Current trends in the computer graphics community propose leveraging the massive parallel computational power of GPUs to accelerate physically based simulations. Collision detection and solving is a fundamental part of this process. It is also the most significant bottleneck on physically based simulations and it easily becomes intractable as the number of vertices in the scene increases. Brute force approaches carry a quadratic growth in both computational time and memory footprint. While their parallelization is trivial in GPUs, their complexity discourages from using such approaches. Acceleration structures -- such as BVH -- are often applied to increase performance, achieving logarithmic computational times for individual point queries. Nonetheless, their memory footprint also grows rapidly and their parallelization in a GPU is problematic due to their branching nature. We propose using implicit surface representations learnt through deep learning for collision handling in physically based simulations. Our proposed architecture has a complexity of O(n) -- or O(1) for a single point query -- and has no parallelization issues. We will show how this permits accurate and efficient collision handling in physically based simulations, more specifically, for cloth. In our experiments, we query up to 1M points in 300 milliseconds.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Manifold-Guided Motion Planning for Tight Assemblies

    cs.RO 2026-07 reject novelty 6.0 of 10

    A sampling-based planner that biases samples toward near-contact configurations solves previously unsolved tight assembly puzzles and is claimed to be probabilistically complete.

Pith tools