Simplicial isosurfacing in arbitrary dimension and codimension

Journal of Computational Physics

Volumn 190, Issue 1, 2003, Pages 295-310

  Min, Chohong ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY DIMENSION; CODIMENSION; DISCRETE FUNCTIONS; HIGHER CO DIMENSIONS; HIGHER DIMENSIONS; INTERFACE PROBLEMS; ISO SURFACE; ISO-SURFACING; LEVEL SET METHOD; MOVING INTERFACE;

NUMERICAL METHODS;

EID: 0041355385     PISSN: 00219991     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0021-9991(03)00275-4     Document Type: Article

References (19)

1. M. Haiman, A simple and relatively efficient triangulation of the n-cube, Discrete Comput. Geom. 6 (1991) 287-289.
2. J.F. Sallee, A triangulation of the n-cube, Discrete Math. 40 (1982) 81-86.
3. E.L. Allgower, P.H. Schmidt, An algorithm for piecewise-linear approximation of an implicitly defined manifold, SIAM J. Numer. Anal. 22 (1985) 322-346.
4. D.M.Y. Sommerville, An Introduction to the Geometry of n-Dimensionals, Dover, New York, 1958.
5. S. Osher, J.A. Sethian, Fronts propagating with curvature-dependent spee, J. Comput. Phys. 79 (1988) 12-49.
6. G.M. Ziegler, Lectures on Polytopes, Springer, Berlin, 1995.
7. W.E. Lorenson, H.E. Cline, Maching cubes: a high resolution 3d surface reconstruction algorithm, Comput. Graphics 21 (1987) 163-169.
8. B.P. Carneiro, C. Silva, A.E. Kaufman, Tetra-cubes: an algorithm to generate 3d isosurfaces based upon tetrahedra, Anais do IX SIBGRAPI (1996) 205-210.
9. H.W. Kuhn, Some combinatorial lemmas in topology, IBM J. Res. Dev. 4 (1960) 518-524.
10. S. Osher, L.T. Cheng, M. Kang, H. Shim, Y.H. Tsai, Geometric optics in a phase-space-based level set and Eulerian framework, J. Comput. Phys. 179 (2002) 622-648.
11. J. Strain, Tree methods for moving interfaces, J. Comput. Phys. 151 (1999) 616-648.
12. P. Bhaniramka, R. Wenger, R. Crawfis, Isosurfacing in higher dimensions, Proc. Visual (2000) 267-273.
13. C. Weigle, D. Banks, Complex-valued contour meshing, IEEE Visual. (1996) 173-180.
14. R.B. Hughes, M.R. Anderson, Simplexity of the cube, Discrete Math. 158 (1996) 99-150.
15. C. Montani, R. Scateni, R. Scopigno, A modified look-up table for implicit disambiguation of marching cubes, Visual Comput. 10 (1994) 353-355.
16. B. Engquist, O. Runborg, A.-K. Tornberg, High frequency wave propagation by the segment projection method, J. Comput. Phys 178 (2002) 373-390.
17. L. Ambrosio, H.M. Soner, Level set approach to mean curvature flow in arbitrary dimension, J. Diff. Geom. 43 (1996) 693-737.
18. L. Lorigo, O. Faugeras, Co-dimension 2 geodesic contours for MRA segmentation, Proc. IPMI (1999).
19. Y.R. Tsai, L.T. Tien, P. Burchard, S. Osher, G. Sapiro, Dynamic Visibility in an implicit framework, UCLA CAM Report 02-06 (2002).