Diameter partitioning-Reference-Cited by-同舟云学术

Diameter partitioning

Published:1986-09 Issue:3 Volume:1 Page:265-276
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Avis David

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02187699.pdf

Reference17 articles.

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA 1974.

2. D. Avis, Non-partitionable point sets,Inform. Proc. Lett. 19 (1984), 125–129.

3. D. Avis, Space partitioning and its application to generalized retrieval problems,Proceedings of the International Conference on Foundations of Data Organization, 154–162, Kyoto, May 1985.

4. D. Avis and M. Doskas, Algorithms for high dimensional stabbing problems, (to appear).

5. D. P. Dobkin and H. Edelsbrunner, Space searching for intersecting objects,Proceedings of the 25th FOCS, 387–391, October, 1984.

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Geometric clustering in normed planes;Computational Geometry;2019-06

2. Some clustering algorithms in normed planes;Electronic Notes in Discrete Mathematics;2018-07

3. Two-Dimensional Range Diameter Queries;LATIN 2012: Theoretical Informatics;2012

4. An efficient divisive-agglomerative hierarchical clustering algorithm using minimum spanning tree;Journal of Discrete Mathematical Sciences and Cryptography;2011-12

5. FREE-FORM SURFACE PARTITION IN 3-D;International Journal of Computational Geometry & Applications;2011-12