Anastasios Gkaravelis

Anastasios Gkaravelis

Auto-generated profile, based on publicly available information

Anastasios Gkaravelis

Department of Informatics Athens University of Economics and Business Greece

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 May 2023 in Computer Graphics Forum
Verified
Journal Article
Open access
NVN. Vitsas
N. Vitsas
IEI. Evangelou
I. Evangelou
GPG. Papaioannou
G. Papaioannou
AGA. Gkaravelis
A. Gkaravelis
Oriented bounding box (OBB) hierarchies can be used instead of hierarchies based on axis‐aligned bounding boxes (AABB), providing tighter fitting to the underlying geometric structures and resulting in improved interference tests, such as ray‐geometry intersections. In this paper, we present a method for the fast, parallel transformation of an existing bounding volume hierarchy (BVH), based on AABBs, into a hierarchy based on oriented bounding boxes. To this end, we parallelise a high‐quality OBB extraction algorithm from the literature to operate as a standalone OBB estimator and further extend it to efficiently build an OBB hierarchy in a bottom up manner. This agglomerative approach allows for fast parallel execution and the formation of arbitrary, high‐quality OBBs in bounding volume hierarchies. The method is fully implemented on the GPU and extensively evaluated with ray intersections.

6 May 2016 in The Visual Computer
Verified
Journal Article
Closed access
PDF file
AGAnastasios Gkaravelis
Anastasios Gkaravelis
GPGeorgios Papaioannou
Georgios Papaioannou

1 May 2020 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
NVN. Vitsas
N. Vitsas
GPG. Papaioannou
G. Papaioannou
AGA. Gkaravelis
A. Gkaravelis
AVA. A. Vasilakis
A. A. Vasilakis

1 December 2023 in Virtual Reality & Intelligent Hardware
Verified
Journal Article
Open access
NVNick Vitsas
Nick Vitsas
IEIordanis Evangelou
Iordanis Evangelou
GPGeorgios Papaioannou
Georgios Papaioannou
AGAnastasios Gkaravelis
Anastasios Gkaravelis

24 July 2023 in The Visual Computer
Verified
Journal Article
Open access
PDF file
IEIordanis Evangelou
Iordanis Evangelou
GPGeorgios Papaioannou
Georgios Papaioannou
KVKonstantinos Vardis
Konstantinos Vardis
AGAnastasios Gkaravelis
Anastasios Gkaravelis
Spatial data structures, such as k-d trees and bounding volume hierarchies, are extensively used in computer graphics for the acceleration of spatial queries in ray tracing, nearest neighbour searches and other tasks. Typically, the splitting strategy employed during the construction of such structures is based on the greedy evaluation of a predefined objective function, resulting in a less than optimal subdivision scheme. In this work, for the first time, we propose the use of unsupervised deep learning to infer the structure of a fixed-depth k-d tree from a constant, subsampled set of the input primitives, based on the recursive evaluation of the cost function at hand. This results in high-quality upper spatial hierarchy, inferred in constant time and without paying the intractable price of a fully recursive tree optimisation. The resulting fixed-depth tree can then be further expanded, in parallel, into either a full k-d tree or transformed into a bounding volume hierarchy, with any known conventional tree builder. The approach is generic enough to accommodate different cost functions, such as the popular surface area and volume heuristics. We experimentally validate that the resulting hierarchies have competitive traversal performance with respect to established tree builders, while maintaining minimal overhead in construction times.

29 June 2026 in Multimedia Tools and Applications
Verified
Journal Article
Open access
PDF file
VKVasileios Ektor Kotsis-Panakakis
Vasileios Ektor Kotsis-Panakakis
IEIordanis Evangelou
Iordanis Evangelou
FBFotios Bistas
Fotios Bistas
AVAndreas A. Vasilakis
Andreas A. Vasilakis
GPGeorgios Papaioannou
Georgios Papaioannou
NVNikolaos Vitsas
Nikolaos Vitsas
Real-time holographic communication enables immersive remote interaction by transmitting dynamic three-dimensional representations of users and environments, providing a stronger sense of presence than conventional video conferencing. However, the high data throughput requirements of volumetric streaming introduce challenges related to bandwidth variability and heterogeneous device capabilities. This paper presents an end-to-end system for scalable, real-time holographic telepresence, designed to operate within a fixed volumetric data transmission budget. The proposed approach combines importance-driven and semantic-aware filtering to preserve perceptually and interaction-critical details, while degrading less relevant data. We also leverage gesture recognition to automatically identify and emphasize points of interest, enhancing interactivity and realism. Experimental results demonstrate high visual fidelity and responsive performance with low bandwidth requirements, enabling efficient holographic communication for diverse use cases across different platforms.