Connectivity editing for quadrilateral meshes
نویسندگان
چکیده
منابع مشابه
Connectivity Compression for Irregular Quadrilateral Meshes
Applications that require Internet access to remote 3D datasets are often limited by the storage costs of 3D models. Several compression methods are available to address these limits for objects represented by triangle meshes. Many CAD and VRML models, however, are represented as quadrilateral meshes or mixed triangle/quadrilateral meshes, and these models may also require compression. We prese...
متن کامل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:
متن کاملTernary subdivision for quadrilateral meshes
Abstract. A well-documented problem of Catmull and Clark subdivision surfaces is that, in the neighborhood of extraordinary points, the curvature is unbounded and fluctuates. In fact, since one of the eigenvalues that determines elliptic shape is too small, the limit surface can have a saddle point when the designer’s input mesh suggests a convex shape. Here, we replace, near the extraordinary ...
متن کامل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 ...
متن کامل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 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2011
ISSN: 0730-0301,1557-7368
DOI: 10.1145/2070781.2024175