Inner sphere trees for proximity and penetration queries

Weller, René; Zachmann, Gabriel

doi:10.15607/rss.2009.v.010

Cited by 31 publications

(13 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Additionally, no resolution is applied if the bodies are estimated to move apart, based on their relative velocity or previous PV. Where a resolution is required, some of the previous work suggest applying penalty forces based on a spring model [FBAF08,WZ09a]: F ∝ PV · ∇PV . Since the derivative of this force increases steeply, the resulting force is often bigger than required.…”

Section: Usage In a Physical Simulationmentioning

confidence: 99%

Fast Penetration Volume for Rigid Bodies

Nirel

Lischinski

2018

Computer Graphics Forum

View full text Add to dashboard Cite

Handling collisions among a large number of bodies can be a performance bottleneck in video games and many other real‐time applications. We present a new framework for detecting and resolving collisions using the penetration volume as an interpenetration measure. Given two non‐convex polyhedral bodies, a new sampling paradigm locates their near‐contact configurations in advance, and stores associated contact information in a compact database. At runtime, we retrieve a given configuration's nearest neighbors. By taking advantage of the penetration volume's continuity, cheap geometric methods can use the neighbors to estimate contact information as well as a translational gradient. This results in an extremely fast, geometry‐independent, and trivially parallelizable computation, which constitutes the first global volume‐based collision resolution. When processing multiple collisions simultaneously on a 4‐core processor, the average running cost is as low as 5 μs. Furthermore, no additional proximity or contact‐regions queries are required. These results are orders of magnitude faster than previous penetration volume approaches.

show abstract

Section: Usage In a Physical Simulationmentioning

confidence: 99%

Fast Penetration Volume for Rigid Bodies

Nirel

Lischinski

2018

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

“…One criticism of the spherical approximation approach has been that it is very slow, because an enormous number of spheres are required (Figure (a)). The inner sphere tree method addresses this problem by adaptively approximating a shape using large spheres for the bulk of the object and small spheres on its surfaces . However, reconstructing this tree for deformable bodies would take too long.…”

Section: Related Workmentioning

confidence: 99%

Incorporating particle motion into an ADF for fast coupling of fluids with rigid and deformable solids

Kim

Lee

2016

Computer Animation & Virtual

View full text Add to dashboard Cite

We present a new method for the fast simulation of interactions between fluids and solids by incorporating particle-based water flow into an adaptive signed distance field. In some previous methods, the motion of every water particle is checked when simulating the collision with the solid in the coupling process, and the computational cost becomes very great as the number of particles increases. If only the particles on the leaf nodes surrounding the solid are considered, this reduces the computational cost of collision detection, but some collisions may not be detected. This may lead to the "tunneling" artifact, in which particles with high velocities skip across the layer of leaf nodes. This paper addresses the problem by (i) considering particles only on the leaf nodes in the adaptive structure to improve the processing time required for the water-solid coupling and (ii) considering the water flow to avoid the tunneling artifact by incorporating particle motion into the tree structure of the adaptive signed distance field. Our method can be computed in parallel, and experimental results show that it outperforms previous methods while producing animations that are largely free of artifacts. Copyright

show abstract

“…The inner sphere tree was constructed by using a heuristic approach, voxelization and batch neural gas clustering algorithm (BNG), known from artificial intelligence (Weller & Zachmann, 2008;Weller & Zachmann, 2009a;Weller & Zachmann, 2009b;Weller & Zachmann, 2011). In Weller and Zachmann (2010) a prototype for sphere packing algorithm was constructed by using a GPU assistant.…”

Section: Sphere Packingmentioning

confidence: 99%

Revisión de literatura de jerarquía volúmenes acotantes enfocados en detección de colisiones

Dinas

Bañón

2015

IyC

View full text Add to dashboard Cite

A bounding volume is a common method to simplify object representation by using the composition of geometrical shapes that enclose the object; it encapsulates complex objects by means of simple volumes and it is widely useful in collision detection applications and ray tracing for rendering algorithms. They are popular in computer graphics and computational geometry. Most popular bounding volumes are spheres, Oriented-Bounding Boxes (OBB's), Axis-Aligned Bounding Boxes (AABB's); moreover, the literature review includes ellipsoids, cylinders, sphere packing, sphere shells, k-DOP's, convex hulls, cloud of points, and minimal bounding boxes, among others. A Bounding Volume Hierarchy is usually a tree in which the complete object is represented tighter fitting every level of the hierarchy. Additionally, each bounding volume has a cost associated to construction, update, and interference tests. For instance, spheres are invariant to rotation and translations, then they do not require being updated; their constructions and interference tests are more straightforward then OBB's; however, their tightness is lower than other bounding volumes. Finally, three comparisons between two polyhedra; seven different algorithms were used, of which five are public libraries for collision detection. Keywords: Axis-aligned bounding box (AABB), bounding volumes hierarchies, convex objects, oriented bounding box (OBB), spheres. ResumenUn volumen acotante es un método común para simplificar la representación de los objetos por medio de composición de formas geométricas que encierran el objeto; estos encapsulan objetos complejos por medio de volúmenes simples y son ampliamente usados en aplicaciones de detección de colisiones y trazador de rayos para algoritmos de renderización. Los volúmenes acotantes son populares en computación gráfica y en geometría computacional; los más populares son las esferas, las cajas acotantes orientadas (OBB's) y las cajas acotantes alineadas a los ejes (AABB's); no obstante, la literatura incluye elipses, cilindros empaquetamiento de esferas, conchas de esferas, k-DOP's, convex hulls, nubes de puntos y cajas acotantes mínimas, entre otras. Una jerarquía de volúmenes acotantes es usualmente un árbol, en el cual la representación de los objetos es más ajustada en cada uno de los niveles de la jerarquía. Adicionalmente, cada volumen acotante tiene asociado costos de construcción, actualización, pruebas de interferencia. Por ejemplo, las esferas so invariantes a rotación y translación, por lo tanto no requieren ser actualizadas en comparación con los AABB no son invariantes a la rotación. Por otro lado la construcción y las pruebas de solapamiento de las esferas son más simples que los OBB's; sin embargo, el ajuste de las esferas es menor que otros volúmenes acotantes. Finalmente, se comparan dos poliedros con siete algoritmos diferentes de los cuales cinco son librerías públicas para detección de colisiones. Palabras Clave: Cajas acotantes orientadas (CAO), cajas acotantes alineadas a los ejes (CAAE), ...

show abstract

Inner sphere trees for proximity and penetration queries

Cited by 31 publications

References 27 publications

Fast Penetration Volume for Rigid Bodies

Fast Penetration Volume for Rigid Bodies

Incorporating particle motion into an ADF for fast coupling of fluids with rigid and deformable solids

Revisión de literatura de jerarquía volúmenes acotantes enfocados en detección de colisiones

Contact Info

Product

Resources

About