An efficient ray tracing algorithm and its implementation based on adaptive octree decomposition

This paper proposes a ray tracing algorithm based on adaptive octree decomposition to solve the problem of low efficiency of calculating the intersection point of light rays and complex surfaces in the optical simulation of vehicle lights. The algorithm significantly improves the efficiency of solving the intersection problem by discretizing the complex surface into a series of polygonal facets and using a bilinear interpolation algorithm to optimize the light refraction calculation. Experiments show that the algorithm can greatly reduce the computation time on vehicle light models of different complexity, especially when dealing with complex surfaces, the algorithm improves performance by nearly 50%. The algorithm has been successfully applied to simulating optical performance in the design of vehicle lights and has achieved good application results, providing an efficient solution for the optical simulation in the design of vehicle lights.

Authors

Institutions

Publication Details

Journal
Computing and artificial intelligence.
Published
2025-04-08
DOI
https://doi.org/10.59400/cai2514
Primary Topic
Computer Graphics and Visualization Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An efficient ray tracing algorithm and its implementation based on adaptive octree decomposition

Chunlong Dong, Limin Zhao, Shengjun Xue
Computing and artificial intelligence.
Computer Graphics and Visualization Techniques
article

An efficient ray tracing algorithm and its implementation based on adaptive octree decomposition

Chunlong Dong, Limin Zhao, Shengjun Xue
article en

Abstract

This paper proposes a ray tracing algorithm based on adaptive octree decomposition to solve the problem of low efficiency of calculating the intersection point of light rays and complex surfaces in the optical simulation of vehicle lights. The algorithm significantly improves the efficiency of solving the intersection problem by discretizing the complex surface into a series of polygonal facets and using a bilinear interpolation algorithm to optimize the light refraction calculation. Experiments show that the algorithm can greatly reduce the computation time on vehicle light models of different complexity, especially when dealing with complex surfaces, the algorithm improves performance by nearly 50%. The algorithm has been successfully applied to simulating optical performance in the design of vehicle lights and has achieved good application results, providing an efficient solution for the optical simulation in the design of vehicle lights.

Computing and artificial intelligence.Vol. 3(2)
Nanjing University of Information Science and Technology (CN), Kunshan Govisionox Optoelectronic (China) (CN)
Openalex Percentile: Top 88%
Computer Graphics and Visualization Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.