Научная литература
booksshare.net -> Добавить материал -> Математика -> Препарата Ф. -> "Вычислительная геометрия: Введение" -> 168

Вычислительная геометрия: Введение - Препарата Ф.

Препарата Ф., Шеймос М. Вычислительная геометрия: Введение. Под редакцией Ю. М. Банковского — М.: Мир, 1989. — 478 c.
ISBN 5-03-001041-6
Скачать (прямая ссылка): vichgeometr.pdf
Предыдущая << 1 .. 162 163 164 165 166 167 < 168 > 169 170 171 172 173 174 .. 180 >> Следующая


Communications of the ACM 18, 509-517 (1975). J. L. Bentley, Algorithms for Klee's rectangle problems, Carnegie-Mellon University,

Pittsburgh, Penn., Department of Computer Science, unpublished notes, 1977. J. L, Bentley, Decomposable searching problems, Info. Proc. Lett. 8, 244-251 (1979).

') Цифровыми индексами отмечены работы, вышедшие на русском языке или в русском переводе, которые входят под соответствующим номером в отдельный список, приведенный далее. Звездочкой отмечены работы, уточненные выходные данные которых приведены в списке дополнительной литературы к русскому изданию.

456

Литература

J. 1.. lkiUley.Mulliiimicnsion.il divide and conquer. Comm ACM 23(4), 214-229

J. I.. Hcnilcy, G. M. Faust and F P. Preparata, Approximation algorithms-for convex

hulls, Comm. ACM 25, 64-68 (1982). .1. I... Bentley, H. T. Kung, M. Schkolnick and C, D. Thompson, On the average

number of maxima in a set of vectors, /. ACM 25, 536-543 (1978), J. L, Bentley and H. A. Maurcr, A note on Euclidean near neighbor searching in the

plane, 'inform. Processing Lett. 8,133-136 (1979). J. L, Bentlcv and H. A. Maurcr, Efficient worst-case data structures for range searching, Acta lnformalica 13, 155-168 (1980). J. L, Bentley and T. A. Olmumn, Algorithms for reporting and counting geometric

intersections, IEEE Transactions on Computers 28, 643-647 (1979). J. L. Bentley and M. I. Shamos, Divide-and-Conquer in Multidimensional Space,

Proc. Eighth ACM Annual Symp. on Theory of Compute pp. 220-230 (Vfav

1976).

J, L. Bentley and M. I. Shamos, A problem in multivariate statistics: Algorithms, data structure, and applications, Proceedings of ihe 15th Annual Allcrton Conference on Communication, Control, and Computing, pp. 193-201 (1977).

J. L, Bentlcv and M. I. Shamos, Divide and conquer for linear expected time, Info, Proc. l.ctt.l, 87-91 (1978).

.T. L, Bentlcv and D. F. Stanat, Analysis of range searches in quad trees, Info. Proc. Leu. 3,170-173 (1975).

J. L. Bentley and D. Wood, An optimal worst case algorithm for reporting intersection of rectangles, IEEE Transactions on Computers 29, 571-577 (1980).

P. Bozicr, Numerical Central—Mathematics and Applications, Translated bv A. R. Forrest. Wiley, New York, 1972.

B. B'hattacharya, Worst-case analysis of a convex hull algorithm, unpublished manuscript, Dept. of Computer Science, Simon Eraser University, February 1982.

Ci. Bilardi and F. P, Preparata, Probabilistic analysis of a ticw geometric searching technique, unpublished manuscript, 1981.

Ci. Birkhoff and S. MacLanc, A Survey of Modern Algebra, McMillan, New York, 1965.

M. Blum, R. W. Floyd, V. Pratt, R. L. Rivcst and R. V., Tarjan, Time bounds for

selection. Jour. Compt. Sys. Sci. 7, 448-461 (1973). B. Bollobas, Graph Theory, An Introductory Course, Springer-Verlag, New York, 1979. K.Q. Brown, Fast intersection of half spaces, Carnegie-Mellon University, Pittsburgh,

Pennsylvania, Department of Computer Science; Report CMU-CS-78-129,1978. K.Q. Brown, Geometric transformations for fast geometric algorithms. Ph. D. thesis,

Dept. of Computer Science, Carnegie Mellon Univ.. Dec. 1979a. К. O. Brown, Voronoi diagrams from convex hulls. Info. Proc. Lett. 9, 223-22S

(1979b).

W. A. Burkhard and R, M. Keller, Some approaches to best match file searching. Comm. ACM'U, 230-236 (1973).

A. Bykat, Convex hull of a finite set of points in two dimensions. Info. Proc. Lett. 1,

296-298 (197K).

J, O, Cavendish, Automatic triangulation of arbitrary planar domains for the finite element method, Intl.I. Numerical Methods in Engineering 8, 679-696 (1974).

1), R. ('hand and S. S. Kapur, An algorithm for convex polvtopcs, Л-1СЛ/17(1), 78-86 (Jan. 1970),

B. M. Cha/clle, Reporting and counting arbitrary planar intersections'. Rep. CS-83-16,

Dept. of Сотр. Sci., Brown University. Providence, RI, l()X3a. В. M. Cha/clle, Optimal algorithms for computing depths and layers, Proc. 2/st Allerum Conference on Comm., Control and Compul., pp. 427-436 (Oct. 1983b).

Литература

457

Symp. on Foundations of Сотр. Sci., Tucson, AZ, 122-132 Nov. ] 983c. *B. M. Chazelle, R. Cole, F. P. Preparata, and С. K. Yap, New upper bounds for

neighbor searching, submitted lor publication (1984). В. M. Chazelle and D. P. Dobkin, Detection is easier than computation, Proc. 12th

ACM Annual Symp. on Theory of Сотри!., pp. 146-153, (May 1980). *B. M. Chazelle and H. Edelsbrunner, Optimal solutions for a class of point retrieval

problems. Tech. Rep. CS-84-16, Dept. of Computer Science, Brown University,

July 1984.

В. M. Chazelle and L. J. Guibas, Fractional'cascading: A data structuring technique

with geometric applications, manuscript, 1984. В M. Chazelle, L.J. Guibas and D. T. Lee, The power of geometric duality, Proc. 24th

IEEE Annual Symp. on Foundations of Comput. Sci., pp. 217-225 (Nov. 1983). . В. M. Chazelle and J. lnccrpi. Triangulating a polygon by divide-and-conquer, Proc.
Предыдущая << 1 .. 162 163 164 165 166 167 < 168 > 169 170 171 172 173 174 .. 180 >> Следующая

Реклама

c1c0fc952cf0704ad12d6af2ad3bf47e03017fed

Есть, чем поделиться? Отправьте
материал
нам
Авторские права © 2009 BooksShare.
Все права защищены.
Rambler's Top100

c1c0fc952cf0704ad12d6af2ad3bf47e03017fed