Realistic input models for geometric algorithms

被引:66
作者
de Berg, M
Katz, MJ
van der Stappen, AF
Vleugels, J
机构
[1] Univ Utrecht, Inst Informat & Comp Sci, NL-3508 TB Utrecht, Netherlands
[2] Ben Gurion Univ Negev, Dept Math & Comp Sci, IL-84105 Beer Sheva, Israel
关键词
computational geometry; analysis of algorithms; input models;
D O I
10.1007/s00453-002-0961-x
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
The traditional worst-case analysis often fails to predict the actual behavior of the running time of geometric algorithms in practical situations. One reason is that worst-case scenarios are often very contrived and do not occur in practice. To avoid this, models are needed that describe the properties that realistic inputs have, so that the analysis can take these properties into account. We try to bring some structure to this emerging research direction. In particular, we present the following results: We show the relations between various models that have been proposed in the literature. For several of these models, we give algorithms to compute the model parameter(s) for a given (planar) scene; these algorithms can be used to verify whether a model is appropriate for typical scenes in some application area. As a case study, we give some experimental results on the appropriateness of some of the models for one particular type of scene often encountered in geographic information systems, namely certain triangulated irregular networks.
引用
收藏
页码:81 / 97
页数:17
相关论文
共 29 条
[11]  
DEBERG M, 1995, LECT NOTES COMPUTER, V979, P252
[12]  
Efrat A., 1997, Proceedings of the Thirteenth Annual Symposium on Computational Geometry, P104, DOI 10.1145/262839.262911
[13]   Dynamic data structures for fat objects and their applications [J].
Efrat, A ;
Katz, MJ ;
Nielsen, F ;
Sharir, M .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2000, 15 (04) :215-227
[14]  
EFRAT A, 1998, P 14 ACM S COMP GEOM, P206
[15]   OPTIMAL PACKING AND COVERING IN THE PLANE ARE NP-COMPLETE [J].
FOWLER, RJ ;
PATERSON, MS ;
TANIMOTO, SL .
INFORMATION PROCESSING LETTERS, 1981, 12 (03) :133-137
[16]  
Katz M. J., 1992, Computational Geometry: Theory and Applications, V2, P223, DOI 10.1016/0925-7721(92)90024-M
[17]   3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects [J].
Katz, MJ .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1997, 8 (06) :299-316
[18]   VORONOI DIAGRAMS IN L1 (L INFINITY) METRICS WITH TWO-DIMENSIONAL STORAGE APPLICATIONS [J].
LEE, DT ;
WONG, CK .
SIAM JOURNAL ON COMPUTING, 1980, 9 (01) :200-211
[19]   FAT TRIANGLES DETERMINE LINEARLY MANY HOLES [J].
MATOUSEK, J ;
PACH, J ;
SHARIR, M ;
SIFRONY, S ;
WELZL, E .
SIAM JOURNAL ON COMPUTING, 1994, 23 (01) :154-169
[20]   Query-sensitive ray shooting [J].
Mitchell, JSB ;
Mount, DM ;
Suri, S .
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1997, 7 (04) :317-347