Konstantinos Vardis

Konstantinos Vardis

Auto-generated profile, based on publicly available information

Konstantinos Vardis

Department of Informatics, Athens University of Economics and Business, Athens, Greece

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
21 March 2017 in Journal on Computing and Cultural Heritage
Verified
Journal Article
Open access
GPGeorgios Papaioannou
Georgios Papaioannou
TSTobias Schreck
Tobias Schreck
AAAnthousis Andreadis
Anthousis Andreadis
PMPavlos Mavridis
Pavlos Mavridis
RGRobert Gregor
Robert Gregor
KVKonstantinos Vardis
Konstantinos Vardis
The problem of the restoration of broken artifacts, where large parts could be missing, is of high importance in archaeology. The typical manual restoration can become a tedious and error-prone process, which also does not scale well. In recent years, many methods have been proposed for assisting the process, most of which target specialized object types or operate under very strict constraints. We propose a digital shape restoration pipeline consisting of proven, robust methods for automatic fragment reassembly and shape completion of generic three-dimensional objects of arbitrary type. In this pipeline, first we introduce a novel unified approach for handling the reassembly of objects from heavily damaged fragments by exploiting both fracture surfaces and salient features on the intact sides of fragments, when available. Second, we propose an object completion procedure based on generalized symmetries and a complementary part extraction process that is suitable for driving the fabrication of missing geometry. We demonstrate the effectiveness of our approach using real-world fractured objects and software implemented as part of the European Union--funded PRESIOUS project, which is also available for download from the project site.

21 March 2013
Verified
Conference Paper
Open access
PDF file
KVKostas Vardis
Kostas Vardis
GPGeorgios Papaioannou
Georgios Papaioannou
AGAthanasios Gaitatzes
Athanasios Gaitatzes
Screen-space ambient occlusion and obscurance (AO) techniques have become de-facto methods for ambient light attenuation and contact shadows in real-time rendering. Although extensive research has been conducted to improve the quality and performance of AO techniques, view-dependent artifacts remain a major issue. This paper introduces Multi-view Ambient Occlusion, a generic per-fragment view weighting scheme for evaluating screen-space occlusion or obscurance using multiple, arbitrary views, such as the readily available shadow maps. Additionally, it exploits the resulting weights to perform adaptive sampling, based on the importance of each view to reduce the total number of samples, while maintaining the image quality. Multi-view Ambient Occlusion improves and stabilizes the screen-space AO estimation without overestimating the results and can be combined with a variety of existing screen-space AO techniques. We demonstrate the results of our sampling method with both open volume- and solid angle-based AO algorithms.

27 February 2016
Verified
Conference Paper
Open access
KVKostas Vardis
Kostas Vardis
AVAndreas A. Vasilakis
Andreas A. Vasilakis
GPGeorgios Papaioannou
Georgios Papaioannou
We introduce a generic method for interactive ray tracing, able to support complex and dynamic environments, without the need for precomputations or the maintenance of additional spatial data structures. Our method, which relies entirely on the rasterization pipeline, stores fragment information for the entire scene on a multiview and multilayer structure and marches through depth layers to capture both near and distant information for illumination computations. Ray tracing is efficiently achieved by concurrently traversing a novel cube-mapped A-buffer variant in image space that exploits GPU-accelerated double linked lists, decoupled storage, uniform depth subdivision and empty space skipping on a per-fragment basis. We illustrate the effectiveness and quality of our approach on path tracing and ambient occlusion implementations in scenarios, where full scene coverage is of major importance. Finally, we report on the performance and memory usage of our pipeline and compare it against GPGPU ray tracing approaches.

1 May 2020 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
AVA. A. Vasilakis
A. A. Vasilakis
KVK. Vardis
K. Vardis
GPG. Papaioannou
G. Papaioannou

14 July 2020 in The Visual Computer
Verified
Journal Article
Closed access
PDF file
IEIordanis Evangelou
Iordanis Evangelou
GPGeorgios Papaioannou
Georgios Papaioannou
KVKonstantinos Vardis
Konstantinos Vardis
AVAndreas A. Vasilakis
Andreas A. Vasilakis

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.