Robotic bees: Algorithms for collision detection and prevention

05/25/2019
by   Vincent Arcila, et al.
0

In the following paper we will discuss data structures suited for distance threshold queries keeping in mind real life application such as collision detection on robotic bees. We will focus on spatial hashes designed to store 3D points and capable of fastly determining which of them surpass a specific threshold from any other. In this paper we will discuss related literature, explain in depth the data structure chosen with its design criteria, operations and speed and memory efficiency analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/05/2021

Dynamic Enumeration of Similarity Joins

This paper considers enumerating answers to similarity-join queries unde...
research
10/21/2020

On Adaptive Distance Estimation

We provide a static data structure for distance estimation which support...
research
06/03/2019

Assessing Performance Implications of Deep Copy Operations via Microbenchmarking

As scientific frameworks become sophisticated, so do their data structur...
research
03/26/2018

Extra Space during Initialization of Succinct Data Structures and of Dynamical Initializable Arrays

Many succinct data structures on a word RAM require precomputed tables t...
research
07/01/2022

DiffPills: Differentiable Collision Detection for Capsules and Padded Polygons

Collision detection plays an important role in simulation, control, and ...
research
07/11/2019

Learning Key-Value Store Design

We introduce the concept of design continuums for the data layout of key...
research
10/03/2019

How does the Mind store Information?

How we store information in our mind has been a major intriguing open qu...

Please sign up or login with your details

Forgot password? Click here to reset