דלג לתוכן (מקש קיצור 's')
Logo of Technion
Logo of CS Department
אירועים

אירועים

CGGC Seminar: Localizing the Delaunay Triangulation and its Parallel Implementation
event speaker icon
רנג'י צ'ן (מדעי המחשב, טכניון)
event date icon
יום ראשון, 20.1.2013, 13:00
event location icon
חדר 337, בניין טאוב למדעי המחשב
The Delaunay triangulation and its dual, the Voronoi diagram, are among the most fundamental structures in computational geometry. We show how to localize the Delaunay triangulation of a given planar point set, namely, bound the set of points which are possible Delaunay neighbors of a given point. We then exploit this observation in an algorithm for constructing the Delaunay triangulation (and its dual Voronoi diagram) by computing the Delaunay neighbors (and Voronoi cell) of each point independently. While this does not lead to the fastest serial algorithm possible for Delaunay triangulation, it does lead to an efficient parallelization strategy which achieves almost perfect speedups on multicore machines.
[בחזרה לאינדקס האירועים]