degree-driven geometric algorithm design
DESCRIPTION
Degree-driven Geometric Algorithm Design. David L. Millman University Of North Carolina - Chapel Hill. ITCS’12 9 January 2012. An Example Problem. Given n sites on a pixel grid, what is the closest site to each pixel? How much precision is needed to determine this?. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Degree-driven Geometric Algorithm Design](https://reader036.vdocuments.net/reader036/viewer/2022062518/56813fd9550346895daabed0/html5/thumbnails/1.jpg)
Degree-driven Geometric Algorithm Design
David L. Millman
University Of North Carolina - Chapel Hill
ITCS’129 January 2012
![Page 2: Degree-driven Geometric Algorithm Design](https://reader036.vdocuments.net/reader036/viewer/2022062518/56813fd9550346895daabed0/html5/thumbnails/2.jpg)
An Example ProblemAn Example Problem
Given n sites on a pixel grid, what is the closest site to each pixel?
How much precision is needed to determine this?
2
![Page 3: Degree-driven Geometric Algorithm Design](https://reader036.vdocuments.net/reader036/viewer/2022062518/56813fd9550346895daabed0/html5/thumbnails/3.jpg)
Why Precision [Y97]Why Precision [Y97]
3
![Page 4: Degree-driven Geometric Algorithm Design](https://reader036.vdocuments.net/reader036/viewer/2022062518/56813fd9550346895daabed0/html5/thumbnails/4.jpg)
Analyzing Precision [LPT99]
e.g. Precision of the Orientation test:
4
![Page 5: Degree-driven Geometric Algorithm Design](https://reader036.vdocuments.net/reader036/viewer/2022062518/56813fd9550346895daabed0/html5/thumbnails/5.jpg)
Analyzing Precision [LPT99]
e.g. Precision of the Orientation test:
4
![Page 6: Degree-driven Geometric Algorithm Design](https://reader036.vdocuments.net/reader036/viewer/2022062518/56813fd9550346895daabed0/html5/thumbnails/6.jpg)
Analyzing Precision [LPT99]
e.g. Precision of the Orientation test:
4
![Page 7: Degree-driven Geometric Algorithm Design](https://reader036.vdocuments.net/reader036/viewer/2022062518/56813fd9550346895daabed0/html5/thumbnails/7.jpg)
Analyzing Precision [LPT99]
e.g. Precision of the Orientation test:
![Page 8: Degree-driven Geometric Algorithm Design](https://reader036.vdocuments.net/reader036/viewer/2022062518/56813fd9550346895daabed0/html5/thumbnails/8.jpg)
Analyzing Precision [LPT99]
e.g. Precision of the Orientation test:
Degree 2
![Page 9: Degree-driven Geometric Algorithm Design](https://reader036.vdocuments.net/reader036/viewer/2022062518/56813fd9550346895daabed0/html5/thumbnails/9.jpg)
Some Results of My ThesisSome Results of My Thesis
5
![Page 10: Degree-driven Geometric Algorithm Design](https://reader036.vdocuments.net/reader036/viewer/2022062518/56813fd9550346895daabed0/html5/thumbnails/10.jpg)
Other ProjectsOther Projects
Parallel computational geometryVicente H.F. Batista, David L. Millman, Sylvain Pion, and Johannes Singler. Parallel geometric algorithms for
multi-core computers. Computational Geometry, 43(8):663 – 677, 2010.
Monte Carlo algos for the neutron transport equationDavid L. Millman, David P. Griesheimer, Brian Nease and Jack Snoeyink. Robust volume calculation for
constructive solid geometry (CSG) components in Monte Carlo Transport Calculations. Under Review
David P. Griesheimer, David L. Millman, and Clarence R. Willis. Analysis of distances between inclusions in finite
binary stochastic materials. Journal of Quantitative Spectroscopy and Radiative Transfer in Journal of Quantitative
Spectroscopy and Radiative Transfer, 112(4):577–598, March 2011.
6