Bounding volume

Results: 74



#Item
1Computing Bounding Volume Hierarchies Using Model Simplification Tiow-Seng Tan+, Ket-Fah Chong+ Kok-Lim Lowf

Computing Bounding Volume Hierarchies Using Model Simplification Tiow-Seng Tan+, Ket-Fah Chong+ Kok-Lim Lowf

Add to Reading List

Source URL: www.comp.nus.edu.sg

- Date: 2001-04-06 22:46:44
    2INTERACTIVE GPU-BASED COLLISION DETECTION Joachim Georgii Jens Krüger  Rüdiger Westermann

    INTERACTIVE GPU-BASED COLLISION DETECTION Joachim Georgii Jens Krüger Rüdiger Westermann

    Add to Reading List

    Source URL: wwwcg.in.tum.de

    Language: English - Date: 2011-02-14 03:23:59
    3Computational Design of Reconfigurables

    Computational Design of Reconfigurables

    Add to Reading List

    Source URL: www.cs.columbia.edu

    Language: English - Date: 2016-04-14 01:21:41
    4Project 5 Intersect  2.3 Like OpenGL, you will be using a limited illumination model. We only expect you to handle the ambient and diffuse lighting terms of the simple illumination model

    Project 5 Intersect 2.3 Like OpenGL, you will be using a limited illumination model. We only expect you to handle the ambient and diffuse lighting terms of the simple illumination model

    Add to Reading List

    Source URL: cs.brown.edu

    Language: English - Date: 2015-11-10 19:33:11
    5Memory-optimized bounding-volume hierarchies Pierre Terdiman MarchAbstract

    Memory-optimized bounding-volume hierarchies Pierre Terdiman MarchAbstract

    Add to Reading List

    Source URL: www.codercorner.com

    Language: English - Date: 2008-02-12 03:29:15
      6Fast collision detection through bounding volume hierarchies in workspace-time space for sampling-based motion planners Ulrich Schwesinger1 , Roland Siegwart1 and Paul Furgale1 Abstract— This paper presents a fast coll

      Fast collision detection through bounding volume hierarchies in workspace-time space for sampling-based motion planners Ulrich Schwesinger1 , Roland Siegwart1 and Paul Furgale1 Abstract— This paper presents a fast coll

      Add to Reading List

      Source URL: europa2.informatik.uni-freiburg.de

      Language: English - Date: 2016-01-26 19:50:17
      7An Algorithm to Detect Full Irreducibility by Bounding the Volume of Periodic Free Factors

      An Algorithm to Detect Full Irreducibility by Bounding the Volume of Periodic Free Factors

      Add to Reading List

      Source URL: www.comp.uark.edu

      Language: English
        8Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions ∗  Gill Barequet

        Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions ∗ Gill Barequet

        Add to Reading List

        Source URL: www.cs.duke.edu

        Language: English - Date: 2007-03-20 12:27:41
          9EUROGRAPHICSD. Cohen-Or and P. Slavík (Guest Editors) Volume), Number 3  Highly Parallel Fast KD-tree Construction for Interactive

          EUROGRAPHICSD. Cohen-Or and P. Slavík (Guest Editors) Volume), Number 3 Highly Parallel Fast KD-tree Construction for Interactive

          Add to Reading List

          Source URL: cygwin.lukasz.dk

          Language: English - Date: 2009-01-27 16:22:46
          10Box-Trees and R-trees with Near-Optimal Query Time P. K. Agarwaly , M. de Bergz , J. Gudmundssonz, M. Hammarx , H. J. Haverkortz y Dept. of Computer Science, Box 90129, Duke University, Durham, NC, USA, panka

          Box-Trees and R-trees with Near-Optimal Query Time P. K. Agarwaly , M. de Bergz , J. Gudmundssonz, M. Hammarx , H. J. Haverkortz y Dept. of Computer Science, Box 90129, Duke University, Durham, NC, USA, panka

          Add to Reading List

          Source URL: webdoc.sub.gwdg.de

          Language: English - Date: 2006-04-25 01:39:06