Back to Results
First PageMeta Content
Euclidean plane geometry / Polytopes / Polyhedra / Arrangement of lines / K-set / Dual polyhedron / Randomized algorithm / Sweep line algorithm / Polygon / Geometry / Mathematics / Discrete geometry


CCCG 2011, Toronto ON, August 10–12, 2011 Algorithms for Bivariate Majority Depth Dan Chen∗ Abstract
Add to Reading List

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

Open Document

File Size: 261,32 KB

Share Result on Facebook

City

Berlin / Heidelberg / Vancouver / Cambridge / Montreal / New York / /

Company

SIAM Journal / MIT Press / Centerpoint / /

Country

Germany / United States / Canada / /

/

Facility

Rutgers University / Carleton University / /

IndustryTerm

topological sweep algorithm / e-level / sweep line algorithm / k-level algorithms / /

Organization

School of Computer Science / Congress / Carleton University / Ottawa / International Congress / American Statistical Association / MIT / Rutgers University / Department of Statistics / /

Person

Pat Morin / /

ProvinceOrState

New York / Ontario / /

PublishedMedium

SIAM Journal on Computing / Theoretical Computer Science / Journal of the American Statistical Association / Lecture Notes in Computer Science / /

Technology

topological sweep algorithm / RAM / randomized algorithm / An algorithm / k-level algorithms / time algorithm / sweep line algorithm / 2011 Algorithms / /

SocialTag