Efficient Penetration Depth Computation Between Rigid Models Using Contact Space Propagation Sampling

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Continuous penetration depth computation for rigid models using dynamic Minkowski sums

We present a novel, real-time algorithm for computing the continuous penetration depth (CPD) between two interpenetrating rigid models bounded by triangle meshes. Our algorithm guarantees gradient continuity for the penetration depth (PD) results, unlike conventional penetration depth (PD) algorithms that may have directional discontinuity due to the Euclidean projection operator involved with ...

متن کامل

Efficient Motion Planning using Generalized Penetration Depth Computation

Liangjun Zhang: Efficient Motion Planning using Generalized Penetration Depth Computation. (Under the direction of Dinesh Manocha.) Motion planning is a fundamental problem in robotics and also arises in other applications including virtual prototyping, navigation, animation and computational structural biology. It has been extensively studied for more than three decades, though most practical ...

متن کامل

Efficient Penetration Depth Approximation using Active Learning

Given two objectsA andB, we denote their configuration space as C-space and each configuration or point in C-space corresponds to relative configuration (i.e., position and orientation) of A w.r.t B. In the rest of the paper, we assume that A is movable and B is fixed. For 2D objects, C-space has 2 degrees of freedom (DOF) if A can only undergo translation motion, and 3-DOF if we take into acco...

متن کامل

Fast Penetration Depth Computation Using Rasterization Hardware and Hierarchical Refinement

We present a novel and fast algorithm to compute penetration depth (PD) between two polyhedral models. Given two overlapping polyhedra, it computes the minimal translation distance to separate them using a combination of object-space and image-space techniques. The algorithm computes pairwise Minkowski sums of decomposed convex pieces, performs closest-point query using rasterization hardware a...

متن کامل

Fast Penetration Depth Computation and its Applications

In this paper, we highlight our past experiences on fast penetration depth computation and its applications in different areas such as physically-based animation, 6DOF haptic rendering and robot motion planning.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Robotics and Automation Letters

سال: 2016

ISSN: 2377-3766,2377-3774

DOI: 10.1109/lra.2015.2502919