Collision Detection with Swept Spheres and Ellipsoids
|
|
- Percival Bennett
- 5 years ago
- Views:
Transcription
1 Collision etection with Swet Shees and Ellisoids Joit Rouwé Souce code: htt:// Intoduction Toda most games use conex olgons fo collision detection. The ae usuall stoed in a tee like stuctue to make it ossible to quickl eject a lot of olgons when efoming intesection tests. In the end howee, ee intesection test boils down to some imitie esus a olgon test. One commonl used intesection test is that of a swet shee a shee moing along a line o a swet ellisoid an ellisoid moing along a line but not otating with a static olgon. A game chaacte fo examle can be eesented b a collection of shees. When the chaacte is moing though the enionment we need to detect the fist oint fo which the collection of shees intesects with the wold geomet. Afte this oint is detected we also need an indication of whee the chaacte collided so we can comute a sliding diection that eents the chaacte fom getting stuck. As an altenatie to a numbe of shees we can also use a single ellisoid as an aoximation fo the olume of a chaacte. olgons used fo endeing usuall eside somewhee whee the ae not accessible to the collision sstem AG memo fo examle o the ae comessed and inteleaed with othe endeing data like etex colos. This foces us to stoe a seaate set of olgons fo collision. A chea wa of educing the amount of memo needed fo a olgon is to stoe it as a list of etices togethe with a lane equation. Of couse ou get the exta oehead of stoing a lane equation, but when using a S ina Sace atitioning tee fo examle ou need to stoe this lane anwa. In this aticle we will fist look at a function that can conet a olgon consisting of 3 oints into a lane and a list of oints. Afte that we will deie the intesection between a static olgon and a swet shee and that of a static olgon with a swet ellisoid. Finall we show that the same algoithm also woks on olgons consisting of 3 oints in the case that it is not ossible o not desiable to stoe a olgon in.. ojecting 3 oints on a lane A lane is defined b the set of oints fo which C. We call x,, z the lane nomal and C the lane constant. etails on how to ceate a lane equation can fo examle be found in []. 5/8/3
2 5/8/3 The distance of a oint to the lane is: lane C d. To oject a oint on the lane we ceate an othonomal base fo the lane with oigin at C and axes,, V U : U V U x z z x z x x z >,,,, To oject a oint fom wold sace to lane sace use:, V U To oject a oint fom lane sace to wold sace use: C V U x 3. Swet Shee Vesus olgon 3.. Swet Shee Vesus lane The fist ste in detemining if a swet shee collides with a olgon is to detemine the inteal oe which it intesects with the lane of the olgon. We use a swet shee of adius R and cente t t C, whee is the begin osition of the shee, the tanslation of the shee and t is a alue in the ange [, ]. The following image illustates this: R
3 The shee intesects the lane if the distance of the cente of the shee to the lane is equal o less than R: C t R. d lane When is zeo the lane is aallel to the motion of the shee. If d lane > R thee is no intesection, if d lane R the shee intesects oe the whole ange t [, ]. If is not zeo we hae to sole d lane C t R fo t: t t R C R C If both alues ae outside the ange [, ] thee is no intesection. We sot the two alues so that t < t and clam the alues to the ange [, ]. The inteal of intesection is now t [t, t ]. The following function efoms this test: bool laneswetsheeintesectconst lane &inlane, const Vecto3 &inegin, const Vecto3 &inelta, float inradius, float &outt, float &outt // If the cente of the shee moes like: cente inegin t * inelta fo t e [, ] // then the shee intesects the lane if: -R < distance lane to cente < R float n_dot_d inlane.momal.otinelta; float dist_to_b inlane.getsignedistanceinegin; if n_dot_d.f // The shee is moing neal aallel to the lane, check if the distance // is smalle than the adius if Absdist_to_b > inradius else // Intesection on the entie ange outt.f; outt.f; // etemine inteal of intesection outt inradius - dist_to_b / n_dot_d; outt -inradius - dist_to_b / n_dot_d; // Ode the esults if outt > outt SwaoutT, outt; // Eal out if no hit ossible if outt >.f outt <.f 3 5/8/3
4 // Clam it to the ange [, ], the ange of the swet shee if outt <.f outt.f; if outt >.f outt.f; 3.. Swet Cicle Vesus olgon We hae now detemined the inteal oe which the swet shee intesects with the lane of the olgon. To test if the shee intesects with the olgon itself we ae going to look at the oblem in the sace of the lane. The intesection between the shee and the lane is a cicle with a adius that aies along the ath. The cicle has a ositie adius oe ou eious comuted inteal [t, t ]. Outside this inteal the adius is negatie because the shee does not intesect with the lane. The following image illustates this: t t and ae ojected on the lane of the olgon in the same wa as the oints of the olgon see section, the esult in and ectos so that the cente of the swet cicle is descibed b C t t. The adius of the cicle is R t R d lane C t t t 3 with: 3 C R C Thee ae thee cases fo which the shee intesects with the olgon:. The cicle intesects with the olgon at t.. The cicle intesects with a etex on the inteal [t, t ]. 3. The cicle intesects with an edge on the inteal [t, t ]. 4 5/8/3
5 The esults of all these tests will gie a closest intesection faction the alue of t fo the fist collision and a collision oint. This collision oint can be coneted back to 3 as descibed in section. It can be used to detemine a collision esonse once the shee hits the olgon. We will now deie the thee tests in the next sections Static Cicle Vesus olgon In the fist test we test if the cicle at t defined b cente C t and adius R t intesects with the olgon. This is the case when:. The cicle cente is inside the olgon. In this case C t is the collision oint and t the intesection faction.. The closest oint fom C t to an of the edges is less than o equal to R t. In this case this closest oint is the collision oint and t the intesection faction. The following function combines both tests. It assumes that the etices ae invetices, inumvetices odeed counte clockwise. The cente of the cicle is incente and the adius of the cicle squaed is inradiussq. The collision oint will be etuned in outoint. bool olgoncicleintesectconst Vecto *invetices, int inumvetices, const Vecto &incente, float inradiussq, Vecto &outoint // Check if the cente is inside the olgon if olgoncontainsinvetices, inumvetices, incente outoint incente; // Loo though edges bool collision false; fo const Vecto * invetices, * invetices inumvetices - ; < invetices inumvetices;, // Get faction whee the closest oint to this edge occus Vecto _ * - *; Vecto _cente incente - *; float faction _cente.ot_; if faction <.f // Closest oint is float dist_sq _cente.getlengthsquaed; if dist_sq < inradiussq collision tue; 5 5/8/3
6 else outoint *; inradiussq dist_sq; float len_sq _.GetLengthSquaed; if faction < len_sq // Closest oint is on line segment Vecto oint * _ * faction / len_sq; float dist_sq oint - incente.getlengthsquaed; if dist_sq < inradiussq collision tue; outoint oint; inradiussq dist_sq; etun collision; The olgoncontains function checks if a oint is inside the olgon: bool olgoncontainsconst Vecto *invetices, int inumvetices, const Vecto &inoint // Loo though edges fo const Vecto * invetices, * invetices inumvetices - ; < invetices inumvetices;, // If the oint is outside this edge, the oint is outside the olgon Vecto _ * - *; Vecto _oint inoint - *; if _.mx * _oint.my - _oint.mx * _.my >.f 3.4. Swet Cicle Vesus Vetex In the second test, we test if the swet cicle intesects with an of the etices of the olgon. Fo ee etex we test if thee is a t fo which the distance between the cente of the cicle and the etex equals the adius of the cicle: C t R t Soling fo t we get a quadatic equation at bt c with: 6 5/8/3
7 7 5/8/3 3 c b a Let t be the smallest solution that lies in the inteal [, cuent closest faction]. If thee is a solution we stoe t as the cuent closest intesection faction and as the cuent collision oint Swet Cicle Vesus Edge In the thid and final test we test if the swet cicle intesects with an edge of the olgon. Fo ee edge to we will test if thee is a t fo which the cicle and the edge touch. Fist we test if the cicle intesects with the infinite line that the edge is at of. The distance between a oint and an infinite line though and is: d edge The cicle and the infinite line touch when: t R t C d edge Soling fo t we get a quadatic equation c bt at with: 3 c b a Let t be the smallest solution that lies in the inteal [, cuent closest faction]. If thee is no solution we continue with the next edge. A oint on the edge is gien b: f
8 The closest oint fom the cicle cente to the edge is when the diection fom the cente of the cicle to the oint is eendicula to the edge: C t Soling fo f : f t If f is inside the ange [, ] thee is an intesection, we stoe t as the cuent closest intesection faction and as the cuent closest intesection oint Imlementation This section will combine the esults of the eious sections into the full swet shee esus static olgon test. Fist of all we will combine the tests fom sections 3.4 and 3.5 since the shae a lot of exessions. The following function tests a swet cicle with the edges and etices of the olgon. The swet cicle taels fom inegin to inegin inelta. ina, in and inc ae a, b, and c of the quadatic equation of the cicle adius. The collision oint will be etuned in outoint and the faction in outfaction. bool SwetCicleEdgeVetexIntesectconst Vecto *invetices, int inumvetices, const Vecto &inegin, const Vecto &inelta, float ina, float in, float inc, Vecto &outoint, float &outfaction // Loo though edges float ue_bound.f; bool collision false; fo const Vecto * invetices, * invetices inumvetices - ; < invetices inumvetices;, float t; // Check if cicle hits the etex Vecto b * - inegin; float a ina - inelta.getlengthsquaed; float b in.f * inelta.otb; float c inc - b.getlengthsquaed; if FindLowestRootInInteala, b, c, ue_bound, t // We hae a collision collision tue; ue_bound t; outoint *; // Check if cicle hits the edge Vecto * - *; 8 5/8/3
9 float _dot_delta.otinelta; float _dot_b.otb; float _len_sq.getlengthsquaed; float a _len_sq * a _dot_delta * _dot_delta; float b _len_sq * b -.f * _dot_b * _dot_delta; float c _len_sq * c _dot_b * _dot_b; if FindLowestRootInInteala, b, c, ue_bound, t // Check if the intesection oint is on the edge float f t * _dot_delta - _dot_b; if f >.f && f < _len_sq // We hae a collision collision tue; ue_bound t; outoint * * f / _len_sq; // Check if we had a collision if!collision outfaction ue_bound; The tests ae not efomed on the ange [t, t ] as descibed in section 3., but on the ange [, cuent closest faction]. umeical ound off can geneate solutions that ae slightl lowe than t. Soling oe this lage ange does not gie us an false collisions since the adius of the cicle becomes negatie outside the ange [t, t ] so no solutions ae ossible. The following iece of code finds the lowest solution of a quadatic equation with coefficients ina, in and inc in the inteal [, inueound]. The solution is etuned in outx when the function etuns tue. bool FindLowestRootInIntealfloat ina, float in, float inc, float inueound, float &outx // Check if a solution exists float deteminant in * in - 4.f * ina * inc; if deteminant <.f // The standad wa of doing this is b comuting: x -b /- Sqtb^ - 4 a c / a // is not numeicall stable when a is close to zeo. // Sole the equation accoding to "umeical Reciies in C" aagah 5.6 float q -.5f * in in <.f? -.f :.f * Sqtdeteminant; // oth of these can etun IF, -IF o A that's wh we test both solutions // to be in the secified ange below float x q / ina; float x inc / q; // Ode the esults if x < x Swax, x; 9 5/8/3
10 // Check if x is a solution if x >.f && x < inueound outx x; // Check if x is a solution if x >.f && x < inueound outx x; 4. Swet Ellisoid Vesus olgon 4.. Theo In this section we will exand the swet shee esus static olgon test into a swet ellisoid esus static olgon test. We will assume that the ellisoid does not otate. To test a swet ellisoid with a olgon we hae to tansfom the olgon to the sace whee the ellisoid is a unit shee a shee with adius. We define an ellisoid b its thee othogonal axis e, e, e : x z e e x The cente of the ellisoid will moe accoding to C t t, whee is the begin osition of the ellisoid, the delta tanslation and t is a alue in the ange [, ]. We define a otation / scaling matix that tansfoms a unit shee in the ellisoid: 5/8/3
11 unit > ellisoid ex e e z unit > ellisoid unit unit > ellisoid When tansfoming the ellisoid b the matix moing along C t. unit unit unit > ellisoid unit t unit we get a unit shee and with We need to tansfom the lane of the olgon with lane equation C with: unit > ellisoid, this leads to the C unit > ellisoid unit > ellisoid C T unit > ellisoid T T Whee T unit > ellisoid >. indicates the tansose of unit ellisoid With this tansfomed lane we can detemine the inteal of intesection between the unit shee and the lane as befoe. If thee is an intesection we need to tansfom ou olgon to the sace of the unit shee. ojecting a oint fom lane sace to wold sace can be witten in matix fom: lane wold lane wold U x V C Let lane wold and tansfomed lane wold esectiel be the matix that takes oints fom the untansfomed lane to wold sace and fom the tansfomed lane to wold sace. The tansfomation needed fo the olgon is: 5/8/3
12 olgon tansfomed lane wold unit > ellisoid untansfomed lane wold Once the olgon has been tansfomed we can oject unit and unit on the tansfomed lane to fom and. ow we follow the same ath as befoe to detemine collision between a moing cicle and a olgon. If a collision oint is found we hae to tansfom it into wold sace b using the following matix: collision wold unit > ellisoid tansfomed lane wold 4.. Imlementation The swet ellisoid moes fom inegin to inegin inelta. The incial axis of the ellisoid ae inaxis, inaxis and inaxis3 which should be othogonal. When thee is a collision the function etuns tue and the collision oint will be in outoint and the cente of the shee is inegin outfaction * inelta when the shee collides. bool olgonswetellisoidintesectconst lane &inlane, const Vecto *invetices, int inumvetices, const Vecto3 &inegin, const Vecto3 &inelta, const Vecto3 &inaxis, const Vecto3 &inaxis, const Vecto3 &inaxis3, Vecto3 &outoint, float &outfaction // Comute matix that takes a oint fom unit shee sace to wold sace // OTE: When colliding with lots of olgons this can be cached atix unit_shee_to_wold; unit_shee_to_wold.column inaxis; unit_shee_to_wold.column inaxis; unit_shee_to_wold.column inaxis3; // Comute matix that takes a oint fom wold sace to unit shee sace // OTE: When colliding with lots of olgons this can be cached atix wold_to_unit_shee unit_shee_to_wold.getinesed; // Comute begin and delta in unit shee sace // OTE: When colliding with lots of olgons this can be cached Vecto3 begin_uss wold_to_unit_shee * inegin; Vecto3 delta_uss wold_to_unit_shee * inelta; // Tansfom the lane into unit shee local sace lane tansfomed_lane; tansfomed_lane inlane.gettansfomedineseunit_shee_to_wold; // etemine the ange oe which the unit shee intesects the tansfomed lane float t, t; if!laneswetsheeintesecttansfomed_lane, begin_uss, delta_uss,.f, t, t // Get matix that tansfoms a oint fom lane sace to wold sace atix lane_to_wold inlane.getlanetowoldatix; // Get matix that tansfoms a oint fom the tansfomed lane to unit shee sace atix tansfomed_lane_to_unit_shee tansfomed_lane.getlanetowoldatix; 5/8/3
13 // Get matix that takes a d olgon etex fom the oiginal sace to the sace of the // tansfomed lane so that the unit shee is still a unit shee atix lane_to_tansfomed_lane tansfomed_lane_to_unit_shee.getinesed * wold_to_unit_shee * lane_to_wold; // The adius of the cicle is defined as: adius^ - distance lane to cente^ // this can be witten as: adius^ a * t^ b * t c float n_dot_d tansfomed_lane.momal.otdelta_uss; float dist_to_b tansfomed_lane.getsignedistancebegin_uss; float a -n_dot_d * n_dot_d; float b -.f * n_dot_d * dist_to_b; float c.f - dist_to_b * dist_to_b; // Get the basis ectos fo the tansfomed lane const Vecto3 &u tansfomed_lane_to_unit_shee.column; const Vecto3 & tansfomed_lane_to_unit_shee.column; // To aoid tanslating the olgon we subtact the tanslation fom the begin oint // and then late add it to the collision esult again Vecto tanslane_to_tansfomed_lane.e, 3, lane_to_tansfomed_lane.e, 3; // Get the equation fo the intesection cicle between the lane and the // unit shee: cente begin t * delta Vecto begin lane::sconetwoldtolaneu,, begin_uss - tans; Vecto delta lane::sconetwoldtolaneu,, delta_uss; // Tansfom the olgon Vecto *tansfomed_etices Vecto *allocainumvetices * sizeofvecto; fo int i ; i < inumvetices; i tansfomed_etices[i] Tansfomxlane_to_tansfomed_lane, invetices[i]; // Test if shee intesects at t Vecto ; if olgoncicleintesecttansfomed_etices, inumvetices, begin delta * t, a * t * t b * t c, outfaction t; outoint unit_shee_to_wold * tansfomed_lane_to_unit_shee * Vecto3 tans; // Test if shee intesects with one of the edges o etices if SwetCicleEdgeVetexIntesecttansfomed_etices, inumvetices, begin, delta, a, b, c,, outfaction outoint unit_shee_to_wold * tansfomed_lane_to_unit_shee * Vecto3 tans; 5. Using olgons Stoed as 3 oints We stoed ou olgons as a list of oints and a lane equation, but the algoithm is the same if olgons ae stoed as a list of 3 oints. To make the algoithm wok we need to make the following changes to the equations in the eious sections: 3 5/8/3
14 Comute the lane equation at un time o stoe it. Set and so the become 3 ectos. Set and. 3 R Tansfom the olgon b the 4x4 matix:. olgon unit > ellisoid collision wold unit > Tansfom the collision esult b the 4x4 matix: ellisoid. 6. Refeences. eell, Gahics Gems III, W.H. ess, umeical Recies in C, Second Edition htt:// 3. T. Schoede, "Collision etection Using Ra Casting", Game eeloe agazine,. 5-57, August ft://ft.gdmag.com/ub/sc/aug.zi 4. T. Akenine-ölle, E. Haines, Real-Time Rendeing htt:// 4 5/8/3
CS 450: COMPUTER GRAPHICS RASTERIZING CONICS SPRING 2016 DR. MICHAEL J. REALE
CS 45: COMPUTER GRAPHICS RASTERIZING CONICS SPRING 6 DR. MICHAEL J. REALE RASTERIZING CURVES OTHER THAN LINES When dealing with othe inds of cuves, we can daw it in one of the following was: Use elicit
More information5. Geometric Transformations and Projections
5. Geometic Tansfomations and ojections 5. Tanslations and Rotations a) Tanslation d d d d d d d d b) Scaling s s s s c) Reflection (about - - lane) d) Rotation about Ais ( ) ( ) CCW 5.. Homogeneous Repesentation
More information4.2. Co-terminal and Related Angles. Investigate
.2 Co-teminal and Related Angles Tigonometic atios can be used to model quantities such as
More information(a, b) x y r. For this problem, is a point in the - coordinate plane and is a positive number.
Illustative G-C Simila cicles Alignments to Content Standads: G-C.A. Task (a, b) x y Fo this poblem, is a point in the - coodinate plane and is a positive numbe. a. Using a tanslation and a dilation, show
More informationProf. Feng Liu. Fall /17/2016
Pof. Feng Liu Fall 26 http://www.cs.pdx.edu/~fliu/couses/cs447/ /7/26 Last time Compositing NPR 3D Gaphics Toolkits Tansfomations 2 Today 3D Tansfomations The Viewing Pipeline Mid-tem: in class, Nov. 2
More information10/29/2010. Rendering techniques. Global Illumination. Local Illumination methods. Today : Global Illumination Modules and Methods
Rendeing techniques Compute Gaphics Lectue 10 Can be classified as Local Illumination techniques Global Illumination techniques Global Illumination 1: Ray Tacing and Radiosity Taku Komua 1 Local Illumination
More informationIntroduction To Robotics (Kinematics, Dynamics, and Design)
Intoduction o obotics Kinematics Dnamics and Design EION # 9: satial Descitions & ansfomations li Meghdai ofesso chool of Mechanical Engineeing haif Univesit of echnolog ehan IN 365-9567 Homeage: htt://meghdai.shaif.edu
More informationOutput Primitives. Ellipse Drawing
Output Pimitives Ellipse Dawing Ellipses. An ellipses is an elongated cicle and can be dawn with modified cicle dawing algoithm.. An ellipse has set of fied points (foci) that will have a constant total
More informationSiggraph Precomputed Radiance Transfer: Theory and Practice
Siggah 2005 Pecomuted Radiance Tansfe: Theoy and Pactice Summay Geneal model of shading and shadowing fo eal-time endeing. Basic adiance tansfe techniques, moe advanced techniques that incooate highe-fequency
More informationA New Free-form Deformation Through the Control of Parametric Surfaces
A New Fee-fom Defomation Though the Contol of Paametic Sufaces Jieqing Feng Lizhuang Ma and Qunsheng Peng State Key Lab. of CAD&CG, Zhejiang Univesity Hangzhou 310027, P. R. of CHINA email: jqfeng@cad.zju.edu.cn
More informationReader & ReaderT Monad (11A) Young Won Lim 8/20/18
Copyight (c) 2016-2018 Young W. Lim. Pemission is ganted to copy, distibute and/o modify this document unde the tems of the GNU Fee Documentation License, Vesion 1.2 o any late vesion published by the
More informationShortest Paths for a Two-Robot Rendez-Vous
Shotest Paths fo a Two-Robot Rendez-Vous Eik L Wyntes Joseph S B Mitchell y Abstact In this pape, we conside an optimal motion planning poblem fo a pai of point obots in a plana envionment with polygonal
More informationMassachusetts Institute of Technology Department of Mechanical Engineering
cm cm Poblem Massachusetts Institute of echnolog Depatment of Mechanical Engineeing. Intoduction to obotics Sample Poblems and Solutions fo the Mid-em Exam Figue shows a obotic vehicle having two poweed
More informationdc - Linux Command Dc may be invoked with the following command-line options: -V --version Print out the version of dc
- CentOS 5.2 - Linux Uses Guide - Linux Command SYNOPSIS [-V] [--vesion] [-h] [--help] [-e sciptexpession] [--expession=sciptexpession] [-f sciptfile] [--file=sciptfile] [file...] DESCRIPTION is a evese-polish
More information2D Transformations. Why Transformations. Translation 4/17/2009
4/7/9 D Tansfomations Wh Tansfomations Coodinate sstem tansfomations Placing objects in the wold Move/animate the camea fo navigation Dawing hieachical chaactes Animation Tanslation + d 5,4 + d,3 d 4,
More informationPledge: Signature:
S/PM 0 Final Exam 7 May 005 Name: KEY E-mail ID: @viginia.edu Pledge: Signatue: Thee ae 80 minutes 3 hous fo this exam and 80 oints on the test; don t send too long on any one uestion! Thee is an exam
More informationComputer Graphics and Animation 3-Viewing
Compute Gaphics and Animation 3-Viewing Pof. D. Chales A. Wüthich, Fakultät Medien, Medieninfomatik Bauhaus-Univesität Weima caw AT medien.uni-weima.de Ma 5 Chales A. Wüthich Viewing Hee: Viewing in 3D
More information17/5/2009. Introduction
7/5/9 Steeo Imaging Intoduction Eample of Human Vision Peception of Depth fom Left and ight eye images Diffeence in elative position of object in left and ight eyes. Depth infomation in the views?? 7/5/9
More informationSimulating Life of Virtual Plants, Fishes and Butterflies
Simulating Life of Vitual Plants, Fishes and Butteflies 1 3 Simulating Life of Vitual Plants, Fishes and Butteflies Hansudi Nose, Daniel Thalmann Comute Gahics Lab, Swiss Fedeal Institute of Technology
More informationEnvironment Mapping. Overview
Envionment Mapping 1 Oveview Intoduction Envionment map constuction sphee mapping Envionment mapping applications distant geomety eflections 2 1 Oveview Intoduction Envionment map constuction sphee mapping
More informationDefining and Implementing Dynamic Semantics of Object Oriented High Level Petri Nets
Defining and Imlementing Dynamic Semantics of Object Oiented High Level Peti Nets Maius Bezovan Faculty of Automation Comutes and Electonics, Univesity of Caiova 1100 Caiova, Romania Abstact. This ae deals
More informationAll lengths in meters. E = = 7800 kg/m 3
Poblem desciption In this poblem, we apply the component mode synthesis (CMS) technique to a simple beam model. 2 0.02 0.02 All lengths in metes. E = 2.07 10 11 N/m 2 = 7800 kg/m 3 The beam is a fee-fee
More informationMapReduce Optimizations and Algorithms 2015 Professor Sasu Tarkoma
apreduce Optimizations and Algoithms 2015 Pofesso Sasu Takoma www.cs.helsinki.fi Optimizations Reduce tasks cannot stat befoe the whole map phase is complete Thus single slow machine can slow down the
More informationCSE 165: 3D User Interaction
CSE 165: 3D Use Inteaction Lectue #6: Selection Instucto: Jugen Schulze, Ph.D. 2 Announcements Homewok Assignment #2 Due Fiday, Januay 23 d at 1:00pm 3 4 Selection and Manipulation 5 Why ae Selection and
More informationCoordinate Systems. Ioannis Rekleitis
Coodinate Systems Ioannis ekleitis Position epesentation Position epesentation is: P p p p x y z P CS-417 Intoduction to obotics and Intelligent Systems Oientation epesentations Descibes the otation of
More informationA Memory Efficient Array Architecture for Real-Time Motion Estimation
A Memoy Efficient Aay Achitectue fo Real-Time Motion Estimation Vasily G. Moshnyaga and Keikichi Tamau Depatment of Electonics & Communication, Kyoto Univesity Sakyo-ku, Yoshida-Honmachi, Kyoto 66-1, JAPAN
More information2. PROPELLER GEOMETRY
a) Fames of Refeence 2. PROPELLER GEOMETRY 10 th Intenational Towing Tank Committee (ITTC) initiated the pepaation of a dictionay and nomenclatue of ship hydodynamic tems and this wok was completed in
More informationExtended Perspective Shadow Maps (XPSM) Vladislav Gusev, ,
Extended Pespective Shadow Maps (XPSM) http://xpsm.og Vladislav Gusev,.8.27, xmvlad@gmail.com Figue : XPSM esults (~4 objects in a scene, 536x536 shadow map). Intoduction Shadows ae one of the most impotant
More informationJournal of World s Electrical Engineering and Technology J. World. Elect. Eng. Tech. 1(1): 12-16, 2012
2011, Scienceline Publication www.science-line.com Jounal of Wold s Electical Engineeing and Technology J. Wold. Elect. Eng. Tech. 1(1): 12-16, 2012 JWEET An Efficient Algoithm fo Lip Segmentation in Colo
More information3/1/18. Overview. Program Representations. Abstract Syntax Tree (AST) Eclipse JDT. Java Model. The Tree Structure of Java Project[2]
Oveview Pogam Reesentations Abstact Syntax Tee Eclise JDT Java Model Eclise JDT AST Contol Flow Gah Pogam Deendence Gah Points-to Gah Call Gah 2 Abstact Syntax Tee (AST) Ceated by the comile at the end
More informationA Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Personification by Boulic, Thalmann and Thalmann.
A Mathematical Implementation of a Global Human Walking Model with Real-Time Kinematic Pesonification by Boulic, Thalmann and Thalmann. Mashall Badley National Cente fo Physical Acoustics Univesity of
More informationEE 168 Handout #32 Introduction to Digital Image Processing March 7, 2012 HOMEWORK 7 SOLUTIONS
EE 168 Handout #32 Intoduction to Diital Imae Pocessin Mach 7, 2012 HOMEWORK 7 SOLUTIONS Polem 1: Colo Wheels We can epesent an N x N colo imae y a thee-dimensional aay such that the fist two dimensions
More informationLecture 27: Voronoi Diagrams
We say that two points u, v Y ae in the same connected component of Y if thee is a path in R N fom u to v such that all the points along the path ae in the set Y. (Thee ae two connected components in the
More informationConservation Law of Centrifugal Force and Mechanism of Energy Transfer Caused in Turbomachinery
Poceedings of the 4th WSEAS Intenational Confeence on luid Mechanics and Aeodynamics, Elounda, Geece, August 1-3, 006 (pp337-34) Consevation Law of Centifugal oce and Mechanism of Enegy Tansfe Caused in
More informationA New and Efficient 2D Collision Detection Method Based on Contact Theory Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai MIAO, Jian XUE
5th Intenational Confeence on Advanced Mateials and Compute Science (ICAMCS 2016) A New and Efficient 2D Collision Detection Method Based on Contact Theoy Xiaolong CHENG, Jun XIAO a, Ying WANG, Qinghai
More informationDerivation of the Nodal Forces Equivalent to Uniform Pressure for Quadratic Isoparametric Elements RAWB, Last Update: 30 September 2008
Deivation of the odal oces Equivalent to Unifom Pessue fo Quadatic sopaametic Elements RWB, Last Update: 0 Septembe 008 The displacement vecto u at an point within a single element, E, is lineal elated
More informationWhat is a Radian? The side that remains fixed is called the initial side
What is a Radian? Befoe we begin ou investigation of a adian let us fist establish a definition of an angle and eview some impotant concepts fom geomety. Definition of an Angle: A union of two ays with
More informationA Haptic-Assisted Guidance System for Navigating Volumetric Data Sets
A Haptic-Assisted Guidance System fo Navigating Volumetic Data Sets Eick Méndez*, Shunsuke Yoshida, Hauo Noma, Robet W. Lindeman*, Yasuyuki Yanagida, Shinobu Masaki, Kenichi Hosaka (*)Compute Science Depatment,
More informationGoal. Rendering Complex Scenes on Mobile Terminals or on the web. Rendering on Mobile Terminals. Rendering on Mobile Terminals. Walking through images
Goal Walking though s -------------------------------------------- Kadi Bouatouch IRISA Univesité de Rennes I, Fance Rendeing Comple Scenes on Mobile Teminals o on the web Rendeing on Mobile Teminals Rendeing
More informationADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM
ADDING REALISM TO SOURCE CHARACTERIZATION USING A GENETIC ALGORITHM Luna M. Rodiguez*, Sue Ellen Haupt, and Geoge S. Young Depatment of Meteoology and Applied Reseach Laboatoy The Pennsylvania State Univesity,
More informationPositioning of a robot based on binocular vision for hand / foot fusion Long Han
2nd Intenational Confeence on Advances in Mechanical Engineeing and Industial Infomatics (AMEII 26) Positioning of a obot based on binocula vision fo hand / foot fusion Long Han Compute Science and Technology,
More informationTrinocular Stereo using Shortest Paths and the Ordering Constraint
Tinocula Steeo using Shotest Paths and the Odeing Constaint Motilal Agawal and Lay S. Davis Deatment of Comute Science, Univesity of Mayland, College Pak, MD 20742, USA email: mla,lsd @umiacs.umd.edu Abstact
More informationDYNAMIC STORAGE ALLOCATION. Hanan Samet
ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu
More informationa Not yet implemented in current version SPARK: Research Kit Pointer Analysis Parameters Soot Pointer analysis. Objectives
SPARK: Soot Reseach Kit Ondřej Lhoták Objectives Spak is a modula toolkit fo flow-insensitive may points-to analyses fo Java, which enables expeimentation with: vaious paametes of pointe analyses which
More informationCOSC 6385 Computer Architecture. - Pipelining
COSC 6385 Compute Achitectue - Pipelining Sping 2012 Some of the slides ae based on a lectue by David Culle, Pipelining Pipelining is an implementation technique wheeby multiple instuctions ae ovelapped
More informationDr. A.B.M. Toufique Hasan. Lecture-13
7/5/8 ME 45: Aeodynamics D. A.B.M. Toufique Hasan Pofesso Depatment of Mechanical Engineeing g Bangladesh Univesity of Engineeing & Technology BUET, Dhaka Lectue-3 7/5/8 Doublet & Flow Ove a stationey
More informationComputer Vision - Histogram Processing. Dr. S. Das IIT Madras, CHENNAI - 36
Comute Viion - Hitogam Poceing D. S. Da IIT Mada, CHENNAI - 36 HISTOGRAM In a gay level image the obabilitie aigned to each gay level can be given by the elation: n, N Inut image,,2...l - - The nomalized
More informationTowards Adaptive Information Merging Using Selected XML Fragments
Towads Adaptive Infomation Meging Using Selected XML Fagments Ho-Lam Lau and Wilfed Ng Depatment of Compute Science and Engineeing, The Hong Kong Univesity of Science and Technology, Hong Kong {lauhl,
More informationAny modern computer system will incorporate (at least) two levels of storage:
1 Any moden compute system will incopoate (at least) two levels of stoage: pimay stoage: andom access memoy (RAM) typical capacity 32MB to 1GB cost pe MB $3. typical access time 5ns to 6ns bust tansfe
More informationNODAL AND LOOP ANALYSIS TECHNIQUES
NODAL AND LOOP ANALYSIS TECHNIQUES LEANING GOALS NODAL ANALYSIS LOOP ANALYSIS Deelop systematic techniques to determine all the oltages and currents in a circuit NODE ANALYSIS One of the systematic ways
More informationCS-184: Computer Graphics. Today. Lecture #5: 3D Transformations and Rotations. Transformations in 3D Rotations
CS-184: Compute Gaphics Lectue #5: 3D Tansfomations and Rotations Pof. James O Bien Univesity of Califonia, Bekeley V2009-F-05-1.0 Today Tansfomations in 3D Rotations Matices Eule angles Eponential maps
More informationImage Enhancement in the Spatial Domain. Spatial Domain
8-- Spatial Domain Image Enhancement in the Spatial Domain What is spatial domain The space whee all pixels fom an image In spatial domain we can epesent an image by f( whee x and y ae coodinates along
More informationSORTING IN SPACE HANAN SAMET
SORTING IN SPACE HANAN SAMET COMPUTER SCIENCE DEPARTMENT AND CENTER FOR AUTOMATION RESEARCH AND INSTITUTE FOR ADVANCED COMPUTER STUDIES UNIVERSITY OF MARYLAND COLLEGE PARK, MARYLAND 074-4 USA e mail: hjs@cs.umd.edu
More informationPOMDP: Introduction to Partially Observable Markov Decision Processes Hossein Kamalzadeh, Michael Hahsler
POMDP: Intoduction to Patially Obsevable Makov Decision Pocesses Hossein Kamalzadeh, Michael Hahsle 2019-01-02 The R package pomdp povides an inteface to pomdp-solve, a solve (witten in C) fo Patially
More informationA modal estimation based multitype sensor placement method
A modal estimation based multitype senso placement method *Xue-Yang Pei 1), Ting-Hua Yi 2) and Hong-Nan Li 3) 1),)2),3) School of Civil Engineeing, Dalian Univesity of Technology, Dalian 116023, China;
More informationSegmentation of Casting Defects in X-Ray Images Based on Fractal Dimension
17th Wold Confeence on Nondestuctive Testing, 25-28 Oct 2008, Shanghai, China Segmentation of Casting Defects in X-Ray Images Based on Factal Dimension Jue WANG 1, Xiaoqin HOU 2, Yufang CAI 3 ICT Reseach
More informationAugmented Reality. Integrating Computer Graphics with Computer Vision Mihran Tuceryan. August 16, 1998 ICPR 98 1
Augmented Reality Integating Compute Gaphics with Compute Vision Mihan Tuceyan August 6, 998 ICPR 98 Definition XCombines eal and vitual wolds and objects XIt is inteactive and eal-time XThe inteaction
More informationDesired Attitude Angles Design Based on Optimization for Side Window Detection of Kinetic Interceptor *
Poceedings of the 7 th Chinese Contol Confeence July 6-8, 008, Kunming,Yunnan, China Desied Attitude Angles Design Based on Optimization fo Side Window Detection of Kinetic Intecepto * Zhu Bo, Quan Quan,
More informationDYNAMIC STORAGE ALLOCATION. Hanan Samet
ds0 DYNAMIC STORAGE ALLOCATION Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 074 e-mail: hjs@umiacs.umd.edu
More informationTESSELLATIONS. This is a sample (draft) chapter from: MATHEMATICAL OUTPOURINGS. Newsletters and Musings from the St. Mark s Institute of Mathematics
TESSELLATIONS This is a sample (daft) chapte fom: MATHEMATICAL OUTPOURINGS Newslettes and Musings fom the St. Mak s Institute of Mathematics James Tanton www.jamestanton.com This mateial was and can still
More informationRANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES
RANDOM IRREGULAR BLOCK-HIERARCHICAL NETWORKS: ALGORITHMS FOR COMPUTATION OF MAIN PROPERTIES Svetlana Avetisyan Mikayel Samvelyan* Matun Kaapetyan Yeevan State Univesity Abstact In this pape, the class
More informationE-OPTIMAL SEMI-REGULAR GRAPH DESIGNS AND PARTIALLY EFFICIENCY BALANCED DESIGNS
ounal of Statistical Theoy and Applications ISS 58-7887 Volume, ume, 22, pp.7-6 E-OPTIMAL SEMI-REGULAR GRAPH DESIGS AD PARTIALLY EFFICIECY BALACED DESIGS D.K. Ghosh Depatment of Statistics, Sauashta Uniesity,
More informationFACE VECTORS OF FLAG COMPLEXES
FACE VECTORS OF FLAG COMPLEXES ANDY FROHMADER Abstact. A conjectue of Kalai and Eckhoff that the face vecto of an abitay flag complex is also the face vecto of some paticula balanced complex is veified.
More information^2 PMAC NC FOR MILL APPLICATION
^1 SOFTWARE REFERENCE MANUA ^2 PMAC NC FOR MI APPICATION ^3 Integato/Softwae Manual ^4 3xx-603450-xSxx ^5 June 11, 2004 Single Souce Machine Contol Powe // Flexibility // Ease of Use 21314 assen Steet
More informationThe EigenRumor Algorithm for Ranking Blogs
he EigenRumo Algoithm fo Ranking Blogs Ko Fujimua N Cybe Solutions Laboatoies N Copoation akafumi Inoue N Cybe Solutions Laboatoies N Copoation Masayuki Sugisaki N Resonant Inc. ABSRAC he advent of easy
More informationCS 450: COMPUTER GRAPHICS 2D TRANSFORMATIONS SPRING 2016 DR. MICHAEL J. REALE
CS 45: COMUTER GRAHICS 2D TRANSFORMATIONS SRING 26 DR. MICHAEL J. REALE INTRODUCTION Now that we hae some linear algebra under our resectie belts, we can start ug it in grahics! So far, for each rimitie,
More informationAN ARTIFICIAL NEURAL NETWORK -BASED ROTATION CORRECTION METHOD FOR 3D-MEASUREMENT USING A SINGLE PERSPECTIVE VIEW
Ma 8, 9 and 30, 1997 Le Ceusot, Bougogne, FRANCE AN ARIFICIAL NEURAL NEWORK -BASED ROAION CORRECION MEHOD FOR 3D-MEASUREMEN USING A SINGLE PERSPECIVE VIEW Kauko Väinämö, Juha Röning Depatment of Electical
More informationIllumination methods for optical wear detection
Illumination methods fo optical wea detection 1 J. Zhang, 2 P.P.L.Regtien 1 VIMEC Applied Vision Technology, Coy 43, 5653 LC Eindhoven, The Nethelands Email: jianbo.zhang@gmail.com 2 Faculty Electical
More information3D Reconstruction from 360 x 360 Mosaics 1
CENTER FOR MACHINE PERCEPTION 3D Reconstuction fom 36 x 36 Mosaics CZECH TECHNICAL UNIVERSITY {bakstein, pajdla}@cmp.felk.cvut.cz REPRINT Hynek Bakstein and Tomáš Pajdla, 3D Reconstuction fom 36 x 36 Mosaics,
More informationStrongly Connected Components. Uses for SCC s. Two Simple SCC Algorithms. Directed Acyclic Graphs
CSE Intoduction to Algoithms Depth Fist Seach and Stongly Connected Components W.L. Ruzzo, Summe 00 Undiected Depth-Fist Seach It s not just fo tees DFS() back edge tee edge if maked then etun; mak ; #
More informationTransmission Lines Modeling Based on Vector Fitting Algorithm and RLC Active/Passive Filter Design
Tansmission Lines Modeling Based on Vecto Fitting Algoithm and RLC Active/Passive Filte Design Ahmed Qasim Tuki a,*, Nashien Fazilah Mailah b, Mohammad Lutfi Othman c, Ahmad H. Saby d Cente fo Advanced
More informationGARBAGE COLLECTION METHODS. Hanan Samet
gc0 GARBAGE COLLECTION METHODS Hanan Samet Compute Science Depatment and Cente fo Automation Reseach and Institute fo Advanced Compute Studies Univesity of Mayland College Pak, Mayland 07 e-mail: hjs@umiacs.umd.edu
More informationUser Specified non-bonded potentials in gromacs
Use Specified non-bonded potentials in gomacs Apil 8, 2010 1 Intoduction On fist appeaances gomacs, unlike MD codes like LAMMPS o DL POLY, appeas to have vey little flexibility with egads to the fom of
More informationInteresting Target Detection and Matching Algorithm Based on Phase Information
009 Intenational Confeence on Machine Leaning and Comuting IPCSIT vol.3 0 0 IACSIT Pess Singaoe Inteesting Taget Detection and Matching Algoithm Based on Phase Infomation hitao Xiao Jun u Lei Geng Jianming
More informationUndirected Depth-First Search. CSE 421 Introduction to Algorithms. Undirected Depth-First Search. Directed Depth First Search
CSE Intoduction to Algoithms Undiected Depth-Fist Seach It s not just fo tees Depth Fist Seach and Stongly Connected Components DFS() back edge tee edge if maked then etun; mak ; # := ++count; fo all edges
More information= dv 3V (r + a 1) 3 r 3 f(r) = 1. = ( (r + r 2
Random Waypoint Model in n-dimensional Space Esa Hyytiä and Joma Vitamo Netwoking Laboatoy, Helsinki Univesity of Technology, Finland Abstact The andom waypoint model (RWP) is one of the most widely used
More informationControl of Mobile Robots
Conto of Mobie obots efeences: -. Siegwat and I.. Noubakhsh, Intoduction to Autonomous Mobie obots, MIT, 004 (Chaps.,3. - S. G. Tzafestas, Intoduction to Mobie obot Conto, Esevie, 013. 1 Tpes of Mobie
More informationFault-Tolerant Metric Vector Routing
Fault-Toleant Metic Vecto Routing Joge A. Cobb Deatment of Comute Science Univesity of Texas at Dallas Richadson, TX 75083-0688 jcobb@utdallas.edu Abstact We esent a distibuted outing otocol fo obtaining
More informationColor Correction Using 3D Multiview Geometry
Colo Coection Using 3D Multiview Geomety Dong-Won Shin and Yo-Sung Ho Gwangju Institute of Science and Technology (GIST) 13 Cheomdan-gwagio, Buk-ku, Gwangju 500-71, Republic of Koea ABSTRACT Recently,
More informationConversion Functions for Symmetric Key Ciphers
Jounal of Infomation Assuance and Secuity 2 (2006) 41 50 Convesion Functions fo Symmetic Key Ciphes Deba L. Cook and Angelos D. Keomytis Depatment of Compute Science Columbia Univesity, mail code 0401
More informationn If S is in convex position, then thee ae exactly k convex k-gons detemined by subsets of S. In geneal, howeve, S may detemine fa fewe convex k-gons.
Counting Convex Polygons in Plana Point Sets Joseph S. B. Mitchell a;1, Günte Rote b, Gopalakishnan Sundaam c, and Gehad Woeginge b a Applied Mathematics and Statistics, SUNY Stony Book, NY 11794-3600.
More informationComparisons of Transient Analytical Methods for Determining Hydraulic Conductivity Using Disc Permeameters
Compaisons of Tansient Analytical Methods fo Detemining Hydaulic Conductivity Using Disc Pemeametes 1,,3 Cook, F.J. 1 CSRO Land and Wate, ndoooopilly, Queensland The Univesity of Queensland, St Lucia,
More informationLecture # 04. Image Enhancement in Spatial Domain
Digital Image Pocessing CP-7008 Lectue # 04 Image Enhancement in Spatial Domain Fall 2011 2 domains Spatial Domain : (image plane) Techniques ae based on diect manipulation of pixels in an image Fequency
More informationElastohydrodynamic Lubrication Analysis of Journal Bearings Using CAD
The 3d Intenational Confeence on Design Engineeing and Science, ICDES 1 Pilsen, Czech Repulic, August 31 Septeme 3, 1 Elastohydodynamic Luication Analysis of Jounal Beaings Using CAD Toshihio OZASA *1,
More informationModule 6 STILL IMAGE COMPRESSION STANDARDS
Module 6 STILL IMAE COMPRESSION STANDARDS Lesson 17 JPE-2000 Achitectue and Featues Instuctional Objectives At the end of this lesson, the students should be able to: 1. State the shotcomings of JPE standad.
More informationA Neural Network Model for Storing and Retrieving 2D Images of Rotated 3D Object Using Principal Components
A Neual Netwok Model fo Stong and Reteving 2D Images of Rotated 3D Object Using Pncipal Components Tsukasa AMANO, Shuichi KUROGI, Ayako EGUCHI, Takeshi NISHIDA, Yasuhio FUCHIKAWA Depatment of Contol Engineeng,
More informationFinding point-pairs. Find Closest Point from Dense Cloud
Finding point-pais Given an a, find a coesponding b on the suface. Then one appoach would be to seach evey possible tiangle o suface point and then take the closest point. The key is to find a moe efficient
More informationScaling Location-based Services with Dynamically Composed Location Index
Scaling Location-based Sevices with Dynamically Composed Location Index Bhuvan Bamba, Sangeetha Seshadi and Ling Liu Distibuted Data Intensive Systems Laboatoy (DiSL) College of Computing, Geogia Institute
More informationLayered Animation using Displacement Maps
Layeed Animation using Displacement Maps Raymond Smith, Wei Sun, Adian Hilton and John Illingwoth Cente fo Vision, Speech and Signal Pocessing Univesity of Suey, Guildfod GU25XH, UK a.hilton@suey.ac.uk
More informationDirectional Stiffness of Electronic Component Lead
Diectional Stiffness of Electonic Component Lead Chang H. Kim Califonia State Univesit, Long Beach Depatment of Mechanical and Aeospace Engineeing 150 Bellflowe Boulevad Long Beach, CA 90840-830, USA Abstact
More informationWhere am I? Using Vanishing Points
Whee am I? Using Vanishing Points Whee was I (how high)? Taken fom my hotel oom (6 th floo) Taken fom beach Vanishing point Vanishing line fo hoizon Vanishing point What can vanishing line tell us
More informationWhere am I? Using Vanishing Points
Whee am I? Using Vanishing Points Vanishing point Vanishing line fo hoizon Vanishing point What can vanishing line tell us about me? Hoizon Camea pitch angle (looking down) Camea oll angle (tilted towad
More informationHaptic Glove. Chan-Su Lee. Abstract. This is a final report for the DIMACS grant of student-initiated project. I implemented Boundary
Physically Accuate Haptic Rendeing of Elastic Object fo a Haptic Glove Chan-Su Lee Abstact This is a final epot fo the DIMACS gant of student-initiated poject. I implemented Bounday Element Method(BEM)
More informationGravitational Shift for Beginners
Gavitational Shift fo Beginnes This pape, which I wote in 26, fomulates the equations fo gavitational shifts fom the elativistic famewok of special elativity. Fist I deive the fomulas fo the gavitational
More informationMono Vision Based Construction of Elevation Maps in Indoor Environments
8th WSEAS Intenational onfeence on SIGNAL PROESSING, OMPUTATIONAL GEOMETRY and ARTIFIIAL VISION (ISGAV 08) Rhodes, Geece, August 0-, 008 Mono Vision Based onstuction of Elevation Maps in Indoo Envionments
More informationTHE THETA BLOCKCHAIN
THE THETA BLOCKCHAIN Theta is a decentalized video steaming netwok, poweed by a new blockchain and token. By Theta Labs, Inc. Last Updated: Nov 21, 2017 esion 1.0 1 OUTLINE Motivation Reputation Dependent
More informationCache Memory and Performance
Cache Memo and Pefomance Code and Caches 1 Man of the following slides ae taken with pemission fom Complete Powepoint Lectue Notes fo Compute Sstems: A Pogamme's Pespective (CS:APP) Randal E. Bant and
More informationUser Visible Registers. CPU Structure and Function Ch 11. General CPU Organization (4) Control and Status Registers (5) Register Organisation (4)
PU Stuctue and Function h Geneal Oganisation Registes Instuction ycle Pipelining anch Pediction Inteupts Use Visible Registes Vaies fom one achitectue to anothe Geneal pupose egiste (GPR) ata, addess,
More informationAdaptation of Motion Capture Data of Human Arms to a Humanoid Robot Using Optimization
ICCAS25 June 2-5, KINTEX, Gyeonggi-Do, Koea Adaptation of Motion Captue Data of Human Ams to a Humanoid Robot Using Optimization ChangHwan Kim and Doik Kim Intelligent Robotics Reseach Cente, Koea Institute
More informationEffective Data Co-Reduction for Multimedia Similarity Search
Effective Data Co-Reduction fo Multimedia Similaity Seach Zi Huang Heng Tao Shen Jiajun Liu Xiaofang Zhou School of Infomation Technology and Electical Engineeing The Univesity of Queensland, QLD 472,
More information