<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<identifier>6qtX3pFwXQZG2LgkFdY/LKeML</identifier>
		<repository>sid.inpe.br/sibgrapi@80/2006/07.13.18.20</repository>
		<metadatarepository>sid.inpe.br/sibgrapi@80/2006/07.13.18.20.33</metadatarepository>
		<site>sibgrapi.sid.inpe.br 802</site>
		<citationkey>RochaRodrTadd:2006:PeEvHy</citationkey>
		<author>Rocha, Rafael de Sousa,</author>
		<author>Rodrigues, Maria Andréia Formico,</author>
		<author>Taddeo, Leandro da Silva,</author>
		<affiliation>Informática, Universidade de Fortaleza (UNIFOR)</affiliation>
		<affiliation>Mestrado em Informática Aplicada, Universidade de Fortaleza (UNIFOR)</affiliation>
		<affiliation>Mestrado em Informática Aplicada, Universidade de Fortaleza (UNIFOR)</affiliation>
		<title>Performance Evaluation of a Hybrid Algorithm for Collision Detection in Crowded Interactive Environments</title>
		<conferencename>Brazilian Symposium on Computer Graphics and Image Processing, 19 (SIBGRAPI)</conferencename>
		<year>2006</year>
		<editor>Oliveira Neto, Manuel Menezes de,</editor>
		<editor>Carceroni, Rodrigo Lima,</editor>
		<booktitle>Proceedings</booktitle>
		<date>8-11 Oct. 2006</date>
		<publisheraddress>Los Alamitos</publisheraddress>
		<publisher>IEEE Computer Society</publisher>
		<conferencelocation>Manaus</conferencelocation>
		<keywords>hybrid algorithm, collision detection, crowded interactive environments.</keywords>
		<abstract>Crowded interactive environments composed of a large number of objects need a fast, accurate and scalable mechanism for collision detection. This work presents a detailed performance analysis of a hybrid collision detection algorithm for highly interactive and crowded environments. Extensive tests were conducted and the performance of the algorithm was evaluated in terms of output quality and running time, by applying a usability criteria. The results show that interactive frame rates for environments composed of 1000 colliding objects can be successfully achieved with a good level of user satisfaction using the Sweep & Prune algorithm together with sphere-trees generated by the Combined algorithm.</abstract>
		<language>en</language>
		<tertiarytype>Full Paper</tertiarytype>
		<format>On-line</format>
		<size>364 KiB</size>
		<numberoffiles>1</numberoffiles>
		<targetfile>rochar-CollisionDetection.pdf</targetfile>
		<lastupdate>2006:07.13.18.20.32 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatalastupdate>2020:02.19.03.17.35 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 2006}</metadatalastupdate>
		<e-mailaddress>mafr@unifor.br</e-mailaddress>
		<usergroup>rochar administrator</usergroup>
		<visibility>shown</visibility>
		<transferableflag>1</transferableflag>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<contenttype>External Contribution</contenttype>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/sibgrapi@80/2006/07.13.18.20</url>
	</metadata>
</metadatalist>