LOCATION OF MULTIPLE POINTS IN A PLANAR SUBDIVISION

被引：8

作者：

LEE, DT

YANG, CC

机构：

[1] Northwestern University, Evanston, IL

[2] Naval Research Laboratory, Washington, DC

来源：

关键词：

Pictorial data bases; point-location algorithm; slabs method; Voronoi diagram;

D O I：

10.1016/0020-0190(79)90066-8

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

页码：190 / 193

页数：4

共 12 条

[1]

Adel'son-Velskii, Landis, An algorithm for the organization of information, Dokl. Akad. Nauk SSR, 16, pp. 263-266, (1962)

[2]

Adel'son-Velskii, Landis, An algorithm for the organization of information, Soviet Math. Dokl., 3, pp. 1259-1262, (1962)

[3]

Dobkin, Lipton, The complexity of searching lines in the plane, (1975)

[4]

Lee, Preparata, Location of a point in a planar subdivision and its applications, SIAM Journal on Computing, 6, 3, pp. 594-606, (1977)

[5]

Lipton, Tarjan, Applications of a planar separator theorem, Proc. 18th IEEE Symp. on Foundations of Computer Sci., pp. 228-240, (1977)

[6]

Muller, Preparata, Finding the intersection of two polyhedra, Theoret. Comput. Sci., 7, pp. 217-236, (1978)

[7]

Preparata, Steps into computational geometry, Coordinate Science Laboratory Report R-760, (1977)

[8]

Raghavan, Yu, A note on a multidimensional searching problem, Information Processing Lett., 6, 4, pp. 133-135, (1977)

[9]

Roger, Packing and Covering, (1964)

[10]

Schultz, A graphic program for updating the confidence region of a target, NRL Memorandum Report 3415, (1976)