Back to Results
First PageMeta Content
Discrete geometry / Computational geometry / Lattice points / Order theory / Diagrams / Voronoi diagram / Lattice / Total order / Packing problem / Mathematics / Geometry / Abstract algebra


CCCG 2007, Ottawa, Ontario, August 20–22, 2007 A Lower Bound on the Area of a 3-Coloured Disc Packing Peter Brass∗ Ferran Hurtado†
Add to Reading List

Document Date: 2008-10-28 21:29:35


Open Document

File Size: 216,95 KB

Share Result on Facebook

City

Ottawa / /

Company

Fiat / Las Vegas NV / Cisco Systems Inc. / Cellular Networks / /

/

Facility

University of Waterloo / City College / McGill’s Bellairs Research Institute / /

IndustryTerm

wireless hardware maker / univercd/ cc/ td/ doc/ product/ wireless/ airo1200/ accsspts/ techref/ channel / wireless network deployments / then computing / Wireless Infrastructure Network Deployment / online version / wireless network / incremental insertion algorithm / Wireless Communications / online algorithms / evidence that our algorithm / wireless network deployment problem / wireless networks / wireless access points / /

NaturalFeature

accsspts/ techref/ channel / /

Organization

City College / London Mathematical Society / Department of Computer Science / McGill’s Bellairs Research Institute / University of Waterloo / Universitat Polit` / /

Person

Peter Brass∗ Ferran Hurtado / Sue Whitesides / Benjamin Lafreniere‡ Anna Lubiw / Ferran Hurtado† Benjamin Lafreniere / Sylvain Lazard / Hazel Everett / /

ProvinceOrState

Ontario / /

PublishedMedium

Computer Graphics / IEEE Wireless Communications / /

Technology

incremental insertion algorithm / wireless access / time algorithm / 6 Algorithm / http / Wi-Fi / /

SocialTag