|
|
Авторизация |
|
|
Поиск по указателям |
|
|
|
|
|
|
|
|
|
|
Sack J.R., Urrutia J. (Ed) — Handbook of Computational Geometry |
|
|
Предметный указатель |
Papadimitriou, C. 34 35 45 46 46 251 271 288 288 440 460 645 650 651 656 661 662 665 667 668 670 677 691 691 697 697 698 698 698 698
Papadopoulou, E. 247 280 288 642 698
Papakostas, A. 947—952 954 961 962 964 969 970 970 970 970 970 970 970 970 970 970
Papamitridiou, C.H. 351 372 384 384
Paraboloid 220
Parallel algorithm 241 642 649 1010
Parallel algorithm derandomization 568 575 578 589
Parallel bounded degree decision tree 812
Parallel comparison tree 787
Parallel divide and conquer 164
Parallel merge sort 191
Parallel prefix 160 775
Parallel quicksort 776
Parallel random access machine 539
Parallel reducible 773
Parallelization 280
Parameter space 750
Parameterizations 139
parametric search 136 140 588 589
Parametric searching 101
Parberry, I. 159 199
Parent, R. 146 149 150 152
Pareto optimal 656
Parikh, P. 321 322 330
Paris, J. 12 46
Parise, A. 964 966
Park, J. 181 184 185 187 192 193 679 696
Parker, R. 680 698
Parsimonious algorithm 616
Parthasarathy, V.N. 312 313 330
Partial matching 123
Partition 496
Partition into convex polygons 445
Paschinger, I. 233 288
Pascucci, V. 356 377
Passes 370
Paterson, M. 74 715 437 438 460 674 698
Path 637
Path planning 350
Path preserving graph 648
Path problems 372
Path-preserving graph 651
Pathnet 651 670
Pathwise connected 262 264
Pattern recognition 493
Paul, W. 188 199 821 828
Pavlidis, T. 361 386 493 4 498 500 514 517 517 517
Payne, T. 946 952 953 965
Payton, D.W. 665 697
Peaks 370
Pearl, J. 644 698
Peck, G.W. 73 117
Peiro, J. 322 330
Pellegrini, M. 52 68 70 71 101 108 117 117 117 589 594 750 758
Penttonen, M. 888 932
Peraire, J. 322 329 329 330
Perakis, A. 652 698 698
Peralta, R. 570 591
Percentile-based Hausdorff distance 130
Perfect matchings 977
Perimeter minimization 181
Periscope visibility 995
Perry, E. 318 327
Persson, J. 347 385
Perturbation 606 618
Perucchio, R. 323 330
Peshkin, M.A. 833 874
Peterkin, C. 10 46
Peters, J.G. 547 557 648 692 697
Petersson, O. 544 555
Petre, M. 421 [24]
Petreschi, R. 949 969
Petrie, G. 351 352 354 355 385 385
Petrovskii, I.G. 58 117
Peucker, T.K. 143 151 347 357 370 371 379 385
Piatko, C. 550 557 657—659 685 687 687 697
Piecewise-linear approximation 280
Pienovi, C. 228 284 366 379
Pigot, S. 340 385
Pilouk, M. 385 [219]
Pin, F.G. 656 699
Pinter, R. 493 497 503 504 516 843 871
Pion, S. 609 613 627
Piperno, A. 944 945 950 952 955 966 966
Pippenger, N. 74 115 746 759
Pits 370
Plaisted, D. 445 460 498 517
Planar digraphs 946
Planar drawing 940
Planar graph 427 436 444 446 448 450 451 945 959
Planar linkages 547
Planar point location 179 434
Planar point location problem, chain method solution for 474
Planar point location problem, chain method with fractional cascading 475
Planar point location problem, trapezoid method solution for 473
Planar point location problem, “slab” method solution for 471
Planar straight line graph 240 466
Planar straight line graph, doubly-connected edge list representation of 467
Planar straight line graph, quad-edge representation of 469
Planar straight line graph, winged-edge representation of 468
Planar straight-line graph 445 446
Planar subdivision 843
Planar visibility graphs 865
Planarization approach 957
Plane illumination problem 996
Plane sweep 219 843 884
Plane sweep algorithm 241 247
Plane sweep triangulation 860
Plantinga, H. 99 100 117
Plassmann, P. 27 42 310 313 325 329 329 638 675 689 689
Plaxton, C.G. 196 [96] 199 199
Plotkin, S.A. 589 590 594
Pocchiola, M. 644 646 699 699 860 874
Pocket machining 241
Poiker, T.K. 335 336 381
Point features 370
Point floodlights 983 1000
Point guards 982
Point location 265 639 647
Point pattern 123
Point pattern matching 124
Point pattern with respect to Hausdorff-distance 128
Point visibility graph 840 865
Point visibility polygon 855 857
Polarity 233 237
Polimenis, V.G. 91 108
Pollack, R. 21 23 27 28 36 40 43 43 44 46 53—55 58 71 73 74 77 81 89 90 92 93 104 106 109 109 109 109 112 112 113 113 113 117 527 528 542 557 643 699 828 842 869 874 946 948 949 951—953 966
Pollak, H.O. 674 693
polling 796
Polling lemma 797
Polygon interpolation 148
Polygon placement 102
Polygon with holes 531 831 985
Polygonal chain 215
Polygonal cutting theorem 534
Polygonal domain 638 643
Polyhedral domain 665
Polyhedral surface 666
Polyhedral terrain 145 352 1015
Polyline drawing 940
Polynomial expression 602
Polynomial time approximation scheme (PTAS) 637 678
Polytope 666 668
Post office problem 264 265 880
Postnikov, A. 53 117
Pouly, L. 325 327
Powar, P.L. 227 288
Powell, K.G. 317 328
Power and ground networks 427
Power cell 231
| Power diagram 231 233 260 261 273 277
Power function 231
Power hyperplane 231
Pozo, R. 298 327
PRAM (parallel random access machine) 157 539 767
Prasad, D. 870 871 871
Pratt, V.R. 191 194
Pratt, W.K. 339 385
PRECISION 599
Precision problem 601
Precision-sensitivity 669
Preis, B. 350 383
Preparata, F. 21 23 27 35 42 42 43 46 95 98 110 117 163 176 178 189 191 192 193 193 198 198 198 199 199 203 209 211 221 253 288 289 293 306 330 340 344—346 353 366 367 375 377 384 385 385 385 465 467 471 473 474 480 483 489 489 489 489 489 489 489 493 499 515 517 522 550 556 557 610 626 627 603 607 608 613 626 627 627 627 628 630 631 631 638 641 642 690 690 696 699 740 762 826 828 828 828 843 856 857 873 874 874 882 909 928 934 976 1020 1025 1026
Price, B.A. 393 421 421 421 421
Priest, D.M. 611 631 631
Prim, R.C. 270 289
Prison problem 993
Prison yard problem 990 992
Prize-collecting salesperson 679
Probabilistic learning paradigm 655
Probabilistic roadmap 104
Probert, E.J. 322 329 329
Progressive meshes 362
Properties of geographic data 335
protected 1016
Proximity 725
Proximity drawing 941 959
Pruhs, K. 665 672 675 677 688 695 695 695
Prune-and-search 191
Przestawski, K. 138 153
Przytycka, T. 161 192
Pseudo-random generator 561
Puech, C. 343 380 756 759
Pugh, W. 719 723 919 925 934
Puiseux series 54
Pullar, D. 621 631
Pulleyblank, B. 681 689
Pulleyblank, W. 681 692 1001 1024
Puppo, E. 337 341 342 349 352 358 359 361 363 369 377 378 379 379 379 379 379 379 379 379 384 385 385 385 385 635 691
Quad edge 209
Quad edge data structure 216
Quad-CIF tree 753
Quadrilaterals 500 505
Quadtree 344 442 360 653 917
Quak, W. 351 387
Quasi-robust algorithm 616
Quaternary triangulation 360
Query processing 725
Quota-driven salesperson 679
Quotient space 250
R+-tree 752
R-file 754
R-tree 345 752
Raab, S. 92 117
Rabin, M.O. 705 723 888 934
Rademacher, H. 962 970
Radii graph 271
Radke, J.D. 273 274 287
Raeihae, K.-J. 421 [18]
Rafferty, C.S. 315 327
Raghavachari, B. 439 444 460 460 953 967
Raghavan, P. 104 115 133 152 570 593 593 594 654 661 662 673 677 681 683 686 689 689 689 695 882 929 930
Raghunathan, A. 510—512 516 516 517 868 874 874
Rajagopalan, S. 439 440 456 680 687
Rajan, V.T. 194 [62] 227 230 231 281 289 321 331 353 385 526 530 540—542 551 555
Rajasekaran, S. 241 289 825 828 828
Ramachandran, V. 159 198 539 556
Ramaiyer, K. 487 488 639 641 693
Ramamohanarao, K. 754 762
Raman, R. 192 199 268 286 481 488 636 699 825 827 890 891 907—909 933 933
Ramanan, P. 814 827
Ramaswami, S. 241 289 500 517 825 828
Ramaswamy, S. 749 763
Ramesh, H. 676 679 688
Ramos, E. 26 30 42 46 102 117 117 189—192 193 193 193 197 199 234 281 570 575 578 580 581 585 586 588 589 591 591 594 594 594 594 594 825 826 928 930
Ramos, P. 500 517
Ramshaw, L. 150 152
Ranade, A. 818 828
Randell, R. 52 113
Random mate 783
Random point sets 453
Random sample higher moments 563
Random sample pointwise bound 563
Random sampling 189 711 888
Random sampling higher moments 566
Random update sequence 718
Randomization 212
Randomized algebraic decision tree model 445 452
Randomized algorithm 672 678
Randomized divide-and-conquer 562 566 705 797
Randomized incremental algorithm 242 245 435 713
Randomized Incremental Construction 260 262 564 566 890
Randomized incremental insertion 241
Randomized strategies 661
Randomized symmetry breaking 783
Range minima 162
Range searching 98
Range space 571 709 572
Range tree 909 919
Ranjan, D. 743 757
Rao, A. 105 117
Rao, N.S.V. 660 665 699 699 699 740 760
Rao, S. 636 659 694 818 819 827
Rao, S.B. 678 699
Rao, S.V.N. 665 695
Raper, J. 375 385
Rappaport, D. 686 691 865 871 874 1010 1013 1024 7024
Rappoport, A. 149 153 499 517
Rardin, R. 680 698
Rasch, R. 263 289
Raster model 339
Rational expression 603
Rau-Chaplin, A. 194 [38] 196 196 196
Ravi, R. 440 441 457 460 675 676 693 695 699
Ravi, S.S. 440 441 460 676 699
Raviart, P.A. 300 328
Ravishankar, C. 761 [101]
Rawlins, G. 661 662 682 688 691 868 875 875 875
Ray shooting 38 365 471
Razzazi, M. 505 515 515
Reachability problem 548
Read, J. 963 968
Realizable sign sequences 58
Recio, T. 249 250 253 254 284 288
Reciprocal figure 225
Reckhow, R. 501 508 510—512 514 514 514 517 517 868 872 875 1021 1024 1024
Recognition of Voronoi diagrams 222
Recognizing visibility graphs 864 865
Recognizing visibility polygons 855
rectangle 502—504 507 508
Rectangle cover 1021
Rectangular art gallery 979
Rectangular visibility 869
Rectanguloid polygon 533
Rectilinear 648 650 663 675
Rectilinear and metrics 431
Rectilinear data structures, k-D 484
Rectilinear Delaunay triangulation 449
Rectilinear link distance 649 658 664
Rectilinear link radius 547
Rectilinear metric 435 449
Rectilinear polygon 533
Rectilinear quad trees 484
Rectilinear range trees 485
Rectilinear segment trees 485
Rectilinear shortest paths 181
Reed, B. 1003 1025
Reeds, J.A. 653 699
Reference point 136 141
Refinement methods 357
|
|
|
Реклама |
|
|
|