ROAM algorithm demo

preview_player
Показать описание
Watch in HD. This video demonstrates the ROAM (real optimized adapting meshes) algorithm. Although the algorithm is deprecated for today's hardware I gave it a try.

This demo is programmed with C++ and OpenGL and uses vertex arrays.
  1. imPrgrmr
  2. ROAM
  3. algorithm
  4. demo
  5. planet
  6. procedural
Рекомендации по теме
ROAM algorithm demo 0:00:42

ROAM algorithm demo

EmacsConf 2020 - 0:21:57

EmacsConf 2020 - 16 - Org-roam: Presentation, Demonstration, and What's on the Horizon - Leo Vi...

The ROAM Algorithm 0:03:53

The ROAM Algorithm at 25

roam.avi 0:01:05

roam.avi

Building My Second 0:00:55

Building My Second Brain with Emacs and Org-Roam (An Overview)

ROAM Planet 0:03:30

ROAM Planet

ROAM 2.0 Full 0:01:07

ROAM 2.0 Full Implementation

ROAM 2.0: Beginning 0:02:06

ROAM 2.0: Beginning of Implementation

OpenGL 3.2 ROAM 0:01:42

OpenGL 3.2 ROAM Terrain demo 0.3

OpenGL 3.2 ROAM 0:01:34

OpenGL 3.2 ROAM Terrain 0.2

ROAM: Recurrently Optimizing 0:01:01

ROAM: Recurrently Optimizing Tracking Model

OpenGL 3.2 ROAM 0:02:26

OpenGL 3.2 ROAM Terrain demo 0.4

Roam Demo on 0:04:19

Roam Demo on November 10, 2017 at 01:25:14

Roam Mind Map 0:03:17

Roam Mind Map Nov2

Roam Datomic Query 0:05:51

Roam Datomic Query Smart Block

ROAM 2.0 - 0:00:39

ROAM 2.0 - 1/2 Implemented with very basic height based per vertex lighting

Real-time Optimally Adapting 0:01:39

Real-time Optimally Adapting Meshes (ROAM)

OpenGL 3.2 ROAM 0:00:35

OpenGL 3.2 ROAM Terrain 0.1 - tesselation

Building a graph 0:06:57

Building a graph from Org-Mode with Roam

Roam-Excalidraw MVP.v03 0:10:21

Roam-Excalidraw MVP.v03

Future Proof Attributes 0:08:47

Future Proof Attributes for Roam Research: Academic Workflow Demo

Roam Inter technical 0:58:07

Roam Inter technical walkthrough

Roaming 3D Terrain 0:02:18

Roaming 3D Terrain Demo 3

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

@jamesbpgm

Hi, Yes you are right. It's based on Sean O' Neil articles. I should have mentioned that in the description. In addition I use a stack of indices and a simple array of vertices's instead of a dynamic array. I think this way is simpler and maybe faster.

I think that this algorithm is old because it uses a lot of CPU resources to compute the optimal mesh. There are better approaches like geomipmapping.

imPrgrmr
Автор

You says in your description that this algorithm is deprecated. What's the reasons for you ?

Anyway good job with your ROAM. I think you've taken it from the Gamasutra's article of Sean O'Neil right ? I'm working on the same things with it. Good luck.

jamesbpgm
visit shbcf.ru