Вычислительная геометрия: Введение - Препарата Ф.
ISBN 5-03-001041-6
Скачать (прямая ссылка):
problem, Journal of Algorithms, 3(3), 218-224 (1982). D. T. Lee and B. Schachter. Two algorithms for constructing Delaunay triangulations,
IntlJ. Comput. and Info. Sci. 9(3), 219-242 (1980). D. T, Lee and С. K. Wong, Worst-case analysis for region and partial region searches
in multidimensional binary search trees and balanced quad trees, Acta Infnrma-
tica 9, 23-29 (1977).
D. T. Lee and C. K.Wong. Voronoi diagrams in Lr(Lw-) metrics with 2-dimensional
storage applications, SI AM J. Comput. 9(1), 200-211 (1980). J. van Leeuwen and D. Wood, Dynamization of decomposable searching problems,
Info. Proc. Lett. 10, 51-56 (1980). J. van Leeuwen and D.Wood, The measure problem for rectangular ranges in t/-space,
J. Algorithms 2, 282-300 (1981).
E. Lemoine, Geometrographie, C. Naud, Paris, 1902.
W. Lipski, Jr. and С. H. Papadimitriou, A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems, Journal of Algorithms 2, 211-226 (1981).
W. Lipski, Jr. and F. P. Preparata, Finding the contour of a union of iso-orienlcd ^f,,n„iPc T„„r„ni „i¦ Ai.w.rhhm i 04S-94fi поят
462
Литература
W. Lipski, Jr. and F. . . Preparata, Segments, rectangles, contours, Journal oj Algorithms 2, 63-76(1981).
R. J. Lipton and R. E. Tarjan. A separator theorem lor planar graphs. Conference on Theoretical Computer Science, Waterloo, Ont., pp. I 10 (August 1977a)
R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. Proc. ISth IEEE Annual Svmp. on Found, of Сотр. Sci., Providence, RI. pp. 162 170 (October 1977b).
R J. Lipton and R. E. Tarjan, Applications of a planar separator theorem. SI AM J.
Comput. 9(3). 615 627 (1980). ("'. L. Liu. Introduction to Combinatorial Mathematics, McGraw-Hill. New York. 1968.
F. I . I.lovd. On triangulations of a set of points in the plane, Proc. IHth IEEE Annual
Svmp. on Foundations of Comput. Sci.. pp. 228-240 (Oct. 1977). H. I.oberman and A. Weinberger, Formal procedures for connecting terminals with a
minimum total wire length, JACM 4, 428-437 (1957). D. O. I.oftsgaarden and C. P. Quecnsbcrry. A nonparametric density function. Ann.
Math. Stat. 36. 1049 .1051 (1965). P. P. Loutrel, A solution to the hidden-line problem for computer-drawn polvhedra.
IEEE Trans. Сотр. C-19(3). 205 215 (March 1970).
G. S. Lueker, A data structure for orthogonal range queries. Proceedings of the 14th
Annual IEEE Symposium on Foundations of Computer Science, pp. 28 34 (1978). U. Manber and M. Tompa, Probabilistic, nondeterministic and alternating decision x trees. Tech. Rep. No. 82-03-01, Univ. Washington, 1982.
H. G. Mairson and J. Stolfi, Reporting line segment intersections in the plane, Tech.
Rep., Dept. of Computer Sci., Stanford University, 1983.
Y. Matsushita, A solution to the hidden line problem, Technical Report 335. Department of Computer Science, University of Illinois, 1969.
D. W. Matula and R. R. Sokal. Properties of Gabriel graphs relevant to geographic variation research and the clustering of points in the plane. Geographical Analysis 12, 205-222 (July 1980).
D. McCallum and D. Avis. A linear algorithm for finding the convex hull of a simple polygon. Info. Proc. Lett. 9, 201-206 (1979).
F. M. McCreight, Priority search trees. Tech. Rep. Xerox PARC CSL-81-5. 1981.
P. McM ullen and G. C. Shephard, Convex Polytopes and the Upper Bound Conjecture, Cambridge University Press, Cambridge, England, 1971.
C. A. Mead and L. Conway, Introduction to VLSI Systems, Addison-Wesley. Reading.
Mass., 1979.
N. Megiddo, Linear time algorithm for linear programming in R3 and related problems, SIAMJ. Comput. 12(4), 759-776 (Nov. 1983).
W. S. Meisel, Computer-Oriented Approaches to Pattern Recognition, Academic Press. New York, 1972.
Z. A. Melzak. Companion to Concrete Mathematics. Wiley-Interscience. New York.
1973.
J. Milnor. On the Bctti numbers of real algebraic varieties. Proc. A MS 15, 2745-280 (1964).
J. Milnor, Singular Points of Complex Hvpersurfaces, Princeton Univ. Press, Princeton. NJ, 1968. ,SM. I. Minski and S. Papert. Perceptrons, MIT Press, Amherst, Mass., 1969. J. W. Moon, Various proofs of Cayley's formula for counting trees, in A Seminar on Graph Theory. Edited by F. Harary. Holt, Rinehart and Winston, New York,
13 1976'
D. E. Muller and F. P. Preparata, Finding the intersection ol two convex polyhedra,
Theoretical Computer Science 7(2). 217-236 (Oct. 1978). К P. K. Nair and R. Chandrasekaran. Optimal location of a single service center of
Литература
463
16 W. М. Newman and R. F. Sproull, Principles of Interactive Computer Graphics, McGraw-Hill. New York. 1973. J. Nievergelt and F. Preparala. Plane-sweep algorithms for intersecting geometric
figures. Comm. ACM 25(10). 739-747 (1982). A Niienhuis and H. S. Will", Combinatorial Algorithms, Academic Press. New York, 1975.
J, O'Rourke, C.-B Chicn, T. Olson and D. Naddor. A new linear algorithm for intersecting convex polygons, Computer Graphics and Image Processing 19, 384-391 (1982).
