.png){kind=icon}
Return
A fast high-dimensional continuation hypercubes algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cag.2025.104237.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces the Fast Continuation Hypercubes (FCH) algorithm, a method for generating piecewise linear approximations of implicitly defined manifolds of arbitrary dimension. By integrating and mixing key aspects of existing approaches, the FCH algorithm offers significant improvements in both speed and memory efficiency. It traverses the domain by generating and processing only the necessary cells, which reduces the computational cost associated with high-dimensional manifold approximation. Additionally, the algorithm stores only the cells at the boundary of the traversed region, further optimizing memory efficiency. Experimental results demonstrate that FCH outperforms state-of-the-art algorithms in terms of runtime and memory usage.
Keywords:
Manifold approximation/polygonization/tracing
Isomanifold
Triangulation
High-Dimensional Marching Cubes
Continuation method
Journal
C
IF:
2.8
Papers:
82
Citations:
4.3K
Organization
Cited Papers
.png){kind=icon}
ShareSaveMarching cubes technique for volumetric visualization accelerated with graphics processing units
OAAI
OAAIShareSave
ShareSaveShareSaveShareSaveShareSave
View more