Computational Geometry—A Survey

We survey the state of the art of computational geometry, a discipline that deals with the complexity of geometric problems within the framework of the analysis of algorithms. This newly emerged area of activities has found numerous applications in various other disciplines, such as computer-aided design, computer graphics, operations research, pattern recognition, robotics, and statistics. Five major problem areas—convex hulls, intersections, searching, proximity, and combinatorial optimizations—are discussed. Seven algorithmic techniques—incremental construction, plane-sweep, locus, divide-and-conquer, geometric transformation, prune-and-search, and dynamization—are each illustrated with an example. A collection of problem transformations to establish lower bounds for geo-metric problems in the algebraic computation/decision model is also included.

[1]  Herbert Freeman,et al.  An Algorithm for the Solution of the Two-Dimensional "Hidden-Line" Problem , 1967, IEEE Trans. Electron. Comput..

[2]  Gordon A. Rose.  "Intergraphic, " A Microprogrammed Graphical-Interface Computer , 1967, IEEE Trans. Electron. Comput..

[3]  L. Bass,et al.  On finding a disc of minimum radius containing a given set of points , 1967 .

[4]  R. Galimberti,et al.  An algorithm for hidden line elimination , 1969, CACM.

[5]  Donald R. Chand,et al.  An Algorithm for Convex Polytopes , 1970, JACM.

[6]  Edward M. Reingold,et al.  On the Optimality of Some Set Algorithms , 1972, JACM.

[7]  Nathan Friedman,et al.  Some Results on the Effect of Arithmetics on Comparison Problems , 1972, SWAT.

[8]  Ronald L. Graham,et al.  An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1972, Inf. Process. Lett..

[9]  Michael O. Rabin,et al.  Proving Simultaneous Positivity of Linear Forms , 1972, J. Comput. Syst. Sci..

[10]  Ray A. Jarvis,et al.  On the Identification of the Convex Hull of a Finite Set of Points in the Plane , 1973, Inf. Process. Lett..

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

[12]  Robert F. Sproull,et al.  Principles in interactive computer graphics , 1973 .

[13]  Walter A. Burkhard,et al.  Some approaches to best-match file searching , 1973, Commun. ACM.

[14]  Richard Franklin Riesenfeld,et al.  Applications of b-spline approximation to geometric problems of computer-aided design. , 1973 .

[15]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[16]  Alfred V. Aho,et al.  Currents In The Theory Of Computing , 1973 .

[17]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[18]  Robert A. Schumacker,et al.  A Characterization of Ten Hidden-Surface Algorithms , 1974, CSUR.

[19]  J. Cavendish.  Automatic triangulation of arbitrary planar domains for the finite element method , 1974 .

[20]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[21]  A. R. Forrest,et al.  COMPUTATIONAL GEOMETRY - ACHIEVEMENTS AND PROBLEMS , 1974 .

[22]  H. T. Kung,et al.  On Finding the Maxima of a Set of Vectors , 1975, JACM.

[23]  Jon Louis Bentley,et al.  Analysis of Range Searches in Quad Trees , 1975, Inf. Process. Lett..

[24]  Herbert Freeman,et al.  Determining the minimum-area encasing rectangle for an arbitrary closed curve , 1975, CACM.

[25]  Andrew Chi-Chih Yao,et al.  On the complexity of comparison problems using linear functions , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[26]  Richard J. Lipton,et al.  On the Complexity of Computations under Varying Sets of Primitives , 1975, J. Comput. Syst. Sci..

[27]  Theodosios Pavlidis,et al.  Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition , 1975, IEEE Transactions on Computers.

[28]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[29]  Forest Baskett,et al.  An Algorithm for Finding Nearest Neighbors , 1975, IEEE Transactions on Computers.

[30]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[31]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[32]  Michael Ian Shamos,et al.  Geometric complexity , 1975, STOC.

[33]  Arnold Schönhage,et al.  Finding the Median , 1976, J. Comput. Syst. Sci..

[34]  M. Shamos.  Geometry and statistics: problems at the interface , 1976 .

[35]  Donald E. Knuth,et al.  Big Omicron and big Omega and big Theta , 1976, SIGA.

[36]  Michael Ian Shamos,et al.  Geometric intersection problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[37]  Richard J. Lipton,et al.  Multidimensional Searching Problems , 1976, SIAM J. Comput..

[38]  Robert E. Tarjan,et al.  Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

[39]  David P. Dobkin.  A Nonlinear Lower Bound on Linear Search Tree Programs for Solving Knapsack Problems , 1976, J. Comput. Syst. Sci..

[40]  Richard J. Lipton,et al.  A Lower Bound of ½n² on Linear Search Programs for the Knapsack Problem , 1976, MFCS.

[41]  Peter M. Will,et al.  Determining the Three-Dimensional Convex Hull of a Polyhedron , 1976, IBM J. Res. Dev..

[42]  Michael Ian Shamos,et al.  Divide-and-conquer in multidimensional space , 1976, STOC '76.

[43]  D. H. McLain,et al.  Two Dimensional Interpolation from Random Data , 1976, Comput. J..

[44]  D. T. Lee,et al.  Location of a point in a planar subdivision and its applications , 1976, STOC '76.

[45]  Ronald L. Graham,et al.  Some NP-complete geometric problems , 1976, STOC '76.

[46]  Franco P. Preparata,et al.  The Medial Axis of a Simple Polygon , 1977, MFCS.

[47]  Vijay V. Raghavan,et al.  A Note on a Multidimensional Searching Problem , 1977, Inf. Process. Lett..

[48]  Robert E. Tarjan,et al.  Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[49]  F. P. Preparata,et al.  Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.

[50]  C. Lawson.  Software for C1 Surface Interpolation , 1977 .

[51]  William F. Eddy,et al.  A New Convex Hull Algorithm for Planar Sets , 1977, TOMS.

[52]  Christos H. Papadimitriou,et al.  The Euclidean Traveling Salesman Problem is NP-Complete , 1977, Theor. Comput. Sci..

[53]  Henry S. Baird.  Fast algorithms for LSI artwork analysis , 1977, DAC '77.

[54]  Malcolm A. Sabin,et al.  Piecewise Quadratic Approximations on Triangles , 1977, TOMS.

[55]  Jon Louis Bentley,et al.  The Complexity of Finding Fixed-Radius Near Neighbors , 1977, Inf. Process. Lett..

[56]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[57]  DAVID DOBKIN,et al.  A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem , 1978, J. Comput. Syst. Sci..

[58]  Bruce W. Weide,et al.  On the complexity of computing the measure of ∪[ai,bi] , 1978, CACM.

[59]  David E. Muller,et al.  Finding the Intersection of two Convex Polyhedra , 1978, Theor. Comput. Sci..

[60]  Selim G. Akl,et al.  A Fast Convex Hull Algorithm , 1978, Inf. Process. Lett..

[61]  A. Bykat,et al.  Convex Hull of a Finite Set of Points in Two Dimensions , 1978, Inf. Process. Lett..

[62]  Der-Tsai Lee.  Proximity and reachability in the plane. , 1978 .

[63]  Dan E. Willard.  Predicate-Oriented Database Search Algorithms , 1978, Outstanding Dissertations in the Computer Sciences.

[64]  Michael Ian Shamos,et al.  Divide and Conquer for Linear Expected Time , 1978, Inf. Process. Lett..

[65]  Jon Louis Bentley,et al.  Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces , 1978, IEEE Transactions on Computers.

[66]  B. Fox,et al.  Construction of Voronoi Polyhedra , 1978 .

[67]  Kenneth R. Anderson,et al.  A Reevaluation of an Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set , 1978, Inf. Process. Lett..

[68]  Michael Ian Shamos,et al.  A Problem in Multivariate Statistics: Algorithm, Data Structure and Applications. , 1978 .

[69]  Franco P. Preparata,et al.  The Densest Hemisphere Problem , 1978, Theor. Comput. Sci..

[70]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[71]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[72]  D. T. Lee,et al.  The All Nearest-Neighbor Problem for Convex Polygons , 1978, Inf. Process. Lett..

[73]  Richard J. Lipton,et al.  Linear Programming is Log-Space Hard for P , 1979, Inf. Process. Lett..

[74]  Hermann A. Maurer,et al.  A Note on Euclidean Near Neighbor Searching in the Plane , 1979, Inf. Process. Lett..

[75]  Kevin Q. Brown,et al.  Voronoi Diagrams from Convex Hulls , 1979, Inf. Process. Lett..

