65 search results - page 1 / 13 » Mesh Graph Structure for Longest-Edge Refinement Algorithms |
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...
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...
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...
EGPGV
2011
Springer
12 years 8 months ago
2011
Springer
We present parallel algorithms for processing, extracting and rendering adaptively sampled regular terrain datasets represented as a multiresolution model defined by a super-squa...
CCCG
2008
13 years 6 months ago
2008
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....