Back to Results
First PageMeta Content
Sorting algorithms / B-tree / Analysis of algorithms / Line segment intersection / Cache-oblivious algorithm / Line segment / Merge sort / Point location / Bentley–Ottmann algorithm / Mathematics / Combinatorics / Order theory


Cache-Oblivious Red-Blue Line Segment Intersection Lars Arge1,? , Thomas Mølhave1,?? , and Norbert Zeh2,? ? ? 1 2
Add to Reading List

Document Date: 2014-03-13 08:10:55

Open Document

File Size: 198,26 KB

Share Result on Facebook

City

Halifax / /

Company

Goodrich / /

Country

Denmark / Canada / /

/

Facility

University of Aarhus / Dalhousie University / /

IndustryTerm

memory systems / intersection type using several applications / cache-oblivious orthogonal line-segment intersection algorithm / cache-oblivious algorithm / cache-oblivious sorting algorithms / external-memory algorithm / /

Organization

Canadian Foundation for Innovation / Danish National Research Foundation / Center for Massive Data Algorithmics / Danish Strategic Research Council / University of Aarhus / Faculty of Computer Science / US Army Research Office / Natural Sciences and Engineering Research Council of Canada / Danish National Science Research Council / Department of Computer Science / Dalhousie University / /

Position

Rt / /

ProvinceOrState

Nova Scotia / /

Technology

cache-oblivious orthogonal line-segment intersection algorithm / Our algorithm / paging / cache-oblivious sorting algorithms / RAM-model algorithm / cache-oblivious algorithm / external-memory algorithm / /

SocialTag