[76]  Franco P. Preparata,et al.  An optimal real-time algorithm for planar convex hulls , 1979, CACM.

[77]  Dan E. Willard,et al.  New Data Structures for Orthogonal Queries. , 1979 .

[78]  Robin Fegeas,et al.  An algorithm for shading of regions on vector display devices , 1979, SIGGRAPH.

[79]  Jon Louis Bentley,et al.  Decomposable Searching Problems , 1979, Inf. Process. Lett..

[80]  John W. Boyse,et al.  Interference detection among solids and surfaces , 1979, CACM.

[81]  Selim G. Akl.  Two Remarks on a Convex Hull Algorithm , 1979, Inf. Process. Lett..

[82]  Peter Gilbert.  New Results on Planar Triangulations. , 1979 .

[83]  Richard J. Lipton,et al.  On the Complexity of Computations under Varying Sets of Primitives , 1975, J. Comput. Syst. Sci..

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

[85]  Jon Louis Bentley,et al.  Transforming static data structures to dynamic structures , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[86]  A. M. Andrew,et al.  Another Efficient Algorithm for Convex Hulls in Two Dimensions , 1979, Inf. Process. Lett..

[87]  D. T. Lee,et al.  A Note on the all Nearest-Neighbor Problem for Convex Polygons , 1979, Inf. Process. Lett..

[88]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[89]  Frank K. Hwang,et al.  An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees , 1979, JACM.

[90]  Selim G. Akl,et al.  EFFICIENT CONVEX HULL ALGORITHMS FOR PATTERN RECOGNITION APPLICATIONS. , 1979 .

[91]  David Avis,et al.  A Linear Algorithm for Finding the Convex Hull of a Simple Polygon , 1979, Inf. Process. Lett..

[92]  V. Klee.  On the complexity ofd- dimensional Voronoi diagrams , 1979 .

[93]  David G. Kirkpatrick,et al.  Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[94]  John E. Hopcroft,et al.  A Note on Rabin's Nearest-Neighbor Algorithm , 1978, Inf. Process. Lett..

[95]  Bernard Chazelle,et al.  Decomposing a polygon into its convex parts , 1979, STOC.

[96]  Jon Louis Bentley,et al.  Data Structures for Range Searching , 1979, CSUR.

[97]  David E. Muller,et al.  Finding the Intersection of n Half-Spaces in Time O(n log n) , 1979, Theor. Comput. Sci..

[98]  David P. Dobkin,et al.  On a general method for maximizing and minimizing among certain geometric problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[99]  S. L. HAKIMIt.  AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. , 1979 .

[100]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[101]  D. T. Lee,et al.  An Optimal Algorithm for Finding the Kernel of a Polygon , 1979, JACM.

[102]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[103]  Wesley E. Snyder,et al.  Finding the Extrema of a Region , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[104]  Chak-Kuen Wong,et al.  Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications , 1980, SIAM J. Comput..

[105]  Derick Wood,et al.  The rectangle intersection problem revisited , 1980, BIT.

[106]  Godfried T. Toussaint,et al.  PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .

[107]  Andrew Chi-Chih Yao,et al.  On the Polyhedral Decision Problem , 1980, SIAM J. Comput..

[108]  Bruce W. Weide,et al.  Optimal Expected-Time Algorithms for Closest Point Problems , 1980, TOMS.

[109]  David P. Dobkin,et al.  Efficient Uses of the Past , 1980, FOCS.

[110]  Chak-Kuen Wong,et al.  Quintary trees: a file structure for multidimensional datbase sytems , 1980, TODS.

[111]  D. Wood,et al.  Data structures for the rectangle containment and enclosure problems , 1980 .

[112]  Franco P. Preparata,et al.  Finding the Contour of a Union of Iso-Oriented Rectangles , 1980, J. Algorithms.

[113]  Jon Louis Bentley,et al.  Decomposable Searching Problems I: Static-to-Dynamic Transformation , 1980, J. Algorithms.

[114]  Hermann A. Maurer,et al.  Efficient worst-case data structures for range searching , 1978, Acta Informatica.

[115]  B. Boots.  Weighting Thiessen Polygons , 1980 .

[116]  Jan van Leeuwen,et al.  Dynamization of Decomposable Searching Problems , 1980, Inf. Process. Lett..

[117]  Narendra Ahuja,et al.  Interference Detection and Collision Avoidance Among Three Dimensional Objects , 1980, AAAI.

[118]  Peter van Emde Boas,et al.  On the Omega(n log n) Lower Bound for Convex Hull and Maximal Vector Determination , 1980, Inf. Process. Lett..

[119]  D. Titterington,et al.  Minimum Covering Ellipses , 1980 .

[120]  Derick Wood,et al.  An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles , 1980, IEEE Transactions on Computers.

[121]  B. Chazelle.  Computational geometry and convexity , 1980 .

[122]  G. Klincsek.  Minimal Triangulations of Polygonal Domains , 1980 .

[123]  Jon Louis Bentley,et al.  Multidimensional divide-and-conquer , 1980, CACM.

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

[125]  D. T. Lee,et al.  Two-Dimensional Voronoi Diagrams in the Lp-Metric , 1980, J. ACM.

[126]  KEVIN Q. BROWN.  Comments on “algorithms for reporting and counting geometric intersections” , 1981, IEEE Transactions on Computers.

[127]  Nesa L'abbe Wu,et al.  Linear programming and extensions , 1981 .

[128]  Jan van Leeuwen,et al.  Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[129]  Victor O. K. Li,et al.  Finding minimum rectilinear distance paths in the presence of barriers , 1981, Networks.

[130]  Godfried T. Toussaint,et al.  An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.

[131]  Jan van Leeuwen,et al.  Worst-Case Optimal Insertion and Deletion Methods for Decomposable Searching Problems , 1981, Inf. Process. Lett..

[132]  Godfried T. Toussaint,et al.  An Efficient Algorithm for Decomposing a Polygon into Star-Shaped Polygons , 1981 .

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

[134]  Jan van Leeuwen,et al.  Some Principles for Dynamizing Decomposable Searching Problems , 1981, Inf. Process. Lett..

[135]  Franco P. Preparata,et al.  A New Approach to Planar Point Location , 1981, SIAM J. Comput..

[136]  D. T. Lee,et al.  Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..

[137]  Christos H. Papadimitriou,et al.  A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems , 1981, J. Algorithms.

[138]  Jan van Leeuwen,et al.  The Measure Problem for Rectangular Ranges in d-Space , 1981, J. Algorithms.

[139]  R. Seidel.  A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions , 1981 .

[140]  Michael L. Fredman,et al.  A Lower Bound on the Complexity of Orthogonal Range Queries , 1981, JACM.

[141]  Azad Bolour.  Optimal Retrieval Algorithms for Small Region Queries , 1981, SIAM J. Comput..

[142]  Jan van Leeuwen,et al.  The Art of Dynamizing , 1981, MFCS.

[143]  Franco P. Preparata,et al.  Segments, Rectangles, Contours , 1981, J. Algorithms.

[144]  Mark H. Overmars,et al.  Dynamization of Order Decomposable Set Problems , 1981, J. Algorithms.

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

[146]  Olli Nevalainen,et al.  Finding minimal spanning trees in a euclidean coordinate space , 1981, BIT.

[147]  David Avis,et al.  A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

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

[149]  Herbert Edelsbrunner,et al.  On the Intersection of Orthogonal Objects , 1981, Inf. Process. Lett..

[150]  Chak-Kuen Wong,et al.  Finding Intersection of Rectangles by Range Search , 1981, J. Algorithms.

[151]  Jacob T. Schwartz,et al.  Finding the Minimum Distance Between Two Convex Polygons , 1981, Information Processing Letters.

[152]  Jan van Leeuwen,et al.  Dynamization of Decomposable Searching Problems Yielding Good Worsts-Case Bounds , 1981, Theoretical Computer Science.

[153]  Martin Tompa.  An Optimal Solution to a Wire-Routing Problem , 1981, J. Comput. Syst. Sci..

[154]  Herbert Edelsbrunner,et al.  A Space-Optimal Solution of General Region Location , 1981, Theor. Comput. Sci..

[155]  Adrian Bowyer,et al.  Computing Dirichlet Tessellations , 1981, Comput. J..

[156]  Mark J. Post,et al.  A minimum spanning ellipse algorithm , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[157]  D. T. Lee,et al.  Shading of regions on vector display devises , 1981, SIGGRAPH '81.

[158]  Andrew Chi-Chih Yao,et al.  A Lower Bound to Finding Convex Hulls , 1981, JACM.

[159]  Kurt Mehlhorn,et al.  Optimal Dynamization of Decomposable Searching Problems , 1981, Inf. Process. Lett..

[160]  D. F. Watson.  Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[161]  David P. Dobkin,et al.  Optimal Time Minimal Space Selection Algorithms , 1981, JACM.

[162]  Udi Manber,et al.  Probabilistic, Nondeterministic, and Alternating Decision Trees , 1982, STOC 1982.

[163]  Dan E. Willard,et al.  Polygon Retrieval , 1982, SIAM journal on computing (Print).

[164]  Franco P. Preparata,et al.  Approximation algorithms for convex hulls , 1982, CACM.

[165]  Godfried T. Toussaint,et al.  On a convex hull algorithm for polygons and its application to triangulation problems , 1982, Pattern Recognit..

[166]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[167]  D. T. Lee,et al.  Medial Axis Transformation of a Planar Shape , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

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

[169]  D. T. Lee,et al.  An Improved Algorithm for the Rectangle Enclosure Problem , 1982, J. Algorithms.

[170]  Andrzej Lingas,et al.  The Power of Non-Rectilinear Holes , 1982, ICALP.

[171]  Leonidas J. Guibas,et al.  Finding extremal polygons , 1982, STOC '82.

[172]  D. T. Lee,et al.  On k-Nearest Neighbor Voronoi Diagrams in the Plane , 1982, IEEE Transactions on Computers.

[173]  Joseph O'Rourke,et al.  A new linear algorithm for intersecting convex polygons , 1982, Comput. Graph. Image Process..

[174]  Hiroshi Imai.  Finding Connected Components of an Intersection Graph of Squares in the Euclidean Plane , 1982, Inf. Process. Lett..

[175]  George S. Lueker,et al.  A Data Structure for Dynamic Range Queries , 1982, Inf. Process. Lett..

[176]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[177]  Henryk Wozniakowski,et al.  Complexity of linear programming , 1982, Oper. Res. Lett..

[178]  Mark H. Overmars,et al.  On the Equivalence of Some Rectangle Problems , 1982, Inf. Process. Lett..

[179]  JOSEPH O’ROURKE,et al.  A new linear algorithm for intersecting convex polygons , 1982, Comput. Graph. Image Process..

[180]  J. Michael Steele,et al.  Lower Bounds for Algebraic Decision Trees , 1982, J. Algorithms.

[181]  Godfried T. Toussaint,et al.  Computational Geometric Problems in Pattern Recognition , 1982 .

[182]  Jack Sklansky,et al.  Finding the convex hull of a simple polygon , 1982, Pattern Recognit. Lett..

[183]  Vijay K. Vaishnavi,et al.  Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization , 1982, J. Algorithms.

[184]  Franco P. Preparata,et al.  Plane-sweep algorithms for intersecting geometric figures , 1982, CACM.

[185]  Arnold L. Rosenberg,et al.  Stabbing line segments , 1982, BIT.

[186]  David G. Kirkpatrick,et al.  Polygonal Intersection Searching , 1982, Inf. Process. Lett..

[187]  Derick Wood,et al.  Counting and Reporting Intersections of d-Ranges , 1982, IEEE Transactions on Computers.

[188]  David R. Smith,et al.  A Hidden-Line Algorithm for Hyperspace , 1982, SIAM J. Comput..

[189]  Vijay K. Vaishnavi,et al.  Computing Point Enclosures , 1982, IEEE Transactions on Computers.

[190]  Ralf Hartmut Güting,et al.  Stabbing C-Oriented Polygons , 1983, Inf. Process. Lett..

[191]  Mark H. Overmars,et al.  The Locus Approach , 1983, International Workshop on Graph-Theoretic Concepts in Computer Science.

[192]  Jyrki Katajainen.  On the worst case of a minimal spanning tree algorithm for euclidean space , 1983, BIT Comput. Sci. Sect..

[193]  Gaston H. Gonnet,et al.  Direct dynamic structures for some line segment problems , 1983, Comput. Vis. Graph. Image Process..

[194]  Chr. Gram,et al.  A simple algorithm for building the 3-D convex hull , 1983, BIT Comput. Sci. Sect..

[195]  Witold Lipski,et al.  Finding a manhattan path and related problems , 1983, Networks.

[196]  Michael Ben-Or,et al.  Lower bounds for algebraic computation trees , 1983, STOC.

[197]  N. Megiddo,et al.  The Maximum Coverage Location Problem , 1983 .

[198]  Francis Y. L. Chin,et al.  Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons , 1983, IEEE Transactions on Computers.

[199]  Bernard Chazelle,et al.  A Decision Procedure for Optimal Polyhedron Partitioning , 1983, Inf. Process. Lett..

[200]  Leonidas J. Guibas,et al.  The power of geometric duality , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[201]  F. Frances Yao,et al.  A 3-space partition and its applications , 1983, STOC.

[202]  Joseph O'Rourke,et al.  Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.

[203]  I. G. Gowda,et al.  Dynamic Voronoi diagrams , 1983, IEEE Trans. Inf. Theory.

[204]  Bernard Chazelle.  OPTIMAL ALGORITHMS FOR COMPUTING DEPTHS AND LAYERS. , 1983 .

[205]  Bernard Chazelle.  An Improved Algorithm for the Fixed-Radius Neighbor Problem , 1983, Inf. Process. Lett..

[206]  Kenneth L. Clarkson,et al.  Fast algorithms for the all nearest neighbors problem , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[207]  David G. Kirkpatrick,et al.  Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..

[208]  H. Edelsbrunner.  A new approach to rectangle intersections part I , 1983 .

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

[210]  G. Toussaint.  Solving geometric problems with the rotating calipers , 1983 .

[211]  Bernard Chazelle.  How to Search in History , 1983, FCT.

[212]  Godfried T. Toussaint,et al.  Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets , 1983, J. Algorithms.

[213]  David Avis,et al.  A survey of heuristics for the weighted matching problem , 1983, Networks.

[214]  Bernard Chazelle,et al.  Filtering search: A new approach to query-answering , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[215]  Leonidas J. Guibas,et al.  On Computing All North-East Nearest Neighbors in the L1 Metric , 1983, Inf. Process. Lett..

[216]  Bernard Chazelle.  Filtering Search: A New Approach to Query-Answering , 1983, FOCS.

[217]  R.M. McElhaney,et al.  Algorithms for graphics and image processing , 1983, Proceedings of the IEEE.

[218]  Mikhail J. Atallah,et al.  A Linear Time Algorithm for the Hausdorff Distance Between Convex Polygons , 1983, Inf. Process. Lett..

[219]  Richard Cole,et al.  Geometric retrieval problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[220]  Mikhail J. Atallah,et al.  Dynamic computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[221]  F. Frances Yao,et al.  Finding the Convex Hull of a Simple Polygon , 1983, J. Algorithms.

[222]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[223]  D. T. Lee,et al.  Visibility of a simple polygon , 1983, Comput. Vis. Graph. Image Process..

[224]  Adam Józwik.  A recursive method for the investigation of the linear separability of two sets , 1983, Pattern Recognit..

[225]  J. Kahn,et al.  Traditional Galleries Require Fewer Watchmen , 1983 .

[226]  Iraj Kalantari,et al.  A Data Structure and an Algorithm for the Nearest Point Problem , 1983, IEEE Transactions on Software Engineering.

[227]  Takao Asano,et al.  Minimum partition of polygonal regions into trapezoids , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[228]  Raimund Seidel,et al.  Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[229]  Takao Asano,et al.  Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane , 1983, J. Algorithms.

[230]  Der-Tsai Lee,et al.  Maximum Clique Problem of Rectangle Graphs , 1983 .

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

[232]  Derick Wood,et al.  Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles , 1984, J. Algorithms.

[233]  D. T. Lee,et al.  Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

[234]  Fabrizio Luccio,et al.  A Visibility Problem in VLSI Layout Compaction , 1984 .

[235]  Robert E. Tarjan,et al.  Scaling and related techniques for geometry problems , 1984, STOC '84.

[236]  Intersecting is easier than sorting , 1984, STOC '84.

[237]  Micha Sharir,et al.  On shortest paths in polyhedral spaces , 1986, STOC '84.

[238]  Hossam A. ElGindy,et al.  A new linear convex hull algorithm for simple polygons , 1984, IEEE Trans. Inf. Theory.

[239]  Franz Aurenhammer,et al.  An optimal algorithm for constructing the weighted voronoi diagram in the plane , 1984, Pattern Recognit..

