A modified reliable distance algorithm for octree‐encoded objects | Zendy

Dyllong Eva | Zendy; Grimm Cornelius | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

A modified reliable distance algorithm for octree‐encoded objects

Author(s) -

Dyllong Eva,

Grimm Cornelius

Publication year - 2007

Publication title -

pamm

Language(s) - English

Resource type - Journals

ISSN - 1617-7061

DOI - 10.1002/pamm.200700637

Subject(s) - octree , computer science , collision detection , algorithm , boundary (topology) , constructive , boundary representation , constructive solid geometry , collision , theoretical computer science , mathematics , mathematical analysis , computer security , process (computing) , operating system

Among other approaches, such as implicit surfaces, constructive solid geometry and boundary representations, octrees provide a powerful technique for the geometric modeling of rigid objects. A multibody system can be modeled with a composition of octrees for efficient collision detection or collision prevention applications. In this paper, we provide an algorithm for a reliable distance calculation of octree‐encoded objects. The algorithm is based on previous algorithms by Dyllong and Luther [2, 3] and has running times that are considerably shorter in different case scenarios. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research