@nothings @raiganburns @DyadGame Please answer my question. When you say it is not "ad hoc" to "collide" against multiple minkowskis.
-
-
Replying to @cmuratori
@cmuratori@raiganburns@DyadGame Tcoll(union(A,B)) = min(Tcoll(A), Tcoll(B))1 reply 0 retweets 0 likes -
Replying to @nothings
@nothings@raiganburns@DyadGame And tcoll is raycast again convex polyhedra?1 reply 0 retweets 0 likes -
Replying to @cmuratori
@cmuratori@raiganburns@DyadGame Or whatever. For Doom engine I minkowski-sum-raycasted circle for player against each edge separately.1 reply 0 retweets 0 likes -
Replying to @nothings
@cmuratori@raiganburns@DyadGame 2D edge = 3D wall1 reply 0 retweets 0 likes -
Replying to @nothings
@nothings@raiganburns@DyadGame Yes. So I call that a completely ad-hoc walkable area determination. It is totally...1 reply 0 retweets 0 likes -
Replying to @cmuratori
@nothings@raiganburns@DyadGame ... dependent on the location where you are walking from and can produce different results...1 reply 0 retweets 0 likes -
Replying to @cmuratori
@nothings@raiganburns@DyadGame ... depending on the direction / position of approach for any given area. This is not a serious problem...2 replies 0 retweets 0 likes -
Replying to @cmuratori
@cmuratori@raiganburns@DyadGame Are you defending why you have to use search-in-p for this? That's not what I'm criticizing.2 replies 0 retweets 0 likes -
Replying to @nothings
@nothings@raiganburns@DyadGame No, I'm saying why we do CSG separate from search-in-p. You were wondering why I had to do that.1 reply 0 retweets 0 likes
@nothings @raiganburns @DyadGame And I'm not defending anything, I'm explaining it to you.
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.