Back to Results
First PageMeta Content
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

Document Date: 2011-08-06 04:11:16

Open Document

File Size: 275,79 KB

Share Result on Facebook

City

Washington / DC / Philadelphia / Berlin / Kano / M. Urabe / London / New York / /

Country

United States / United Kingdom / /

/

Facility

University of Waterloo / NATO Advanced Science Institute / /

IndustryTerm

trapezoid sweep algorithm / online counterpart / level algorithm / exponential search trees / give algorithms / balanced search tree / predecessor search data structures / predecessor search data structures log2 log / predecessor search / /

Organization

NATO Advanced Science Institute / David R. Cheriton School of Computer Science / University of Waterloo / Society for Industrial and Applied Mathematics / IEEE Computer Society / /

Person

J. ACM / Discrete / Bryan T. Wilkinson / Computational Geometry / /

ProgrammingLanguage

DC / /

ProvinceOrState

New York / /

PublishedMedium

Computer Graphics / Theory of Computing / Lecture Notes in Computer Science / /

Technology

give algorithms / 2 High-Level Algorithm / RAM / 3-d / high-level algorithm / trapezoid sweep algorithm / CAD / /

SocialTag