arXiv (All)
open access
CuACD: A Fully GPU-Resident Approximate Convex Decomposition
Approximate convex decomposition (ACD) converts triangle meshes into small sets of convex parts and is a standard preprocessing step for physics simulation, collision detection, and large-scale robot learning. The majority of modern ACD methods produce high-quality decompositions through an expensiv
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Quasi-SVD: Learning a Lie-constrained matrix factorisation for real-time imaging#1061762
- Distributed Continuous-Time Optimization on the Special Orthogonal Group SO(3) over Tree Interaction Graphs#1033811
- Convex Quadratic Distance Field Computation#985004
- Parallel SMT Solving via Dynamic Partitioning, Core-Guided Pruning, and Online Backbone Detection#267621
- EXaCTz: Guaranteed Extremum Graph and Contour Tree Preservation for Distributed- and GPU-Parallel Lossy Compression#1062881
Record · ID 1076387
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive