Coordination of bat sonar activity and flight for the exploration of three-dimensional objects

2012 ◽  
Vol 215 (13) ◽  
pp. 2226-2235 ◽  
Author(s):  
D. Genzel ◽  
C. Geberl ◽  
T. Dera ◽  
L. Wiegrebe
Algorithms ◽  
2021 ◽  
Vol 14 (3) ◽  
pp. 72
Author(s):  
Luca Tonti ◽  
Alessandro Patti

Collision between rigid three-dimensional objects is a very common modelling problem in a wide spectrum of scientific disciplines, including Computer Science and Physics. It spans from realistic animation of polyhedral shapes for computer vision to the description of thermodynamic and dynamic properties in simple and complex fluids. For instance, colloidal particles of especially exotic shapes are commonly modelled as hard-core objects, whose collision test is key to correctly determine their phase and aggregation behaviour. In this work, we propose the Oriented Cuboid Sphere Intersection (OCSI) algorithm to detect collisions between prolate or oblate cuboids and spheres. We investigate OCSI’s performance by bench-marking it against a number of algorithms commonly employed in computer graphics and colloidal science: Quick Rejection First (QRI), Quick Rejection Intertwined (QRF) and a vectorized version of the OBB-sphere collision detection algorithm that explicitly uses SIMD Streaming Extension (SSE) intrinsics, here referred to as SSE-intr. We observed that QRI and QRF significantly depend on the specific cuboid anisotropy and sphere radius, while SSE-intr and OCSI maintain their speed independently of the objects’ geometry. While OCSI and SSE-intr, both based on SIMD parallelization, show excellent and very similar performance, the former provides a more accessible coding and user-friendly implementation as it exploits OpenMP directives for automatic vectorization.


i-Perception ◽  
2020 ◽  
Vol 11 (6) ◽  
pp. 204166952098231
Author(s):  
Masakazu Ohara ◽  
Juno Kim ◽  
Kowa Koida

Perceiving the shape of three-dimensional objects is essential for interacting with them in daily life. If objects are constructed from different materials, can the human visual system accurately estimate their three-dimensional shape? We varied the thickness, motion, opacity, and specularity of globally convex objects rendered in a photorealistic environment. These objects were presented under either dynamic or static viewing condition. Observers rated the overall convexity of these objects along the depth axis. Our results show that observers perceived solid transparent objects as flatter than the same objects rendered with opaque reflectance properties. Regional variation in local root-mean-square image contrast was shown to provide information that is predictive of perceived surface convexity.


1993 ◽  
Vol 94 (1) ◽  
Author(s):  
Y. Matsakis ◽  
M. Lipshits ◽  
V. Gurfinkel ◽  
A. Berthoz

2007 ◽  
Vol 32 (10) ◽  
pp. 1229 ◽  
Author(s):  
Conor P. McElhinney ◽  
John B. McDonald ◽  
Albertina Castro ◽  
Yann Frauel ◽  
Bahram Javidi ◽  
...  

2001 ◽  
Author(s):  
Brian H. Dennis ◽  
George S. Dulikravich

Abstract A finite element method (FEM) formulation is presented for the prediction of unknown steady boundary conditions in heat conduction on multiply connected three-dimensional solid objects. The present FEM formulation is capable of determining temperatures and heat fluxes on the boundaries where such quantities are unknown or inaccessible, provided such quantities are sufficiently over-specified on other boundaries. Details of the discretization, linear system solution techniques, regularization, and sample results for 3-D problems are presented.


2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Yongho Choi ◽  
Darea Jeong ◽  
Junseok Kim

We present a new method using the modified Cahn-Hilliard (CH) equation for smoothing piecewise linear shapes of two- and three-dimensional objects. The CH equation has good smoothing dynamics and it is coupled with a fidelity term which keeps the original given data; that is, it does not produce significant shrinkage. The modified CH equation is discretized using a linearly stable splitting scheme in time and the resulting scheme is solved by using a Fourier spectral method. We present computational results for both curve and surface smoothing problems. The computational results demonstrate that the proposed algorithm is fast and efficient.


Sign in / Sign up

Export Citation Format

Share Document