Вычислительная геометрия: Введение - Препарата Ф.
ISBN 5-03-001041-6
Скачать (прямая ссылка):
21st Allerton Conference on Comm. Control and Comput., pp."447-456 (Oct. 1983).
D. Cheriton and R. F. Tarjan. Finding minimum spanning trees, SIAM J. Comput. -
5(4), 724-742 (Dec. 1976). F. Chin and C. A. Wang, Optimal algorithms for the intersection and the minimum distance problems between planar polygons, IEEE Trans. Comput. C-32(12), 1203-1207 (1983).
F. Chin and C. A. Wang, Minimum vertex distance between separable convex polygons, Info. Proc. Leu. 18, 41 -45 (1984).
N. Christofidcs. Worst-ease analysis of a new heuristic for the travelling salesman problem. Symposium on Algorithms and Complexity. Department of Computer Science, Carnegie-Mellon University, Apr. 1976.
V. Chvatal, A combinatorial theorem in plane geometry, J. Comb. Theory B. 18, 39-41 (1975).
J. L. Coolidgc, A Treatise on the Circle and the Sphere, Oxford University Press,
Oxford, England, 1916. Reprinted 1971 by Chelsea. B. Dasarathy and L. J. White, On some maximin location and classifier problems,
Computer Science Conference. Washington, D.C., 1975 (Unpublished lecture). P. J. Davis, Interpolation and Approximation, Blaisdell, NY (1963). Reprinted 1975 by
Dover, New York.
5B. Delaunay, Sur la sphere vide. Bull. Acad. Sci. USSR(VII). Classe Sci. Mat. Nat., 793-800 (1934).
R. B. Desens, Computer processing for display of three-dimensional structures, Technical Report CFSTI AD-7006010, Naval Postgraduate School, Oct. 1969.
E. W. Dijkstra, A note on two problems in connection with graphs, Numer. Math. 1 (5),
269-271 (Oct. 1959).
D. P. Dobkin and D. G. Kirkpatrick, Fast algorithms for preprocessed polyhedral
intersection detection, submitted for publication (1984). David Dobkin and Richard Lipton, Multidimensional searching problems, SIAM J.
Comput. 5(2), 181-186 (June 1976). David Dobkin and Richard Lipton, On the complexity of computations under varying
set of primitives. Journal of Computer and Systems Sciences 18, 86-91 (1979). R. L. Drysdale, III, Generalized Voronoi diagrams and geometric searching, Ph.D.
Thesis, Dept. Сотр. Sci., Stanford University, Tech. Rep. STAN-CS-79-705
(1979).
6R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis, Wiley-Interscience, New York, 1973. R. D. Diippe and H. J. Gottschalk, Automatische Interpolation yon Isolinien bei willkiirlich verteiltcn Stiitzpunkten, Allyemeine Vermessungsnachrichten 77, 423-426(1970).
M. E. Dver, A simplified O(nloen) algorithm for the intersection of 3-polyhedra,
458
Литература
ematics and Statistics; Report TPMR 80-5, 1980. M. E. Dver. Linear time algorithms for two- and three-variable linear programs,
SIAMJ. Сотр. 13(1), 31-45 (Feb. 1984). M. I. Edahiro, Г Kokubo and T. Asano. A new point-location algorithm and its
practical efficiency—comparison with existing algorithms. Res. Memo. RMI 83-
04, Dept: Math. Eng. В Instrumentation Physics, Univ. of Tokyo, Oct. 1983. W*. Eddy, A new convex hull algorithm for planar sets, ACM Trans, Math. Software
3(4"). 398-403 (1977).
H. Edelsbrunner. Dynamic data structures for orthogonal intersection queries, Rep.
F59, Tech. Univ. Graz, Institute fur Informationsverarbeitung 1980. H. Edelsbrunner. Intersection problems in computational gcometrv. Ph, D. Thesis,
Rep. 93, IIG. Tcchnischc Univcrsitat Graz, Austria, 1982. H. Edelsbrunner. A new approach to rectangle intersections. Part II. Int'l. J. Comput,
Math. 13. 221-229 (1983). *E. Edelsbrunner, L. J. Guibas and J. Stolfi, Optimal point location in a monotone
subdivision. SIAM J. Comput., to appear (1985). H. Edelsbrunner. J. van Leeuwen, T. A. Ottman,.and D. Wood, Connected components of orthogonal geometric objects, McMaster University. Hamilton. Ontario.
Unit for Computer Science, Report 81 -CS-04, 1981. H. Edelsbrunner and-H. A. Maurcr; On the intersection of orthoaonal objects Info.
Proc. Lett. 13, 177—181 (1981). H. Edelsbrunner and M. H. Ovcrmars. On the equivalence of some rectansle problems.
Information Processing Letters 14(3), 124-123; (May 1982). H. Edelsbrunner and M. H. Ovcrmars, Batched_dynamic solutions to decomposable
searching problems, J.. Algorithms, to appear (1985). H. Edelsbrunner. M. H. Overmars and D. Wood. Graphics in flatland: A case study, in
Advances in Computing Research. Edited bv F. P. Preparata. Vol. 1. JAI Press. ^ 35-59 (1983).
H. Edelsbrunner and R. Seidel, Arrangements of planes and Voronoi diagrams, 'in preparation (1985).
*H. Edelsbrunner and E. Welzl, Halfplanar range search in linear space and 0(n**
0.695) query time, Rep. Ill, IIG. Technische Universitat Graz. Austria. 1983. •J. Edmonds. Maximum matching and a polvhedron with 0,1 vertices. J. Res. \BS.
69B, 125-130 (Apr,-June 1965). B. Efron, The convex hull of a random set of points. Bh.nwtrika 52. 331-343 ( 1965). H. El Gindv and D. Avis. A linear algorithm for computing the \isibihtv pohgon from
a point, J. Algorithms 2(2). 186-197 (1981). D. J. Elzinga and D. W. Hearn. Geometrical solutions for some minimax location
