CONSTRUCTING ARRANGEMENTS OF LINES AND HYPERPLANES WITH APPLICATIONS

被引:265
作者
EDELSBRUNNER, H
OROURKE, J
SEIDEL, R
机构
[1] JOHNS HOPKINS UNIV,DEPT ELECT ENGN & COMP SCI,BALTIMORE,MD 21218
[2] CORNELL UNIV,DEPT COMP SCI,ITHACA,NY 14853
关键词
D O I
10.1137/0215024
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:341 / 363
页数:23
相关论文
共 29 条
[1]  
ALEXANDERSON GL, 1978, MATH MAG, V51, P220
[2]  
[Anonymous], 1982, GEOMET DEDICATA
[3]   A RECURSIVE SWEEP-PLANE ALGORITHM, DETERMINING ALL CELLS OF A FINITE DIVISION OF RD [J].
BIERI, H ;
NEF, W .
COMPUTING, 1982, 28 (03) :189-198
[4]  
BROWN KQ, 1980, CMUCS80101 CARN U DE
[5]  
Chazelle B., 1983, 24th Annual Symposium on Foundations of Computer Science, P217, DOI 10.1109/SFCS.1983.75
[6]  
CHAZELLE BM, 1983, P INT S FUNDAMENTAL
[7]  
DEHNE F, 1982, 20TH P ANN ALL C COM
[8]  
DOBKIN DP, COMMUNICATION
[9]   OPTIMAL POINT LOCATION IN A MONOTONE SUBDIVISION [J].
EDELSBRUNNER, H ;
GUIBAS, LJ ;
STOLFI, J .
SIAM JOURNAL ON COMPUTING, 1986, 15 (02) :317-340
[10]  
EDELSBRUNNER H, 1982, BIT, V22, P274, DOI 10.1007/BF01934440