CCCG 2011, Toronto ON, August 10–12, 2011 √ Bichromatic Line Segment Intersection Counting in O(n log n) Time Timothy M. Chan∗

First Page		Document Content
Date: 2011-08-06 04:11:16 Segment tree Line segment intersection Point location Sweep line algorithm Delaunay triangulation Computational geometry Differential topology Algebraic topology Fiber bundles Geometry Mathematics Binary trees		CCCG 2011, Toronto ON, August 10–12, 2011 √ Bichromatic Line Segment Intersection Counting in O(n log n) Time Timothy M. Chan∗ Add to Reading List Source URL: 2011.cccg.ca Download Document from Source Website File Size: 275,79 KB Share Document on Facebook

	New Perspectives in Geometric Combinatorics MSRI Publications Volume 38, 1999 Combinatorial Differential Topology and Geometry DocID: 1utsl - View Document
	Differential Topology Shmuel Weinberger Eck 403 Office Hours Th 9:30-10:30 and by appointment. In class exam on February 17. Final, TBA. DocID: 1t3yS - View Document
	The classification of doubly periodic minimal tori with parallel ends Joaqu´ın P´erez∗, Magdalena Rodr´ıguez∗ and Martin Traizet June 21, 2004 Abstract. Let K be the space of properly embedded minimal tori in q DocID: 1rtz7 - View Document
	A Lorentz metric on the manifold of positive definite (2 x 2)-matrices and foliations by ellipses Marcos Salvai ´ FaMAF (UNC) – CIEM (CONICET), Cordoba, DocID: 1rsXz - View Document
	PULLING APART 2–SPHERES IN 4–MANIFOLDS ROB SCHNEIDERMAN AND PETER TEICHNER Abstract. An obstruction theory for representing homotopy classes of surfaces in 4– manifolds by immersions with pairwise disjoint images i DocID: 1rr3I - View Document