Utilize este identificador para referenciar este registo: https://hdl.handle.net/1822/18769

Registo completo
Campo DCValorIdioma
dc.contributor.authorDeusdado, Leonel Domingues-
dc.contributor.authorFernandes, António Ramires-
dc.contributor.authorBelo, Orlando-
dc.date.accessioned2012-04-19T16:26:32Z-
dc.date.available2012-04-19T16:26:32Z-
dc.date.issued2008-
dc.identifier.urihttps://hdl.handle.net/1822/18769-
dc.description.abstractThe continuous development of graphics hardware is contributing to the creation of 3D virtual worlds with high level of detail, from models of large urban areas, to complete infrastructures, such as residential buildings, stadiums, industrial settings or archaeological sites, to name just a few. Adding virtual humans or avatars adds an extra touch to the visualization providing an enhanced perception of the spaces, namely adding a sense of scale, and enabling simulations of crowds. Path planning for crowds in a meaningful way is still an open research field, particularly when it involves an unknown polygonal 3D world. Extracting the potential paths for navigation in a non automated fashion is no longer a feasible option due to the dimension and complexity of the virtual environments available nowadays. This implies that we must be able to automatically extract information from the geometry of the unknown virtual world to define potential paths, determine accessibilities, and prepare a navigation structure for real time path planning and path finding. A new image based method is proposed that deals with arbitrarily a priori unknown complex virtual worlds, namely those consisting of multilevel passages (e.g. over and below a bridge). The algorithm is capable of extracting all the information required for the actual navigation of avatars, creating a hierarchical data structure to help both high level path planning and low level path finding decisions. The algorithm is image based, hence it is tessellation independent, i.e. the algorithm does not use the underlying polygonal structure of the 3D world. Therefore, the number of polygons as well as the topology, do not affect the performance.por
dc.language.isoengpor
dc.publisherACMpor
dc.rightsopenAccesspor
dc.subjectPath-findingpor
dc.subjectAvatarspor
dc.subjectComputer graphicspor
dc.titlePath planning for complex 3D multilevel environmentspor
dc.typearticle-
dc.peerreviewedyespor
sdum.publicationstatuspublishedpor
sdum.event.titleSpring Conference in Computer Graphics. Bratislava-
oaire.citationStartPage1por
oaire.citationEndPage8por
Aparece nas coleções:DI/CCTC - Artigos (papers)

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
SCCG08.pdfArtigo403,28 kBAdobe PDFVer/Abrir

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu ORCID