Algorithmic Techniques for Geometric Optimization

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

[1]  H. Martini,et al.  Hyperplane Approximation and Related Topics , 1993 .

[2]  Micha Sharir,et al.  Ray shooting amidst convex polytopes in three dimensions , 1993, SODA '93.

[3]  Jerzy W. Jaromczyk,et al.  An efficient algorithm for the Euclidean two-center problem , 1994, SCG '94.

[4]  Dan Gusfield,et al.  Parametric Combinatorial Computing and a Problem of Program Module Distribution , 1983, JACM.

[5]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[6]  Ketan Mulmuley,et al.  Computational geometry : an introduction through randomized algorithms , 1993 .

[7]  E. Helly,et al.  Über Systeme von abgeschlossenen Mengen mit gemeinschaftlichen Punkten , 1930 .

[8]  Klara Kedem,et al.  On Some Geometric Selection and Optimization Problems via Sorted Matrices , 1995, WADS.

[9]  Sivan Toledo,et al.  Computing a Segment Center for a Planar Point Set , 1993, J. Algorithms.

[10]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[11]  Klara Kedem,et al.  Improvements on Geometric Pattern Matching Problems , 1992, SWAT.

[12]  Michael T. Goodrich.  Geometric partitioning made easier, even in parallel , 1993, SCG '93.

[13]  Andrew Stein,et al.  Finding the repeated median regression line , 1992, SODA '92.

[14]  Endre Szemerédi,et al.  An Optimal-Time Algorithm for Slope Selection , 1989, SIAM J. Comput..

[15]  Jirí Matousek.  On geometric optimization with few violated constraints , 1994, SCG '94.

[16]  Daniel Mier Gusfield.  Sensitivity analysis for combinatorial optimization , 1980 .

[17]  Micha Sharir,et al.  Off-line dynamic maintenance of the width of a planar point set , 1991 .

[18]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[19]  Daniel P. Huttenlocher,et al.  Computing the minimum Hausdorff distance for point sets under translation , 1990, SCG '90.

[20]  Matthias Reichling.  On the Detection of a Common Intersection of k Convex Polyhedra , 1988, Workshop on Computational Geometry.

[21]  Hermann A. Maurer,et al.  New Results and New Trends in Computer Science , 1991, Lecture Notes in Computer Science.

[22]  Donald B. Johnson,et al.  Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures , 1983, J. Algorithms.

[23]  Kenneth L. Clarkson,et al.  Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.

[24]  Asish Mukhopadhyay,et al.  Computing a centerpoint of a finite planar set of points in linear time , 1993, SCG '93.

[25]  Jirí Matousek.  Computing the Center of Planar Point Sets , 1990, Discrete and Computational Geometry.

[26]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[27]  Matthias Reichling.  On the Detection of a Common Intersection of k Convex Objects in the Plane , 1988, Inf. Process. Lett..

[28]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[29]  William L. Steiger,et al.  Algorithms for ham-sandwich cuts , 1994, CCCG.

[30]  Sivan Toledo,et al.  Applications of parametric searching in geometric optimization , 1992, SODA '92.

[31]  Richard C. T. Lee,et al.  On weighted rectilinear 2-center and 3-center problems , 1991, Inf. Sci..

[32]  Donald E. Knuth,et al.  Sorting and Searching , 1973 .

[33]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

[34]  Alon Efrat,et al.  Geometric Pattern Matching in d-Dimensional Space , 1995, ESA.

[35]  Godfried T. Toussaint,et al.  Computing the Width of a Set , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[36]  Sivan Toledo,et al.  An Eecient Multi-dimensional Searching Technique and Its Applications an Eecient Multi-dimensional Searching Technique and Its Applications , 2007 .

[37]  Donald E. Knuth,et al.  The art of computer programming: sorting and searching (volume 3) , 1973 .

[38]  Donald B. Johnson,et al.  The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns , 1982, J. Comput. Syst. Sci..

[39]  Jiří Matoušek,et al.  Lower Bounds for a Subexponential Optimization Algorithm , 1994, Random Struct. Algorithms.

[40]  Nimrod Megiddo,et al.  A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension , 1992, STOC '92.

[41]  Herbert Edelsbrunner,et al.  Computing a Ham-Sandwich Cut in Two Dimensions , 1986, J. Symb. Comput..

[42]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[43]  Bernard Chazelle,et al.  On linear-time deterministic algorithms for optimization problems in fixed dimension , 1996, SODA '93.

