Marching Cubes: A High Resolution 3D Surface Construction Algor....pdf

发布时间：2022-06-03 发布人：admin 分类：说明书资料大小：1.59M 资料格式：pdf 举报版权申诉

fourierfeng-6805059-16359647490900016735.pdf-第1页.png

第1页 / 共25页

fourierfeng-6805059-16359647490900016735.pdf-第2页.png

第2页 / 共25页

fourierfeng-6805059-16359647490900016735.pdf-第3页.png

第3页 / 共25页

fourierfeng-6805059-16359647490900016735.pdf-第4页.png

第4页 / 共25页

fourierfeng-6805059-16359647490900016735.pdf-第5页.png

第5页 / 共25页

fourierfeng-6805059-16359647490900016735.pdf-第6页.png

第6页 / 共25页

fourierfeng-6805059-16359647490900016735.pdf-第7页.png

第7页 / 共25页

fourierfeng-6805059-16359647490900016735.pdf-第8页.png

第8页 / 共25页

文本预览

Marching Cubes: A High Resolution 3D Surface Construction Algorithm Based on the Paper by William E. Lorensen and Harvey E. Cline

Introduction  The goal: create a constant density surface from a 3D array of data

Introduction  One surface at a time  For another surface must run again

Introduction  Idea:  create a triangular mesh that will approximate the iso-surface  calculate the normals to the surface at each vertex of the triangle  Algorithm:  locate the surface in a cube of eight pixels  calculate normals  march to the next cube

Surface intersection in a cube assign ZERO to vertex outside the surface assign ONE to vertex inside the surface Note: Surface intersects those cube edges where one vertex is outside and the other inside the surface

Surface intersection in a cube  There are 28=256 ways the surface may intersect the cube  Triangulate each case

Patterns  Note: using the symmetries reduces those 256 cases to 15 patterns

Patterns

分享到：

赞收藏

资料库

Marching Cubes: A High Resolution 3D Surface Construction Algor....pdf

相关推荐

行业

热门标签

最新资料