On the public citation graph

Experiences with Streaming Construction of SAH KD-Trees

https://doi.org/10.1109/rt.2006.280219

0 signed · 89 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-7091-6303-0_27openalex-snapshot

Dynamic Acceleration Structures for Interactive Ray Tracing

inferredcites →https://doi.org/10.1007/bf01911006openalex-snapshot

Heuristics for ray tracing using space subdivision

inferredcites →https://doi.org/10.1109/mcg.1987.276983openalex-snapshot

Automatic Creation of Object Hierarchies for Ray Tracing

inferredcites →https://doi.org/10.1109/pvgs.2003.1249045openalex-snapshot

Distributed interactive ray tracing of dynamic scenes

inferredcites →https://doi.org/10.1109/rt.2006.280213openalex-snapshot

RT-DEFORM: Interactive Ray Tracing of Dynamic Scenes using BVHs

inferredcites →https://doi.org/10.1109/rt.2006.280216openalex-snapshot

On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N)

inferredcites →https://doi.org/10.1109/rt.2006.280217openalex-snapshot

On the Fast Construction of Spatial Hierarchies for Ray Tracing

inferredcites →https://doi.org/10.1109/rt.2006.280218openalex-snapshot

Fast kd-tree Construction with an Adaptive Error-Bounded Heuristic

inferredcites →https://doi.org/10.1145/1283900.1283912openalex-snapshot

B-KD trees for hardware accelerated ray tracing of dynamic scenes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cav.2024openalex-snapshot

Multi‐level tetrahedralization‐based accelerator for ray‐tracing animated scenes

inferred← citeshttps://doi.org/10.1007/978-3-030-22263-5_12openalex-snapshot

Real-Time Ray Tracing Algorithm for Dynamic Scene

inferred← citeshttps://doi.org/10.1007/978-3-540-76856-2_67openalex-snapshot

Fast kd-Tree Construction for 3D-Rendering Algorithms Like Ray Tracing

inferred← citeshttps://doi.org/10.1007/978-3-540-89639-5_105openalex-snapshot

Tracking Data Structures Coherency in Animated Ray Tracing: Kalman and Wiener Filters Approach

inferred← citeshttps://doi.org/10.1007/978-3-642-10331-5_92openalex-snapshot

Efficient Strategies for Acceleration Structure Updates in Interactive Ray Tracing Applications on the Cell Processor

inferred← citeshttps://doi.org/10.1007/s00371-018-1575-xopenalex-snapshot

On the use of local ray termination for efficiently constructing qualitative BSPs, BIHs and (S)BVHs

inferred← citeshttps://doi.org/10.1007/s11042-014-2378-3openalex-snapshot

A fast ray tracing algorithm based on a hybrid structure

inferred← citeshttps://doi.org/10.1007/s11042-015-2896-7openalex-snapshot

Efficient kd-tree construction for ray tracing using ray distribution sampling

inferred← citeshttps://doi.org/10.1007/s11227-021-03680-0openalex-snapshot

Parallel optimization of the ray-tracing algorithm based on the HPM model

inferred← citeshttps://doi.org/10.1016/j.cad.2017.01.002openalex-snapshot

Coherent spherical range-search for dynamic points on GPUs

inferred← citeshttps://doi.org/10.1016/j.cag.2007.11.004openalex-snapshot

Fast, parallel, and asynchronous construction of BVHs for ray tracing animated scenes

inferred← citeshttps://doi.org/10.1016/j.cag.2011.11.007openalex-snapshot

Construction of efficient kd-trees for static scenes using voxel-visibility heuristic

inferred← citeshttps://doi.org/10.1016/j.cag.2012.02.013openalex-snapshot

Visibility driven BVH build up algorithm for ray tracing

inferred← citeshttps://doi.org/10.1016/j.cag.2016.12.003openalex-snapshot

Construction of bounding volume hierarchies with SAH cost approximation on temporary subtrees

inferred← citeshttps://doi.org/10.1016/j.cag.2021.05.001openalex-snapshot

MBKD: Acceleration structure designed for moving primitives

inferred← citeshttps://doi.org/10.1016/j.sysarc.2011.06.003openalex-snapshot

gkDtree: A group-based parallel update kd-tree for interactive ray tracing

inferred← citeshttps://doi.org/10.1109/access.2022.3211072openalex-snapshot

Virtual LiDAR Simulation as a High Performance Computing Challenge: Toward HPC HELIOS++

inferred← citeshttps://doi.org/10.1109/csse.2008.1381openalex-snapshot

Ray Tracing Dynamic Scenes using fast KD-tree Base on Multi-Core Architectures

inferred← citeshttps://doi.org/10.1109/dmdcm.2011.14openalex-snapshot

SAH Based KD Tree Construction on Hybrid Architecture

inferred← citeshttps://doi.org/10.1109/icet.2008.4777521openalex-snapshot

