Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
AN O(n2 log n) TIME ALGORITHM FOR THE MINMAX ANGLE TRIANGULATION HERBERT EDELSBRUNNERy , TIOW SENG TANy AND ROMAN WAUPOTITSCHy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the m
Add to Reading List
Document Date: 2003-07-20 23:05:10
Open Document
File Size: 241,10 KB
Share Result on Facebook
AN O(n2 log n) TIME ALGORITHM FOR THE MINMAX ANGLE TRIANGULATION HERBERT EDELSBRUNNERy , TIOW SENG TANy AND ROMAN WAUPOTITSCHy Abstract. We show that a triangulation of a set of n points in the plane that minimizes the m