I'm trying to implement a marching cubes algorithm to get a mesh from an isosurface. But I've heard of a marching triangle approach but can't find anything on google. Anyone have any tips on better algorithms for this type of thing?

Marching cubes is the algorithm to get a mesh from an isosurface. You might mean marching squares for 2D. Also, Marching tetrahedron is also an algorithm. What is the problem you are having?

Delaunay tesselation (3-d version of Delaunay triangulation) seems to be popular now. You might have a look at this link as well: http://dspace.mit.edu/handle/1721.1/6007

To answer your original questions, the marching triangles approach is going to be exactly like the marching cubes approach. The only difference is that instead of using cubes, you use half/cubes (divide by a cross-sectional plane)