AN OPTIMAL PARALLEL ALGORITHM FOR TRIANGULATING A SET OF POINTS IN THE PLANE

被引：8

作者：

MERKS, E ^{[1
]}

机构：

[1] SIMON FRASER UNIV,SCH COMP SCI,BURNABY V5A 1S6,BC,CANADA

来源：

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING | 1986年 / 15卷 / 05期

关键词：

D O I：

10.1007/BF01414464

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：399 / 411

页数：13

共 50 条

[31] A Note on Convex Decompositions of a Set of Points in the Plane
Víctor Neumann-Lara
Eduardo Rivera-Campo
Jorge Urrutia
[J]. Graphs and Combinatorics, 2004, 20 : 223 - 231
[32] TO FIT A PLANE TO A SET OF POINTS BY LEAST SQUARES
BLOW, DM
[J]. ACTA CRYSTALLOGRAPHICA, 1960, 13 (02): : 168 - 168
[33] ON THE BOUNDARY OF A FINITE-SET OF POINTS IN THE PLANE
MEDEK, V
[J]. COMPUTER GRAPHICS AND IMAGE PROCESSING, 1981, 15 (01): : 93 - 99
[34] TRIANGULATING A MONOTONE POLYGON IN PARALLEL
WAGENER, H
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 333 : 136 - 147
[35] An optimal parallel algorithm for the perfect dominating set problem on distance-hereditary graphs
Hsieh, SY
Chen, GH
Ho, CW
[J]. ADVANCES IN COMPUTING SCIENCE-ASIAN' 98, 1998, 1538 : 113 - 124
[36] RANDOMIZED STOPPING POINTS AND OPTIMAL STOPPING ON THE PLANE
NUALART, D
[J]. ANNALS OF PROBABILITY, 1992, 20 (02): : 883 - 900
[37] ON LEAST-SQUARES PLANE THROUGH A SET OF POINTS
HAMILTON, WC
[J]. ACTA CRYSTALLOGRAPHICA, 1961, 14 (02): : 185 - &
[38] Fitting rectilinear polygonal curves to a set of points in the plane
Díaz-Báñez, JM
Mesa, JA
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 130 (01) : 214 - 222
[39] TO FIT A PLANE OR A LINE TO A SET OF POINTS BY LEAST SQUARES
SCHOMAKER, V
WASER, J
MARSH, RE
BERGMAN, G
[J]. ACTA CRYSTALLOGRAPHICA, 1959, 12 (08): : 600 - 604
[40] On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane
Jan Kára
Attila Pór
David R. Wood
[J]. Discrete & Computational Geometry, 2005, 34 : 497 - 506

← 1 2 3 4 5 →