English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We present a real-time algorithm that finds the Penetration Depth (PD)between general polygonal models based on iterative and local optimizationtechniques. Given an in-collision configuration of an object in configurationspace, we find an initial collision-free configuration using several methodssuch as centroid difference, maximally clear configuration, motion coherence,random configuration, and sampling-based search. We project this configurationon to a local contact space using a variant of continuous collision detectionalgorithm and construct a linear convex cone around the projectedconfiguration. We then formulate a new projection of the in-collisionconfiguration onto the convex cone as a Linear Complementarity Problem (LCP),which we solve using a type of Gauss-Seidel iterative algorithm. We repeat thisprocedure until a locally optimal PD is obtained. Our algorithm can processcomplicated models consisting of tens of thousands triangles at interactiverates.

PolyDepth: Real-time Penetration Depth Computation using Iterative Contact-Space Projection