pads:ddm
Differences
This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revisionLast revisionBoth sides next revision | ||
pads:ddm [2013/12/06 08:49] – [Download] gdangelo | pads:ddm [2021/07/29 08:03] – gda | ||
---|---|---|---|
Line 4: | Line 4: | ||
Games, where the game engine must send game updates only to players that might be affected, in order to reduce computation cost and network traffic. | Games, where the game engine must send game updates only to players that might be affected, in order to reduce computation cost and network traffic. | ||
- | ===== Interval Tree Matching (ITM) ===== | + | Unfortunately, |
- | Unfortunately, | + | ===== Parallel Sort-based |
- | ===== Research results and implementation ===== | + | A novel [[: |
- | This is the support page of the paper titled | + | ===== |
- | [[http:// | + | |
- | + | ||
- | To foster the reproducibility of our experiments, | + | |
- | + | ||
- | ===== Download ===== | + | |
- | + | ||
- | | ^ Sources | + | |
- | ^ DDM-DSRT-2013 | + | |
- | + | ||
- | + | ||
- | ===== Slides | + | |
- | < | + | The [[pads:Interval Tree Matching (ITM)]] algorithm for computing intersections among d-rectangles. ITM is based on a simple Interval Tree data structure, and exhibits an embarrassingly parallel structure. |
- | <iframe src=" | + | |
- | </ | + | |
- | ===== Contacts ===== | ||
- | For more information on our DDM research effort please [[pads: |
pads/ddm.txt · Last modified: 2021/07/29 08:05 by gda