A QUADRATIC TIME ALGORITHM FOR THE MINMAX LENGTH TRIANGULATION HERBERT EDELSBRUNNER AND TIOW SENG TANy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the maximum edge length can b

First Page		Document Content
Date: 2003-07-20 23:05:10		A QUADRATIC TIME ALGORITHM FOR THE MINMAX LENGTH TRIANGULATION HERBERT EDELSBRUNNER AND TIOW SENG TANy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the maximum edge length can b Add to Reading List Source URL: www.comp.nus.edu.sg Download Document from Source Website File Size: 337,17 KB Share Document on Facebook