Вычислительная геометрия: Введение - Препарата Ф.
ISBN 5-03-001041-6
Скачать (прямая ссылка):
H. W. Six and D. Wood, The rectangle intersection problem revisited, Я/7"20.426-433 (1980).
H. W. Six and D. Wood, Counting and reporting intersections of ^/-ranges, IEEE
Trans. Comput. C-31, 181-187 (1982). J. Sklansky, Measuring concavity on a rectangular mosaic. IEEE Trans. Сотр. C-21,
1355 -1364 (1972).
E. Soisalon-Soininen and D. Wood, An optimal algorithm for testing for safety and
detecting deadlock in locked transaction systems, Proc. of ACM Symposium on Principles of Data Bases, Los Angeles, March 1982; pp. 108-116. J. M. Steele and A. C. Yao, Lower bounds for algebraic decision trees, /. Algorithms 3, 1-8 (1982).
J. Stoer and C. Witzgall, Convexity and Optimization in Finite Dimensions I, Springer-Verlag. New York, 1970. Z6G. Strang and G. Fix. An Analysis of the Finite Element Method, Prentice-Hall, Englewood Cliffs, NJ. 1973.
Литература
465
1. L;. Sutherland, Compulcr graphics: ten unsolved problems. Datamation 12(5). 22-27 (May 1966).
J. J. Svl\es(er. On Poncelct's approximate linear valuation of surd form*, Phil Mag, Scr. 4,20,203-222 (1860).
R. Thorn, Sur 1'homologic.des varielcs algcbrai'ques jeclles, Differential ami Combinatorial Topology. Edited bv S. S. Cairns, Princeton L niv. Press. Princeton, NJ, 1965.
C. Toregas. R. Swain, C. Revelle and L. Bergman, The location of emergency service
facilities, Operations Research 19, 1363-1373 (1971). G. T. Toussaint, Pattern recognition and geometrical complexity, Proc. 5th Int'l
Conference on Pattern Recognition, pp. 1324-1347 (Dec, 1980a). G. T. Toussaint. The relative .neighborhood graph'of a finite planar set, Pattern
Recognition 12(4), 26.1-268 (1980b). G. T. Toussaint, An optimal algorithm for computing the minimum vertex distance
between two crossing convex polygons, Proc. 21st Allerton Conference on
Comm..Control and Comput., pp. 457-458 (1983a). G. T. Toussaint, Computing .largest empty circles with location constraints, Int'l J,
Computer and Info. Sci. 12(5), 347-358 (1983b). V. Vaishnavi, Computing point enclosures, Pattern Recog. 15, 22-29 (1982). V. Vaishnavi and D. Wood, Data structures lor the rectangle containment and
enclosure problems, Computer Graphics and Image Processing 13, 372 -384(1980). V. Vaishnavi and D. Wood, Rectilinear line segment intersection, layered segment
trees, and dynamization, J. Algorithms 3. 160 176 (1982).
F. A. Valentine, Convex Sets, McGraw-Hill, New York, 1964.
G. Voronoi, Nouvelles applications des parametres continus a la iheorie des formes
quadratiques. Deuxieme Memorie: Rcchcrches sur les parallcloedres primilifs. /. rcinc angew. Math. 134, 198-287 (1908). J. E. Warnock, A hidden-surface algorithm for computer generated halftone pictures, Technical Report TR 4-15. Computer Science Department, University of Utah, 1969.
G. S. Watkins, A real-time visible surface algorithm, Technical Report UTECH-CSc-70-101. Computer Science Department, University of Utah. June 1970.
D. E. Willard, Predicate-oriented database search algorithms. Harvard University,
Cambridge. MA, Aiken Computation Laboratory. Ph.D. Thesis, Report TR-20-78, 1978.
2 D. E. Willard, Polygon retrieval, SIAMJ. Comput. II, 149-165 (1982). N. Wirlh, Algorithms + Data Structures = Programs; Prcnticc-Hall, Englcwood Cliffs, NJ, 1976.
301. M. Yaglom and V. G. Boltyanskii, Convex Figures. Holt, Rinehart and Winston, New York, 1961.
A. C. Yao, An 0(?loglog V) algorithm for finding minimum spanning trees, Info.
Proc. Ie»4,21-23 (1975), A. C. Yao, A lower bound to finding convex hulls, J. ACM 28, 780 787 (I9SI), A. C. Yao. On conlructin!! minimum spanning decs in k-dtmensional space and
related problems, SIAM ./. Comput. 11(4). 721 736 (1982), M. Z. Yannakakis. С. II. Papadimitriou and lit. Kung, Locking policies; safety and
freedom for deadlock, Proceedings 20th Annual Symposium on Foundations of
Computer Science, pp. 286 297 (1979). С. T, Zahn, Graph-theoretical methods for delecting and describing gestnlt clusters,
1EFF Tram. Со»,p. C'-20( 1), 68 86 (Jan. 1 9; | >, TS. I. Zhukhoviisky and L. 1. Avclcvcva. Linear and Convex Proammmmj Saunders,
Philadelphia, 1966.
Литература
Работы вышедшие на русском языке или в русском переводе
1. Ахо А., Хопкрофт Дж., Ульман Дж. Построение и анализ вычислительных алгоритмов. — М.: Мир, 1979.
2. Вирт Н. Алгоритмы -f- структуры данных = программы. — М.: Мир, 1985. -* 3. Гильберт Д. Основания геометрии. — М. — Л.: Гостехиздат, 1948.
4. Гэри М., Джонсон Д. Вычислительные машины и труднорешаемые задачи. — М.: Мир, 1982.
5. Делоне Б. Н. О пустом шаре. — Известия АН СССР, 1934, VII серия, 6, с. 793—800.
6. Дуда Р., Харт П. Распознавание образов и анализ сцен. — М.: Мир, 1976.
7. Зуховицкий С. И., Авдеева Л. И. Линейное и выпуклое программирование.— М.: Наука, 1964.
8. Карп Р. М. Сводимость комбинаторных проблем. — Кибернетический сборник, вып. 12. —М.: Мир, 1975, с. 16—38.
9. Кендэл М., Моран П. Геометрические вероятности. — М.: Наука, 1972.