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

First Page		Document Content
Date: 2015-07-24 06:57:56 Linear algebra Sorting algorithms Computational geometry Cache Models of computation Line segment Cache-oblivious algorithm B-tree Merge sort Intersection Trie BentleyOttmann algorithm		Cache-Oblivious Red-Blue Line Segment Intersection Lars Arge1,? , Thomas Mølhave1,?? , and Norbert Zeh2,? ? ? 1 2 Add to Reading List Source URL: users.cs.duke.edu Download Document from Source Website File Size: 198,26 KB Share Document on Facebook

	Sorting and a Tale of Two Polytopes Jean Cardinal ULB, Brussels, Belgium Algorithms & Permutations, Paris, 2012 DocID: 1uPKr - View Document
	Average-case complexity analysis of perfect sorting by reversals Mathilde Bouvel with Cedric Chauve, Marni Mishna and Dominique Rossin Algorithms and Permutations 2012 DocID: 1uPKg - View Document
	Parallel Memetic Genetic Algorithms for Sorting Unsigned Genomes by Translocations Lucas A. da Silveira ´ Jos´e L. Soncco-Alvarez DocID: 1sSnj - View Document
	6.006 Intro to Algorithms QUIZ 2 REVIEW NOTES - Part 2 April 12, 2011 DocID: 1rsoU - View Document
	CSE 181 Project guidelines DocID: 1rn8e - View Document