Repository logo
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
Repository logo
  • PRISM

  • Communities & Collections
  • All of PRISM
  • English
  • Català
  • Čeština
  • Deutsch
  • Español
  • Français
  • Gàidhlig
  • Latviešu
  • Magyar
  • Nederlands
  • Polski
  • Português
  • Português do Brasil
  • Suomi
  • Svenska
  • Türkçe
  • Қазақ
  • বাংলা
  • हिंदी
  • Ελληνικά
  • Yкраї́нська
  • Log In
    or
    New user? Click here to register.Have you forgotten your password?
  1. Home
  2. Browse by Author

Browsing by Author "Jevans, David"

Now showing 1 - 2 of 2
Results Per Page
Sort Options
  • Loading...
    Thumbnail Image
    Item
    Open Access
    ADAPTIVE VOXEL SUBDIVISION FOR RAY TRACING
    (1988-11-01) Jevans, David; Wyvill, Brian
    Although regular subdivision has been shown to be efficient at ray tracing scenes where objects are evenly distributed, such algorithms perform poorly when objects are concentrated in a small number of voxels. In this paper, a method is presented where voxels in a regular grid are examined and recursively subdivided depending on object density. This integration of regular and adaptive spatial subdivision methods allows images consisting of large regularly distributed objects and small dense objects to be ray traced efficiently. The parameters controlling the coarseness of the voxel grid, depth of adaptive subdivision trees, and maximum number of polygons per voxel are varied and their effects on execution time, subdivision time, and memory use are measured.
  • Loading...
    Thumbnail Image
    Item
    Open Access
    RAY TRACING IMPLICIT SURFACES
    (1988-01-01) Wyvill, Brian; Jevans, David
    We present an algorithm for ray tracing implicit surfaces. The algorithm first divides space uniformly and areas of interest are adaptively subdivided using an octree method. We review earlier work on reducing intersection calculations in ray tracing and introduce a new data structure, a variation on the octree, that is more efficient in both time and memory requirements. Our results indicate that using this hybrid algorithm retains the benefits of both uniform and octree subdivision while providing better average performance than using either one of these approaches alone.

Libraries & Cultural Resources

  • Contact us
  • 403.220.8895
Start Something.
  • Digital Privacy Statement
  • Privacy Policy
  • Website feedback

University of Calgary
2500 University Drive NW
Calgary Alberta T2N 1N4
CANADA

Copyright © 2023

The University of Calgary acknowledges the traditional territories of the people of the Treaty 7 region in Southern Alberta, which includes the Blackfoot Confederacy (comprised of the Siksika, Piikani, and Kainai First Nations), as well as the Tsuut’ina First Nation, and the Stoney Nakoda (including the Chiniki, Bearspaw and Wesley First Nations). The City of Calgary is also home to Metis Nation of Alberta, Region 3. The University of Calgary acknowledges the impact of colonization on Indigenous peoples in Canada and is committed to our collective journey towards reconciliation to create a welcome and inclusive campus that encourages Indigenous ways of knowing, doing, connecting and being.