hig.sePublikasjoner
Endre søk
Begrens søket
12 1 - 50 of 62
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1. Barerra, Tony
    et al.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Bengtsson, Ewert
    An Alternative Model for Real-Time Rendering of Diffuse Light for Rough Materials2005Inngår i: SCCG '05 Proceedings II, 2005, s. 27-28Konferansepaper (Annet vitenskapelig)
  • 2. Barrera, T
    et al.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Bengtsson, E
    A Fast All-Integer Ellipse Discretization Algorithm2003Inngår i: Graphics Programming Methods / [ed] Jeff Lander, Hingham, Mass.: Charles River Media , 2003, s. 121-132Kapittel i bok, del av antologi (Annet vitenskapelig)
  • 3. Barrera, T
    et al.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Bengtsson, E
    A Fast and Simple All-Integer Parametric Line2003Inngår i: Graphics Programming Methods / [ed] Jeff Lander, Hingham, Mass.: Charles River Media , 2003Kapittel i bok, del av antologi (Annet vitenskapelig)
  • 4. Barrera, T
    et al.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Bengtsson, E
    Fast Near Phong-Quality Software Shading2006Inngår i: WSCG'06, 2006Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Quadratic shading has been proposed as a technique giving better results than Gouraud shading, but which is substantially faster than Phong shading. Several techniques for fitting a second order surface to six points have been proposed. We show in this paper how an approximation of the mid-edge samples can be done in a very efficient way. An approximation of the mid-edge vectors are derived. Several advantages are apparent when these vectors are put into the original formulation. First of all it will only depend on the vertex vectors. Moreover, it will simplify the setup and no extra square roots are necessary for normalizing the mid-edge vectors. The setup will be about three times faster than previous approaches. This makes quadratic shading very fast for interpolation of both diffuse and specular light, which will make it suitable for near Phong quality software renderings.

  • 5. Barrera, T
    et al.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Bengtsson, E
    Faster shading by equal angle interpolation of vectors2004Inngår i: IEEE Transactions on Visualization and Computer Graphics, ISSN 1077-2626, E-ISSN 1941-0506, Vol. 10, nr 2, s. 217-223Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    In this paper, we show how spherical linear interpolation can be used to produce shading with a quality at least similar to Phong shading at a computational effort in the inner loop that is close to that of the Gouraud method. We show how to use the Chebyshev's recurrence relation in order to compute the shading very efficiently. Furthermore, it can also be used to interpolate vectors in such a way that normalization is not necessary, which will make the interpolation very fast. The somewhat larger setup effort required by this approach can be handled through table look up techniques.

  • 6. Barrera, T
    et al.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Bengtsson, E
    Incremental Spherical Linear Interpolation2004Inngår i: Sigrad 2004, 2004, s. 7-10Konferansepaper (Fagfellevurdert)
  • 7. Barrera, T
    et al.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Bengtsson, E
    Surface Construction with Near Least Square Acceleration based on Vertex Normals on Triangular Meshes2002Inngår i: Proceedings from Sigrad 2002, 2002, s. 43-48Konferansepaper (Fagfellevurdert)
  • 8. Barrera, Tony
    et al.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Bengtsson, Ewert
    Connected Minimal Acceleration Trigonometric Curves2005Konferansepaper (Fagfellevurdert)
    Abstract [en]

    We present a technique that can be used to obtain a series of connected minimal bending trigonometric splines that will intersect any number of predefined points in space. The minimal bending property is obtained by a least square minimization of the acceleration. Each curve segment between two consecutive points will be a trigonometric Hermite spline obtained from a Fourier series and its four first terms. The proposed method can be used for a number of points and predefined tangents. The tangent length will then be optimized to yield a minimal bending curve. We also show how both the tangent direction and length can be optimized to give as smooth curves as possible. It is also possible to obtain a closed loop of minimal bending curves. These types of curves can be useful tools for 3D modelling, etc.

  • 9. Barrera, Tony
    et al.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Bengtsson, Ewert
    Minimal Acceleration Hermite Curves2005Inngår i: Game programming gems 5 / [ed] Kim Pallister, Hingham, Massachusetts: Charles River Media, inc. , 2005, s. 225-231Kapittel i bok, del av antologi (Annet (populærvitenskap, debatt, mm))
  • 10. Barrera, Tony
    et al.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Bengtsson, Ewert
    Trigonometric Splines2008Inngår i: Game Programming Gems 7, Boston: Charles River Media , 2008, s. 191-198Kapittel i bok, del av antologi (Fagfellevurdert)
  • 11. Barrera, Tony
    et al.
    Spångberg, Daniel
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Bengtsson, Ewert
    Vectorized table driven algorithms for double precision elementary functions using Taylor expansions2009Inngår i: APLIMAT 8th international conference, 2009, s. 231-246Konferansepaper (Fagfellevurdert)
    Abstract [en]

    This paper presents fast implementations of the inverse square root and arcsine, both in double precision. In single precision it is often possible to use a small table and one ordinary Newton-Raphson iteration to compute elementary functions such as the square root. In double precision a substantially larger table is necessary to obtain the desired precision, or, if a smaller table is used, the additional Newton-Raphson iterations required to obtain the precision often requires the evaluation of other expensive elementary functions. Furthermore, large tables use a lot of the cash memory that should have been used for the application code.

    Obtaining the desired precision using a small table can instead be realised by using a higher order method than the second order Newton-Raphson method. A generalization of Newton's method to higher order is Householder's method, which unfortunately often results in very complicated expressions requiring many multiplications, additions, and even divisions.

    We show how a high-order method can be used, which only requires a few extra additions and multiplications for each degree of higher order. The method starts from the Taylor expansion of the difference of the value of the elementary function and a starting guess value for each iteration. If the Taylor series is truncated after the second term, ordinary Newton iterations are obtained. In several cases it is possible to algebraically simplify the difference between the true value and the starting guess value. In those cases we show that it is advantageous to use the Taylor series to higher order to obtain the fast convergent method. Moreover, we will show how the coefficients of a Chebyshev polynomial can be fitted to give as little error as possible for the functions close to zero and in the same time reduce the terms in the Taylor expansion.

    In the paper we benchmark two example implementations of the method on the x86_64 architecture. The first is the inverse square root, where the actual table (to 12 bit precision) is provided by the processor hardware. The inverse square root is important in many application programs, including computer graphics, and explicit particle simulation codes, for instance the Monte Carlo and Molecular Dynamics methods of statistical mechanics. The other example is the arcsine function, which has a slow converging Taylor expansion and where no tables are provided by the hardware. The vectorized versions of the implementations of the inverse square root are 3.5 times faster than compiled code on the Athlon64 and about 5 times faster on the Core 2. The scalar version of the arcsine function is, depending on order and table size, between 2 and 3 times faster than the compiled code, and the vectorized version is between 3 and 4 times faster on the Athlon64, while it is between 4 and 5 times faster than the compiled version on the Core 2.

  • 12. Barrera, Tony
    et al.
    Spångberg, Daniel
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Bengtsson, Ewert
    Vectorized table driven algorithms for double precision elementary functions using Taylor expansions2009Inngår i: Aplimat - Journal of Applied Mathematics, ISSN 1337-6365, Vol. 2, nr 3, s. 171-188Artikkel i tidsskrift (Fagfellevurdert)
    Abstract [en]

    This paper presents fast implementations of the inverse square root and arcsine, both in double precision. In single precision it is often possible to use a small table and one ordinary Newton-Raphson iteration to compute elementary functions such as the square root. In double precision a substantially larger table is necessary to obtain the desired precision, or, if a smaller table is used, the additional Newton-Raphson iterations required to obtain the precision often requires the evaluation of other expensive elementary functions. Furthermore, large tables use a lot of the cash memory that should have been used for the application code.

    Obtaining the desired precision using a small table can instead be realised by using a higher order method than the second order Newton-Raphson method. A generalization of Newton's method to higher order is Householder's method, which unfortunately often results in very complicated expressions requiring many multiplications, additions, and even divisions.

    We show how a high-order method can be used, which only requires a few extra additions and multiplications for each degree of higher order. The method starts from the Taylor expansion of the difference of the value of the elementary function and a starting guess value for each iteration. If the Taylor series is truncated after the second term, ordinary Newton iterations are obtained. In several cases it is possible to algebraically simplify the difference between the true value and the starting guess value. In those cases we show that it is advantageous to use the Taylor series to higher order to obtain the fast convergent method. Moreover, we will show how the coefficients of a Chebyshev polynomial can be fitted to give as little error as possible for the functions close to zero and in the same time reduce the terms in the Taylor expansion.

    In the paper we benchmark two example implementations of the method on the x86_64 architecture. The first is the inverse square root, where the actual table (to 12 bit precision) is provided by the processor hardware. The inverse square root is important in many application programs, including computer graphics, and explicit particle simulation codes, for instance the Monte Carlo and Molecular Dynamics methods of statistical mechanics. The other example is the arcsine function, which has a slow converging Taylor expansion and where no tables are provided by the hardware. The vectorized versions of the implementations of the inverse square root are 3.5 times faster than compiled code on the Athlon64 and about 5 times faster on the Core 2. The scalar version of the arcsine function is, depending on order and table size, between 2 and 3 times faster than the compiled code, and the vectorized version is between 3 and 4 times faster on the Athlon64, while it is between 4 and 5 times faster than the compiled version on the Core 2.

  • 13.
    Carling, Eva
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap.
    Proceedings from the first Seminar on Computer Graphics and Visualization2002Rapport (Annet vitenskapelig)
  • 14. Ericsson, Martin
    et al.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Nyström, Ingela
    Interactivity, Quality and Usability: Three-Dimensional Image Studio for Uppsala2008Inngår i: SIGRAD, 2008, s. 79-80Konferansepaper (Fagfellevurdert)
  • 15.
    Ericsson, Martin
    et al.
    Uppsala universitet.
    Hast, Anders
    Högskolan i Gävle, Akademin för teknik och miljö, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad.
    Seipel, Stefan
    Högskolan i Gävle, Akademin för teknik och miljö, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad.
    A Heterogeneous Cluster framework for Computationally Heavy Visualizations2009Inngår i: Proceedings of IADIS Applied Computing 2009, 2009, s. 337-339Konferansepaper (Fagfellevurdert)
  • 16.
    Haglund, Håkan
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Andersson, Mattias
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Snow Accumulation in Real-time2002Inngår i: Proceedings from SIGRAD 2002, 2002, s. 11-15Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Whenever real-time snowfall is animated in computer games, no snow accumulation is simulated, as far as we know. Instead, so-called zero thickness is used, which means that the blanket of snow does not grow when the snowflakes reach the ground. In this paper we present a method for simulation of snow accumulation, which simulates the different stages, starting with a snow free environment and ending with a totally snow covered scene, all in real-time. The main focus is not on the physical properties of snow but on speed and visual result.

  • 17.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    A Model for Anisotropic Shading of Fibers with varying Topology2006Inngår i: SCCG'06, 2006Konferansepaper (Fagfellevurdert)
  • 18.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    An Alternative Model for Shading of Diffuse Light for Rough Materials2008Inngår i: Game Programming Gems 7 / [ed] Scott Jacobs, Boston: Charles River Media , 2008, s. 191-198Kapittel i bok, del av antologi (Annet (populærvitenskap, debatt, mm))
  • 19.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Elementary Predicates for Continuous Collision Detection,2008Inngår i: Proceedings of the 13th International Conference on Geometry and Graphics, Dresden: Technische Universität , 2008, s. 1-10Konferansepaper (Fagfellevurdert)
  • 20.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Geometry of fibers with varying topology2006Inngår i: Extended abstract in Proceedings of the 9th Conference “Geometry and Computer”, 2006, s. 25-26Konferansepaper (Annet vitenskapelig)
    Abstract [en]

    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.

  • 21.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Geometry of fibers with varying topology2007Inngår i: The Journal of Polish Society for Geometry and Engineering Graphics, Vol. 16, s. 5-10Artikkel i tidsskrift (Annet vitenskapelig)
  • 22.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Improved Textures for 3D Virtual Reconstruction and Visualization.2009Konferansepaper (Annet vitenskapelig)
  • 23.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Shading by Quaternion Interpolation2005Inngår i: WSCG '05, 2005, s. 53-56Konferansepaper (Fagfellevurdert)
  • 24.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    SIGRAD 2007: the Annual SIGRAD Conference, Special Theme: Computer Graphics in Healthcare, November 28–29, 2007, Uppsala, Sweden : conference proceedings2007Konferanseproceedings (Fagfellevurdert)
  • 25.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Solving Systems of Linear Equations using the Cross Product2006Inngår i: Game Programming Gems 6 / [ed] Michael Dickheiser, Boston, Mass.: Charles River Media, cop. , 2006Kapittel i bok, del av antologi (Annet vitenskapelig)
  • 26.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Topology Maps for Anisotropic Shading (poster)2007Inngår i: WSCG ' 2007: Posters proceedings / [ed] Vaclav Skala, Plzen: University of West Bohemia in Pilsen - Publishing Centre, 2007, s. 13-16Konferansepaper (Fagfellevurdert)
  • 27.
    Hast, Anders
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Understanding Rotations and their Applications2007Inngår i: Proceeding of 5th International Conference, Ustroń, June 2007, Silesian University of Technology , 2007Konferansepaper (Annet vitenskapelig)
  • 28.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Barrera, T
    Bengtsson, E
    A Modified Phong-Blinn Light Model for Shadowed Areas2003Inngår i: Graphics Programming Methods / [ed] Jeff Lander, Hingham, Mass.: Charles River Media , 2003, s. 231-236Kapittel i bok, del av antologi (Annet vitenskapelig)
  • 29.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Barrera, T
    Bengtsson, E
    Antialiasing for Bump Maps and a Fast Normalization Trick2003Inngår i: Graphics Programming Methods / [ed] Jeff Lander, Hingham, Mass.: Charles River Media , 2003, s. 291-298Kapittel i bok, del av antologi (Annet vitenskapelig)
  • 30.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Barrera, T
    Bengtsson, E
    Fast Intensity Distribution Functions for Soft and Hard Edged2004Inngår i: WSCG'04, Short Paper, 2004, s. 95-99Konferansepaper (Fagfellevurdert)
  • 31.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Barrera, T
    Bengtsson, E
    Fast Setup for Bilinear and Biquadratic Interpolation over Triangles2003Inngår i: Graphics Programming Methods / [ed] Jeff Lander, Hingham, Mass.: C. Hurst & Co., 2003, s. 299-314Kapittel i bok, del av antologi (Annet vitenskapelig)
  • 32.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Barrera, T
    Bengtsson, E
    Fast Specular Highlights by modifying the Phong-Blinn Model2003Inngår i: Siggraph, sketches and applications, 2003Konferansepaper (Fagfellevurdert)
  • 33.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Barrera, T
    Bengtsson, E
    Improved Bump Mapping by using Quadratic Vector Interpolation2002Inngår i: Eurographics02, 2002Konferansepaper (Fagfellevurdert)
  • 34.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Barrera, T
    Bengtsson, E
    Reconstruction Filters for Bump Mapping2002Inngår i: Second Conference for Promotion of Research in IT at New Universities and University Colleges in Sweden, 2002, s. 244-256Konferansepaper (Annet vitenskapelig)
  • 35.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Barrera, T
    Bengtsson, E
    Reconstruction Filters for Bump Mapping2002Inngår i: WSCG'02, 2002, s. 9-12Konferansepaper (Fagfellevurdert)
  • 36.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Barrera, T
    Bengtsson, E
    Shading by Spherical Linear Interpolation using De Moivre’s Formula2003Inngår i: WSCG'03, Short Paper, 2003, s. 57-60Konferansepaper (Fagfellevurdert)
  • 37.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Barrera, Tony
    Bengtsson, Ewert
    Incremental Spherical Interpolation with Quadratically Varying Angle2006Inngår i: Proceedings of the Annual SIGRAD Conference, 2006, s. 36-38Konferansepaper (Fagfellevurdert)
    Abstract [en]

    Spherical linear interpolation has got a number of important applications in computer graphics. We show how spherical interpolation can be performed efficiently even for the case when the angle vary quadratically over the interval. The computation will be fast since the implementation does not need to evaluate any trigonometric functions in the inner loop. Furthermore, no renormalization is necessary and therefore it is a true spherical interpolation. This type of interpolation, with non equal angle steps, should be useful for animation with accelerating or decelerating movements, or perhaps even in other types of applications.

  • 38.
    Hast, Anders
    et al.
    Högskolan i Gävle, Akademin för teknik och miljö, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, Datavetenskap.
    Bengtsson, Lars
    Chalmers.
    Weidendorfer, Josef
    Tech Univ Munich, Munich, Germany.
    Wu, Ren
    HP Labs, Palo Alto, CA, USA.
    UCHPC 2010: Third workshop on unConventional high performance computing2011Inngår i: Euro-Par 2010 Parallel Processing Workshops: HeteroPar, HPCC, HiBB, CoreGrid, UCHPC, HPCF, PROPER, CCPI, VHPC, Ischia, Italy, August 31–September 3, 2010, Revised Selected Papers / [ed] Guarracino, MR; Vivien, F; Traff, JL; Cannataro, M; Danelutto, M; Hast, A; Perla, F; Knupfer, A; DiMartino, B; Alexander, M, Berlin: Springer Berlin/Heidelberg, 2011, s. 327-328Konferansepaper (Annet vitenskapelig)
  • 39.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Ericsson, M
    Reiner, T
    Improved Textures for 3D Virtual Reconstruction and Visualization by a Modified Multiscale Texture Synthesis Approach2009Inngår i: ARCH-3D, 2009Konferansepaper (Fagfellevurdert)
  • 40.
    Hast, Anders
    et al.
    Högskolan i Gävle, Akademin för teknik och miljö, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, Datavetenskap.
    Ericsson, Martin
    UPPMAX, Uppsala University, Uppsala, Sweden .
    Seipel, Stefan
    Högskolan i Gävle, Akademin för teknik och miljö, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, Datavetenskap.
    Multiscale Texture Synthesis and Colourization of Greyscale Textures2010Inngår i: 18th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, WSCG 2010 - In Co-operation with EUROGRAPHICS: Full Papers Proceedings, Plzen: Union Agency Science Press , 2010, s. 55-61Konferansepaper (Fagfellevurdert)
    Abstract [en]

    The main idea presented herein is to use a multiscale texture synthesis approach in order to both colourize and upscale greyscale textures. Such textures can be vintage photos to be used in archaeological or urban 3D visualizations and obviously the colour needs to be reconstructed some way. Due to limited quality, walls etc in such 3D visualizations will appear either pixelized or blurry when the viewer approaches them on a close distance. The latter if some kind of interpolation technique is being used to reduce the pixelization. The low resolution greyscale texture and a high resolution coloured texture is used for the colourization and upscaling, which will produce a colour version of the greyscale texture with 4 times higher resolution in each upscale step. The novel idea is to use multiscale texture synthesis in HSV space for the first upscale in order to create a RGB colour image for subsequent upscaling, using either ordinary RGB multiscale texture synthesis or continue using HSV multiscale texture synthesis. These two main approaches will be compared and discussed.

  • 41.
    Hast, Anders
    et al.
    Uppsala universitet.
    Jenke, Peter
    Högskolan i Gävle, Akademin för teknik och miljö, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, Datavetenskap.
    Seipel, Stefan
    Högskolan i Gävle, Akademin för teknik och miljö, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, Datavetenskap. Uppsala universitet.
    Shortest diagonal triangulation of convex layers2013Inngår i: Proceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013, 2013, s. 424-430Konferansepaper (Fagfellevurdert)
    Abstract [en]

    One problem in the field of computational geometry is the triangulation of convex layers. The rotating caliper algorithm is an alternative to the constrained Delaunay triangulation method. We present an improved triangulation algorithm, which gives a mesh quality close to that of the Constrained Delaunay but substantially faster. Each layer will be connected to the neighboring layer by edges and from the two vertices constituting an edge the proposed algorithm will select the shortest diagonal to its next neighbors in the polygonal chain on the other side, i.e. from the outer layer to the inner layer or vice versa. We discuss quality issues regarding the rotating caliper method and some improvements to it, as well as how a Constrained Delaunay can be efficiently implemented for convex layers.

  • 42.
    Hast, Anders
    et al.
    Högskolan i Gävle, Akademin för teknik och miljö, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, Datavetenskap.
    Marchetti, A
    Retrospective Illumination Correction of Greyscale Historical Aerial Photos2011Inngår i: Proceedings of International Conference on Image Analysis and Processing, 2011, s. 275-284Konferansepaper (Fagfellevurdert)
  • 43.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Parus, Jindra
    Kolingerova, Ivana
    Smooth Shading for Soft-Body Animation of Meshes obtained by Topology Merging, using Quaternion Correction, Poster2006Inngår i: Poster, ACM SIGGRAPH / Eurographics Symposium on Computer Animation, 2006Konferansepaper (Fagfellevurdert)
  • 44.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Parus, Jindrich
    Kolingerova, Ivana
    Improved Normal Computation by Quaternion Correction2008Inngår i: Aplimat - Journal of applied mathematics, ISSN 1337-6365, Vol. 1, nr 2, s. 217-225Artikkel i tidsskrift (Fagfellevurdert)
  • 45.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Parus, Jindrich
    Kolingerova, Ivana
    Improved Normal Computation by Quaternion Correction2008Inngår i: APLIMAT 7:th international conference 2008., 2008, s. 829-837Konferansepaper (Fagfellevurdert)
  • 46.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Romanyuk, A
    Lyashenko, Y
    A Comparison of Different Approaches to the Setup for Shading Algorithms2008Inngår i: Information technologies and computer engineering (International scientific and technical Journal VNTU), Vol. 11, nr 1, s. 202-208Artikkel i tidsskrift (Fagfellevurdert)
  • 47.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Romanyuk, A
    Lyashenko, Y
    Models that use Logarithmic and Power Functions2008Inngår i: IES The Sixth International Conference 'INTERNET - EDUCATION - SCIENCE', 2008, s. 538-542Konferansepaper (Annet vitenskapelig)
  • 48.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Weidendorfer, Josef
    Computing Frontiers 2009: UCHPC-MAW '09: Proceedings of the combined workshops on UnConventional high performance computing workshop plus memory access workshop2009Konferanseproceedings (Annet vitenskapelig)
  • 49.
    Hast, Anders
    et al.
    Högskolan i Gävle, Akademin för teknik och miljö, Avdelningen för Industriell utveckling, IT och Samhällsbyggnad, Datavetenskap.
    Weidendorfer, Josef
    Tech Univ Munich, Munich, Germany.
    Weiss, Jan-Philipp
    Karlsruhe Inst Technol, Karlsruhe, Germany.
    UCHPC 2011: Fourth Workshop on UnConventional High Performance Computing2012Inngår i: EURO-PAR 2011: PARALLEL PROCESSING WORKSHOPS, PT II, Berlin: Springer Berlin/Heidelberg, 2012, s. 333-334Konferansepaper (Fagfellevurdert)
  • 50.
    Hast, Anders
    et al.
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Wesslén, Daniel
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Seipel, Stefan
    Högskolan i Gävle, Institutionen för matematik, natur- och datavetenskap, Ämnesavdelningen för datavetenskap.
    Improved Diffuse Anisotropic Shading2004Inngår i: Proceedings of the Annual SIGRAD Conference, 2004, s. 57-58Konferansepaper (Fagfellevurdert)
12 1 - 50 of 62
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf