Efficient algorithms for geometric optimization

We review the recent progress in the design of efficient algorithms for various problems in geometric optimization. We present several 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. We then describe a wide range of applications of these and other techniques to numerous problems in geometric optimization, including facility location, proximity problems, statistical estimators and metrology, placement and intersection of polygons and polyhedra, and ray shooting and other query-type problems.

[1]  Joseph S. B. Mitchell,et al.  Practical methods for approximate geometric pattern matching under rigid motions: (preliminary version) , 1994, SCG '94.

[2]  Jirí Matousek,et al.  Efficient partition trees , 1991, SCG '91.

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

[4]  Micha Sharir,et al.  The upper envelope of voronoi surfaces and its applications , 1991, SCG '91.

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

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

[7]  Martin E. Dyer,et al.  A parallel algorithm for linear programming in fixed dimension , 1995, SCG '95.

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

[9]  E. Szemerédi,et al.  Sorting inc logn parallel steps , 1983 .

[10]  Pankaj K. Agarwal,et al.  Exact and Approximation Algortihms for Clustering , 1997 .

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

[12]  Leila De Floriani.  A graph based approach to object feature recognition , 1987, SCG '87.

[13]  Sung-Hyon Myaeng,et al.  Image organization and retrieval with automatically constructed feature vectors , 1996, SIGIR '96.

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

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

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

[17]  Michiel H. M. Smid,et al.  Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects , 1994, Comput. Geom..

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

[19]  Andrew Stein,et al.  Robust statistics in shape fitting , 1992, Proceedings 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

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

[21]  Hiroshi Imai,et al.  Weighted Orthogonal Linear L∞-Approximation and Applications , 1989, WADS.

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

[23]  大野 義夫,et al.  Computer Graphics : Principles and Practice, 2nd edition, J.D. Foley, A.van Dam, S.K. Feiner, J.F. Hughes, Addison-Wesley, 1990 , 1991 .

[24]  M. Garland,et al.  Fast Polygonal Approximation of Terrains and Height Fields , 1998 .

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

[26]  Wolfgang Maass,et al.  Fast Approximation Algorithms for a Nonconvex Covering Problem , 1987, J. Algorithms.

[27]  Marco Pellegrini,et al.  Repetitive Hidden Surface Removal for Polyhedra , 1996, J. Algorithms.

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

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

[30]  Nimrod Megiddo,et al.  An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem , 1986, J. Algorithms.

[31]  Michiel H. M. Smid,et al.  Computing a Largest Empty Anchored Cylinder, and Related Problems , 1995, FSTTCS.

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

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

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

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

[36]  Nimrod Megiddo.  On the Complexity of Some Geometric Problems in Unbounded Dimension , 1990, J. Symb. Comput..

[37]  George E. Collins,et al.  Cylindrical Algebraic Decomposition I: The Basic Algorithm , 1984, SIAM J. Comput..

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

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

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

[41]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[42]  Kurt Mehlhorn,et al.  A complete roundness classification procedure , 1997, SCG '97.

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

[44]  Micha Sharir,et al.  On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space , 1987, Discret. Comput. Geom..

[45]  Teofilo F. Gonzalez,et al.  Covering a Set of Points in Multidimensional Space , 1991, Inf. Process. Lett..

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

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

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

[49]  Sanjeev Arora,et al.  Polynomial time approximation schemes for Euclidean TSP and other geometric problems , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

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

[51]  Peter Widmayer,et al.  k-Violation Linear Programming , 1994, Inf. Process. Lett..

[52]  Jirí Matousek,et al.  On Enclosing k Points by a Circle , 1995, Inf. Process. Lett..

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

[54]  Joseph S. B. Mitchell,et al.  Separation and approximation of polyhedral objects , 1992, SODA '92.

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

[56]  Sanjeev Arora,et al.  Nearly Linear Time Approximation Schemes for Euclidean TSP and Other Geometric Problems , 1997, RANDOM.

[57]  Kenneth L. Clarkson,et al.  RANDOMIZED GEOMETRIC ALGORITHMS , 1992 .

[58]  William Grimson,et al.  Object recognition by computer - the role of geometric constraints , 1991 .

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

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

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

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

[63]  Arie Tamir,et al.  Algebraic optimization: The Fermat-Weber location problem , 1990, Math. Program..

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

[65]  John Hershberger,et al.  Minimizing the Sum of Diameters Efficiently , 1992, Comput. Geom..

