arXiv subjects

Sukanya Bhattacharjee

Publications and source records attributed to Sukanya Bhattacharjee.

4 recordsLinked to original sources

arXiv2024

Character Animation in AR: Character Animation in AR: a mobile application development study

Digital preservation of the cultural heritages is one of the major applications of various computer graphics and vision algorithms. The advancement in the AR/VR technologies is giving the cultural heritage preservation an interesting spin due to its immense visualization ability. The use of these technologies to digitally recreate heritage sites and art is becoming a popular trend. A project, called Indian Digital Heritage (IDH), for recreating the heritage site of Hampi, Karnataka during Vijaynagara empire ($1336$ - $1646$ CE) has been initiated by the Department of Science and Technology (DST) few years back. Immense work on surveying the site, collecting geographical and historic information about the life in Hampi, creating 3D models for buildings and people of Hampi and many other related tasks has been undertaken by various participants of this project. A major part of this project is to make tourists visiting Hampi visualize the life of people in ancient Hampi through any handy device. With such a requirement, the mobile AR based platform becomes a natural choice for developing any application for this purpose. We contributed to the project by developing an AR based mobile application to recreate a scene from Virupaksha Bazaar of Hampi with two components - author scene with augmented virtual contents at any scale, and visualize the same scene by reaching the physical location of augmentation. We develop an interactive application for the purpose of digitally recreating ancient Hampi. Though the focus of this work is not creating any static or dynamic content from scratch, it shows an interesting application of the content created in a real world scenario.

cs.HC↗

arXiv2024

Cube2Pipes : Investigating Hybrid Gameplay Using AR and a Tangible 3D Puzzle

We present our game, Cube2Pipes, as an attempt to investigate a unique gameplay design where we use a tangible 3D spatial puzzle, in the form of a 2X2 Rubik's Cube, as an interface to a tabletop mobile augmented reality (AR) game. The game interface adapts to user movement and interaction with both virtual and tangible elements via computer vision based tracking. This game can be seen as an instance of generic interactive hybrid systems as it involves interaction with both virtual and real, tangible elements. We present a thorough user evaluation about various aspects of the gameplay in order to answer the question as to whether hybrid gameplay involving both real and virtual interfaces and elements is more captivating and preferred by users, than standard (baseline) gameplay with only virtual elements. We use multiple industry standard user study questionnaires to try and answer this question. We also try to determine whether the game facilitates understanding of the spatial moves required to solve a Rubik's Cube, and the efficacy of a tangible puzzle interface to a tabletop AR game.

cs.HC↗

arXiv2020

Vertex Fault-Tolerant Geometric Spanners for Weighted Points

Given a set S of n points, a weight function w to associate a non-negative weight to each point in S, a positive integer k \ge 1, and a real number ε> 0, we present algorithms for computing a spanner network G(S, E) for the metric space (S, d_w) induced by the weighted points in S. The weighted distance function d_w on the set S of points is defined as follows: for any p, q \in S, d_w(p, q) is equal to w(p) + d_π(p, q) + w(q) if p \ne q, otherwise, d_w(p, q) is 0. Here, d_π(p, q) is the Euclidean distance between p and q if points in S are in \mathbb{R}^d, otherwise, it is the geodesic (Euclidean) distance between p and q. The following are our results: (1) When the weighted points in S are located in \mathbb{R}^d, we compute a k-vertex fault-tolerant (4+ε)-spanner network of size O(k n). (2) When the weighted points in S are located in the relative interior of the free space of a polygonal domain \cal P, we detail an algorithm to compute a k-vertex fault-tolerant (4+ε)-spanner network with O(\frac{kn\sqrt{h+1}}{ε^2} \lg{n}) edges. Here, h is the number of simple polygonal holes in \cal P. (3) When the weighted points in S are located on a polyhedral terrain \cal T, we propose an algorithm to compute a k-vertex fault-tolerant (4+ε)-spanner network, and the number of edges in this network is O(\frac{kn}{ε^2} \lg{n}).

cs.CG↗

arXiv2019

Fault-tolerant additive weighted geometric spanners

Let S be a set of n points and let w be a function that assigns non-negative weights to points in S. The additive weighted distance d_w(p, q) between two points p,q belonging to S is defined as w(p) + d(p, q) + w(q) if p \ne q and it is zero if p = q. Here, d(p, q) denotes the (geodesic) Euclidean distance between p and q. A graph G(S, E) is called a t-spanner for the additive weighted set S of points if for any two points p and q in S the distance between p and q in graph G is at most t.d_w(p, q) for a real number t > 1. Here, d_w(p,q) is the additive weighted distance between p and q. For some integer k \geq 1, a t-spanner G for the set S is a (k, t)-vertex fault-tolerant additive weighted spanner, denoted with (k, t)-VFTAWS, if for any set S' \subset S with cardinality at most k, the graph G \ S' is a t-spanner for the points in S \ S'. For any given real number ε> 0, we obtain the following results: - When the points in S belong to Euclidean space R^d, an algorithm to compute a (k,(2 + ε))-VFTAWS with O(kn) edges for the metric space (S, d_w). Here, for any two points p, q \in S, d(p, q) is the Euclidean distance between p and q in R^d. - When the points in S belong to a simple polygon P, for the metric space (S, d_w), one algorithm to compute a geodesic (k, (2 + ε))-VFTAWS with O(\frac{k n}{ε^{2}}\lg{n}) edges and another algorithm to compute a geodesic (k, (\sqrt{10} + ε))-VFTAWS with O(kn(\lg{n})^2) edges. Here, for any two points p, q \in S, d(p, q) is the geodesic Euclidean distance along the shortest path between p and q in P. - When the points in $S$ lie on a terrain T, an algorithm to compute a geodesic (k, (2 + ε))-VFTAWS with O(\frac{k n}{ε^{2}}\lg{n}) edges.

cs.CG↗