Hostname: page-component-7dd5485656-7jgsp Total loading time: 0 Render date: 2025-10-31T18:38:19.279Z Has data issue: false hasContentIssue false
  • English
  • Français

A NOTE CONCERNING THE DISTANCES OF UNIFORMLY DISTRIBUTED POINTS FROM THE CENTRE OF A RECTANGLE

Part of: Geometric probability and stochastic geometry

Published online by Cambridge University Press:  07 June 2012

ROBERT STEWART  and
HONG ZHANG
ROBERT STEWART*
Affiliation:
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2E8 (email: RLStewart@ieee.org)
HONG ZHANG
Affiliation:
Department of Computing Science, University of Alberta, Edmonton, Alberta, Canada T6G 2E8 (email: hzhang@ualberta.ca)
*
✉For correspondence; e-mail: RLStewart@ieee.org
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Given a rectangle containing uniformly distributed random points, how far are the points from the rectangle’s centre? In this paper we provide closed-form expressions for the cumulative distribution function and probability density function that characterise the distance. An expression for the average distance to the centre of the rectangle is also provided.

Keywords

rectangledistribution of distancesprobability density functioncumulative distribution functionmean distancerectangle pickingrobotic computer vision

MSC classification

Secondary: 60D05: Geometric probability and stochastic geometry

Information

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 87 , Issue 1 , February 2013 , pp. 115 - 119
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2012

Footnotes

The authors would like to gratefully acknowledge partial funding of this work by NSERC. Robert Stewart would additionally like to acknowledge the support of a Postdoctoral Fellowship from the University of Alberta while he was on leave without pay from an Australian research organisation.

References

[1]Alagar, V. S., ‘The distribution of the distance between random points’, J. Appl. Probab. 13 (1976), 558–566.CrossRefGoogle Scholar
[2]Burgstaller, B. and Pillichshammer, F., ‘The average distance between two points’, Bull. Aust. Math. Soc. 80 (2009), 353–359.CrossRefGoogle Scholar
[3]Chu, D. P. and Fotouhi, A. R., ‘Distance between bivariate beta random points in two rectangular cities’, Commun. Stat. Simul. Comput. 38 (2009), 257–268.CrossRefGoogle Scholar
[4]Dacey, M. F., ‘Some properties of order distance for random point distributions’, Geogr. Ann.: Series B, Human Geography 49 (1967), 25–32.CrossRefGoogle Scholar
[5]Daley, D. J., ‘Solution to problem 75-12. An average distance’, SIAM Rev. 18 (1976), 498–499.Google Scholar
[6]Dunbar, S. R., ‘The average distance between points in geometric figures’, College Math. J. 28 (1997), 187–197.CrossRefGoogle Scholar
[7]Ehlers, P. F. and Enns, E. G., ‘Random secants of a convex body generated by surface randomness’, J. Appl. Probab. 18 (1981), 157–166.CrossRefGoogle Scholar
[8]Finch, S. R., Mathematical Constants (Cambridge University Press, Cambridge, 2003).Google Scholar
[9]Ghosh, B., ‘On random distances between two rectangles’, Sci. Cult. 8 (1943), 464.Google Scholar
[10]Ghosh, B., ‘On the distribution of random distances in a rectangle’, Sci. Cult. 8 (1943), 388.Google Scholar
[11]Ghosh, B., ‘Random distances within a rectangle and between two rectangles’, Bull. Calcutta Math. Soc. 43 (1951), 17–24.Google Scholar
[12]Lazoff, D. M. and Sherman, A. T., ‘An exact formula for the expected wire length between two randomly chosen terminals’, Technical Report, University of Maryland Baltimore County, 1994.CrossRefGoogle Scholar
[13]Lazoff, D. M. and Sherman, A. T., ‘Problem 95-6. Expected wire length between two randomly chosen terminals’, SIAM Rev. 38 (1995), 321–324.Google Scholar
[14]Miller, L. E., ‘Distribution of link distances in a wireless network’, J. Res. Natl. Inst. Stand. Technol. 106 (2001), 401–412.CrossRefGoogle Scholar
[15]Mullen, J. P., ‘Robust approximations to the distribution of link distances in a wireless network occupying a rectangular region’, Mobile Comput. Commun. Rev. 7 (2003), 80–91.CrossRefGoogle Scholar
[16]Murchland, J. D., ‘Comment to problem 75-12. An average distance’, SIAM Rev. 18 (1976), 498.Google Scholar
[17]Sheng, T. K., ‘The distance between two random points in plane regions’, Adv. Appl. Probab. 17 (1985), 748–773.CrossRefGoogle Scholar
[18]Srinivasa, S. and Haenggi, M., ‘Distance distributions in finite uniformly random networks: theory and applications’, IEEE Trans. Veh. Technol. 59 (2010), 940–949.CrossRefGoogle Scholar
[19]Stewart, R. L. and Zhang, H., ‘Image similarity from feature-flow for keyframe detection in appearance-based SLAM’, Proc. 2011 IEEE Int. Conf. on Robotics and Biomimetics (IEEE-ROBIO 2011), Phuket, Thailand, 7–11 December 2011, pp. 305–312.Google Scholar
[20]Walpole, R. E., Myers, R. H., Myers, S. L. and Ye, K., Probability and Statistics for Engineers and Scientists, 8th edn (Pearson Prentice Hall, Upper Saddle River, NJ, 2007).Google Scholar
[21]Weisstein, E. W., ‘Square point picking’, MathWorld—A Wolfram Web Resource, http://mathworld.wolfram.com/SquarePointPicking.html.Google Scholar
[22]Wicker, N., ‘A note on ball segment picking related to clustering’, Pattern Recogn. Lett. 32 (2011), 651–655.CrossRefGoogle Scholar