Volume 29 (2010): Recent submissions
Now showing items 21-40 of 259
-
Metalights: Improved Interleaved Shading
(The Eurographics Association and Blackwell Publishing Ltd, 2010)We present metalights, a novel Virtual Point Light (VPL) encapsulating structure which enhances classic interleaved shading by improving VPL sampling, based on few initial screen space samples to estimate VPL contribution ... -
Condenser-Based Instant Reflectometry
(The Eurographics Association and Blackwell Publishing Ltd, 2010)We present a technique for rapid capture of high quality bidirectional reflection distribution functions(BRDFs) of surface points. Our method represents the BRDF at each point by a generalized microfacet model with tabulated ... -
Modeling of Clouds from a Single Photograph
(The Eurographics Association and Blackwell Publishing Ltd, 2010)In this paper, we propose a simple method for modeling clouds from a single photograph. Our method can synthesize three types of clouds: cirrus, altocumulus, and cumulus. We use three different representations for each ... -
Modeling Complex Unfoliaged Trees from a Sparse Set of Images
(The Eurographics Association and Blackwell Publishing Ltd, 2010)We present a novel image-based technique for modeling complex unfoliaged trees. Existing tree modeling tools either require capturing a large number of views for dense 3D reconstruction or rely on user inputs and botanic ... -
Video Painting via Motion Layer Manipulation
(The Eurographics Association and Blackwell Publishing Ltd, 2010)Temporal coherence is an important problem in Non-Photorealistic Rendering for videos. In this paper, we present a novel approach to enhance temporal coherence in video painting. Instead of painting on video frame, our ... -
Efficient Mean-shift Clustering Using Gaussian KD-Tree
(The Eurographics Association and Blackwell Publishing Ltd, 2010)Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional and large data set clustering. In this ... -
Instant Propagation of Sparse Edits on Images and Videos
(The Eurographics Association and Blackwell Publishing Ltd, 2010)The ability to quickly and intuitively edit digital contents has become increasingly important in our everyday life. We propose a novel method for propagating a sparse set of user edits (e.g., changes in color, brightness, ... -
Dirichlet Harmonic Shape Compression with Feature Preservation for Parameterized Surfaces
(The Eurographics Association and Blackwell Publishing Ltd, 2010)With the rapid advancement of 3D scanning devices, large and complicated 3D shapes are becoming ubiquitous, and require large amount of resources to store and transmit them efficiently. This makes shape compression a ... -
Feature Oriented Progressive Lossless Mesh Coding
(The Eurographics Association and Blackwell Publishing Ltd, 2010)A feature-oriented generic progressive lossless mesh coder (FOLProM) is proposed to encode triangular meshes with arbitrarily complex geometry and topology. In this work, a sequence of levels of detail (LODs) are generated ... -
Binary Orientation Trees for Volume and Surface Reconstruction from Unoriented Point Clouds
(The Eurographics Association and Blackwell Publishing Ltd, 2010)Given a complete unoriented point set, we propose a binary orientation tree (BOT) for volume and surface representation, which roughly splits the space into the interior and exterior regions with respect to the input point ... -
Least Squares Subdivision Surfaces
(The Eurographics Association and Blackwell Publishing Ltd, 2010)The usual approach to design subdivision schemes for curves and surfaces basically consists in combining proper rules for regular configurations, with some specific heuristics to handle extraordinary vertices. In this ... -
Frontmatter PG 2010
(The Eurographics Association and Blackwell Publishing Ltd, 2010) -
Signing the Unsigned: Robust Surface Reconstruction from Raw Pointsets
(2010)We propose a modular framework for robust 3D reconstruction from unorganized, unoriented, noisy, and outlierridden geometric data. We gain robustness and scalability over previous methods through an unsigned distance ... -
Multi-scale Geometric Modeling of Ambiguous Shapes with Toleranced Balls and Compoundly Weighted a-shapes
(2010)Dealing with ambiguous data is a challenge in Science in general and geometry processing in particular. One route of choice to extract information from such data consists of replacing the ambiguous input by a continuum, ... -
Localized Delaunay Refinement for Sampling and Meshing
(2010)The technique of Delaunay renement has been recognized as a versatile tool to generate Delaunay meshes of a variety of geometries. Despite its usefulness, it suffers from one lacuna that limits its application. It does not ... -
Moebius Transformations For Global Intrinsic Symmetry Analysis
(2010)The goal of our work is to develop an algorithm for automatic and robust detection of global intrinsic symmetries in 3D surface meshes. Our approach is based on two core observations. First, symmetry invariant point sets ... -
On Discrete Killing Vector Fields and Patterns on Surfaces
(2010)Symmetry is one of the most important properties of a shape, unifying form and function. It encodes semantic information on one hand, and affects the shape's aesthetic value on the other. Symmetry comes in many flavors, ... -
Closed-form Blending of Local Symmetries
(2010)We present a closed-form solution for the symmetrization problem, solving for the optimal deformation that reconciles a set of local bilateral symmetries. Given as input a set of point-pairs which should be symmetric, we ... -
Designing Quad-dominant Meshes with Planar Faces
(2010)We study the combined problem of approximating a surface by a quad mesh (or quad-dominant mesh) which on the one hand has planar faces, and which on the other hand is aesthetically pleasing and has evenly spaced vertices. ... -
Fast Generation of Pointerless Octree Duals
(2010)Geometry processing applications frequently rely on octree structures, since they provide simple and efficient hierarchies for discrete data. However, octrees do not guarantee direct continuous interpolation of this data ...