Data structures and algorithms for navigation in highly polygon-populated scenes

We present the visibility octree, a new data structure to accelerate 3D navigation through very complex scenes. Our approach employs a conservative visibility technique to compute an approximation to the visibility space partition. This approximation is computed and stored hierarchically at a prepro...

Descripción completa

Detalles Bibliográficos
Autores: Saona Vázquez, Carlos Luis, Navazo Álvaro, Isabel|||0000-0001-6298-1463, Brunet Crosa, Pere|||0000-0001-8406-1975
Tipo de recurso: informe técnico
Fecha de publicación:1998
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/84550
Acceso en línea:https://hdl.handle.net/2117/84550
Access Level:acceso abierto
Palabra clave:Visibility octree
3D navigation
Àrees temàtiques de la UPC::Informàtica::Infografia
id ES_69b996c8ff5b98780906fc85650d5df3
oai_identifier_str oai:upcommons.upc.edu:2117/84550
network_acronym_str ES
network_name_str España
repository_id_str
spelling Data structures and algorithms for navigation in highly polygon-populated scenesSaona Vázquez, Carlos LuisNavazo Álvaro, Isabel|||0000-0001-6298-1463Brunet Crosa, Pere|||0000-0001-8406-1975Visibility octree3D navigationÀrees temàtiques de la UPC::Informàtica::InfografiaWe present the visibility octree, a new data structure to accelerate 3D navigation through very complex scenes. Our approach employs a conservative visibility technique to compute an approximation to the visibility space partition. This approximation is computed and stored hierarchically at a preprocessing stage. We believe its main contribution to be its ability to provide an effective control over the coarseness of the approximation. A preliminary test with some randomly generated indoor scenes seems to show that the visibility octree will perform well on densely occluded scenes.19981998-10-0120162016-03-16reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/pdfhttps://hdl.handle.net/2117/84550reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/845502026-05-27T15:37:01Z
dc.title.none.fl_str_mv Data structures and algorithms for navigation in highly polygon-populated scenes
title Data structures and algorithms for navigation in highly polygon-populated scenes
spellingShingle Data structures and algorithms for navigation in highly polygon-populated scenes
Saona Vázquez, Carlos Luis
Visibility octree
3D navigation
Àrees temàtiques de la UPC::Informàtica::Infografia
title_short Data structures and algorithms for navigation in highly polygon-populated scenes
title_full Data structures and algorithms for navigation in highly polygon-populated scenes
title_fullStr Data structures and algorithms for navigation in highly polygon-populated scenes
title_full_unstemmed Data structures and algorithms for navigation in highly polygon-populated scenes
title_sort Data structures and algorithms for navigation in highly polygon-populated scenes
dc.creator.none.fl_str_mv Saona Vázquez, Carlos Luis
Navazo Álvaro, Isabel|||0000-0001-6298-1463
Brunet Crosa, Pere|||0000-0001-8406-1975
author Saona Vázquez, Carlos Luis
author_facet Saona Vázquez, Carlos Luis
Navazo Álvaro, Isabel|||0000-0001-6298-1463
Brunet Crosa, Pere|||0000-0001-8406-1975
author_role author
author2 Navazo Álvaro, Isabel|||0000-0001-6298-1463
Brunet Crosa, Pere|||0000-0001-8406-1975
author2_role author
author
dc.subject.none.fl_str_mv Visibility octree
3D navigation
Àrees temàtiques de la UPC::Informàtica::Infografia
topic Visibility octree
3D navigation
Àrees temàtiques de la UPC::Informàtica::Infografia
description We present the visibility octree, a new data structure to accelerate 3D navigation through very complex scenes. Our approach employs a conservative visibility technique to compute an approximation to the visibility space partition. This approximation is computed and stored hierarchically at a preprocessing stage. We believe its main contribution to be its ability to provide an effective control over the coarseness of the approximation. A preliminary test with some randomly generated indoor scenes seems to show that the visibility octree will perform well on densely occluded scenes.
publishDate 1998
dc.date.none.fl_str_mv 1998
1998-10-01
2016
2016-03-16
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/84550
url https://hdl.handle.net/2117/84550
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869410050363097088
score 15,300719

Similares en LA Referencia