Вычислительная геометрия: Введение - Препарата Ф.
ISBN 5-03-001041-6
Скачать (прямая ссылка):
R. V.. Ostcen and P. P. Lin, Picture skeletons based on eccentricities of points of
minimum spanning trees, SIAM J. Comput. 3(1), 23 40 (March 1974). MIL Ovcrmars, The design of dynamic data structures, Ph. D. Thesis; University of
Utrecht, The Netherlands (1983). M. 11. Ovcrmars and J. van Leeuwen, Maintenance of configurations in the plane. /.
Comput. andSyst. Sci. 23, 166-204 (1981). С. II. Papadimitriou, The Euclidean traveling salesman problem is NP-cpmplcte,
Thcoret. Comput. Sci. 4, 237-244 (1977). C. 11, Papadimitriou and K. Steiglitz, Some complexity results for the traveling
salesman problem, Eighth ACM Annual Symp. on Theory o) Comput., pp. 1-9
(Mav 1976).
V.. Piclou, Mathematical Ecology, Wiles-Intcrscienee, New York, 1977.
F. P. Preparala, Steps into computational geometry, Technical Report. Coordinated
Science Laboratory, University of Illinois, 1977. F. P. Preparala, An optimal real time algorithm for planar convex hulls, Comm. ACM
22, 402 405 (1979).
F. P. Preparala. A new approach to planar point location, SIAM J. Comput. 10(3), 473 482 (1981).
F. P. Preparala and S. J. Hong, Convex hulls of finite sets of points in two and three
dimensions, Comm. ACM 2(20), 87-93 (Feb. 1977). F. P. Preparala and D. E. Muller, Finding the intersection of я half-spaces in time
0(n\ogn), Theoretical Computer Science 8(1), 45-55 (Jan. 1979). F. P. Preparata and K. J. Supowil, Testing a simple polygon for monotonicitv. Info.
Proc. Lett. 12(4), 161-164 (Aug. 1981). 18 R. C. Prim. Shortest connecting networks and some generalizations, BSTJ 36,
1389-1401 (1957).
M. О Rabin, Proving simultaneous positively of linear forms, Journal (if Computer and
System Sciences 6. 639-650 (1972). 19H. Rademachcrand O. Tocplilz, The Enjoyment of Mathematics, Princeton University
Press, Princeton, NJ, 1957. II. Raynaud, Sur I'envcloppe convexe des nuages des points alcatoires dans R". I, J.
Appl. Prob. 7, 35-48 (1970). V.. M. Reingokl. On the optimalitv of some set algorithms, Journal of the ACM 19,
649 659 (1972).
20E. M. Reinaold. J. Nievergelt, and N. Deo. Combinatorial Algorithms: Theory and Practice. Prentice-Hall, Englewood Chits. NJ, 1977. A. Renyi and R. Sulanke, Ucbcr die konvexe Hulle von n zufallig gewahlten Punkten,
I, Z. Wuhrschein. 2, 75-84 (1963). R. Ricsenl'cld. Applications of b-spline approximation to geometric problems of computer-aided design. Technical Report UTEC-CSc-73-126. Department of Computer Science, University of Utah, 1973. 2 R. T. Rockafellar. Convex Analysis, Princeton University Press, Princeton, NJ 197(1, Z,C. A. Rogers. Packing and Covering, Cambridge University Press, Cambridge, England. 1964.
464
Литература
D. J. Roscnkranlz, R. E. Stearns and P. M. Lewis. Approximate algorithms for the traveling salesperson problem. Fifteenth- Annual IEEE Symposium on Switching and Automata Theory, pp. 33 42 (May 1974). ЙТ. L. Saaty. Optimization in Integers and Related Extremal Problems. McGraw-Hill, New York, 1970.
ZSL. A. Santalo. Integral Geometry and Geometric Probability. Encyclopedia of Mathematics and Its Applications, Vol. I. Addison-Wesley, Reading, Mass., 1976. J. B.Saxc. On the number of range queries in k-spacc. Discrete Applied Mathematics 1. 217-225 (1979).
J. B. Saxc and J. L. Bentley, Transforming static data structures into dynamic structures, Proc. 20th IEEE Annual Svmp. on Foundations of Comput. St /'.. pp. 148 168 (1979).
A. M. Schonhagc, M. Patcrson and N. Pippengcr, Finding the median. J. Comput and
Syst. Sci. 13. 184-199 (1976). J. T. Schwartz, Finding the minimum distance between two convex polygons. Info
Proc. Lett. 13(4), 168-170(1981).
D. H. Schwartzmann and J. J Vidal, An algorithm for determining the topological
dimensionality of point clusters, IEEE Trans. Сотр. C-24(I2). I 175 ¦ I 182 (Dec. 1975).
R. Seidel, A convex hull algorithm optimal for points in even dimensions, M.S. thesis, Tech. Rep. 81-14, Dept. of Comput. Sci.. Univ. of British Columbia. Vancouver, Canada. 1981.
R. Seidel, The complexity of Voronoi diagrams in higher dimensions. Proc. 20th Allerton Conference on Comm., Control and Comput., pp. 94-95 (1982). See also Tech. Rep. No. F94, Technische Universitat Graz, Austria, 1982.
M. I. Shamos, Problems in computational geometry, unpublished manuscript. 1975a.
M. I. Shamos, Geometric Complexity, Seventh ACM Annual Svmp. on Theory of Comput., pp. 224-233 (May 1975b).
M. I. Shamos, Geometry and statistics: Problems at the interface, in Recent Results and New Directions in Algorithms and Complexity. Edited by J. F. Traub. Academic Press (1976).
M. I. Shamos. Computational geometry, Ph.D. thesis, Dept. of Comput. Sci.. Yale Univ.. 1978.
M. I. Shamos and D. Hoey, Closest-point problems. Sixteenth Annual IEEE Symposium on Foundations of Computer Science, pp. 151-162 (Oct. 1975).
M. I. Shamos and D. Hoey, Geometric intersection problems, Seventeenth Annual IEEE Symposium on Foundations of Computer Science , pp. 208-215 (Oct. 1976).
