Concurrent Binary Trees (paper presentation)

preview_player
Показать описание
  1. Jonathan
Рекомендации по теме
Concurrent Binary Trees 0:17:23

Concurrent Binary Trees (paper presentation)

Concurrent Binary Trees 0:03:18

Concurrent Binary Trees (with application to longest edge bisection)

Concurrent binary tree 0:00:41

Concurrent binary tree terrain: rendering modes

Concurrent Binary Trees 0:21:47

Concurrent Binary Trees for Large-Scale Game Components

Experimenting with Concurrent 0:29:55

Experimenting with Concurrent Binary Trees for Large Scale Terrain Rendering

Concurrent binary tree 0:00:34

Concurrent binary tree terrain: zooming in and out

Concurrent binary tree 0:00:13

Concurrent binary tree terrain: adjusting lod

The ROAM Algorithm 0:03:53

The ROAM Algorithm at 25

Implementing Parallel Tree 1:22:04

Implementing Parallel Tree Structure in Shared-Memory

Vitaly Aksenov — 0:59:24

Vitaly Aksenov — What about Binary Search Trees?

Is it possible 0:48:21

Is it possible to make self-adjusting data structures concurrent?

UAT: CSC382 - 0:48:37

UAT: CSC382 - Project: Binary Search Tree

Pony: Making it 0:46:11

Pony: Making it easy to write efficient, concurrent, data race free programs - Curry On

Proving Highly-Concurrent Traversals 0:12:08

Proving Highly-Concurrent Traversals Correct

Lecture 4 - 1:11:07

Lecture 4 - I/O-friendly Data Structures I (Trees, skip lists)

Human Calculator Solves 0:00:34

Human Calculator Solves World’s Longest Math Problem #shorts

A New Radix-Tree 0:17:12

A New Radix-Tree Based Memory Storage Engine - Mengran Wang, VMware

95. OCR A 0:15:03

95. OCR A Level (H446) SLR14 - 1.4 Data structures part 4 - Trees (operations)

Low-Span Parallel Algorithms 0:18:17

Low-Span Parallel Algorithms for the Binary-Forking Model

Concurrent Link-Cut Trees 0:07:23

Concurrent Link-Cut Trees

Trees in 'Clean 1:51:00

Trees in 'Clean Programming Language' | Consultation | ELTE Functional Programming Course

Combinatorial Constructions in 0:45:03

Combinatorial Constructions in Testing Concurrent Programs - Rupak Majumdar

Parallel and Distributed 0:34:09

Parallel and Distributed Optimization with Gurobi

Daniel Lokshtanov: Tree 0:44:46

Daniel Lokshtanov: Tree decompositions and graph algorithms

Комментарии
Автор

KSP2 devs just announced they will be replacing their old terain generation algorithm with this one as it their main performance bottleneck at release, and it looks really promising!

fenhryl
Автор

It's not clear to me how to parallel propagate subdivision into neighboring triangles. Is there a way how to avoid recursive subdivision on half-edges of main mesh triangles?

pacozalky
Автор

Beautiful solution, great explanation. Many thanks : )

manapotion
Автор

You are a research scientist at Unity! How exciting!

ianmcglasham
Автор

Very nice indeed. Wondering how one would use this with landscape tiles for implementing a landscape system in a game. Can the landscape be split into uniform sized tiles and if so would the resulting tiles be seamless with regards to tessellation/LODs? The goal is to be able to use different shaders per tile.

daveyhu
Автор

I dont think I fully understand. Is this used in conjunction with tesselation shaders or is it a complete solution by itself?

ianmcglasham
Автор

Excellent presentation, such an easy to understand explanation of the algorithm!

I'm curious in practice in what way the result of the algorithm (in GPU memory) is used to generate geometry.

DarkDrakman
Автор

Thanks for the awesome video! As far as I understood, you store cbt buffer in GPU memory and looping it in parallel. If the LOD will be big, isn't it really an issue to loop potentially huge amount of nodes and recalculate sum reduction ? And I don't clearly understand from demo, how and where you scale geometry with "PixelsPerEdge" parameter. Does it connected to LOD level and can it be somehow cached ?

НиколайШироков-тл
Автор

Just dropping by again to rewatch. Still great! Lol

ianmcglasham