Geometric applications of a matrix searching algorithm

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Geometric applications of a matrix searching algorithm

Full text

Pdf (560 KB)

Source

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

Yorktown Heights, New York, United States

Pages: 285 - 292

Year of Publication: 1986

ISBN:0-89791-194-6

Authors

A Aggarwal	IBM T. J. Watson Center, Yorktown Heights
M Klawe	IBM Almaden Research Center, San Jose
S Moran	IBM T. J. Watson Center, Yorktown Heights
P Shor	Math. Sciences Research Institute, Berkeley
R Wilber	IBM Almaden Research Center, San Jose

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): 4, Downloads (12 Months): 58, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/10515.10546 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.

	ACY85	A. Aggarwal, J. $. Chang and C. K. Yap, "Minimum Area Circumscribing Polygons," Technical Report, Courant Inst. of Math. Sciences, NYU, 1985. To appear in The Visual Computer, 1986.
	AM83	A. Aggarwal and R. C. Melville, "Fast Computation of the Modality of Polygons," Proc. of the Conf. on Information Sciences and Systems, The Johns Hopkins University. To appear in the Journal of Algorithms, 1986.
	ATB82	D. Avis, G. T. Toussaint and B. K. Bhattacharya, "On the Multimodality of Distance in Convex Polygons," Comp. and Math. with Applications, Vol. 8, No. 2, pp. 153-156, 1982.
	BDDG82	James E. Boyce , David P. Dobkin , Robert L. Drysdale, III , Leo J. Guibas, Finding extremal polygons, SIAM Journal on Computing, v.14 n.1, p.134-147, Feb. 1985 [doi>10.1137/0214011]
	DKSSU81	Danny Dolev , Kevin Karplus , Alan Siegel , Alex Strong , Jeffrey D. Ullman, Optimal wiring between rectangles, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.312-317, May 11-13, 1981, Milwaukee, Wisconsin, United States [doi>10.1145/800076.802484]
	LP78	D. T. Lee and F. P. Preparata, "The All- Nearest Neighbor Problem for Convex Polygons," Info. Proc. Letters, Vol. 7, No. 4, pp. 189-192, June 1978.
	LY85	D. T. Lee and Ch~ K. Yap, Private Communication.
	MOS85	M. Mckenna, J. O'Rourke and S. Suri," Finding the Largest Rectangle in an Orthogonal Polygon," Tech. Report, The Johns Hopkins University, 1985. Also ap= pears in the Proe. of the Allerton Conference on Control, Communications and Computing, 1985.
	Pr77	F. P. Preparata, "Minimum Spanning Circle,'' in Steps in Computational Geometry, F. P. Preparata Ed., University of Illinois, Urbana, pp. 3-5, 1977.
	SD81	A. Seigel and D. Dolev, "The Separation for General Single-Layer Wiring Barriers," Proc. of the CMU Conference on VLSI, pp. 143.-152, 1981.
	Sh75	Michael Ian Shamos, Geometric complexity, Proceedings of seventh annual ACM symposium on Theory of computing, p.224-233, May 05-07, 1975, Albuquerque, New Mexico, United States [doi>10.1145/800116.803772]
	SH75	M. I. Shamos and D. Hoey, "Closest-point Problems," Proc. 16th Annual IEEE Symposium of Foundations of Computer Science, pp. 151-162, October 1975.
	To82	G. T. Toussaint, "Complexity, Convexity and Unimodality," Proc. Second World Conf. on Mathematics, Las Palmas, Spain, 1982. Also, appears in the Journal of Computer and Information Sciences, 1983.
	To83	G. T. Toussaint, "The Symmetric All- Furthest Neighbor Problem," Comp. and Math. Applications, Vol. 9, No. 6, pp. 747-754, 1983.
	TB81	G. T. Toussaint and B. K. Bhattacharya, "On Geometric Algorithms that Use the Furthest-Neighbor Pair of a Finite Planar Set," Tech. Report, School of Computer Science, McGill University, Jan. 1981.

CITED BY 6

	S. Suri, The all-geodesic furthest neighbor problem for simple polygons, Proceedings of the third annual symposium on Computational geometry, p.64, June 08-10, 1987, Waterloo, Ontario, Canada
	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
	Valentin Polishchuk , Joseph S.B. Mitchell, Thick non-crossing paths and minimum-cost flows in polygonal domains, Proceedings of the twenty-third annual symposium on Computational geometry, June 06-08, 2007, Gyeongju, South Korea
	L. J. Guibas , J. Hershberger, Optimal shortest path queries in a simple polygon, Proceedings of the third annual symposium on Computational geometry, p.50-63, June 08-10, 1987, Waterloo, Ontario, Canada
	A. Aggarwal , D. Kravets , J. Park , S. Sen, Parallel searching in generalized Monge arrays with applications, Proceedings of the second annual ACM symposium on Parallel algorithms and architectures, p.259-268, July 02-06, 1990, Island of Crete, Greece
	Alexander Schliep , Roland Krause, Efficient Algorithms for the Computational Design of Optimal Tiling Arrays, IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB), v.5 n.4, p.557-567, October 2008