Back to Results
First PageMeta Content
Delaunay triangulation / Point location / Expectation–maximization algorithm / Voronoi diagram / Algorithm / Jump-and-Walk algorithm / Pitteway triangulation / Triangulation / Mathematics / Geometry


I/O-Efficient Construction of Constrained Delaunay Triangulations Pankaj K. Agarwal1? , Lars Arge2,1?? , and Ke Yi1? ? ? 1 Department of Computer Science, Duke University, Durham, NC 27708, USA.
Add to Reading List

Document Date: 2011-04-05 22:51:13


Open Document

File Size: 309,47 KB

Share Result on Facebook

City

Aarhus / /

Company

D&C INC / Intel / /

Country

United States / Denmark / /

Currency

pence / /

/

Facility

Duke University / University of Aarhus / /

IndustryTerm

recursive algorithm / terrain mapping technologies / internal memory algorithm / randomized incremental algorithm / triangulated irregular network / road networks / theoretical algorithm / multi-round theoretical algorithm / software libraries / point-location algorithm / external memory algorithm / triangulation algorithm / triangulation algorithms / /

OperatingSystem

Linux / /

Organization

University of Aarhus / National Science Foundation / Department of Computer Science / Israel Binational Science Foundation / Danish National Science Research Council / Duke University / Durham / /

ProvinceOrState

North Carolina / /

Technology

constrained Delaunay triangulation algorithm / Laser / three algorithms / 3 Experiments Simplified algorithm / external memory algorithm / randomized incremental algorithm / theoretical algorithm / Linux / internal memory algorithm / Delaunay triangulation algorithms / INC algorithm / point-location algorithm / developed algorithms / time RAM-model algorithms / terrain mapping technologies / multi-round theoretical algorithm / EM algorithm / RAID / recursive algorithm / SCSI / two algorithms / simplified algorithm / Delaunay triangulation algorithm / /

SocialTag