The expected size of some graphs in computational geometry
- 1 January 1988
- journal article
- Published by Elsevier BV in Computers & Mathematics with Applications
- Vol. 15 (1), 53-64
- https://doi.org/10.1016/0898-1221(88)90071-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Direct dominance of pointsInternational Journal of Computer Mathematics, 1986
- The Relative Neighborhood Graph, with an Application to Minimum Spanning TreesJournal of the ACM, 1983
- An improved algorithm for the rectangle enclosure problemJournal of Algorithms, 1982
- Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the PlaneGeographical Analysis, 1980
- The relative neighbourhood graph of a finite planar setPattern Recognition, 1980
- Algorithms for Reporting and Counting Geometric IntersectionsIEEE Transactions on Computers, 1979
- Proportion of Reflexive nth Order Neighbors in Spatial DistributionGeographical Analysis, 1969
- A New Statistical Approach to Geographic Variation AnalysisSystematic Zoology, 1969
- On Some Aspects of Spatial Pattern in Biological PopulationsScience, 1955
- Distance to Nearest Neighbor as a Measure of Spatial Relationships in PopulationsEcology, 1954