Surface generation from constant depth planar contours

praviarun
Messages
1
Reaction score
0
Hi all,

I am trying to develop an application that converts a parallel set of input contours(polygons) with constant Z values to a tessellated surface mesh .The contours may also consist of holes

All available tessellation techniques like glu,delaunay talk about 2d triangulations only.
Can anyone suggest a way forward?

Best Regards,
Praveen
 
Mathematics news on Phys.org
I'll assume that a "hole" is a contour that has two elevation (Z) values associated with it, so it's like a vertical cliff.

If you project the contours on the XY plane and tesllate that 2-D surface so that each contour is approximated by a linked series of edges, then when you project the triangles back to the 3D surface, it will be tesselated except for the verical cliffs. You woud then have to tessellate the vertical cliffs by incorporating the vertices of the triangles that are on the contour that defines a cliff. One vertex on a contour representing a cliff would be become two vertices, one at the top of the cliff and one at the bottom. Your tesselation of the vertical face of the cliff woud have to incorporate those vertices.

Of course, that's a very theoretical sketch of a method. With cliffs that are nearly vertical, but not exactly vertical there can be problems in overflow or underflow when you project the 2D triangles back onto the 3D surface. You haven't stated your requirements for the tessellation. For example, do you want to avoid long skinny triangles?

You might have better luck with this type of question in the computer programming section of the forum or in a computer graphics forum, if you are doing this for computer graphics.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top