Tracking data structures coherency in animated ray tracing for real-time 3D-rendering

inferred← citeshttps://doi.org/10.1109/isape62431.2024.10841029openalex-snapshot

A K-D Tree Ray Tracing Acceleration Algorithm for Calculating Electromagnetic Scattering Characteristics

inferred← citeshttps://doi.org/10.1109/ldav51489.2020.00012openalex-snapshot

Spatial Partitioning Strategies for Memory-Efficient Ray Tracing of Particles

inferred← citeshttps://doi.org/10.1109/pdp.2009.14openalex-snapshot

High Performance Global Illumination on Multi-core Architectures

inferred← citeshttps://doi.org/10.1109/rt.2006.280216openalex-snapshot

On building fast kd-Trees for Ray Tracing, and on doing that in O(N log N)

inferred← citeshttps://doi.org/10.1109/rt.2006.280218openalex-snapshot

Fast kd-tree Construction with an Adaptive Error-Bounded Heuristic

inferred← citeshttps://doi.org/10.1109/rt.2007.4342588openalex-snapshot

On fast Construction of SAH-based Bounding Volume Hierarchies

inferred← citeshttps://doi.org/10.1109/rt.2007.4342590openalex-snapshot

Fast and Lazy Build of Acceleration Structures from Scene Hierarchies

inferred← citeshttps://doi.org/10.1109/rt.2007.4342593openalex-snapshot

Early Split Clipping for Bounding Volume Hierarchies

inferred← citeshttps://doi.org/10.1109/rt.2007.4342598openalex-snapshot

Realtime Ray Tracing on GPU with BVH-based Packet Traversal

inferred← citeshttps://doi.org/10.1109/rt.2008.4634614openalex-snapshot

Adaptive acceleration structures in perspective space

inferred← citeshttps://doi.org/10.1109/rt.2008.4634618openalex-snapshot

Multi bounding volume hierarchies

inferred← citeshttps://doi.org/10.1109/rt.2008.4634620openalex-snapshot

Getting rid of packets - Efficient SIMD single-ray traversal using multi-branching BVHs -

inferred← citeshttps://doi.org/10.1109/rt.2008.4634623openalex-snapshot

Improving Kd-tree quality at a reasonable construction cost

inferred← citeshttps://doi.org/10.1109/rt.2008.4634632openalex-snapshot

Efficient clustered BVH update algorithm for highly-dynamic models

inferred← citeshttps://doi.org/10.1109/rt.2008.4634637openalex-snapshot

Ray tracing with the BSP tree

inferred← citeshttps://doi.org/10.1109/tnnls.2021.3116936openalex-snapshot

SHNE: Semantics and Homophily Preserving Network Embedding

inferred← citeshttps://doi.org/10.1109/tro.2022.3141876openalex-snapshot

FAST-LIO2: Fast Direct LiDAR-Inertial Odometry

inferred← citeshttps://doi.org/10.1109/tvcg.2010.251openalex-snapshot

Fast Construction of SAH BVHs on the Intel Many Integrated Core (MIC) Architecture

inferred← citeshttps://doi.org/10.1109/tvcg.2011.277openalex-snapshot

Combining Single and Packet-Ray Tracing for Arbitrary Ray Distributions on the Intel MIC Architecture

inferred← citeshttps://doi.org/10.1111/cgf.12241openalex-snapshot

Improving Memory Space Efficiency of Kd‐tree for Real‐time Ray Tracing

inferred← citeshttps://doi.org/10.1111/cgf.13142openalex-snapshot

GPU Ray Tracing using Irregular Grids

inferred← citeshttps://doi.org/10.1111/j.1467-8659.2007.01062.xopenalex-snapshot

Highly Parallel Fast KD‐tree Construction for Interactive Ray Tracing of Dynamic Scenes

inferred← citeshttps://doi.org/10.1111/j.1467-8659.2008.01313.xopenalex-snapshot

State of the Art in Ray Tracing Animated Scenes

inferred← citeshttps://doi.org/10.1111/j.1467-8659.2009.01350.xopenalex-snapshot

Specular Effects on the GPU: State of the Art

inferred← citeshttps://doi.org/10.1111/j.1467-8659.2009.01377.xopenalex-snapshot

Fast BVH Construction on GPUs

inferred← citeshttps://doi.org/10.1111/j.1467-8659.2010.01844.xopenalex-snapshot

Review: Kd‐tree Traversal Algorithms for Ray Tracing

inferred← citeshttps://doi.org/10.1145/1278780.1278847openalex-snapshot

Ray tracing dynamic scenes using selective restructuring

inferred← citeshttps://doi.org/10.1145/1364901.1364960openalex-snapshot

Technical strategies for massive model visualization

inferred← citeshttps://doi.org/10.1145/1401132.1401190openalex-snapshot

Massive model visualization techniques

