Вычислительная геометрия: Введение - Препарата Ф.
ISBN 5-03-001041-6
Скачать (прямая ссылка):
problems, Transportation Science 6. 379 -394 (1972a). D. J. Elzinga and D. W. Hearn. The minimum covering sphere problem. Mgmt. Sci.
19(1), 96-104 (Sept. 1972b). P. Erdos, On sets of distances of л points. Amcr. Math. \ГотЫу 53. 248 250 (1946). P. Erdos, On sels of distances of n points in Euclidean space. Muqv. Tud. Akuct. Mat.
Kut. Int. Kozi. 5, 165-169 (1960). K. P. Eswaran, J. N. Grav. R. A. Loric and I L. Traigcr. The notions of consistency,
and predicate locks in a database system. Comm. ACM 19, 624-633 (1976). S. Even, liraph Algorithms. Computer Science Press. Potomac, MD. 1979.
H. Eves, A Survey of Geometry. Allvn and Bacon. Ncwion. Mass.. 1972. G. Kwald. Geometry: An Introduction. Wadsworth, Belmont, Calif. 1971.
I. F;n \. On strnichl-line rcprcsenl.ilion of planar graphs. Acta Sci. Math. Szcqed. 11.
229-233 (1948).
R. A. Finkel and .1. I Bentlev. Quad-trees: a data structure for retrieval on composite kevs. Acta Inform. 4, 1-9 (1974).
Литература
459
187 195 (1971).
R. L. Francis and J. A. White, Facility Lavout and Location: An Analytical Approach.
Prentice-Hall, Englcwood Cliffs,' NJ,' 1974. M. L. Frcdman, A lower bound of the complexity of orthogonal range queries. J. ACM
28, 696-705 (1981).
M. L. Fredman and B. Weide, The complexity of computing the measure of Uf«j. ft,].
Comm. ACM 21(7). 540- 544 (July 1978). H. Freeman, Computer processing of line-drawing images. Comput. Surveys 6, 57-97
(1974).
H. Freeman and P. P. Loutrel. An algorithm for the solution of the two-dimensional
hidden-line problem, IEEE Trans. Elec. Сотр. EC-16(6), 784-790 (1967). H. Freeman and R. Shapira, Determining the minimum-area encasing rectangle for an
arbitrary closed curve. Comm. ACM. 18(7), 409-413 (1975). J. H. Friedman, J. L. Bentley and R A. Finkel. An algorithm for finding best match in
logarithmic expected time. ACM Trans. Math. Software 3(3), 209-226 (1977). H. Gabow, An efficient implementation of Edmond's maximum matching algorithm,
Technical Report 31. Computer Science Department, Stanford Univ.. 1972. K. R. Gabriel and R. R. Sokal. A new statistical approach to geographic variation
analysis. Systematic Zoology 18. 259-278 (1969). R. Galimberti and U. Montanari, An algorithm for hidden-line elimination. С ACM
12(4).'206 211 (1969). M. R. Garey, R. L. Graham and D. S. Johnson. Some NP-complete geometric
problems, Eighth Annual Symp. on Theory of Comput.. pp. 10-22 (Mai 1976). ''M. R. Garey and D. S. Johnson. Computers and Intractability' A Guide to the Theory
ofNP-Completeness. W. H. Freeman. San Francisco, 1979. M. R. Garey. D. S. Johnson and L. Stockmeyer. Some simplified NP-complete graph
problems, Theor. Сотр. Sci. 1. 237-267'(1976). M. Garey, D. S. Johnson, F. P. Preparata. and R. E. Tarjan. Triangulating a simple
polygon. Info. Proc. Lett. 7(4). 175 -180(1978). S. I. Gass, Linear Programming. McGraw-Hill, New York. 1969. J. Gastwirth. On robust procedures. J Amer. Stat. Assn. 65. 929-948 (1966). J. A. George. Computer implementation of the finite element method. Technical
Report STAN-CS-71-208. Computer Science Department. Stanford University,
1971.
P. N. Gilbert. New results on planar trianeulalions. Tech. Rep. ACT-15. Coord. Sci.
Lab.. University of Illinois at Lrbana". July 1979. T. Gonzalez. Algorithms on sets and related problems. Technical Report. Department
of Computer Science. University of Oklahoma. 1975. J. C. Gower and G. J. S. Ross. Minimum spanning trees and single linkage cluster
analysis. Appl. Stat. 18(1).'54-64 (1969). R. L. Graham. An efficient algorithm for determining the convex hull of a finite planar
set. Info. Proc. Lett 1. 132 133 (1972). R. L. Graham and F. F Yao. Finding the convex hull of a simple polygon. Tech. Rep.
No. STAN-CS-81-887. Stanford University, 1981; also J. Algorithms 4(4),
324 331 (1983).
P. J. Green and B. W. Silverman. Constructing the convex hull of a set of points in
the plane. Computer Journal 22. 262-266 (1979). B. Grunbaum, A proof of Vazsonyi's conjecture, Bull. Res. Council Israel 6(A), 77-78
(1956).-
B. Grunbaum. Oobrex Polytopes, Wiley-Interscience, New York. 1967. R. H Guting. An optimal contour algorithm for isooriented rectangles, Jour, of Algorithms 5(3). 303-326 (Sept. 1984). 27H. Hadwigerand H. Dcbrunner. Combinatorial Geometry in the Plane,Uoh. Rinebart
Литература
28 M.Hanan and J. M. Kurt/berg, Placement techniques, in Design Automation of Digital Systems. Edited by M. Brcucr. Prentice-Hall, Englewood Cliffs, NJ, 1972.
M. Hanan, Layout, interconnection, and placement, Networks 5, 85-88 (1975).
J. A. Hartigan, Clustering Algorithms, Wiley, New York, 1975.
T. L. Heath, A History of Greek Mathematics, Oxford University Press, Oxford, England, 1921.
*S. Hcrtel, K. Mchlhorn, M. Mantyla and J. Nievcrgelt, Space sweep solves intersection
of two convex polyhedron elegantly, Acta Informatica (to appear) (1985). 3D. Hilbert, Foundations of Geometry, (1899). Rcpr. 1971 by Open Court, La Salle, IL, J. Ci. Hocking and G. S. Young, Topology, Addison-Wcslcv, Reading, MA, 1961.
