Implicitization using moving curves and surfaces
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Realistic ray tracing
Isosurfacing in higher dimensions
Proceedings of the conference on Visualization '00
Solving non-linear systems of equations on graphics processing units
LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
Solving non-linear systems of equations on graphics processing units
LSSC'09 Proceedings of the 7th international conference on Large-Scale Scientific Computing
| Hi-index | 0.00 |
The marching-cube algorithm is one of the efficient algorithms for computing the solutions of low-dimensional nonlinear systems of equations It is widely used in industrial applications involving intersection problems in 2, 3 and, possibly, higher dimensions In 2006, a research team, including the authors of this article, proposed a new 'marching' approach which differs essentially from the marching-cube approach We coined this new algorithm as The Marching Simplex Algorithm Some of the advantages of the marching simplex algorithm were mentioned already at the time of its introduction However, a detailed comparison between the two algorithms has not been made so far, and the purpose of this article is to address the issues of such a comparison.