Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference12 articles.
1. D. Avis, The number of furthest neighbor pairs of a finite planar set.Amer. Math. Monthly 91 (1984), 417–420.
2. D. Avis, P. Erdös, and J. Pach, Repeated distance in space. Preprint, 1986.
3. J. Beck, On the lattice property of the plane and some problems of Dirac, Motzkin, and Erdös in combinatorial geometry.Combinatorica 3 (1983), 281–297.
4. J. Beck and J. Spencer, Unit distances,J. Combin. Theory Ser. A 37 (1984), 231–238.
5. H. Edelsbrunner and S. S. Skiena, On the number of furthest neighbor pairs in a point set. Preprint.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Bibliography;Combinatorial Geometry;2011-10-28
2. The k Most Frequent Distances in the Plane;Discrete & Computational Geometry;2002-11
3. The exact fitting problem in higher dimensions;Computational Geometry;1996-07
4. Furthest neighbours in space;Discrete Mathematics;1996-04
5. Recent Developments in Combinatorial Geometry;Algorithms and Combinatorics;1993