Metro: Measuring Error on Simplified Surfaces

  title={Metro: Measuring Error on Simplified Surfaces},
  author={Paolo Cignoni and C. Rocchini and Roberto Scopigno},
  journal={Computer Graphics Forum},
This paper presents a new tool, Metro, designed to compensate for a deficiency in many simplification methods proposed in literature. Metro allows one to compare the difference between a pair of surfaces (e.g. a triangulated mesh and its simplified representation) by adopting a surface sampling approach. It has been designed as a highly general tool, and it does no assumption on the particular approach used to build the simplified representation. It returns both numerical results (meshes areas… 
PolyMeCo - a polygonal mesh comparison tool
A tool is presented which enhances the way users perform mesh analysis and comparison, by providing an environment where several visualization options are available and can be used in a coordinated way.
Mesh massage
This work uses a general framework for post-processing and optimizing surface meshes with respect to various target criteria to reduce the texture distortion in animated mesh sequences, to improve the results of cross-parameterizations, and to minimize the distance between meshes and their remeshes.
Papercraft Models using Generalized Cylinders
An algorithm for approximating a 2-manifold 3D mesh by a set of developable surfaces represented as a strip of triangles not necessarily taken from the original mesh is introduced.
Aliasing-free simplification of surface meshes
A robust simplification technique, which preserves geometric features such as sharp edges or corners from original surfaces, and produces valid meshes without aliasing artifacts, without giving up the shape fidelity and quality of the mesh elements.
Measuring errors for massive triangle meshes
The experiments show that the proposed method is very efficient in terms of memory cost, while producing results comparable to the existent tools for the small and medium size meshes.
Mesh Massage : A Versatile Mesh Optimization Framework
The framework is used to reduce the texture distortion in animated mesh sequences, to improve the results of cross-parameterizations, and to minimize the distance between meshes and their remeshes.
A comparative study on polygonal mesh simplification algorithms
  • M. Yirci, ilkay Ulusoy
  • Computer Science
    2009 IEEE 17th Signal Processing and Communications Applications Conference
  • 2009
This work tries to supply a guidance for developers for publicly available mesh libraries in order to implement polygonal mesh simplification algorithms that are embedded in open source libraries: CGAL, VTK and OpenMesh are compared with the Metro geometric error measuring tool.
Building Multiresolution Models for Fast Interactive Visualization
A new method for constructing a multi-resolution representation for complex triangle meshes and a new algorithme to reene and to coarsen a simpliied mesh at variable resolution with respect to a given error function is described.
Topology-reducing surface simplification using a discrete solid representation
This paper presents a new approach for generating coarse-level approximations of topologically complex models and shows that these methods perform significantly better than other surface-based approaches when simplifying topologically-rich models such as scene parts and complex mechanical assemblies.
Area of surface as a basis for vertex removal based mesh simplification
A new, area-based mesh simplification algorithm is described that removes the center vertex of a polygon which consists of n/spl ges/3 faces and represents that polygon with n-2 faces and iteratively determines which vertex is to be removed using the proposed area- based distortion measurement.


Surface simplification using quadric error metrics
This work has developed a surface simplification algorithm which can rapidly produce high quality approximations of polygonal models, and which also supports non-manifold surface models.
Mesh reduction with error control
This work presents a new algorithm to reduce the number of triangles of a mesh without exceeding a user defined Hausdorff distance between the original and simplified mesh, which allows one to generate a hierarchical geometric representation in a canonical way and automatically preserves sharp edges.
Mesh optimization
It is shown that mesh optimization can be effectively used in at least two applications: surface reconstruction from unorganized points, and mesh simplification (the reduction of the number of vertices in an initially dense mesh of triangles).
Full‐range approximation of triangulated polyhedra.
A new algorithm for automatically computing approximations of a given polyhedral object at different levels of details, similar to the region‐merging method used for image segmentation is proposed.
Re-tiling polygonal surfaces
This paper shows how a new set of vertices can be distributed over the surface of a model and connected to one another to create a re-tiling of a surface that is faithful to both the geometry and the topology of the original surface.
Multi-resolution 3D approximations for rendering complex scenes
This work presents a simple, effective, and efficient technique for approximating arbitrary polyhedra based on triangulation and vertex-clustering, and produces a series of 3D approximations that resemble the original object from all viewpoints, but contain an increasingly smaller number of faces and vertices.
Simplification envelopes
We propose the idea of simplification envelopes for generating a hierarchy of level-of-detail approximations for a given polygonal model. Our approach guarantees that all points of an approximation
Progressive meshes
The progressive mesh (PM) representation is introduced, a new scheme for storing and transmitting arbitrary triangle meshes that addresses several practical problems in graphics: smooth geomorphing of level-of-detail approximations, progressive transmission, mesh compression, and selective refinement.