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

	QUADRATIC LINE COMPLEXES OLIVIER DEBARRE Abstract. In this talk, a quadratic line complex is the intersection, in its Pl¨ ucker embedding, of the Grassmannian of lines in an 4-dimensional projective space with a quadric DocID: 1xUQZ - View Document
	The weighted complete intersection theorem Yuval Filmus∗ April 19, 2017 Abstract The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum DocID: 1vpQE - View Document
	Reed Avenue Improvement Projects: Phase 1 - I Street to Manning Avenue: The City of Reedley of completed Phase 1 in May ofThe first phase of the project constructed the roundabout at the intersection of Reed and N DocID: 1veBw - View Document
	arXiv:1608.06696v1 [cs.DC] 24 AugFlexible Paxos: Quorum intersection revisited Heidi Howard1,2 , Dahlia Malkhi1 and Alexander Spiegelman1,3 1 DocID: 1vee5 - View Document
	Detroit Modern Wayne State University Tour DETROIT MODERN Wayne State University Walking Tour This Wayne State University walking tour begins at the intersection of Cass and Warren Avenues and takes about one to DocID: 1vdMW - View Document