Algorithmic techniques for geometric optimization

作者: Pankaj K. Agarwal , Micha Sharir

DOI: 10.1007/BFB0015247

关键词:

摘要: We review the recent progress in design of efficient algorithms for various problems geometric optimization. The emphasis this survey is on techniques used to attack these problems, such as parametric searching, alternatives prune-and-search linear programming and related LP-type their solution.

参考文章(115)
Marco Pellegrini, Incidence and nearest-neighbor problems for lines in 3-space symposium on computational geometry. pp. 130- 137 ,(1992) , 10.1145/142675.142703
Nina Amenta, Finding a line transversal of axial objects in three dimensions symposium on discrete algorithms. pp. 66- 71 ,(1992)
Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Computing envelopes in four dimensions with applications Proceedings of the tenth annual symposium on Computational geometry - SCG '94. pp. 348- 358 ,(1994) , 10.1145/177424.178081
Nimrod Megiddo, Applying Parallel Computation Algorithms in the Design of Serial Algorithms Journal of the ACM. ,vol. 30, pp. 852- 865 ,(1983) , 10.1145/2157.322410
Carolyn Haibt Norton, Serge A Plotkin, Éva Tardos, None, Using separation algorithms in fixed dimension Journal of Algorithms. ,vol. 13, pp. 79- 98 ,(1992) , 10.1016/0196-6774(92)90006-X
M.J. Katz, Improved algorithms in geometric optimization via expanders Proceedings Third Israel Symposium on the Theory of Computing and Systems. pp. 78- 87 ,(1995) , 10.1109/ISTCS.1995.377043
Daniel Mier Gusfield, Sensitivity analysis for combinatorial optimization University of California, Berkeley. ,(1980)
L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem, Geometric Pattern Matching in d-Dimensional Space european symposium on algorithms. pp. 264- 279 ,(1995) , 10.1007/3-540-60313-1_149
Nimrod Megiddo, The Weighted Euclidean 1-Center Problem Mathematics of Operations Research. ,vol. 8, pp. 498- 504 ,(1983) , 10.1287/MOOR.8.4.498
Mark J. Post, Minimum spanning ellipsoids symposium on the theory of computing. pp. 108- 116 ,(1984) , 10.1145/800057.808672