Performance comparisons of tree‐based and cell‐based contact detection algorithms (Q3055829): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1108/02644400710729554
+Normal rank
@@ Property / OpenAlex ID @@
+W2027598300
@@ Property / OpenAlex ID: W2027598300 / rank @@
+Normal rank
@@ Property / cites work @@
+An alternating digital tree (ADT) algorithm for 3D geometric searching and intersection problems
+Normal rank
@@ Property / cites work @@
+An augmented spatial digital tree algorithm for contact detection in computational mechanics
+Normal rank
@@ Property / cites work @@
+A 2D polygon/polygon contact model: algorithmic aspects
+Normal rank
@@ Property / cites work @@
+Filling domains with disks: an advancing front approach
+Normal rank
@@ Property / cites work @@
+SMB: Collision detection based on temporal coherence
+Normal rank
@@ Property / cites work @@
+Q4255104
@@ Property / cites work: Q4255104 / rank @@
+Normal rank
@@ Property / cites work @@
+The modelling of multi-fracturing solids and particulate media
+Normal rank
@@ Property / cites work @@
+A contact algorithm for partitioning <i>N</i> arbitrary sized objects
+Normal rank