DSpace Collection:https://hdl.handle.net/10316/2902024-03-29T00:33:42Z2024-03-29T00:33:42ZA-Frame experimentation and evaluation for the development of interactive VR: a virtual tour of the Conimbriga MuseumSantos, Solange GomesCardoso, Jorge C. S.https://hdl.handle.net/10316/870282021-07-30T11:05:14Z2019-05-01T00:00:00ZTitle: A-Frame experimentation and evaluation for the development of interactive VR: a virtual tour of the Conimbriga Museum
Authors: Santos, Solange Gomes; Cardoso, Jorge C. S.
Abstract: This work provides an analysis of the development effort required to implement a Web-based VR experience using the A-Frame VR framework. We implemented an interactive 360º virtual tour of the Conimbriga Museum, featuring the objects of national interest that can be found in the museum’s exhibition. The tour allows navigation between the 360º scenes, providing information panels about the objects, and a floor menu for rapid teleporting between rooms. The implementation of this virtual tour allowed us to identify several issues where Web-based VR development is still lacking in flexibility.2019-05-01T00:00:00ZSurvey on Distributed Hash TablesAraújo, FilipeRodrigues, Luíshttps://hdl.handle.net/10316/136032020-05-25T12:20:04Z2006-01-01T00:00:00ZTitle: Survey on Distributed Hash Tables
Authors: Araújo, Filipe; Rodrigues, Luís
Abstract: In this paper we review distributed hash tables (DHTs) that work as overlay
networks on top of the IP network. We compare these DHTs under a number
of key aspects that concern performance, scalability and self-configurability.
Additionally, since these networks are not suitable for wireless ad hoc networks, we shortly review techniques that can be used to take distributed
hash tables to wireless environments.2006-01-01T00:00:00ZSingle-Step Creation of Localized Delaunay TriangulationsAraújo, FilipeRodrigues, Luíshttps://hdl.handle.net/10316/136022020-05-25T12:19:28Z2006-01-01T00:00:00ZTitle: Single-Step Creation of Localized Delaunay Triangulations
Authors: Araújo, Filipe; Rodrigues, Luís
Abstract: A localized Delaunay triangulation owns the following interesting properties for sensor and wireless ad hoc
networks: it can be built with localized information, the communication cost imposed by control information is
limited, and it supports geographical routing algorithms that offer guaranteed convergence. This paper presents
two localized algorithms, FLDT1 and FLDT2, that build a graph called planar localized Delaunay triangulation,
P LDel, known to be a good spanner of the Unit Disk Graph, UDG. Our algorithms improve previous algorithms
with similar theoretical bounds in the following aspects: unlike previous work, FLDT1 and FLDT2 build P LDel
in a single communication step, maintaining a communication cost of O(n log n), which is within a constant of
the optimal. Additionally, we show that FLDT1 is more robust than previous triangulation algorithms, because it
does not require the strict UDG connectivity model to work. The small signaling cost of our algorithms allows us
to improve routing performance, by efficiently using the P LDel graph instead of sparser graphs, like the Gabriel
or the Relative Neighborhood graphs.2006-01-01T00:00:00Z