Topic
Marching triangles
About: Marching triangles is a research topic. Over the lifetime, 15 publications have been published within this topic receiving 350 citations.
Papers
TL;DR: It is shown that the marching triangles can be used as an incremental meshing technique in an interactive modeling environment and no extra data‐structure is needed to incrementally edit skeletal implicit surfaces, which saves both memory and computation time.
Abstract: This paper presents several improvements to the marching triangles algorithm for general implicit surfaces. The original method generates equilateral triangles of constant size almost everywhere on the surface. We present several modifications to adapt the size of the triangles to the curvature of the surface. As cracks may arise in the resulting polygonization, we propose a specific crack-closing method invoked at the end of the mesh growing step. Eventually, we show that the marching triangles can be used as an incremental meshing technique in an interactive modeling environment. In contrast to existing incremental techniques based on spatial sudvision, no extra datastructure is needed to incrementally edit skeletal implicit surfaces, which saves both memory and computation time.
110 citations
TL;DR: An algorithm for polygonizing closed implicit surfaces, which produces meshes adapted to the local curvature of the surface, which is capable of good accuracy and meshing quality without sacrificing computing resources is presented.
25 citations
7 Nov 2002
TL;DR: C/sup 1/ discontinuities (fold edges) are detected and used to constrain the final triangulation, thus increasing the accuracy of the mesh at sharp edges and corners and decreasing the number of triangles with a poor aspect ratio.
Abstract: Marching triangles is a method for producing a polygon mesh surface approximation composed of triangular facets which are approximately equilateral. This paper improves the marching triangles algorithm where the inputs are multiple range images of scenes. C/sup 1/ discontinuities (fold edges) are detected and used to constrain the final triangulation, thus increasing the accuracy of the mesh at sharp edges and corners and decreasing the number of triangles with a poor aspect ratio.
13 citations
1 Jan 2002
TL;DR: This method put emphasis on the shape of triangles of the resulting polygonal mesh and the main advan- tages of the triangulation presented are simplicity and the stable features that can be used for next expanding.
Abstract: This paper presents a new method for polygonization of implicit surfaces. Our method put emphasis on the shape of triangles of the resulting polygonal mesh. The main advan- tages of the triangulation presented are simplicity and the stable features that can be used for next expanding. The implementation is not complicated and only the standard data structures are used. This algorithm is based on the surface tracking scheme and it is compared with the other algorithms which are based on the similar principle, such as the Marching cubes and the Marching triangles algorithms.
10 citations
16 Jun 2004
TL;DR: An adaptive method for polygonization of implicit surfaces based on the surface tracking scheme that insists on the shape of triangles and the accuracy of resulting approximation as well.
Abstract: This paper presents an adaptive method for polygonization of implicit surfaces The method insists on the shape of triangles and the accuracy of resulting approximation as well The main advantages of the triangulation presented are simplicity and the stable features that can be used for next expanding The implementation is not complicated and only the standard data structures are used The presented algorithm is based on the surface tracking scheme and it is compared with the other algorithms based on the similar principle, such as the Marching cubes and the Marching triangles algorithms
9 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2017 | 1 |
| 2007 | 2 |
| 2005 | 1 |
| 2004 | 4 |
| 2003 | 1 |
| 2002 | 3 |