33a

13 ms·

121.
by 33a 11y ago
Also if you click on the logo and drag around, the blue dots will chase your mouse.
122.
by 33a 11y ago
There are different methods, but for many 3D games people use navmeshes for planning. Grids are kind of neat in that there are lots of little tricks you can use to speed things up and many geometric queries turn out to be way simpler.
123.
Show HN: L1-path-finder, a fast path planner for grids(mikolalysenko.github.io)
30 points by 33a 11y ago|11 comments
124.
by 33a 12y ago
A lot of UI programming patterns are much easier to express in a constraint programming language. Things like data binding don't exist in logic programming, since they are captured by constraints. It is also easier to do common tasks
125.
by 33a 12y ago
Thankfully this looks like it is never gonna happen, and is instead just a random suggestion posted to a newsgroup (which carries very little weight/credibility). In my judgment this feature is highly redundant and unnecessarily compli
126.
by 33a 12y ago
It uses numerical techniques instead of explicit formulas.
127.
by 33a 12y ago
This reminds me of a game I wrote for Ludum Dare a while back: http://0fps.net/2011/09/13/ludum-dare-21-results/ The title of the game was "Help! I'm trapped in a compact riemannian manifold&qu
128.
Show HN: Level sets in any dimension(github.com)
1 points by 33a 12y ago|0 comments
129.
Collision detection benchmarks(0fps.net)
44 points by 33a 12y ago|10 comments
130.
by 33a 12y ago
I referenced this book up front in part 1 of the series: http://0fps.net/2015/01/07/collision-detection-part-1/
131.
by 33a 12y ago
Thanks! The algorithm is based on Clarkson's incremental convex hull algorithm and runs in O(n^ceil(d/2) + n log(n)). I am planning on eventually adding a special case for d=2 to use a sweep line method, which is faster in pract
132.
Show HN: Any dimensional Delaunay triangulation in JavaScript(github.com)
2 points by 33a 12y ago|2 comments
133.
Show HN: A functional red-black tree in JavaScript(github.com)
12 points by 33a 12y ago|1 comments
134.
Show HN: Orthogami – Turn voxel models into foldable papercraft(github.com)
49 points by 33a 12y ago|6 comments
135.
Show HN: Text vectorization in JavaScript(github.com)
6 points by 33a 12y ago|0 comments
136.
by 33a 12y ago
Cool! If you would like I can add this to the benchmark later.
137.
Show HN: A static kd-tree in JavaScript(github.com)
44 points by 33a 12y ago|2 comments
138.
by 33a 12y ago
The advantage of using the library is that you would be able to answer connectivity queries and traverse the connected components of the graph efficiently. EDIT: If you want an example application, suppose you have a physics simulation wit
139.
Show HN: Dynamic graph connectivity data structure(github.com)
25 points by 33a 12y ago|3 comments
140.
by 33a 12y ago
That's true. It might be that under some theoretical assumptions their model could actually solve an instance of an NP-hard problem, but it could also be that the physical realization doesn't scale. They report solutions for a fe
141.
by 33a 12y ago
I still don't fully understand what they mean by a "memcomputer" here, but if you take a boring old real RAM computer + floor function you can even solve all of PSPACE in polynomial time: http://dl.acm.org/cit
142.
Show HN: 3D animated GIF viewer(mikolalysenko.github.io)
15 points by 33a 12y ago|3 comments
143.
by 33a 12y ago
I wrote about some related ideas on my blog earlier this year. http://0fps.net/2014/02/26/replication-in-networked-games-sp... You can do quite a bit of latency hiding without even having to speculatively pre
144.
by 33a 12y ago
SemVer isn't broken, and you already outlined the obvious solution: 1. Don't depend on 0.x.x version modules unless you are willing to accept the pain of updating versions constantly. 2. Bump major versions liberally. If enough
145.
by 33a 12y ago
Also relevant (and not included in this collection) is the following functional red-black tree implementation: https://github.com/mikolalysenko/functional-red-black-tree
146.
by 33a 12y ago
The Austrian study that the author of this post cites has serious methodological flaws. In particular, in Austria it is common practice to prescribe vegetarian diets as treatment for various illnesses, and the authors of the paper failed t
147.
by 33a 12y ago
FPS isn't really an issue for web games, it's input latency. Current browsers add something like a 60ms delay to every input event, and there isn't any fast path for translating inputs to events on screen. This makes it ve
148.
by 33a 12y ago
I really hope this doesn't become a thing. We don't need a bunch of perverse incentives pushing people to write open source like academics are forced to churn out papers.
149.
by 33a 13y ago
That's a cartesian product, not a tensor product.
150.
by 33a 13y ago
Why not use named arguments instead of adding type annotations?

More ›