In this paper we abandon the regular structure of shadow maps. Instead, we transform the visible pixels P(x,y,z) from screen space to the image plane of a light source P′(x′,y′,z′). The (x′,y′) are then used as sampling points when the geometry is rasterized into the shadow map. This eliminates the resolution issues that have plagued shadow maps for decades, e.g., jagged shadow boundaries. Inco...

part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for proot or commercial advantage and that copies bear this notice and the full citation on the rst page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers,...

In this paper we present a surprisingly simple reduction of the program dependence problem to the may-alias problem. While both problems are undecidable, providing a bridge between them has great practical importance. Program dependence information is used extensively in compiler optimizations, automatic program parallelizations, code scheduling in super-scalar machines, and in software enginee...

Recent studies have shown that the ability of disambiguating memory addresses (often referred to as alias analysis) gives concrete performance benefits to the compilation of C code for VLIW machines. This experimental research studies which factors, though external to alias analysis, strongly determine its impact on the performance of compiled code. These factors belong to two categories: archi...

Internet topology mapping studies utilize large scale topology maps to analyze various characteristics of the Internet. IP alias resolution, the task of mapping IP addresses to their corresponding routers, is an important task in building such topology maps. In this paper, we present a new probe-based IP alias resolution tool called palmtree. Palmtree can be used to complement the existing sche...

In this paper we present a surprisingly simple reduction of the program dependence problem to the may-alias problem. While both problems are undecid-able, providing a reduction between them has great practical importance. Program dependence information is used extensively in compiler optimizations, automatic program parallelizations, code scheduling in super-scalar machines, and in software eng...

In this paper we study the usefulness of different local and global, learning-based, single-frame image super-resolution reconstruction techniques in handling three specific tasks, namely, de-blurring, de-noising and alias removal. We start with the global, iterative Papoulis–Gerchberg method for super-resolving a scene. Next we describe a PCA-based global method which faithfully reproduces a s...