[44]  Helmut Alt,et al.  Approximate Matching of Polygonal Shapes (Extended Abstract) , 1991, SCG.

[45]  Micha Sharir,et al.  A Near-Linear Algorithm for the Planar 2-Center Problem , 1996, SCG '96.

[46]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[47]  Nimrod Megiddo.  On the ball spanned by balls , 1989, Discret. Comput. Geom..

[48]  Micha Sharir,et al.  An expander-based approach to geometric optimization , 1993, SCG '93.

[49]  John Hershberger.  A Faster Algorithm for the Two-Center Decision Problem , 1993, Inf. Process. Lett..

[50]  Micha Sharir.  A Near-Linear Algorithm for the Planar 2-Center Problem , 1997, Discret. Comput. Geom..

[51]  Sivan Toledo.  Approximate Parametric Searching , 1993, Inf. Process. Lett..

[52]  Marco Pellegrini,et al.  Incidence and nearest-neighbor problems for lines in 3-space , 1992, SCG '92.

[53]  Micha Sharir,et al.  Optimal Slope Selection Via Expanders , 1993, CCCG.

[54]  Martin E. Dyer,et al.  A class of convex programs with applications to computational geometry , 1992, SCG '92.

[55]  Micha Sharir,et al.  A Combinatorial Bound for Linear Programming and Related Problems , 1992, STACS.

[56]  Jirí Matousek,et al.  Efficient Randomized Algorithms for the Repeated Median Line Estimator , 1998, SODA '93.

[57]  Micha Sharir,et al.  Computing envelopes in four dimensions with applications , 1994, SCG '94.

[58]  J. Matou Sek,et al.  Computing the center of planar point sets , 1991 .

[59]  Micha Sharir,et al.  Computing the Smallest K-enclosing Circle and Related Problems , 1993, Comput. Geom..

[60]  Micha Sharir,et al.  A near-linear algorithm for the planar segment-center problem , 1994, SODA '94.

[61]  Klara Kedem,et al.  A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion , 1993, Comput. Geom..

[62]  Sivan Toledo,et al.  Extremal polygon containment problems , 1991, SCG '91.

[63]  David Eppstein,et al.  Approximating center points with iterated radon points , 1993, SCG '93.

[64]  Jirí Matousek.  Linear Optimization Queries , 1993, J. Algorithms.

[65]  Jirí Matousek,et al.  A deterministic algorithm for the three-dimensional diameter problem , 1993, STOC '93.

[66]  Dan Gusfield,et al.  Parametric optimization of sequence alignment , 1992, SODA '92.

[67]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[68]  Asish Mukhopadhyay,et al.  Computing a centerpoint of a finite planar set of points in linear time , 1994, Discret. Comput. Geom..

[69]  Dennis G. Severance,et al.  Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases , 1976, JACM.

[70]  N. Megiddo,et al.  Maximizing Concave Functions in Fixed Dimension , 1993 .

[71]  Edgar A. Ramos,et al.  Intersection of Unit-balls and Diameter of a Point Set in 3 , 1997, Comput. Geom..

[72]  Mark J. Post.  Minimum spanning ellipsoids , 1984, STOC '84.

[73]  S. Toledo.  Extremal Polygon Containment Problems and Other Issues in Parametric Searching , 1991 .

[74]  Raimund Seidel,et al.  Small-dimensional linear programming and convex hulls made easy , 1991, Discret. Comput. Geom..

[75]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[76]  Greg N. Frederickson,et al.  Optimal algorithms for tree partitioning , 1991, SODA '91.

[77]  Nimrod Megiddo,et al.  Partitioning with Two Lines in the Plane , 1985, J. Algorithms.

[78]  Richard Cole,et al.  Slowing down sorting networks to obtain faster sorting algorithms , 2015, JACM.

[79]  Nina Amenta,et al.  Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem , 1994, SCG '94.

[80]  Pankaj K. Agarwal,et al.  Linear Approximation of Simple Objects , 1997, Inf. Process. Lett..

[81]  D. T. Lee,et al.  1-Segment Center Problems , 1992, INFORMS J. Comput..

[82]  Raimund Seidel,et al.  Linear programming and convex hulls made easy , 1990, SCG '90.

[83]  Bernard Chazelle,et al.  Optimal Slope Selection Via Cuttings , 1994, CCCG.

[84]  Jirí Matousek,et al.  On range searching with semialgebraic sets , 1992, Discret. Comput. Geom..

