Вычислительная геометрия: Введение - Препарата Ф.
ISBN 5-03-001041-6
Скачать (прямая ссылка):
C. A. R. Hoarc, Quicksort, Computer Journal 5, 10-15 (1962).
1. Hoddcr and C. Orton, Spatial Analysis in Archaeology, Cambridge University Press,
Cambridge, England, 1976. P. G. Hoel, Introduction to Mathematical Statistics, Wiley, New York, 1971. P. J. Hubcr, Robust statistics: A review, Ann. Math. Stat. 43(3), 1041-1067 (1972), F. K. Hwang, An 0(нlogн) algorithm for rectilinear minimal spanning tree, /. ACM
26, 177-182 (1979).
J. W. Jaromczyk, Lower bounds for polygon simplicity testing and other problems, Proc. MFCS-84, Prague (Springer-Verlag), 339-347 (1984).
R. A. Jarvis, On the identification of the convex hull of a finite set of points in the plane, Info. Proc. Lett. 2, 18-21 (1973).
S. C. Johnson, Hierarchical clustering schemes, Psychometricka 32. 241-254 (1967),
M. Kallay, Convex hull algorithms in higher dimensions, unpublished manuscript. Dept. Mathematics, Univ. of Oklahoma, Norman, Oklahoma, 1981.
R. M. Karp, Rcducibility among combinatorial problems, in Complexity of Computer Computations. Edited by R. E. Miller and J. W. Thatcher. Plenum Press, New-York,-1972.
J. M. Kcil and J. R. Sack, Minimum decomposition of polygonal objects, in Computational Geometry. Edited by G. T. Toussaint. North-Holland, Amsterdam, The Netherlands (1985).
9M. G. Kendall and P. A. P. Moran, Geometrical Probability, Hafncr, Nov York, 1963,
D. G. Kirkpatrick, Efficient compulation of continuous skeletons, Proc. 20th IEEE
Annual Symp. on Foundations of Comput. Sci., pp. 18-27 (Oct. 1979). D. G. Kirkpatrick, Optimal search in planar subdivisions, SIAM J. Comput. 12(1), 28-35 (1983).
*D. G. Kirkpatrick and R. Seidel, The ultimate planar convex hull algorithm? Tech. Rep. 83-577, Dept. Comput. Sci., Cornell Univ., Oct. 1983. V. Klec, Convex polytopes and linear programming, Proc. IBM Sci. Comput. Symp.'
Combinational Problems, IBM, White Plains/NY, pp. 123-158 (1966). V. Klee, Can the measure of Ufa,-, b-] be computed in less than ()(n \ogn) steps?, Amcr.
Math. Monthly, 84(4), 284-285 (April 1977). V. Klec. On the complexity of (-/-dimensional Yoronoi diagrams, Archio tier Matlw-matik, 34, 75-80(1980). 10F. Klein, Das Erlangen Programm: vergleichende Betrachtungen iibcr ncucrc yeo-metrisches Forschungen, 1872. Reprinted by Akademischc VcrlagsGcscllsdial'i Grcest und Portig, Leipzig, 1974. 1,D. E. Knuth, The Art of Computer Programming. Volume I: Fundamental Algorithms,
Addison-Wesley, Reading, MA, 1968. 1ZD. E. Knuth, The Art of Computer Programming. Volume III: Sorting and Searching, Addison-Wesley, Reading, Mass., 1973. D. E. Knuth, Big omicron and big omega and big thcta, SIGACF News H(2), 18 24 (April June 1976).
J. F. Kolars and J. D. Nvstucn. Human Geoaranhv. McGraw-Hill. New York. 1974.
Литература
461
problem, Proc. AM SI, 48-50 (1956).
H T. Kung. F. Luccio and F. P. Preparata, Ontinding the maxima of a set ol vectors, JACM 22(4), 469-476 (Oct. 1975).
U. Lauther, 4-dimensional binary search trees as a means to speed up associative searches in the design verification of integrated circuits. Jour, of Design Automation and Fault Tolerant Computing, 2(3), 241-247 (July 1978).
С L. Lawson, The smallest covering cone or sphere, SI A M Rev. 7(3), 415-417 (1965).
C. I.. Lawson, Software for С surface interpolation, JPL Publication, pp. 77 30
(Aug. 1977).
D. T. Lee, On finding к nearest neighbors in the plane. Technical Report. Department
of Computer Science, University of Illinois, 1976. D. T. Lee, Proximity and reachability in the plane. Tech. Rep. No. R-831. Coordinated
Sci. Lab., Univ. of Illinois at Urbana, IL, 1978. D. T. Lee, On k-nearest neighbor Voronoi diagrams in the plane. IEEE Trans. Comput.
C-31(6), 478 487 (June 1982). D. T. Lee. Two dimensional Voronoi diagram in the ^-metric, J. ACM 11, 604 618
(1980a).
D. T. Lee, Farthest neighbor Voronoi diagrams and applications, Tech. Rep. No. 80-
ll-FC-04, Dpt. EE,CS, Northwestern Univ., 1980b. D. T. Lee, On finding the convex hull of a simple polygon. Tech. Rep. No. 80-03-FC-
01, EE/CS Dept., Northwestern Univ., 1980. See also IntlJ. Comput. and In for.
Sci. 12(2), 87-98 (1983a). D. T. Lee, Visibility of a simple polygon, Computer Vision. Graphics and Image
. Processing 22, 207-221 (1983b). D. T. Lee and I. M. Chen, Display of visible edges of a set of convex polygons, in
Computational Geometry. Edited by G. T. Toussaint. North Holland, Amsterdam, to appear (1985). D.f. Lee and R. L. Drysdale III, Generalized Voronoi diagrams in the plane, S/AM
J. Comput. 10, 1,.73-87 (Feb. 1981). D. T. Lee and F- P. Preparata, Location of a point in a planar subdivision and its
applications, SI AM Journal on Computing 6(3), 594 606 (Sept. 1977). D. T. Lee and F. P. Preparata, The all nearest neighbor problem for convex polygons.
Info. Proc'Lett. 7, 189 -192(1978). D. T. Lee and F. P. Preparata, An optimal algorithm for finding the kernel of a
polygon, Journal of the ACM 26. 415-421 (1979). D. T. Lee and F. P. Preparata, An improved algorithm for the rectangle enclosure
