On Optimal Bilinear Quadrilateral Meshes

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal base complexes for quadrilateral meshes

In this paper we give an explicit algorithm to optimize the global structure of quadrilateral meshes i.e base complexes, using a graph perfect matching. The approach consists of constructing a special graph over the singularity set of the mesh and finding all quadrilateral based complex subgraphs of that graph. We show by construction that there is always an optimal base complex to a given quad...

متن کامل

Optimal Angle Bounds for Quadrilateral Meshes

We show that any simple planar n-gon can be meshed in linear time by O(n) quadrilaterals with all new angles bounded between 60 and 120 degrees. 1991 Mathematics Subject Classification. Primary: 30C62 Secondary:

متن کامل

Parameterization of Quadrilateral Meshes

Low-distortion parameterization of 3D meshes is a fundamental problem in computer graphics. Several widely used approaches have been presented for triangular meshes. But no direct parameterization techniques are available for quadrilateral meshes yet. In this paper, we present a parameterization technique for non-closed quadrilateral meshes based on mesh simplification. The parameterization is ...

متن کامل

Quadrilateral Meshes for PSLGs

We prove that any PSLG has a conforming quadrilateral mesh with O(n) elements, all angles ≤ 120◦ and all new angles ≥ 60◦ (the complexity and the angle bounds are both sharp). Moreover, all but O(n) of the angles may be taken in a smaller interval, say [89◦, 91◦]. Date: January 2011. 1991 Mathematics Subject Classification. Primary: 30C62 Secondary:

متن کامل

Encoding Quadrilateral Meshes

An important problem in geometric compression is to find succinct representations (encoding schemes) for the conectivity of polygonal meshes. In this note, we show that the encoding scheme discussed in [1] for quadrilateral mesh connectivity can be improved from 3.5 bits per vertex to less than 3 bits per vertex. We also show that an easy equivalence between the labelling schemes of King et al ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Engineering with Computers

سال: 1999

ISSN: 0177-0667,1435-5663

DOI: 10.1007/s003660050017