[66]  Samir Khuller,et al.  The Capacitated K-Center Problem (Extended Abstract) , 1996, ESA.

[67]  Subhash Suri,et al.  Matrix searching with the shortest path metric , 1993, SIAM J. Comput..

[68]  Nimrod Megiddo,et al.  On the complexity of locating linear facilities in the plane , 1982, Oper. Res. Lett..

[69]  Ivan Stojmenovic,et al.  Computing shortest transversals of sets (extended abstract) , 1991, SCG '91.

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

[71]  Sergei N. Bespamyatnikh.  An efficient algorithm for the three-dimensional diameter problem , 1998, SODA '98.

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

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

[74]  D. T. Lee,et al.  Out-of-Roundness Problem Revisited , 1991, IEEE Trans. Pattern Anal. Mach. Intell..

[75]  Tomás Feder,et al.  Optimal algorithms for approximate clustering , 1988, STOC '88.

[76]  Mark Berman,et al.  Large sample bias in least squares estimators of a circular arc center and its radius , 1989, Comput. Vis. Graph. Image Process..

[77]  David B. Shmoys,et al.  A unified approach to approximation algorithms for bottleneck problems , 1986, JACM.

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

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

[80]  Marek Teichmann,et al.  Efficient Algorithms for the Smallest Enclosing Cylinder Problem , 1996, CCCG.

[81]  Dinesh Manocha,et al.  Simplification envelopes , 1996, SIGGRAPH.

[82]  Carlo Meghini.  An image retrieval model based on classical logic , 1995, SIGIR '95.

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

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

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

[86]  Micha Sharir,et al.  Ray Shooting amidst Convex Polyhedra and Polyhedral Terrains in Three Dimensions , 1996, SIAM J. Comput..

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

[88]  Jirí Matousek,et al.  Ray shooting and parametric search , 1992, STOC '92.

[89]  Leila De Floriani,et al.  Maintaining Multiple Levels of Detail in the Overlay of Hierarchical Sub Divisions , 1996, CCCG.

[90]  Alok Aggarwal,et al.  Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[91]  M. Sharir,et al.  An Efficient Multi-Dimensional Searching Technique and itsApplications , 1993 .

[92]  Elmar Schömer,et al.  Efficient collision detection for moving polyhedra , 1995, SCG '95.

[93]  David M. Mount,et al.  A randomized algorithm for slope selection , 1992, Int. J. Comput. Geom. Appl..

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

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

[96]  Marco Pellegrini,et al.  On Collision-Free Placements of Simplices and the Closest Pair of Lines in 3-Space , 1994, SIAM J. Comput..

[97]  Kenneth L. Clarkson,et al.  Algorithms for Polytope Covering and Approximation , 1993, WADS.

[98]  Jerzy W. Jaromczyk,et al.  A geometric proof of the combinatorial bounds the number of optimal solutions for the 2-center euclidean problem , 1995, CCCG.

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

[100]  共立出版株式会社.  コンピュータ・サイエンス : ACM computing surveys , 1978 .

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

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

[103]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[104]  W. Mccrea.  Analytical Geometry of Three Dimensions , 1943, Nature.

[105]  Refael Hassin,et al.  Approximation algorithms for hitting objects with straight lines , 1991, Discret. Appl. Math..

[106]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

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

[108]  Ján Plesník,et al.  A heuristic for the p-center problems in graphs , 1987, Discret. Appl. Math..

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

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

[111]  Micha Sharir,et al.  Line Transversals of Balls and Smallest Enclosing Cylinders in Three Dimensions , 1997, SODA '97.

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

[113]  Kasturi R. Varadarajan.  Approximating monotone polygonal curves using the uniform metric , 1996, SCG '96.

[114]  Michael T. Goodrich,et al.  Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..

[115]  Herbert Edelsbrunner,et al.  Computing the Extreme Distances Between Two Convex Polygons , 1985, J. Algorithms.

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

[117]  Elmar Schömer,et al.  Subquadratic algorithms for the weighted maximin facility location problem , 1995, CCCG.

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

[119]  J. Matoušek,et al.  On geometric optimization with few violated constraints , 1994, SCG '94.

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

[121]  Tomasz Imielinski,et al.  An Interval Classifier for Database Mining Applications , 1992, VLDB.

[122]  Xiaotie Deng.  An Optimal Parallel Algorithm for Linear Programming in the Plane , 1990, Inf. Process. Lett..

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

