Back to Results
First PageMeta Content
Computational geometry / Nearest neighbor graph / Nearest neighbor search / Connectivity / Delaunay triangulation / Yao graph / Proximity problems / Geometry / Information science / Mathematics


CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Kinetic Data Structures for the Semi-Yao Graph and All Nearest Neighbors in Rd Zahed Rahmati∗
Add to Reading List

Document Date: 2014-06-17 10:55:30

Open Document

File Size: 414,15 KB

Share Result on Facebook

City

Davenport / Ranked / Halifax / New York / /

Company

Springer-Verlag New York Inc. / Let Inc / /

Country

United States / Canada / Iran / /

/

Facility

Sharif University of Technology / University of Victoria / /

IndustryTerm

worstcase processing time / randomized search trees / deterministic kinetic algorithm / randomized kinetic algorithm / kinetic algorithm / binary search tree / Approximation algorithms / /

Organization

Sharif University of Technology / University of Victoria / Department of Computer Science / Link / Department of Computer Engineering / /

Person

Z. Rahmati / V / Sue Whitesides / Semi-Yao / Donald Knuth / Valerie King / /

Position

vp / King / mp / internal nodes vp / p∈P mp / /

ProvinceOrState

Nova Scotia / New York / Victoria / /

PublishedMedium

Journal of the ACM / Theory of Computing / /

Technology

deterministic kinetic algorithm / previous randomized kinetic algorithm / time algorithm / randomized kinetic algorithm / kinetic algorithm / Approximation algorithms / /

SocialTag