Efficient FDTD Subgridding Algorithm Based on Tree Data Structure and Morton Encoding

L. Yan

doi:10.1109/lawp.2026.3722858

Efficient FDTD Subgridding Algorithm Based on Tree Data Structure and Morton Encoding

2026-08-12

0

PRE

AI

DOI：10.1109/lawp.2026.3722858

Original

Original request for help

Save

Abstract

En 中文

Traditional FDTD subgridding methods often rely on linear arrays or linked lists, resulting in poor spatial–memory locality and significant boundary-matching overhead. This letter develops a tree-structured FDTD subgridding framework in which Morton-linearized storage and precomputed neighbor offsets convert hierarchical grid topology into contiguous and direct data access during time stepping, reducing repeated coordinate searches and pointer traversal. The proposed algorithm is validated using a dielectric waveguide splitter and a photonic crystal waveguide, demonstrating significantly improved computational efficiency and memory savings while maintaining high numerical accuracy.

Keywords:

Quadtree

FDTD

Subgridding

Morton Code

Hanging-variable

Efficient FDTD Subgridding Algorithm Based on Tree Data Structure and Morton Encoding

Abstract

Journal

Organization

Cited Papers