Fast collision detection among multiple moving spheres움직이는 많은 구들 사이의 빠른 충돌검사

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 493
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorShin, Sung-Yong-
dc.contributor.advisor신성용-
dc.contributor.authorKim, Dong-Jin-
dc.contributor.author김동진-
dc.date.accessioned2011-12-13T05:24:50Z-
dc.date.available2011-12-13T05:24:50Z-
dc.date.issued1999-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=151028&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/33130-
dc.description학위논문(박사) - 한국과학기술원 : 전산학과, 1999.2, [ iv, 73 p. ]-
dc.description.abstractSpheres are widely used in computer graphics and robotics since they are simple and effective to model a variety of objects. To prevent spheres from overlapping, interactions among them should be considered. An important issue of interactions is to minimize the number of collision checks. This dissertation presents an event-driven approach that efficiently detects collisions among multiple ballistic spheres moving in the 3D space. Adopting a hierarchical uniform space subdivision scheme, we are able to trace the trajectories of spheres and their time-varying spatial distribution. We identify three types of events to detect the sequence of all collisions during our simulation: collision, entering, and leaving. The first type of events is due to actual collisions, and the other two types occur when spheres move from subspace to subspace in the space. Tracing all such events in the order of their occurring times, we are able to avoid fixed time step simulation. When the size of the largest sphere is bounded by a constant multiple of that of the smallest, it takes $O(\bar{n}_{c}logn + \bar{n}_{e}logn)$ time with O(n) space after O(n logn) time preprocessing to simulate n moving spheres, where $\bar{n}_c$ and $\bar{n}_e$ are the number of actual collisions and that of entering and leaving events during the simulation, respectively. Since $\bar{n}_e$ depends on the size of subspaces, we modify the collision model from kinetic theory for molecular gas to determine the subspace sizes for the space subdivision scheme, that minimize simulation time. Experimental results show that collision detection can be done in linear time in n over a large range.eng
dc.languageeng-
dc.publisher한국과학기술원-
dc.subjectComputer animation-
dc.subjectPhysical simulation-
dc.subjectEvent-driven approach-
dc.subjectCollision detection-
dc.subjectComputational geometry-
dc.subject계산기하-
dc.subject컴퓨터 애니메이션-
dc.subject물리적 시뮬레이션-
dc.subject사건기반접근방법-
dc.subject충돌검사-
dc.titleFast collision detection among multiple moving spheres-
dc.title.alternative움직이는 많은 구들 사이의 빠른 충돌검사-
dc.typeThesis(Ph.D)-
dc.identifier.CNRN151028/325007-
dc.description.department한국과학기술원 : 전산학과, -
dc.identifier.uid000935040-
dc.contributor.localauthorShin, Sung-Yong-
dc.contributor.localauthor신성용-
Appears in Collection
CS-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0