Can't say much for the game cube, but developing for the xbox is REALLY easy if you know directX. The SDK includes pretty much everything as an interface to directX (directinput, etc), with some minor changes for HW optimization.
Aren't most of the crimes against other corporation entities? If you are saying that technology would be further along without a Windows monopoly, could we sue corporations for not researching enough or for making stupid decisions?
I'm work for MS (Yeah, yeah), in XBOX development. Per-poly detection is a real problem because of the sheer number of operations. We'll probably end up using a lower poly count to do the shadow volumes and the collision (with a higher poly count for the characters themselves). The biggest problem we run into is the memory to store it all- in the latest generation of video cards, it's bad to try to access the polies the video card uses, which means you have to duplicate polies. 64M is a lot, but it's still tough to fit everything in it.
Well, couldn't you in theory also use the quantum computers to come up with mega-bit encryption keys? The whole point of RSA is that it's much easier to encrypt than decrypt- when processing power means you can decrpypt something, it also means you can encrypt it another order of magnitude up..
(Not very technical, I know, but the point is that there could be new forms of encryption also based on quantum computers)
Slashdot Mirror
Can't say much for the game cube, but developing for the xbox is REALLY easy if you know directX. The SDK includes pretty much everything as an interface to directX (directinput, etc), with some minor changes for HW optimization.
Aren't most of the crimes against other corporation entities? If you are saying that technology would be further along without a Windows monopoly, could we sue corporations for not researching enough or for making stupid decisions?
-Synoptic
Heh.. makes me think of something I always do, but still get in trouble for with my coworkers.
Elem *pMyLinkedList;
Elem **pSrch;
for (pSrch = &pMyLinkedList; *pSrch;
pSrch = &((*pSrch)->pNext));
(*pSrch) = new Elem;
(management of a link list with double ptrs so you don't have to condition the first element)
I'm work for MS (Yeah, yeah), in XBOX development. Per-poly detection is a real problem because of the sheer number of operations. We'll probably end up using a lower poly count to do the shadow volumes and the collision (with a higher poly count for the characters themselves). The biggest problem we run into is the memory to store it all- in the latest generation of video cards, it's bad to try to access the polies the video card uses, which means you have to duplicate polies. 64M is a lot, but it's still tough to fit everything in it.
Well, couldn't you in theory also use the
quantum computers to come up with mega-bit
encryption keys? The whole point of RSA is that
it's much easier to encrypt than decrypt- when
processing power means you can decrpypt something, it also means you can encrypt it another order
of magnitude up..
(Not very technical, I know, but the point is that
there could be new forms of encryption also
based on quantum computers)