inferred← citeshttps://doi.org/10.1145/1409060.1409079openalex-snapshot

Real-time KD-tree construction on graphics hardware

inferred← citeshttps://doi.org/10.1145/1572769.1572771openalex-snapshot

Spatial splits in bounding volume hierarchies

inferred← citeshttps://doi.org/10.1145/1572769.1572772openalex-snapshot

Object partitioning considered harmful

inferred← citeshttps://doi.org/10.1145/2018323.2018333openalex-snapshot

Simpler and faster HLBVH with work queues

inferred← citeshttps://doi.org/10.1145/2018323.2018335openalex-snapshot

SAH KD-tree construction on GPU

inferred← citeshttps://doi.org/10.1145/2019627.2019634openalex-snapshot

Razor

inferred← citeshttps://doi.org/10.1145/2159616.2159649openalex-snapshot

Fast, effective BVH updates for animated scenes

inferred← citeshttps://doi.org/10.1145/2643188.2643192openalex-snapshot

Adaptive BVH

inferred← citeshttps://doi.org/10.1145/2832087.2832093openalex-snapshot

Guided profiling for auto-tuning array layouts on GPUs

inferred← citeshttps://doi.org/10.1145/3106341openalex-snapshot

MATOG

inferred← citeshttps://doi.org/10.1145/3182160openalex-snapshot

Arnold

inferred← citeshttps://doi.org/10.1587/transinf.e93.d.891openalex-snapshot

A Fast Ray-Tracing Using Bounding Spheres and Frustum Rays for Dynamic Scene Rendering

inferred← citeshttps://doi.org/10.21203/rs.3.rs-725468/v1openalex-snapshot

Researches on the Fast Determination of Cell Type of Cartesian Grid

inferred← citeshttps://doi.org/10.2139/ssrn.4675561openalex-snapshot

FAST-LIO2: Fast Direct LiDAR-Inertial Odometry

inferred← citeshttps://doi.org/10.2197/ipsjjip.27.840openalex-snapshot

Parallelization of Matrix Partitioning in Construction of Hierarchical Matrices using Task Parallel Languages

inferred← citeshttps://doi.org/10.2197/ipsjjip.30.742openalex-snapshot

Parallelization of Matrix Partitioning in Hierarchical Matrix Construction on Distributed Memory Systems

inferred← citeshttps://doi.org/10.22028/d291-26391openalex-snapshot

Algorithms and data structures for interactive ray tracing on commodity hardware

inferred← citeshttps://doi.org/10.2312/egpgv/egpgv07/101-108openalex-snapshot

Asynchronous BVH Construction for Ray Tracing Dynamic Scenes on Parallel Multi-Core Architectures

inferred← citeshttps://doi.org/10.2312/egs.20091046openalex-snapshot

A Cost Metric for Scene-Interior Ray Origins

inferred← citeshttps://doi.org/10.2312/localchapterevents/italchap/italianchapconf2008/089-096openalex-snapshot

A Survey on Exploiting Grids for Ray Tracing

inferred← citeshttps://doi.org/10.2312/pgv.20141085openalex-snapshot

Auto-Tuning Complex Array Layouts for GPUs

inferred← citeshttps://doi.org/10.2312/sre.20171200openalex-snapshot

k-d Tree Construction Designed for Motion Blur

inferred← citeshttps://doi.org/10.4028/www.scientific.net/amr.433-440.3543openalex-snapshot

Parallel SAH Based KD Tree Construction Algorithm

inferred← citeshttps://doi.org/10.4304/jmm.5.3.259-267openalex-snapshot

Incoherent Ray tracing on GPU

inferred← citeshttps://doi.org/10.4304/jsw.9.3.596-604openalex-snapshot

A Fast Kd-tree Construction for Ray Tracing based on Efficient Ray Distribution

inferred← citeshttps://doi.org/10.48550/arxiv.2102.10808openalex-snapshot

ikd-Tree: An Incremental K-D Tree for Robotic Applications

inferred← citeshttps://doi.org/10.48550/arxiv.2107.06829openalex-snapshot

FAST-LIO2: Fast Direct LiDAR-inertial Odometry

inferred← citeshttps://doi.org/10.5555/1921479.1921492openalex-snapshot

Parallel SAH k-D tree construction

inferred← citeshttps://doi.org/10.5555/2383847.2383860openalex-snapshot

Ray tracing dynamic scenes using selective restructuring

inferred← citeshttps://doi.org/10.70675/7e3f57f6z4175z4a22za02dzf83ca4e3ecfcopenalex-snapshot

Partition spatiale contrainte et convexe pour la simulation basée rayons

inferred← citeshttps://doi.org/10.70675/87ef579azb698z4a5fz8767z6d042ef6ab35openalex-snapshot

Volumes d'ombre en rendu temps réel : Complexité géométrique et stratégie de partitionnement

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.