Real-time Terrain Mapping

We present an interactive, real-time mapping system for digital elevation maps (DEMs), which allows Earth scientists to map and therefore understand the deformation of the continental crust at length scales of 10m to 1000km. Our system visualizes the surface of the Earth as a 3D~surface generated from a DEM, with a color texture generated from a registered multispectral image and vector-based mapping elements draped over it. We use a quadtree-based multiresolution method to be able to render high-resolution terrain mapping data sets of large spatial regions in real time. The main strength of our system is the combination of interactive rendering and interactive mapping directly onto the 3D~surface, with the ability to navigate the terrain and to change viewpoints arbitrarily during mapping. User studies and comparisons with commercially available mapping software show that our system improves mapping accuracy and efficiency, and also enables qualitatively different observations that are not possible to make with existing systems

Query-by-Pointing: Algorithms and Pointing Error Compensation

People typically communicate by pointing, talking, sketching, writing, and typing. Pointing can be used to visualize or exchange information about an object when there is no other mutually understood way of communication. Despite its proven expressiveness, however, it has not yet become a frequently used modality to interact with computer systems. With the rapid move towards the adoption of mobile technologies, geographic information systems (GISs) have a particular need for advanced forms of interaction that enable users to query the geographic world directly. To enable pointing-based query system on a handheld device, a number of fundamental technical challenges have to be overcome. For such a system to materialize we need models stored in the device\u27s knowledge base that can be used as surrogate of real world objects. These computations, however, assume that (1) the pointing direction matches with the line-of-sight and (2) the observations about location and direction are precise enough so that a computational model will determine the same object as what the user points at. Both assumptions are not true. This thesis, therefore, develops an efficient error compensation model to reduce the discrepancy between the line-of-sight of the eye and the pointer direction. The model is based on a coordinate system centered at the neck and distances measured from neck to eye, neck to shoulder, shoulder to handheld pointer, and the pointing direction. An experiment was conducted using a gyro-enhanced sensor and three subjects who pointed at marked targets in a given room. It showed that the error compensation algorithm significantly reduces errors in pointing with arms outstretched

Shadow mapping algorithms: Applications and limitations

This study provides an overview of popular and famous algorithms and techniques in shadow maps generation.Well- known techniques in shadow maps generation is described detail, along with a discussion of the advantages and drawbacks of each. Basic ideas, improvements and future works of the techniques are also comprehensively summarized and analyzed in depth. Often, programmers have difficulty selecting an appropriate shadow generation algorithm that is specific to their purpose. We have classified and systemized these techniques. The main goal of this paper is to provide researchers with background on a variety of shadow mapping techniques so as make it easier for them to choose the method best suited to their aims. It is al-so hoped that our analysis will help researchers find solutions to the shortcomings of each technique. © 2015 NSP Natural Sciences Publishing Co

Visibility computation through image generalization

This dissertation introduces the image generalization paradigm for computing visibility. The paradigm is based on the observation that an image is a powerful tool for computing visibility. An image can be rendered efficiently with the support of graphics hardware and each of the millions of pixels in the image reports a visible geometric primitive. However, the visibility solution computed by a conventional image is far from complete. A conventional image has a uniform sampling rate which can miss visible geometric primitives with a small screen footprint. A conventional image can only find geometric primitives to which there is direct line of sight from the center of projection (i.e. the eye) of the image; therefore, a conventional image cannot compute the set of geometric primitives that become visible as the viewpoint translates, or as time changes in a dynamic dataset. Finally, like any sample-based representation, a conventional image can only confirm that a geometric primitive is visible, but it cannot confirm that a geometric primitive is hidden, as that would require an infinite number of samples to confirm that the primitive is hidden at all of its points. ^ The image generalization paradigm overcomes the visibility computation limitations of conventional images. The paradigm has three elements. (1) Sampling pattern generalization entails adding sampling locations to the image plane where needed to find visible geometric primitives with a small footprint. (2) Visibility sample generalization entails replacing the conventional scalar visibility sample with a higher dimensional sample that records all geometric primitives visible at a sampling location as the viewpoint translates or as time changes in a dynamic dataset; the higher-dimensional visibility sample is computed exactly, by solving visibility event equations, and not through sampling. Another form of visibility sample generalization is to enhance a sample with its trajectory as the geometric primitive it samples moves in a dynamic dataset. (3) Ray geometry generalization redefines a camera ray as the set of 3D points that project at a given image location; this generalization supports rays that are not straight lines, and enables designing cameras with non-linear rays that circumvent occluders to gather samples not visible from a reference viewpoint. ^ The image generalization paradigm has been used to develop visibility algorithms for a variety of datasets, of visibility parameter domains, and of performance-accuracy tradeoff requirements. These include an aggressive from-point visibility algorithm that guarantees finding all geometric primitives with a visible fragment, no matter how small primitive\u27s image footprint, an efficient and robust exact from-point visibility algorithm that iterates between a sample-based and a continuous visibility analysis of the image plane to quickly converge to the exact solution, a from-rectangle visibility algorithm that uses 2D visibility samples to compute a visible set that is exact under viewpoint translation, a flexible pinhole camera that enables local modulations of the sampling rate over the image plane according to an input importance map, an animated depth image that not only stores color and depth per pixel but also a compact representation of pixel sample trajectories, and a curved ray camera that integrates seamlessly multiple viewpoints into a multiperspective image without the viewpoint transition distortion artifacts of prior art methods

PolySurface:a design approach for rapid prototyping of shape-changing displays using semi-solid surfaces

We present a design approach for rapid fabrication of high fidelity interactive shape-changing displays using bespoke semi-solid surfaces. This is achieved by segmenting virtual representations of the given data and mapping it to a dynamic physical polygonal surface. First, we establish the design and fabrication approach for generating semi-solid reconfigurable surfaces. Secondly, we demonstrate the generalizability of this approach by presenting design sessions using datasets provided by experts from a diverse range of domains. Thirdly, we evaluate user engagement with the prototype hardware systems that are built. We learned that all participants, all of whom had no previous interaction with shape-changing displays, were able to successfully design interactive hardware systems that physically represent data specific to their work. Finally, we reflect on the content generated to understand if our approach is effective at representing intended output based on a set of user defined functionality requirements