Back to Results
First PageMeta Content
Discrete mathematics / Computational geometry / Diagrams / Voronoi diagram / Proximity problems / Time complexity / Largest empty rectangle / Smallest circle problem / Mathematics / Theoretical computer science / Discrete geometry


On k-Enclosing Objects in a Coloured Point Set Luis Barba∗ Stephane Durocher†‡ Debajyoti Mondal†
Add to Reading List

Document Date: 2013-08-11 21:51:56


Open Document

File Size: 339,77 KB

Share Result on Facebook

City

Bruxelles / Waterloo / /

Company

SIAM J. Comp. / J. Comp / /

Country

Belgium / Canada / Spain / /

/

Facility

University of Saskatchewan / Carleton University / University of Manitoba / We store / /

IndustryTerm

deterministic algorithms / Static and dynamic algorithms / randomized algorithms / depth-first search / Linear-time algorithms / linear-time algorithm / Space-efficient and fast algorithms / /

Organization

University of Manitoba / Natural Sciences and Engineering Research Council of Canada / Universitat Polit` / Carleton University / University of Saskatchewan / /

Person

Robert Fraser† Jason Morrison / Voronoi / Cat / Stephane Durocher†‡ Debajyoti / /

Position

author / General / /

Product

Bentley / /

ProvinceOrState

Saskatchewan / Manitoba / Ontario / /

PublishedMedium

IEEE Transactions on Computers / /

Technology

Linear-time algorithms / time algorithm / ESA / improved algorithm / machine learning / linear-time algorithm / Static and dynamic algorithms / k-Enclosing Object The algorithms / /

SocialTag