Presentation is loading. Please wait.

Presentation is loading. Please wait.

Isosurfaces Over Simplicial Partitions of Multiresolution Grids Josiah Manson and Scott Schaefer Texas A&M University.

Similar presentations


Presentation on theme: "Isosurfaces Over Simplicial Partitions of Multiresolution Grids Josiah Manson and Scott Schaefer Texas A&M University."— Presentation transcript:

1 Isosurfaces Over Simplicial Partitions of Multiresolution Grids Josiah Manson and Scott Schaefer Texas A&M University

2 Motivation: Uses of Isosurfaces

3 Motivation: Goals Sharp features Thin features Arbitrary octrees Manifold / Intersection-free

4 Motivation: Goals Sharp features Thin features Arbitrary octrees Manifold / Intersection-free

5 Motivation: Goals Sharp features Thin features Arbitrary octrees Manifold / Intersection-free Octree Textures on the GPU [Lefebvre et al. 2005]

6 Motivation: Goals Sharp features Thin features Arbitrary octrees Manifold / Intersection-free

7 Related Work Dual Contouring [Ju et al. 2002] Intersection-free Contouring on an Octree Grid [Ju 2006] Dual Marching Cubes [Schaefer and Warren 2004] Cubical Marching Squares [Ho et al. 2005] Unconstrained Isosurface Extraction on Arbitrary Octrees [Kazhdan et al. 2007]

8 Dual Contouring

9

10

11

12 Dual Contouring [Ju et al. 2002]Our method

13 Dual Contouring Dual Contouring [Ju et al. 2002]Our method

14 Related Work Dual Contouring [Ju et al. 2002] Intersection-free Contouring on an Octree Grid [Ju 2006] Dual Marching Cubes [Schaefer and Warren 2004] Cubical Marching Squares [Ho et al. 2005] Unconstrained Isosurface Extraction on Arbitrary Octrees [Kazhdan et al. 2007]

15 Dual Marching Cubes

16

17

18

19

20 [Schaefer and Warren 2004] Our method

21 Dual Marching Cubes

22 Related Work Dual Contouring [Ju et al. 2002] Intersection-free Contouring on an Octree Grid [Ju 2006] Dual Marching Cubes [Schaefer and Warren 2004] Cubical Marching Squares [Ho et al. 2005] Unconstrained Isosurface Extraction on Arbitrary Octrees [Kazhdan et al. 2007]

23 Our Method Overview Create vertices dual to every minimal edge, face, and cube Partition octree into 1-to-1 covering of tetrahedra Marching tetrahedra creates manifold surfaces Improve triangulation while preserving topology

24 Terminology Cells in Octree – Vertices are 0-cells – Edges are 1-cells – Faces are 2-cells – Cubes are 3-cells Dual Vertices – Vertex dual to each m-cell – Constrained to interior of cell

25 Terminology Cells in Octree – Vertices are 0-cells – Edges are 1-cells – Faces are 2-cells – Cubes are 3-cells Dual Vertices – Vertex dual to each m-cell – Constrained to interior of cell

26 Terminology Cells in Octree – Vertices are 0-cells – Edges are 1-cells – Faces are 2-cells – Cubes are 3-cells Dual Vertices – Vertex dual to each m-cell – Constrained to interior of cell

27 Terminology Cells in Octree – Vertices are 0-cells – Edges are 1-cells – Faces are 2-cells – Cubes are 3-cells Dual Vertices – Vertex dual to each m-cell – Constrained to interior of cell

28 Terminology Cells in Octree – Vertices are 0-cells – Edges are 1-cells – Faces are 2-cells – Cubes are 3-cells Dual Vertices – Vertex dual to each m-cell – Constrained to interior of cell

29 Our Partitioning of Space Start with vertex

30 Our Partitioning of Space Build edges

31 Our Partitioning of Space Build faces

32 Our Partitioning of Space Build cubes

33 Minimal Edge (1-Cell)

34

35

36

37 Building Simplices

38

39

40

41

42

43

44

45 Traversing Tetrahedra

46

47 Octree Traversal from DC [Ju et al. 2002]

48 Finding Features Minimize distances to planes

49 Surfaces from Tetrahedra

50 Manifold Property Vertices are constrained to their dual m-cells Simplices are guaranteed to not fold back Tetrahedra share faces Freedom to move allows reproducing features

51 Finding Features

52

53

54

55 Improving Triangulation

56 Possible Problem: Face BeforeAfter

57 Possible Problem: Edge BeforeAfter

58 Preserving Topology Only move vertex to surface if there is a single contour. Count connected components.

59 Preserving Topology Only move vertex to surface if there is a single contour. Count connected components.

60 Improving Triangulation Before After

61 Results

62

63 Times Armadillo ManMechanical PartLensTank Depth89108 Ours2.58s4.81s9.72s8.78s Ours (Improved Triangles) 2.69s6.80s10.35s8.19s Dual Marching Cubes1.85s3.54s6.42s5.29s Dual Contouring1.35s2.97s5.99s3.78s

64 Conclusions Calculate isosurfaces over piecewise smooth functions Guarantee manifold surfaces Reproduce sharp and thin features Improved triangulation

65

66 Contour Refinement & Error Metric

67 Finding Features

68 Limitations Imperfect detection of sharp edges with multiple features Cube corners cannot move, limiting triangulation improvements Speed

69 Times Time Breakdown of Tank OursOurs (Improved Triangles)DMCDC Total Time8.78s8.19s5.29s3.78s Time Tree4.02s6.13s3.41s2.69s Time Extract4.77s2.06s1.88s1.09s Triangles3.63M1.13M1.16M727k

70 Traversing Edges

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91


Download ppt "Isosurfaces Over Simplicial Partitions of Multiresolution Grids Josiah Manson and Scott Schaefer Texas A&M University."

Similar presentations


Ads by Google