• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 1,471,348
Next 10 →

An Efficient Representation for Surface Details

by Programa De, Pós-graduação Em, Ciência Da Computação, Manuel M. Oliveira, Fabio Policarpo, Paralelo Computação, Manuel M. Oliveira, Fabio Policarpo, Paralelo Computação , 2005
"... This paper describes an efficient representation for real-time mapping and rendering of surface details onto arbitrary polygonal models. The surface details are informed as depth maps, leading to a technique with very low memory requirements and not involving any changes of the model’s original geom ..."
Abstract - Add to MetaCart
This paper describes an efficient representation for real-time mapping and rendering of surface details onto arbitrary polygonal models. The surface details are informed as depth maps, leading to a technique with very low memory requirements and not involving any changes of the model’s original

Rendering surface details with diffusion curves

by Stefan Jeschke, David Cline, Peter Wonka - ACM Trans. Graphics , 2009
"... Figure 1: Real-time diffusion curve renderings. (Left) The inlay ornaments on the vase and bowl show the sharp detail available with diffusion curve textures. (Right) The crisp displacement boundaries on the stone plate and obelisk result from our dynamic feature embedding. Diffusion curve images (D ..."
Abstract - Cited by 8 (0 self) - Add to MetaCart
. This paper extends the application of diffusion curves to render high quality surface details on 3D objects. The first extension is a view dependent warping technique that dynamically reallocates texture space so that object parts that appear large on screen get more texture for increased detail. The second

Surface Simplification Using Quadric Error Metrics

by Michael Garland, Paul S. Heckbert
"... Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface simplifi ..."
Abstract - Cited by 1178 (14 self) - Add to MetaCart
Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface

Reflectance and texture of real-world surfaces

by Kristin J. Dana, Bram van Ginneken, Shree K. Nayar, Jan J. Koenderink - ACM TRANS. GRAPHICS , 1999
"... In this work, we investigate the visual appearance of real-world surfaces and the dependence of appearance on scale, viewing direction and illumination direction. At ne scale, surface variations cause local intensity variation or image texture. The appearance of this texture depends on both illumina ..."
Abstract - Cited by 586 (23 self) - Add to MetaCart
In this work, we investigate the visual appearance of real-world surfaces and the dependence of appearance on scale, viewing direction and illumination direction. At ne scale, surface variations cause local intensity variation or image texture. The appearance of this texture depends on both

A Signal Processing Approach To Fair Surface Design

by Gabriel Taubin , 1995
"... In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals -- functions defined on polyhedral surfaces of arbitrary topology --, we reduce the problem of surface smoothing, or fai ..."
Abstract - Cited by 668 (15 self) - Add to MetaCart
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier analysis to two-dimensional discrete surface signals -- functions defined on polyhedral surfaces of arbitrary topology --, we reduce the problem of surface smoothing

The self-duality equations on a Riemann surface

by N. J. Hitchin - Proc. Lond. Math. Soc., III. Ser , 1987
"... In this paper we shall study a special class of solutions of the self-dual Yang-Mills equations. The original self-duality equations which arose in mathematical physics were defined on Euclidean 4-space. The physically relevant solutions were the ones with finite action—the so-called 'instanton ..."
Abstract - Cited by 524 (6 self) - Add to MetaCart
In this paper we shall study a special class of solutions of the self-dual Yang-Mills equations. The original self-duality equations which arose in mathematical physics were defined on Euclidean 4-space. The physically relevant solutions were the ones with finite action—the so-called 'instantons'. The same equations may be

Marching cubes: A high resolution 3D surface construction algorithm

by William E. Lorensen, Harvey E. Cline - COMPUTER GRAPHICS , 1987
"... We present a new algorithm, called marching cubes, that creates triangle models of constant density surfaces from 3D medical data. Using a divide-and-conquer approach to generate inter-slice connectivity, we create a case table that defines triangle topology. The algorithm processes the 3D medical d ..."
Abstract - Cited by 2675 (4 self) - Add to MetaCart
data in scan-line order and calculates triangle vertices using linear interpolation. We find the gradient of the original data, normalize it, and use it as a basis for shading the models. The detail in images produced from the generated surface models is the result of maintaining the inter

Iterative point matching for registration of free-form curves and surfaces

by Zhengyou Zhang , 1994
"... A heuristic method has been developed for registering two sets of 3-D curves obtained by using an edge-based stereo system, or two dense 3-D maps obtained by using a correlation-based stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract - Cited by 659 (7 self) - Add to MetaCart
, which is required for environment modeling (e.g., building a Digital Elevation Map). Objects are represented by a set of 3-D points, which are considered as the samples of a surface. No constraint is imposed on the form of the objects. The proposed algorithm is based on iteratively matching points

2003: Global analyses of sea surface temperature, sea ice, and night marine air temperature since the late Nineteenth Century

by N. A. Rayner, D. E. Parker, E. B. Horton, C. K. Foll, L. V. Alex, D. P. Rowell, A. Kaplan - J. Geophysical Research
"... data set, HadISST1, and the nighttime marine air temperature (NMAT) data set, HadMAT1. HadISST1 replaces the global sea ice and sea surface temperature (GISST) data sets and is a unique combination of monthly globally complete fields of SST and sea ice concentration on a 1 ° latitude-longitude grid ..."
Abstract - Cited by 517 (3 self) - Add to MetaCart
procedure, followed by superposition of quality-improved gridded observations onto the reconstructions to restore local detail. The sea ice fields are made more homogeneous by compensating satellite microwave-based sea ice concentrations for the impact of surface melt effects on retrievals in the Arctic

New empirical relationships among magnitude, rupture length, rupture width, rupture area, and surface

by Donald L. Wells , 1994
"... Abstract Source parameters for historical earthquakes worldwide are compiled to develop a series of empirical relationships among moment magnitude (M), surface rupture length, subsurface rupture length, downdip rupture width, rupture area, and maximum and average displacement per event. The resultin ..."
Abstract - Cited by 524 (0 self) - Add to MetaCart
Abstract Source parameters for historical earthquakes worldwide are compiled to develop a series of empirical relationships among moment magnitude (M), surface rupture length, subsurface rupture length, downdip rupture width, rupture area, and maximum and average displacement per event
Next 10 →
Results 1 - 10 of 1,471,348
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University