[124]  Christos H. Papadimitriou,et al.  Worst-Case and Probabilistic Analysis of a Geometric Location Problem , 1981, SIAM J. Comput..

[125]  Subhash Suri,et al.  Surface approximation and geometric partitions , 1994, SODA '94.

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

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

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

[129]  Anil K. Jain,et al.  Algorithms for Clustering Data , 1988 .

[130]  Satish Rao,et al.  Approximating geometrical graphs via “spanners” and “banyans” , 1998, STOC '98.

[131]  V. Klee,et al.  Helly's theorem and its relatives , 1963 .

[132]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[133]  Kenneth L. Clarkson,et al.  Linear Programming in O(n * (3_d)_2) Time , 1986, Information Processing Letters.

[134]  Rajeev Motwani,et al.  Incremental clustering and dynamic information retrieval , 1997, STOC '97.

[135]  Hans-Peter Kriegel,et al.  The Impact of Global Clustering on Spatial Database Systems , 1994, VLDB.

[136]  Nimrod Megiddo.  Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

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

[138]  Daniel P. Huttenlocher,et al.  Comparing Images Using the Hausdorff Distance , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

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

[140]  D. Eppstein,et al.  Approximation algorithms for geometric problems , 1996 .

[141]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

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

[143]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[144]  William L. Steiger,et al.  Randomizing Optimal Geometric Algorithms , 1993, CCCG.

[145]  Kurt Swanson.  An Optimal Algorithm for Roundness Determination on Convex Polygons , 1993, WADS.

[146]  Martin E. Dyer,et al.  Linear Time Algorithms for Two- and Three-Variable Linear Programs , 1984, SIAM J. Comput..

[147]  N. Megiddo.  Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[148]  Zvi Drezner,et al.  The Planar Two-Center and Two-Median Problems , 1984, Transp. Sci..

[149]  Asish Mukhopadhyay,et al.  An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons , 1996, J. Algorithms.

[150]  David Eppstein,et al.  Faster construction of planar two-centers , 1997, SODA '97.

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

[152]  Jesús García-López,et al.  Fitting a Set of Points by a Circle , 1997, SCG '97.

[153]  Micha Sharir,et al.  Rectilinear and polygonal p-piercing and p-center problems , 1996, SCG '96.

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

[155]  A. Frieze,et al.  A simple heuristic for the p-centre problem , 1985 .

[156]  Zvi Drezner,et al.  The Facility Location Problem with Limited Distances , 1991, Transp. Sci..

[157]  David R. Karger,et al.  Scatter/Gather: a cluster-based approach to browsing large document collections , 1992, SIGIR '92.

[158]  David P. Luebke,et al.  View-dependent simplification of arbitrary polygonal environments , 1997, SIGGRAPH.

[159]  R. Seidel.  Backwards Analysis of Randomized Geometric Algorithms , 1993 .

[160]  J. Eckhoff.  Helly, Radon, and Carathéodory Type Theorems , 1993 .

[161]  J. Matou Sek.  Computing the center of planar point sets , 1991 .

[162]  Alok Aggarwal,et al.  Parallel searching in generalized Monge arrays with applications , 1990, SPAA '90.

[163]  Mark de Berg,et al.  Computing the Maximum Overlap of Two Convex Polygons under Translations , 1996, Theory of Computing Systems.

[164]  Rakesh Agrawal,et al.  SPRINT: A Scalable Parallel Classifier for Data Mining , 1996, VLDB.

[165]  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).

[166]  Asish Mukhopadhyay,et al.  Optimal algorithms for some smallest intersection radius problems (extended abstract) , 1991, SCG '91.

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

[168]  David Eppstein,et al.  Approximating center points with iterative Radon points , 1996, Int. J. Comput. Geom. Appl..

[169]  Ivan Stojmenovic,et al.  Computing shortest transversals of sets , 1992, Int. J. Comput. Geom. Appl..

[170]  Wolfgang Maass.  On the Complexity of Nonconvex Covering , 1986, SIAM J. Comput..

[171]  Micha Sharir,et al.  Largest Placement of One Convex Polygon Inside Another , 1998, Discret. Comput. Geom..

[172]  Il-Yeol Song,et al.  Octree-R: An Adaptive Octree for Efficient Ray Tracing , 1995, IEEE Trans. Vis. Comput. Graph..

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

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

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

