View Single Post
Old 02 August 2015, 18:18   #188
Thorham
Computer Nerd

Thorham's Avatar
 
Join Date: Sep 2007
Location: Rotterdam/Netherlands
Age: 41
Posts: 2,972
Quote:
Originally Posted by Mrs Beanbag View Post
Ok it's not super-complicated, but it's at least as complicated, since you've got to do a full string comparison anyway to ensure you got a match. Then you've got to deal with hash collisions and rehashing strategies, also choice of hash function.
It's not complicated, period, unless I'm missing something.

Quote:
Originally Posted by Mrs Beanbag View Post
i'm talking about booleans between triangle meshes (i.e. boundary surface representation)
You said solids (Real3D!) before

Quote:
Originally Posted by Mrs Beanbag View Post
If you don't think that is a complex task, you try doing it.
Didn't say it's not complex, you said Amiga can't realistically do it, and it appears it can.

Turing complete machines can do everything that's computable as long as they have enough memory. Whether or not they can do it fast enough is a different matter. Means an Intel 4004 with enough memory can emulate an I7 at the transistor level. Useless, but it can do it.
Thorham is offline  
 
Page generated in 0.37838 seconds with 9 queries