Reputation
8,162
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
15 42
Impact
~271k people reached

Nov
18
awarded  Popular Question
Nov
8
comment What is the difference between a sprite sheet and a texture atlas?
@ArcaneEngineer - You are right, absolutely good point, the comment is misleading and somewhat incorrect. Also the term tile set is misleading cause it can mean different things to different people if not properly defined.
Nov
8
revised What is the difference between a sprite sheet and a texture atlas?
added 529 characters in body
Nov
8
revised What is the difference between a sprite sheet and a texture atlas?
added 529 characters in body
Nov
8
comment What is the difference between a sprite sheet and a texture atlas?
@ArcaneEngineer I don't understand? What are you pointing out or suggesting as an improvement to the answer?
Nov
3
revised Are sockets required when developing a browser based MMOG?
deleted 24 characters in body
Nov
3
revised Are sockets required when developing a browser based MMOG?
added 78 characters in body
Oct
27
awarded  Taxonomist
Oct
15
comment Converting Unity .fbx model to .stl using the exporter?
Well aware this an extreme noob question
Oct
15
asked Converting Unity .fbx model to .stl using the exporter?
Oct
15
comment Find shortest path (quickly) on the surface of a 3d model?
The idia (intuition) I'm getting is that once you find a path of faces, you can essentially flatten this path and then finding the shortest path on the series of flattened faces can be done with the same tools used to find the shortest paths in a 3d polygonal obstacle course (i.e you embed the start point, end point and obstacle corners as vertices in a graph and use Dijkstra on the resulting graph).
Oct
15
accepted Find shortest path (quickly) on the surface of a 3d model?
Oct
15
comment Find shortest path (quickly) on the surface of a 3d model?
Ok, I reread the last part of the answer. It is not clear to me. Specifically "any point on the edge is going to keep the path inside all visited triangles." and "To optimize the path, the method I've found is to iteratively project line between previous/next points on the line of the current point, then limit it inside that line."; I think in essence this is the answer to the question and it's pretty brief and not lucid.
Oct
15
comment Find shortest path (quickly) on the surface of a 3d model?
Ok, thanks! now I get it. So there is a refinement phase after you compute the shortest path on the dual graph (a graph where faces are vertices).
Oct
15
comment Find shortest path (quickly) on the surface of a 3d model?
I mean, I don't see how the absolute shortest path is computed. I don't think you understood the ziggy zaginess issue described in the question or I don't understand the answer. It smells like this would still ziggy zag rougelike style instead of providing a good approximation of the true shortest path.
Oct
15
comment Find shortest path (quickly) on the surface of a 3d model?
There are no orbifolds. I've got triangle adjacency computed. Do not understand how the length of a path is computed in this answer.
Oct
15
asked Find shortest path (quickly) on the surface of a 3d model?
Oct
10
comment Efficient Collision detection for polygons (fleet) in an RTS
What about boxes?
Oct
10
comment Find two points in a point cloud with the maximum distance?
@PieterGeerkens You are right, I borrowed this from Graph Theory.
Oct
10
revised Find two points in a point cloud with the maximum distance?
added 128 characters in body; edited title