[176]  Micha Sharir,et al.  The Discrete 2-Center Problem , 1997, SCG '97.

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

[178]  Joseph S. B. Mitchell,et al.  Query-sensitive ray shooting , 1994, SCG '94.

[179]  Timothy M. Chan.  Fixed-dimensional linear programming queries made easy , 1996, SCG '96.

[180]  Michael T. Goodrich,et al.  Geometric Pattern Matching Under Euclidean Motion , 1993, Comput. Geom..

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

[182]  Peter N. Yianilos,et al.  Data structures and algorithms for nearest neighbor search in general metric spaces , 1993, SODA '93.

[183]  Michiel H. M. Smid,et al.  Static and Dynamic Algorithms for k-Point Clustering Problems , 1993, J. Algorithms.

[184]  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).

[185]  Micha Sharir,et al.  An Expander-Based Approach to Geometric Optimization , 1997, SIAM J. Comput..

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

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

[188]  Jirí Matousek,et al.  A Deterministic Algorithm for the Three-dimensional Diameter Problem , 1996, Comput. Geom..

[189]  David Eppstein,et al.  Fast hierarchical clustering and other applications of dynamic closest pairs , 1999, SODA '98.

[190]  R. D. Spinetto.  A Facility Location Problem , 1976 .

[191]  Michael Zyda,et al.  Simplification of objects rendered by polygonal approximations , 1991, Comput. Graph..

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

[193]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

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

[195]  Tony DeRose,et al.  Mesh optimization , 1993, SIGGRAPH.

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

[197]  Utpal Roy,et al.  Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error , 1992, Comput. Aided Des..

[198]  Michael T. Goodrich,et al.  Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming , 1997, Discret. Comput. Geom..

[199]  J. Makhoul,et al.  Vector quantization in speech coding , 1985, Proceedings of the IEEE.

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

[201]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[202]  Pavan K. Desikan,et al.  An efficient algorithm for terrain simplification , 1997, SODA '97.

[203]  Michael T. Goodrich,et al.  Efficient approximation and optimization algorithms for computational metrology , 1997, SODA '97.

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

[205]  Timothy M. Chan.  Geometric Applications of a Randomized Optimization Technique , 1998, SCG '98.

[206]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[207]  Michael T. Goodrich.  Efficient piecewise-linear function approximation using the uniform metric , 1995, Discret. Comput. Geom..

[208]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

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

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

[211]  Bernard Chazelle,et al.  Cutting hyperplanes for divide-and-conquer , 1993, Discret. Comput. Geom..

[212]  Dimitrios Gunopulos,et al.  Automatic subspace clustering of high dimensional data for data mining applications , 1998, SIGMOD '98.

[213]  Joseph S. B. Mitchell,et al.  Shortest paths among obstacles in the plane , 1993, SCG '93.

[214]  Lydia E. Kavraki,et al.  RAPID: randomized pharmacophore identification for drug design , 1997, SCG '97.

[215]  Micha Sharir,et al.  Ray Shooting Amidst Convex Polygons in 2D , 1996, J. Algorithms.

[216]  Micha Sharir,et al.  Motion Planning for a Convex Polygon in a Polygonal Environment , 1999, Discret. Comput. Geom..

[217]  Tony DeRose,et al.  Piecewise smooth surface reconstruction , 1994, SIGGRAPH.

[218]  Satish Rao,et al.  Approximation schemes for Euclidean k-medians and related problems , 1998, STOC '98.

[219]  Micha Sharir,et al.  Ray Shooting Amidst Spheres in Three Dimensions and Related Problems , 1997, SIAM J. Comput..

[220]  Frank Nielsen,et al.  On piercing sets of objects , 1996, SCG '96.

[221]  David R. Karger,et al.  Constant interaction-time scatter/gather browsing of very large document collections , 1993, SIGIR.

[222]  Noga Alon,et al.  Parallel linear programming in fixed dimension almost surely in constant time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[223]  George O. Wesolowsky,et al.  THE WEBER PROBLEM: HISTORY AND PERSPECTIVES. , 1993 .

[224]  Sanjeev Arora,et al.  Nearly linear time approximation schemes for Euclidean TSP and other geometric problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[225]  David Eppstein,et al.  Iterated nearest neighbors and finding minimal polytopes , 1993, SODA '93.

[226]  Samir Khuller,et al.  The Capacitated K-Center Problem , 2000, SIAM J. Discret. Math..

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

