1 / 16

Distance fields

Distance fields. The program. Multiple perspectives: euclidean, analytic, transformational Build algebraic skills Foreshadow future math concepts Build intuitions (not bad mnemonics…show mine?). Scalar field. Contour map Like a 3d function projected on a plane Slope field Weather map

neveah
Download Presentation

Distance fields

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. Distance fields

  2. The program • Multiple perspectives: euclidean, analytic, transformational • Build algebraic skills • Foreshadow future math concepts • Build intuitions (not bad mnemonics…show mine?)

  3. Scalar field • Contour map • Like a 3d function projected on a plane • Slope field • Weather map • Hiking map (contour map)

  4. Distance field • Not my invention • Used in image processing (though I don’t know how!) • http://http.developer.nvidia.com/GPUGems3/gpugems3_ch34.html • 34.1.1 Overview of Signed Distance Fields • A signed distance field is represented as a grid sampling of the closest distance to the surface of an object represented as a polygonal model. Usually the convention of using negative values inside the object and positive values outside the object is applied. Signed distance fields are very attractive in computer graphics and related fields. Often they are used for collision detection in cloth animation (Bridson et al. 2003), multi-body dynamics (Guendelman et al. 2003), deformable objects (Fisher and Lin 2001), mesh generation (Molino et al. 2003), motion planning (Hoff et al. 1999), and sculpting (Bærentzen 2001). • However, fast and robust signed distance field computation is often either a performance bottleneck, because of high-resolution fields, or a nearly impossible task because of degeneracies in input meshes. Thus, computation can be tedious and time-consuming. For example, a naive implementation on a CPU can take hours, even days, to complete for high-resolution grids (2563 resolution or greater).

  5. http://gamma.cs.unc.edu/DIFI/images/HugoVolRenderWireframe.pnghttp://gamma.cs.unc.edu/DIFI/images/HugoVolRenderWireframe.png

  6. Distance field • Distance to a set of points in plane • Soccer goal example • What is a distance field for a point? • Image • What are the contours? • What is equation of a contour? • Inside/ outside / on contour

  7. insight • Distance from a point to a line • It’s where a contour is tangent to the line (otherwise it crosses in two places. Draw angle bisector, etc.) • Is there a discussion of a similar proof in a common source?

  8. Two points • What will the contours look like? • What is that other line? • What different kinds of contours are there? (3: distinct circles, tangent circles, ‘conjoined circles’) Under what circumstances does each appear? • Notice that boundary is not a contour…not all points on boundary are the same distance. • What is significance of points on the boundary? • Points on this side of boundary closer to this point, etc. • I’m asking bc kids have trouble w this / leads into graphing inequalities

  9. Three points • Circumcenter • Easy to see that where perp bisectors meet is equidistant to all three vertices • Divides triangle into three regions…closer to each vertex

  10. More points: Voronoi diagrams • Cell phone towers • Crystallography • more • Voronoi game v1 • V2 • Competition: what strategies are effective

  11. Voronoi continued • Writing name • When do perp bisectors of four points meet at one point? • Other questions • Classify quadrilaterals

  12. A line

  13. Two lines

  14. Three lines

  15. Classifying quadrilaterals by angle bisectors

  16. A point and a line

More Related