[240]  Bernard Chazelle,et al.  Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm , 1984, SIAM J. Comput..

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

[242]  K. Mehlhorn,et al.  Space sweep solves intersection of two convex polyhedra elegantly , 1984 .

[243]  Raimund Seidel,et al.  Some methods of computational geometry applied to computer graphics , 1984, Comput. Vis. Graph. Image Process..

[244]  B. Chazelle.  Intersecting Is Easier than Sorting , 1984, STOC.

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

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

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

[248]  Bernard Chazelle,et al.  Computing the Largest Empty Rectangle , 1984, SIAM J. Comput..

[249]  D. T. Lee,et al.  On the maximum empty rectangle problem , 1984, Discret. Appl. Math..

[250]  Francis Y. L. Chin,et al.  Minimum Vertex Distance Between Separable Convex Polygons , 1984, Inf. Process. Lett..

[251]  George S. Lueker,et al.  Adding range restriction capability to dynamic data structures , 1985, JACM.

[252]  Bernard Chazelle,et al.  How to Search in History , 1983, Inf. Control..

[253]  M. Iri,et al.  Practical use of Bucketing Techniques in Computational Geometry , 1985 .

[254]  J. Sack,et al.  Minimum Decompositions of Polygonal Objects , 1985 .

[255]  Godfried T. Toussaint,et al.  A historical note on convex hull finding algorithms , 1985, Pattern Recognit. Lett..

[256]  Mark H. Overmars,et al.  Range searching in a set of line segments , 1985, SCG '85.

[257]  J. Mark Keil,et al.  Decomposing a Polygon into Simpler Components , 1985, SIAM J. Comput..

[258]  D. T. Lee,et al.  Display of Visible Edges of a Set of Convex Polygons , 1985 .

[259]  Dan E. Willard,et al.  New Data Structures for Orthogonal Range Queries , 1985, SIAM J. Comput..

[260]  Bernard Chazelle,et al.  Optimal Solutions for a Class of Point Retrieval Problems , 1985, ICALP.

[261]  Mark H. Overmars,et al.  Batched Dynamic Solutions to Decomposable Searching Problems , 1985, J. Algorithms.

[262]  Hiroshi Imai,et al.  Voronoi Diagram in the Laguerre Geometry and its Applications , 1985, SIAM J. Comput..

[263]  D. Avis,et al.  Simple On-Line Algorithms for Convex Polygons , 1985 .

[264]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

[265]  Victor Klee,et al.  Finding the Smallest Triangles Containing a Given Convex Polygon , 1985, J. Algorithms.

[266]  Leonidas J. Guibas,et al.  Fractional Cascading: A Data Structuring Technique with Geometric Applications , 1985, ICALP.

[267]  David G. Kirkpatrick,et al.  A Linear Algorithm for Determining the Separation of Convex Polyhedra , 1985, J. Algorithms.

[268]  Godfried T. Toussaint,et al.  On the ultimate convex hull algorithm in practice , 1985, Pattern Recognit. Lett..

[269]  Bernard Chazelle,et al.  Fast Searching in a Real Algebraic Manifold with Applications to Geometric Complexity , 1985, TAPSOFT, Vol.1.

[270]  G. Toussaint,et al.  Finding the minimum vertex distance between two disjoint convex polygons in linear time , 1985 .

[271]  David G. Kirkpatrick,et al.  The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..

[272]  Leonidas J. Guibas,et al.  Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..

[273]  Herbert Edelsbrunner,et al.  Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time , 1986, Inf. Process. Lett..

[274]  Takao Asano,et al.  Efficient Algorithms for Geometric Graph Search Problems , 1986, SIAM J. Comput..

[275]  Takao Asano,et al.  Partitioning a polygonal region into trapezoids , 1986, JACM.

[276]  J. Davenport.  A "Piano Movers" Problem. , 1986 .

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

[278]  Alok Aggarwal,et al.  An Optimal Algorithm for Finding Minimal Enclosing Triangles , 1986, J. Algorithms.

[279]  Ron Y. Pinter,et al.  Polygon Triangulation: Efficiency and Minimality , 1986, J. Algorithms.

[280]  D. T. Lee,et al.  Computing the visibility polygon from an edge , 1986, Comput. Vis. Graph. Image Process..

[281]  IEEE Transactions on Computers , Computing in Science & Engineering.