Back to Results
First PageMeta Content
Search algorithms / Database theory / Range searching / Fractional cascading / Discrete geometry / Theoretical computer science / Computational geometry / Dynamic convex hull / Bin / Graph theory / Mathematics / Data management


CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Data Structures for Restricted Triangular Range Searching Nadia M. Benbernou∗ Mashhood Ishaque†
Add to Reading List

Document Date: 2008-10-29 00:07:32

Open Document

File Size: 167,02 KB

Share Result on Facebook

City

London / /

Company

AMS Press / /

Country

United States / United Kingdom / /

/

Facility

We store / Tufts University / Massachusetts Institute of Technology / /

IndustryTerm

time using binary search / linear-time exhaustive search / /

Organization

National Science Foundation / Massachusetts Institute of Technology / Tufts University / /

Person

Micha Sharir / Burton Rosenberg / John Iacono / Subhas C. Nandy / Ovidiu Daescu / Leo J. Guibas / Chan-Su Shin / Herbert Edelsbrunner / Emo Welzl / Partha P. Goswami / Leonidas J. Guibas / Joachim Gudmundsson / Alexander Wolff / Rephael Wenger / D. T. Lee / Jeff Erickson / Ningfang Mi / Boris Aronov / Michiel H. M. Smid / Nadia M. Benbernou∗ Mashhood Ishaque / Sandip Das / Stefan Langerman / Erik Demaine / Adv / Diane L. Souvaine / Prosenjit Bose / Bernard Chazelle / Erik D. Demaine / /

Position

author / /

ProvinceOrState

Massachusetts / /

SocialTag