Back to Results
First PageMeta Content
Measure theory / Euclidean plane geometry / Delaunay triangulation / Triangulation / Probability theory / Relative neighborhood graph / N-sphere / Gabriel graph / Support / Geometry / Mathematics / Mathematical analysis


CCCG 2011, Toronto ON, August 10–12, 2011 Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions ∗ Esther M. Arkin†
Add to Reading List

Document Date: 2011-08-06 04:11:14


Open Document

File Size: 206,96 KB

Share Result on Facebook

City

Madrid / Bern / /

Company

Oxford University Press / Wireless Ad Hoc Networks / Distributed Systems / Distributed Computing Systems / P. Noordhoff Ltd. / Institute IMDEA Networks / /

Country

Spain / United States / /

/

Facility

Rutgers University / Stony Brook University / /

IndustryTerm

low energy consumption / energy-efficient geometric routing / geometric networks / Wireless Communications / wireless sensor networks / energy consumption / ad hoc networks / Internet Mathematics / wireless networks / random wireless networks / random networks / spatial networks / /

Organization

Universidad Rey / European Union / Department of Applied Mathematics and Statistics / Oxford University / National Science Foundation / Rutgers University / Computer Science Department / Stony Brook University / /

Person

Joseph S. B. Mitchell / Esther M. Arkin† Antonio Fern / Miguel A. Mosteiro / Rey Juan Carlos / /

SocialTag