An iterative inner-outer polyhedral approximation algorithm solves the ray-intersection formulation of growth distance for convex sets with representable support functions and delivers state-of-the-art speed with primal-dual feasibility and monotone convergence.
Approximate convex decompo- sition for 3d meshes with collision-aware concavity and tree search
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.RO 2verdicts
UNVERDICTED 2representative citing papers
Unreal Robotics Lab integrates Unreal Engine rendering with MuJoCo physics to enable high-fidelity simulation for robotics perception, control, and benchmarking under diverse conditions.
citing papers explorer
-
A Ray Intersection Algorithm for Fast Growth Distance Computation Between Convex Sets
An iterative inner-outer polyhedral approximation algorithm solves the ray-intersection formulation of growth distance for convex sets with representable support functions and delivers state-of-the-art speed with primal-dual feasibility and monotone convergence.
-
Unreal Robotics Lab: A High-Fidelity Robotics Simulator with Advanced Physics and Rendering
Unreal Robotics Lab integrates Unreal Engine rendering with MuJoCo physics to enable high-fidelity simulation for robotics perception, control, and benchmarking under diverse conditions.