Back to Results
First PageMeta Content
Proof theory / Diophantine approximation / Dynamic programming / Earley parser / Euclidean algorithm / Mathematics / Mathematical analysis / Mathematical logic


CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Maximal Covering by Two Isothetic Unit Squares Priya Ranjan Sinha Mahapatra ∗
Add to Reading List

Document Date: 2008-10-29 00:05:31

Open Document

File Size: 158,56 KB

Share Result on Facebook

City

Berlin / Kolkata / /

Facility

square S / India Statistical Institute / /

IndustryTerm

similar applications / parallel algorithm / computing / Detail algorithms / search space / balanced binary search tree / /

NaturalFeature

S. Chandran mountain / D. mountain / Chandran mountain / S. mountain / /

Organization

India Statistical Institute / /

Person

M. Overmars / Berg / J. Miguel Diaz-Banez / Sergio Cabello / Subhas C. Nandy / Jorge Urrutia / Inmaculada Ventura / Sandip Das / O. Schwarzkopf / M. Van Kreveld / Partha P. Goswami / Imma Ventura / Petru Pau / Priya Ranjan Sinha Mahapatra / J. Antoni Sellares / Matthew Dickerson / Carlos Seara / Gill Barequet / /

Technology

proposed algorithm / 4 Algorithm / time algorithm / Detail algorithms / /

SocialTag