Back to Results
First PageMeta Content
Data management / Point location / Arrangement of lines / Trie / T-tree / Computing / Binary trees / B-tree / Mathematics


CCCG 2010, Winnipeg MB, August 9–11, 2010 Towards a Dynamic Data Structure for Efficient Bounded Line Range Search Thuy Thi Thu Le Bradford G. Nickerson∗
Add to Reading List

Document Date: 2010-07-19 10:46:15

Open Document

File Size: 142,82 KB

Share Result on Facebook

City

Philadelphia / Fukuoka / New York / /

Country

Japan / United States / Canada / /

/

Facility

University of New Brunswick / /

IndustryTerm

geometric search problem / point location using persistent search trees / Line segment search / point search / search proceeds / axis-aligned orthogonal range search / search algorithm / persistent search tree / search time / range search / range search time complexity / logarithmic search time / similar algorithm / business to business / balanced search tree / /

Organization

Faculty of Computer Science / University of New Brunswick / /

Person

Bradford G. Nickerson / Thuy Thi / /

ProgrammingLanguage

C / /

ProvinceOrState

New Brunswick / New York / /

Technology

similar algorithm / search algorithm / Computational Geometry Algorithms / /

SocialTag