home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!cis.ohio-state.edu!sample.eng.ohio-state.edu!purdue!yuma!news
- From: bj@fractal.physics.colostate.edu (B.J. Buchalter)
- Newsgroups: comp.programming
- Subject: Re: Collision Detection
- Message-ID: <Jul27.233802.41110@yuma.ACNS.ColoState.EDU>
- Date: 27 Jul 92 23:38:02 GMT
- References: <18052.2a6ea82e@levels.unisa.edu.au>
- Sender: news@yuma.ACNS.ColoState.EDU (News Account)
- Organization: Colorado State University, Fort Collins, CO 80523
- Lines: 27
-
- In article <18052.2a6ea82e@levels.unisa.edu.au> Andrew writes:
- > Does anybody out there know of a fast efficient way to detect and handle
- > colliding objects in two dimensions (there may be multiple objects colliding
- > as well)...
- >
- > it may be a similar problem to gas particles colliding...
-
- Need to know what shape. If the particles are arbitrary shape you should
- discretize them (put them on a bitmap)... then the collision criterion is
- simple. If they are simple geometric objects then the criterion is simpler.
-
- > Please email me...
-
- My machine does not seem to know who your machine is. Maybe you can email me
- directly or post your internet address. I'm bj@phonon.physics.colostate.edu --
- bj@129.82.140.50.
-
- > Part of my Honours project is to animate objects and then detect when they
- > collide and generate there new position...the problems come in when after a
- > collision occurs the object then collides with another object, when it
- bounces
- > away...
-
- determining what to do to the particles after they collide can be a lot harder
- to do then detecting the collision in the first place. need more details on
- what you are trying to accomplish.
- -B.J.
-