SwePub
Tyck till om SwePub Sök här!
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "LAR1:hig ;pers:(Hast Anders)"

Sökning: LAR1:hig > Hast Anders

  • Resultat 21-30 av 60
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
21.
  •  
22.
  •  
23.
  •  
24.
  •  
25.
  • Hast, Anders (författare)
  • Geometry of fibers with varying topology
  • 2006
  • Ingår i: Extended abstract in Proceedings of the 9th Conference “Geometry and Computer”. ; , s. 25-26
  • Konferensbidrag (övrigt vetenskapligt/konstnärligt)abstract
    • Anisotropic shading techniques can be used for materials like hair and silk. Such materials have a surface consisting of very small fibers having a main direction. Geometrically each fiber can be viewed as a cylinder. Poulin and Fournier proposed an illumination model for such materials using a flat topology only. In the paper a model using a varying topology is described. The varying topology is a more correct model and visible differences are clearly apparent.
  •  
26.
  • Hast, Anders (författare)
  • Geometry of fibers with varying topology
  • 2007
  • Ingår i: The Journal of Polish Society for Geometry and Engineering Graphics. ; 16, s. 5-10
  • Tidskriftsartikel (övrigt vetenskapligt/konstnärligt)
  •  
27.
  • Hast, Anders, 1966- (författare)
  • Improved Algorithms for Fast Shading and Lighting
  • 2004
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • Shading is a technique that is used in computer graphics to make faceted objects appear smooth and more realistic. In the research presented in this thesis we have investigated how shading can be generated as efficiently as possible without sacrificing quality.In the classical approach to high quality shading proposed by Phong, the illumination equation is computed per pixel using an interpolated normal. The normals at the vertices are bi-linearly interpolated over the polygon to obtain a normal per pixel. Correct shading requires normalization of these normals, which is computationally demanding involving a square root. In our research we have shown how this normalization can be eliminated through the use of spherical interpolation and the Chebyshev recurrence formula, reducing the calculation to a few single arithmetic operations per pixel.Still a substantial setup operation is needed for each scanline. We have studied how also this can be made more efficient, with some limited progress so far. An alternative approach is to do the most of the setup on polygon level and incrementally compute the setup needed per scanline. In particular, we have studied quadratic shading approaches, i.e. fitting second degree surfaces to the polygons. The most successful approach has been through what we have called X-shading, where the setup is calculated by using an efficient approximation for the mid-edge normals. This setup is about four times faster than previously known methods.In the process of studying shading methods we have also made some contributions to improving bump-mapping and simulation of different kinds of light sources.The developed methods will be of interest in future generations of computer graphics software and hardware systems, ranging from high end systems to generate realistic movies and 3D games, to handheld devices such as mobile phones with graphics displays.
  •  
28.
  •  
29.
  • Hast, Anders, et al. (författare)
  • Improved Diffuse Anisotropic Shading
  • 2004
  • Ingår i: Sigrad Conference 2004. ; , s. 57-58, s. 57-58
  • Konferensbidrag (övrigt vetenskapligt/konstnärligt)
  •  
30.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 21-30 av 60

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy