Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Bounding_interval_hierarchy> ?p ?o }
Showing triples 1 to 45 of
45
with 100 triples per page.
- Bounding_interval_hierarchy abstract "A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd-trees. Bounding interval hierarchies can be used in high performance (or real-time) ray tracing and may be especially useful for dynamic scenes.The BIH was first presented under the name of SKD-Trees, presented by Ooi et al., and BoxTrees, independently invented by Zachmann.".
- Bounding_interval_hierarchy wikiPageExternalLink jsBIH.
- Bounding_interval_hierarchy wikiPageID "6814241".
- Bounding_interval_hierarchy wikiPageLength "7748".
- Bounding_interval_hierarchy wikiPageOutDegree "23".
- Bounding_interval_hierarchy wikiPageRevisionID "651647567".
- Bounding_interval_hierarchy wikiPageWikiLink Axis-aligned_bounding_box.
- Bounding_interval_hierarchy wikiPageWikiLink BSP_tree.
- Bounding_interval_hierarchy wikiPageWikiLink Binary_space_partitioning.
- Bounding_interval_hierarchy wikiPageWikiLink Binary_tree.
- Bounding_interval_hierarchy wikiPageWikiLink Bounding_box.
- Bounding_interval_hierarchy wikiPageWikiLink Bounding_volume_hierarchy.
- Bounding_interval_hierarchy wikiPageWikiLink CPU_cache.
- Bounding_interval_hierarchy wikiPageWikiLink Category:3D_computer_graphics.
- Bounding_interval_hierarchy wikiPageWikiLink Category:Geometric_data_structures.
- Bounding_interval_hierarchy wikiPageWikiLink Category:Trees_(data_structures).
- Bounding_interval_hierarchy wikiPageWikiLink Computer_memory.
- Bounding_interval_hierarchy wikiPageWikiLink Data_structure.
- Bounding_interval_hierarchy wikiPageWikiLink Heuristic.
- Bounding_interval_hierarchy wikiPageWikiLink K-d_tree.
- Bounding_interval_hierarchy wikiPageWikiLink Kd-tree.
- Bounding_interval_hierarchy wikiPageWikiLink Memory_(computers).
- Bounding_interval_hierarchy wikiPageWikiLink Minimum_bounding_box.
- Bounding_interval_hierarchy wikiPageWikiLink Ray_tracing_(graphics).
- Bounding_interval_hierarchy wikiPageWikiLink Space_partitioning.
- Bounding_interval_hierarchy wikiPageWikiLink Stack_(abstract_data_type).
- Bounding_interval_hierarchy wikiPageWikiLink Stack_(data_structure).
- Bounding_interval_hierarchy wikiPageWikiLink Surface_area_heuristic.
- Bounding_interval_hierarchy wikiPageWikiLinkText "Bounding interval hierarchy".
- Bounding_interval_hierarchy wikiPageWikiLinkText "bounding interval hierarchy".
- Bounding_interval_hierarchy hasPhotoCollection Bounding_interval_hierarchy.
- Bounding_interval_hierarchy subject Category:3D_computer_graphics.
- Bounding_interval_hierarchy subject Category:Geometric_data_structures.
- Bounding_interval_hierarchy subject Category:Trees_(data_structures).
- Bounding_interval_hierarchy hypernym Structure.
- Bounding_interval_hierarchy type Building.
- Bounding_interval_hierarchy type Structure.
- Bounding_interval_hierarchy type Technique.
- Bounding_interval_hierarchy comment "A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd-trees. Bounding interval hierarchies can be used in high performance (or real-time) ray tracing and may be especially useful for dynamic scenes.The BIH was first presented under the name of SKD-Trees, presented by Ooi et al., and BoxTrees, independently invented by Zachmann.".
- Bounding_interval_hierarchy label "Bounding interval hierarchy".
- Bounding_interval_hierarchy sameAs m.0gq8tm.
- Bounding_interval_hierarchy sameAs Q4949996.
- Bounding_interval_hierarchy sameAs Q4949996.
- Bounding_interval_hierarchy wasDerivedFrom Bounding_interval_hierarchy?oldid=651647567.
- Bounding_interval_hierarchy isPrimaryTopicOf Bounding_interval_hierarchy.