[85]  Marco Pellegrini.  Repetivive Hidden-Surface-Removal for Polyhedral Scenes , 1993, WADS.

[86]  Nimrod Megiddo,et al.  Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.

[87]  Nimrod Megiddo,et al.  The Weighted Euclidean 1-Center Problem , 1983, Math. Oper. Res..

[88]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[89]  Micha Sharir,et al.  Off-line Dynamic Maintenance of the Width of a Planar Point Set , 1991, Comput. Geom..

[90]  János Komlós,et al.  Sorting in c log n parallel sets , 1983, Comb..

[91]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[92]  Emo Welzl,et al.  Smallest enclosing disks (balls and ellipsoids) , 1991, New Results and New Trends in Computer Science.

[93]  Nina Amenta,et al.  Helly-type theorems and Generalized Linear Programming , 1994, Discret. Comput. Geom..

[94]  Matthew J. Katz.  Improved algorithms in geometric optimization via expanders , 1995, Proceedings Third Israel Symposium on the Theory of Computing and Systems.

[95]  Jerzy W. Jaromczyk,et al.  The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure , 1995, WADS.

[96]  Jeffrey S. Salowe.  L-Infinity Interdistance Selection by Parametric Search , 1989, Inf. Process. Lett..

[97]  Micha Sharir,et al.  Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications , 1995, SCG '95.

[98]  Micha Sharir,et al.  Efficient randomized algorithms for some geometric optimization problems , 1995, SCG '95.

[99]  Helmut Alt,et al.  Approximate matching of polygonal shapes , 1995, SCG '91.

[100]  Éva Tardos,et al.  Using separation algorithms in fixed dimension , 1990, SODA '90.

[101]  Godfried T. Toussaint,et al.  Linear Approximation of Simple Objects , 1994, Comput. Geom..

[102]  Nina Amenta.  Finding a line transversal of axial objects in three dimensions , 1992, SODA '92.

[103]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[104]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[105]  Nimrod Megiddo,et al.  Combinatorial optimization with rational objective functions , 1978, Math. Oper. Res..

[106]  David Fernández-Baca,et al.  Weighted Multidimensional Search and Its Application to Convex Optimization , 1996, SIAM J. Comput..

[107]  Z. Drezner.  On the rectangular p‐center problem , 1987 .

[108]  Martin E. Dyer,et al.  A randomized algorithm for fixed-dimensional linear programming , 1989, Math. Program..

[109]  Endre Szemerédi,et al.  Optimal Slope Selection , 1988, ICALP.

[110]  Leonidas J. Guibas,et al.  Diameter, width, closest line pair, and parametric searching , 1992, SCG '92.

[111]  Zvi Drezner,et al.  The p-Centre Problem—Heuristic and Optimal Algorithms , 1984 .

[112]  Micha Sharir,et al.  Selecting distances in the plane , 1990, SCG '90.

[113]  Kenneth L. Clarkson,et al.  Linear Programming in O(n * (3_d)_2) Time , 1986, Inf. Process. Lett..

[114]  Jirí Matousek,et al.  Ray Shooting and Parametric Search , 1993, SIAM J. Comput..

[115]  Micha Sharir,et al.  A Subexponential Bound for Linear Programming , 1992, Symposium on Computational Geometry.

[116]  Martin E. Dyer,et al.  On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem , 1986, SIAM J. Comput..

[117]  Reuven Bar-Yehuda,et al.  A Simple Algorithm for Maintaining the Center of a Planar Point-set , 1993, CCCG.

[118]  Bernd Gärtner.  A Subexponential Algorithm for Abstract Optimization Problems , 1992, FOCS.

[119]  Richard Cole,et al.  On k-hulls and related problems , 1984, STOC '84.

[120]  Bernard Chazelle,et al.  Product range spaces, sensitive sampling, and derandomization , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[121]  Gil Kalai,et al.  A subexponential randomized simplex algorithm (extended abstract) , 1992, STOC '92.

[122]  Jirí Matousek,et al.  Randomized Optimal Algorithm for Slope Selection , 1991, Inf. Process. Lett..

[123]  Leonidas J. Guibas,et al.  Diameter, width, closest line pair, and parametric searching , 1993, Discret. Comput. Geom..

[124]  Donald B. Johnson,et al.  Generalized Selection and Ranking: Sorted Matrices , 1984, SIAM J. Comput..