Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bhaniramka, P., Wenger, R., Crawfis, R.: Isosurfacing in Higher Dimensions. In: Proceedings of the 11th IEEE Visualization 2000, Conference (VIS 2000). IEEE Computer Society, Los Alamitos (2000)
Bourke, P.: Polygonising a Scalar Field (1997), http://astronomy.swin.edu.au/~pbourke/modelling/polygonise/
Dechevsky, L.T., Bang, B., Gundersen, J., Lakså, A., Kristoffersen, A.R.: Solving nonlinear systems of equations on graphics processing units. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds.) LSSC 2009. LNCS, vol. 5910. Springer, Heidelberg (2009)
Dechevsky, L.T., Gundersen, J.: Isometric Conversion Between Dimension and Resolution. In: Dæhlen, M., Mørken, K., Schumaker, L. (eds.) Mathematical methods for Curves and Surfaces, pp. 103–114. Nashboro Press (2005)
Dechevsky, L.T., Kristoffersen, A.R., Gundersen, J., Lakså, A., Bang, B., Dokken, T.: A “marching simplex” algorithm for approximate solution of non-linear systems of equations and applications to branching of solutions and intersection problems. Int. J. Pure Appl. Math. 33(3), 407–431 (2006)
Dokken, T.: Aspects of Intersection Algorithms and Approximation, Ph.D. Thesis, University of Oslo (1996)
Glassner, A.S.: An Introduction to Ray Tracing. Morgan Kaufmann, San Francisco (2000)
Govindaraju, N.K., Manocha, D., Raghuvanshi, N., Tuft, D.: GPUSort: High Performance Sorting using Graphics Processors. Department of Computer Science, UNC Chapel Hill (2005), http://gamma.cs.unc.edu/GPUSORT/results.html
Gundersen, J., Dechevsky, L.T.: Scientific visualization for the ODE-based simulator BedSim of LKAB. Int. J. Pure Appl. Math. 41(9), 1197–1217 (2007)
Kristoffersen, A.R.: M.Sc. Diploma Thesis, Narvik University College (2004)
Kristoffersen, A.R., Georgiev, D.T., Dechevsky, L.T., Lakså, A., Gundersen, J., Bang, B.: Vertex versus Pixel Based Intersection: Using the GPU for Investigation of Surface Intersection. Int. J. Pure Appl. Math. 33(3), 407–431 (2006)
Sederberg, T.W., Chen, F.: Implicitization using moving curves and surfaces. Computer Graphics Annual Conference Series, pp. 301–308 (1995)
Shirley, P.: Realistic Ray Tracing. A K Peters, Natick (2000)
Zorich, V.A.: Mathematical Analysis. Nauka, Moscow, vol. 1 (1981) (in Russian)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gundersen, J., Kristoffersen, A.R., Dechevsky, L.T. (2010). Comparison between the Marching-Cube and the Marching-Simplex Methods. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2009. Lecture Notes in Computer Science, vol 5910. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12535-5_90
Download citation
DOI: https://doi.org/10.1007/978-3-642-12535-5_90
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12534-8
Online ISBN: 978-3-642-12535-5
eBook Packages: Computer ScienceComputer Science (R0)