Texture Mapping
Haindl, Michal · Digital Repository (National Repository of Grey Literature) · 1998
Cited by 0
Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 7,542 papers for “Texture mapping”
Haindl, Michal · Digital Repository (National Repository of Grey Literature) · 1998
Cited by 0
R.J. Whitrow · 2007
Cited by 0
Zdeněk Strach · Digital Repository (National Repository of Grey Literature)
In this master's thesis I'm engaged in problematic of texture mapping in ray tracing. Ray tracing is shortly described in the beginning. Texture mapping methods are described then, solid textures first and 2D textures follow. Implementation of MIP map method is deeply described in next chapters. The results are evaluated at the end.
Cited by 0
Michal Haindl · Digital Repository (National Repository of Grey Literature) · 1998
Cited by 0
Zdeněk Strach · Digital Repository (National Repository of Grey Literature)
In this master's thesis I'm engaged in problematic of texture mapping in ray tracing. Ray tracing is shortly described in the beginning. Texture mapping methods are described then, solid textures first and 2D textures follow. Implementation of MIP map method is deeply described in next chapters. The results are evaluated at the end.
Cited by 0
Samuel R. Buss · Cambridge University Press eBooks · 2003
Texture mapping, in its simplest form, consists of applying a graphics image, a picture, or a pattern to a surface. A texture map can, for example, apply an actual picture to a surface such as a label on a can or a picture on a billboard or can apply semirepetitive patterns such as wood grain or stone surfaces. More generally, a texture map can hold any kind of information that affects the appearance of a surface: the texture map serves as a precomputed table, and the texture mapping then consists simply of table lookup to retrieve the information affecting a particular point on the surface as it is rendered. If you do not use texture maps, your surfaces will either be rendered as very smooth, uniform surfaces or will need to be rendered with very small polygons so that you can explicitly specify surface properties on a fine scale.
Cited by 0
Strach, Zdeněk · Brno University of Technology Digital Library (Brno University of Technology)
Diplomový projekt se zabývá problematikou mapování textur v zobrazovací metodě "ray tracing". V úvodu práce je stručně popsána metoda "ray tracing" a metody mapování textur, nejprve procedurálních a později 2D. Následující kapitoly se zabývají implementací MIP mappingu a zhodnocením výsledků.
Cited by 0
Claude E. Borg · 2012
Digital technology for measuring and recording three-dimensional shapes of low morphological complexity (primarily planes), as in the case of architectural buildings, offers a lasting and virtually faithful record that can be used by future researchers. This paper compares the results between two systems. An integrated hybrid system that maximises the data collection capacity of three systems; the laser scanner, photogrammetry and the theodolite ( = thealasermetry) and a second system which develops a methodology that attempts to fulfil a number of the functions of thealasermetry with less human resources and with less equipment. Co ordination on site and during the post processing period for thealasermetry is indispensable while the mono laser system in study can be used by one individual. The Malta Centre for Restoration has applied both techniques in a survey of a barrel vault after a previous case study. The mono laser system resulted in a more cost-effective and less time consuming project. The system also overcomes the metric error propagation and improves resolution of texture mapping compared to the traditional use of laser scanning.
Cited by 0
TOM McREYNOLDS, Duncan A. J. Blythe · Elsevier eBooks · 2005
Cited by 0
Arisut, Omer · Calhoun: The Naval Postgraduate School Institutional Archive (Naval Postgraduate School) · 2002
M-I-P-C
Cited by 0
Prof Emmanuel Agu · 2012
li � � Although graphics cards can render over 10 million polygons per second, that number is insufficient for many phenomena
Cited by 0
Song De, Hong Lin · Eurographics · 1988
Texture mapping is one of the most important techniques for highquality image synthesis. It can enhance immensely the visual richness of raster-scan images. We address in this paper the problem of mapping planar texture pattern onto arbitrarily curved surfaces. It is well known that such a mapping will inevitably produce distortion for any undevelopable surface. Although many techniques for texture mapping have been presented in the literature [1], to our knowledge, no general method existed which could control or minimize this distortion. We present in this paper a new method for texture mapping. The main idea is to develop the given curved surface approximately on a two-dimensional plane using an approximate locally isometric mapping while minimizing the distortion by an optimization technique. Our experience has shown that by using this technique, one can reduce considerably the distortion and thus improve the quality of the generated images.
Cited by 51Open access
T MCREYNOLDS, D BLYTHE · Elsevier eBooks · 2005
Cited by 0
Jos Stam · 1997
In this paper we introduce a new technique to texture surfaces. Our approach has the advantage that the texture does not have to be computed at each point of the surface. Rather, we precompute a small set of texture maps which we then map aperiodically onto the surface. The algorithm borrows from recent mathematical results in the area of aperiodic tilings of the plane. To demonstrate the feasibility of the method we apply it to the rendering of water surfaces and caustics.
Cited by 0
Raditya, Marco Triantoro · DR-NTU (Nanyang Technological University) · 2010
Texture mapping adds visual details to enhance realism of three-dimensional model. For most area in computer graphics, it is important to ensure the correspondence of the texture details with the features of the model. Therefore, there is a need of software to perform such task. In this project, our challenge is to map a two-dimensional texture into a three-dimensional model based on user-defined constraints in position for some features. We propose a solution by flattening the model into two-dimensional first, and then applying transformation to a texture image such that it will fit into the flattened model. Some investigations on the state-of-the-art techniques and algorithms used for model flattening and image warping had been done. Subsequently, we built our FLATTENING and WARPING program using C++ programming language for experimental purpose. Our proposed method works with a human face of size 3614 polygon counts in approximately 2 minutes. We managed to achieve average error rate of 0.226873 distance units per vertex with no overlapping terms. From the result, it can be concluded that the algorithms used in our method produce a good performance. Therefore, the proposed method is suitable for texture mapping with constraints in features location.
Cited by 0
Hussein Yahia, Anne Verroust, See Profile et al. · 1993
All in-text\treferences\tunderlined\tin\tblue\tare\tlinked\tto\tpublications\ton\tResearchGate, letting you\taccess\tand\tread\tthem\timmediately.
Cited by 0
Yochay Tzur · 2009
Cited by 0
Journal of International Crisis and Risk Communication Research · 2008
Designing and rendering translucent material requires a faithful description of its aspects as well as a realistic simulation of its interaction with light. A new method for modeling and rendering complex organic materials made up of multiple layers of variable thickness uses simple texture-mapping principles and a single-scattering computation.
Cited by 0Open access
2003
Cited by 0
Eugene Fiume, Alain Fournier, V. Canale · Eurographics · 1987
A new class of geometric mappings is introduced to computer graphics, and the utility of this class is illustrated by applying it to texture mapping. When mapping a texture onto a surface such as a polygon, the entire texture can rarely be mapped without some clipping or non-linear transformation. Is it possible to map a texture bijectively to an arbitrary polygon such that the entire texture is mapped? This paper presents a solution to this problem. A new class of mapping techniques based on conformal mapping is proposed. The technique allows one to construct a continuous, bijective map from a polygonal texture space (e.g., a square) to an arbitrary convex polygon. The resulting map is texture-independent. The theory and .an implementation of conformal texture mapping is discussed, and several simple filtering techniques to support it are outlined. Conformal mapping extends the range of geometric mapping techniques, and is pertinent to many areas of computer graphics. Other examples of the potential utility of conformal mappings are also discussed.
Cited by 18Open access