[228]  Alok Aggarwal,et al.  Applications of generalized matrix searching to geometric algorithms , 1990, Discret. Appl. Math..

[229]  Sivan Toledo.  Maximizing non-linear concave functions in fixed dimension , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[230]  Fazli Can,et al.  Incremental clustering for dynamic information processing , 1993, TOIS.

[231]  James A. Storer,et al.  A single-exponential upper bound for finding shortest paths in three dimensions , 1994, JACM.

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

[233]  David Eppstein.  Dynamic Three-Dimensional Linear Programming , 1992, INFORMS J. Comput..

[234]  Leonidas J. Guibas,et al.  A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications , 1991, Theor. Comput. Sci..

[235]  Richard Cole,et al.  On k-Hulls and Related Problems , 1987, SIAM J. Comput..

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

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

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

[239]  Jirí Matousek,et al.  Linear optimization queries , 1992, SCG '92.

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

[241]  Ming-Tat Ko,et al.  Linear Time Algorithms for the Weighted Tailored 2-Partition Problem and the Weighted 2-Center Problem under linfty-Distance , 1992, Discret. Appl. Math..

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

[243]  Judit Bar-Ilan,et al.  How to Allocate Network Centers , 1993, J. Algorithms.

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

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

[246]  A. Heppes.  Beweis einer Vermutung von A. Vázsonyi , 1956 .

[247]  Thomas Ertl,et al.  Computer Graphics - Principles and Practice, 3rd Edition , 2014 .

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

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

[250]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

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

[252]  Yiu-Tong Chan,et al.  A simple approach for the estimation of circular arc center and its radius , 1989, Comput. Vis. Graph. Image Process..

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

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

[255]  Sandeep Sen.  Parallel multidimensional search using approximation algorithms: with applications to linear-programming and related problems , 1996, SPAA '96.

[256]  M. Carter.  Computer graphics: Principles and practice , 1997 .

[257]  D. Warren,et al.  Improved Approximation Schemes for Geometrical Graphs Via Spanners and Banyans , 1998, STOC 1998.

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

[259]  Prosenjit Bose,et al.  Computing constrained minimum-width annuli of point sets , 1998, Comput. Aided Des..

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

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

[262]  Godfried T. Toussaint,et al.  Computing shortest transversals , 1991, Computing.

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

[264]  Subhash Suri,et al.  Finding tailored partitions , 1989, SCG '89.

[265]  Bernd Gärtner.  A Subexponential Algorithm for Abstract Optimization Problems , 1995, SIAM J. Comput..

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

[267]  Andrew Chi-Chih Yao,et al.  A general approach to d-dimensional geometric queries , 1985, STOC '85.

[268]  Nimrod Megiddo,et al.  A Deterministic Poly(log log N)-Time N-Processor Algorithm for Linear Programming in Fixed Dimensions , 1996, SIAM J. Comput..

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

[270]  Emo Welzl,et al.  Linear Programming - Randomization and Abstract Frameworks , 1996, STACS.

[271]  U. M. Landau,et al.  Estimation of a circular arc center and its radius , 1987, Comput. Vis. Graph. Image Process..

[272]  Subhash Suri,et al.  Efficient computation of Euclidean shortest paths in the plane , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[273]  David B. Shmoys,et al.  A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..

[274]  Z. Drezner.  Note-On a Modified One-Center Model , 1981 .

[275]  Zvi Drezner.  Conditional p-Center Problems , 1989, Transp. Sci..

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

[277]  Michael Goldwasser.  A survey of linear programming in randomized subexponential time , 1995, SIGA.

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

[279]  Alok Aggarwal,et al.  Notes on searching in multidimensional monotone arrays , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[280]  Nimrod Megiddo,et al.  Linear-Time Algorithms for Linear Programming in R^3 and Related Problems , 1982, FOCS.

[281]  Micha Sharir,et al.  Efficient randomized algorithms for some geometric optimization problems , 1996, Discret. Comput. Geom..

[282]  Edgar A. Ramos.  Construction of 1-d lower envelopes and applications , 1997, SCG '97.

[283]  David Eppstein,et al.  Dynamic three-dimensional linear programming , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[284]  Micha Sharir,et al.  Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications , 1999, SIAM J. Comput..

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

[286]  Nancy M. Amato,et al.  Parallel algorithms for higher-dimensional convex hulls , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

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

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

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

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

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