'Designing Data-Intensive Applications' project ideas? Computer Science |
- 'Designing Data-Intensive Applications' project ideas?
- Can the data model / state of (certain non trivial subsets of) video games be made verifiable such that you can ensure your game (or at least the portion interacting with the data model) won't enter an invalid state?
- Let me get this straight...
- Solving heat geodesics, getting negative length.
| 'Designing Data-Intensive Applications' project ideas? Posted: 18 Apr 2021 09:24 PM PDT For those that are familiar with DDIA by Martin Kleppmann, what intermediate-level projects would you recommend to solidify the most important ideas from the book? [link] [comments]  |
| Posted: 18 Apr 2021 09:07 PM PDT I've been reading a lot about data modeling and DSLs, I stumbled on game description language https://en.wikipedia.org/wiki/Game_Description_Language which I thought was quite neat. This got me thinking about the strategy games I play, mostly map staring games by Paradox Interactive. If you haven't seen one before they're akin to a low grade political / economic simulation with many, many tables churning in the back ground to the point where they're CPU bound instead of GPU bound (you just stare at a map after all). My question is, given the game state is governed by formulas, rules, and data tables with set interactions, and is much more akin to a discrete domain model than say an FPS with an agent in a 3d environment, is it at all possible and/or practical to make the portion of the program governing the game state verifiable to where you can be sure it is a valid program? Almost like a formal method, or how 'a rust program that compiles is usually valid' (I don't know a better way to relate this concept). [link] [comments]  |
| Posted: 18 Apr 2021 10:20 PM PDT Computer engineering is the study of combining physics and philosophy (logic) through flowing of electrons. Is this correct? [link] [comments]  |
| Solving heat geodesics, getting negative length. Posted: 18 Apr 2021 09:27 AM PDT I am trying to implement the Heat [Geodesics paper](https://www.cs.cmu.edu/~kmcrane/Projects/HeatMethod/paperCACM.pdf). And I am getting results that are almost what I would expect: However, as you can see in the second image (which is the absolute value of the distance). Some of my results are negative when they are close to the source. I have checked my code multiple times, but I have not been able to pinpoint what the error is, I was hoping someone could take a look and give me a hand :P. I know for a fact that all the inputs into this function are correct, i.e. the error is the logic of the function itself, not any of its dependencies. Edit: What the paper is about is calculating geodesic length on the surface of a mesh. I.e. the distance from every point in the mesh to a determined source point. In this case the images are displaying 2 things, the gradient field (displayed as arrows) and the geodesic length (as a gray scale). In the 2 images a white value represents a larger distance to the source than a smaller value. The values that are negative are the distances. i.e. I am getting negative values for the geodesic length between 2 points, which is clearly wrong. [link] [comments]  |
| You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States | |
No comments:
Post a Comment