Fining k points with minimum spanning trees and related problems

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Fining k points with minimum spanning trees and related problems

Full text

Pdf (978 KB)

Source

Annual Symposium on Computational Geometry archive
Proceedings of the fifth annual symposium on Computational geometry table of contents

Saarbruchen, West Germany

Pages: 283 - 291

Year of Publication: 1989

ISBN:0-89791-318-3

Authors

A. Aggarwal	IBM T. J. Watson Research Center
H. Imai	Kyushu University, Japan
N. Katoh	Kobe University of Commerce, Japan
S. Suri	Bell Communications Research

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 12, Downloads (12 Months): 26, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/73833.73865 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A. Aggarwal , L. Guibas , J. Saxe , P. Shor, A Linear time algorithm for computing the Voronoi diagram of a convex polygon, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.39-45, January 1987, New York, New York, United States [doi>10.1145/28395.28400]
	2	A. Aggarwal , S. Suri, Fast algorithms for computing the largest empty rectangle, Proceedings of the third annual symposium on Computational geometry, p.278-290, June 08-10, 1987, Waterloo, Ontario, Canada [doi>10.1145/41958.41988]
	3	Harry C Andrews, Introduction to mathematical techniques in pattern recognition, R.E. Krieger Pub. Co, 1983
	4	T. Asano, Private communication.
	5	T. Asano , B. Bhattacharya , M. Keil , F. Yao, Clustering algorithms based on minimum and maximum spanning trees, Proceedings of the fourth annual symposium on Computational geometry, p.252-257, June 06-08, 1988, Urbana-Champaign, Illinois, United States [doi>10.1145/73393.73419]
	6	D. P. Dobkin, R. L. Drysdale, III, and L. J. Guibas, "Finding Smallest Polygons," in Advances in Computing Research, Vol. 1, JAI Press, 1983, pp. 181-214.
	7	John A. Hartigan, Clustering Algorithms, John Wiley & Sons, Inc., New York, NY, 1975
	8	J. Hershberger , S. Suri, Finding tailored partitions, Proceedings of the fifth annual symposium on Computational geometry, p.255-265, June 05-07, 1989, Saarbruchen, West Germany [doi>10.1145/73833.73862]
	9	Hiroshi Imai , Takao Asano, Efficient algorithms for geometric graph search problems, SIAM Journal on Computing, v.15 n.2, p.478-494, May 1986 [doi>10.1137/0215033]
	10	D. T. Lee, "On L-Nearest Neighbor Voronoi Diagrams in the Plane," IEEE lknsactions on Computers, Vol. C-31, 1982, pp. 478487.
	11	M. Mckenna, J. O'Rourke, and S. Suri, "Finding the Largest Rectangle in an Orthogonal Polygon," Proc. of the 23rd Annual Allerton Conference on Communications, Control, and Computing, 1985, pp. 486-495.

CITED BY 2

	Franz Aurenhammer, Voronoi diagrams—a survey of a fundamental geometric data structure, ACM Computing Surveys (CSUR), v.23 n.3, p.345-405, Sept. 1991
	David Eppstein, New algorithms for minimum area k-gons, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.83-88, September 1992, Orlando, Florida, United States