1 / 101

Mesh-Based Methods for Multiresolution Representations

Mesh-Based Methods for Multiresolution Representations. Instructor: Ken Joy Center for Image Processing and Integrated Computing Computer Science Department University of California, Davis joy@cs.ucdavis.edu. Multiresolution Methods. Multiresolution Methods. (Crater Lake, USA).

orde
Download Presentation

Mesh-Based Methods for Multiresolution Representations

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Mesh-Based Methods for Multiresolution Representations Visualization 2000 Tutorial Instructor: Ken Joy Center for Image Processing and Integrated Computing Computer Science Department University of California, Davis joy@cs.ucdavis.edu

  2. Multiresolution Methods

  3. Multiresolution Methods (Crater Lake, USA) (Courtesy: M.Bertram, UC Davis)

  4. Multiresolution Methods (Crater Lake, USA) (Courtesy: M.Bertram, UC Davis)

  5. Multiresolution Methods (Crater Lake, USA) (Courtesy: M.Bertram, UC Davis)

  6. Multiresolution Methods (Crater Lake, USA) (Courtesy: M.Bertram, UC Davis)

  7. Objective • We wish to create a multiresolution view of a data set, and • We want to do this by dealing only with the mesh and the data values directly. • No wavelets! • No splines! • Just the mesh!

  8. The Basic Methods • Bottom-up Methods • Start with the finest resolution. • Iteratively remove elements to generate lower-resolution versions of the data • Top-down Methods • Start with a simplified mesh that coarsely approximates the given data set. • Add elements to this mesh, generating better approximations at each step.

  9. Classification of bottom-up methods • Select an element of the mesh • A vertex • An edge • A triangle • A tetrahedron • Remove the element and all mesh edges that connect to the element. • Replace the resulting hole in the mesh with fewer triangular or tetrahedral elements.

  10. Classification of bottom-up methods

  11. Bottom-up methods Remove elements, creating a hole in the mesh.

  12. Classification of bottom-up methods Re-triangulate the hole using fewer elements

  13. Bottom-up Methods • We would like to fill the hole “optimally” • The error between the two triangulations should be minimized. (Examples: height fields) • Hausdorff error is best, but most errors are approximated (L1,L2, L∞) • The number of triangles should be minimized. • “reduced” is OK

  14. Bottom-up Methods • Most methods operate from a priority queue of elements. • Vertices, edges, or triangles are ordered in a priority queue and processed one-by-one as they come out of the queue. • The “cost function,” which assigns the priority, determines the ordering.

  15. Bottom-up Methods • Vertex Removal Methods • Edge Removal Methods • Triangle Removal Methods • Tetrahedra Removal Methods

  16. Vertex removal methods Select an element to be eliminated.

  17. Vertex removal methods Select all triangles sharing this vertex.

  18. Vertex removal methods Remove the selected triangles, creating the hole.

  19. Vertex removal methods Fill the hole with triangles.

  20. Vertex removal methods • Most frequently used method of triangulations: • Use a constrained Delaunay triangulation to fill the hole (Schroeder, et al.). • Works best on height fields • Must alter the “Delaunay” criterion slightly to work with data sets that are not height fields

  21. Prioritizing Vertices for Removal • Using a point-to-plane distance test. • Fit a plane through the point neighboring each vertex. • Measure the distance of each vertex from its respective best-fit plane. • Higher priority to those points that have associated the smaller distances.

  22. Edge removal methods Select an edge to be eliminated.

  23. Edge removal methods Select all triangles adjacent to this edge.

  24. Edge removal methods Remove these triangles, creating a hole.

  25. Edge removal methods Fill the hole with triangles.

  26. Triangle removal methods Select a triangle for removal

  27. Triangle removal methods Select all triangles that are adjacent to the selected one.

  28. Triangle removal methods Remove the selected triangles

  29. Triangle removal methods Re-triangulate the region

  30. Bottom-up methods • Mathematical conditions must be established that select the element to be removed. • Methods must be established that “optimally” fill the hole, minimizing the “error” between the resulting data sets.

  31. Vertex removal methods

  32. Vertex removal methods Use a constrained Delaunay triangulation to fill the hole. (Schroeder, et al., 1992).

  33. Edge collapse methods

  34. Edge collapse methods

  35. Edge collapse methods

  36. Edge collapse methods

  37. Edge collapse methods

  38. Edge collapse methods

  39. Edge collapse methods

  40. Edge collapse methods

  41. Edge collapse methods

  42. Edge collapse methods

  43. Edge collapse methods

  44. Triangle collapse methods

  45. Triangle collapse methods

  46. Triangle collapse methods

  47. Triangle collapse methods

  48. Triangle collapse methods

  49. Priority of an element. Prioritizes for topology characteristics you wish to select Prioritizes for the characteristic you want to select Prioritizes inversely for artifacts that your algorithm produces that you would like to avoid. Prioritizing Elements P(E) = F(E) + T(E) + A(E)

  50. Priority-Queue Methods • Using the priority (cost) function, prioritize all elements in the mesh. • Collapse the element with the lowest priority. • Re-adjust the priorities of the elements of the queue affected by the collapse.

More Related