Name
Abstract | ||
|---|---|---|
The marching cubes (MC) algorithm is employed to generated triangular meshes for visualizing medical images, sculpture scans and mathematical surfaces. It sequentially traverses cuberille data composed of sampled points of a scalar volumetric data. This paper proposes a propagation-based MC algorithm that uses the open boundary loop concept. The open boundary loop is used to determine adjacent cells for the next iteration of the MC algorithm. After inserting each triangle, the open boundary loop is reevaluated. Simultaneously, it is ensured that all triangles are coherently oriented and there are no holes on the isosurface. Several tests are conducted to determine the performance of the algorithm in comparison with the original MC algorithm. Results from these tests indicate that, for large-scale problems, the proposed algorithm performs better than the original. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s00371-017-1417-2 | The Visual Computer |
Keywords | Field | DocType |
Marching cubes algorithm, Propagation-based approach, Open boundary | Computer vision,Polygon mesh,Computer science,Marching cubes,Marching tetrahedra,Scalar (physics),Isosurface,Algorithm,Marching squares,Artificial intelligence,Volumetric data,Geometry | Journal |
Volume | Issue | ISSN |
34 | 10 | 0178-2789 |
Citations | PageRank | References |
1 | 0.39 | 11 |
Authors | ||
9 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marcos Sales Guerra Tsuzuki | 1 | 32 | 7.61 |
| André Kubagawa Sato | 2 | 14 | 4.82 |
| Edson K. Ueda | 3 | 2 | 1.07 |
| Thiago de Castro Martins | 4 | 18 | 6.73 |
| Rogerio Yugo Takimoto | 5 | 4 | 2.13 |
| Yuma Iwao | 6 | 6 | 1.56 |
| Leonardo Ishida Abe | 7 | 1 | 0.72 |
| Toshiyuki Gotoh | 8 | 46 | 13.64 |
| Seiichiro Kagei | 9 | 26 | 5.81 |