Name
Abstract | ||
|---|---|---|
The Marching Cubes Algorithm may return degenerate, zero area isosurface triangles, and often returns isosurface triangles with small areas, edges or angles. We show how to avoid both problems using an extended Marching Cubes lookup table. As opposed to the conventional Marching Cubes lookup table, the extended lookup table differentiates scalar values equal to the isovalue from scalar values greater than the isovalue. The lookup table has 38 = 6561 entries, based on three possible labels, '-' or '=' or '+', of each cube vertex. We present an algorithm based on this lookup table which returns an isosurface close to the Marching Cubes isosurface, but without any degenerate triangles or any small areas, edges or angles |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1111/j.1467-8659.2008.01209.x | Comput. Graph. Forum |
Keywords | Field | DocType |
marching cubes algorithm,extended marching cubes,scalar value,lookup table,marching cubes isosurface,extended lookup table,quality isosurface mesh generation,conventional marching cubes,isosurface triangle,isosurface close,cubes lookup table,small area,marching cube,mesh generation | Lookup table,Computer graphics (images),Computer science,Marching tetrahedra,Marching cubes,Scalar (physics),Isosurface,Artificial intelligence,Computer vision,Vertex (geometry),Algorithm,Mesh generation,Cube | Journal |
Volume | Issue | ISSN |
27 | 3 | 0167-7055 |
Citations | PageRank | References |
15 | 0.65 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sundaresan Raman | 1 | 15 | 2.00 |
| Rephael Wenger | 2 | 441 | 43.54 |