Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

111

FOCS
2009
IEEE

91views Theoretical Computer Science» more FOCS 2009»

Delaunay Triangulations in O(sort(n)) Time and More

15 years 26 days ago

Delaunay Triangulations in O(sort(n)) Time and More

Download page.mi.fu-berlin.de

Kevin Buchin, Wolfgang Mulzer

Real-time Traffic

FOCS 2009 | Theoretical Computer Science |

claim paper

Related Content

» An Improved Parallel Algorithm for Delaunay Triangulation on Distributed Memory Parallel C...

» Efficient minimum spanning tree construction without Delaunay triangulation

» The Big Sweep On the Power of the Wavefront Approach to Voronoi Diagrams

» Computational geometry based placement migration

» Accurate integration of multiview range images using kmeans clustering

» Localized construction of bounded degree and planar spanner for wireless ad hoc networks

Post Info
More Details (n/a)

Added	17 Feb 2011
Updated	17 Feb 2011
Type	Journal
Year	2009
Where	FOCS
Authors	Kevin Buchin, Wolfgang Mulzer

Comments (0)