3 search results - page 1 / 1 » Mesh Refinement Based on the 8-Tetrahedra Longest- Edge Part... |
IMR
2003
Springer
13 years 10 months ago
2003
Springer
The 8-tetrahedra longest-edge (8T-LE) partition of any tetrahedron is defined in terms of three consecutive edge bisections, the first one performed by the longest-edge. The ass...
IMR
1998
Springer
13 years 9 months ago
1998
Springer
In this paper we introduce and discuss a graph structure associated with longest-edge algorithms (algorithms based on the bisection of triangles by the longest-edge) which can be u...
CAGD
2004
13 years 4 months ago
2004
The four-triangles longest-edge (4T-LE) partition of a triangle t is obtained by joining the midpoint of the longest edge of t to the opposite vertex and to the midpoints of the t...