Computational geometry: a retrospective
暂无分享,去创建一个
[1] Micha Sharir,et al. Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes , 1986, FOCS.
[2] Leonidas J. Guibas,et al. Computing a face in an arrangement of line segments , 1991, SODA '91.
[3] Michael T. Goodrich,et al. Planar separators and parallel polygon triangulation (preliminary version) , 1992, STOC '92.
[4] Bruce Randall Donald,et al. A Geometric Approach to Error Detection and Recovery for Robot Motion Planning with Uncertainty , 1987, Artif. Intell..
[5] Subhash Suri,et al. A pedestrian approach to ray shooting: shoot a ray, take a walk , 1993, SODA '93.
[6] Michael T. Goodrich,et al. Dynamic ray shooting and shortest paths via balanced geodesic triangulations , 1993, SCG '93.
[7] Marshall W. Bern,et al. Compatible tetrahedralizations , 1993, SCG '93.
[8] Kurt Mehlhorn,et al. Constructive Whitney-Graustein Theorem: Or How to Untangle Closed Planar Curves , 1991, SIAM J. Comput..
[9] M. Iri,et al. Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic , 1992, Proc. IEEE.
[10] R. Seidel. A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions , 1981 .
[11] Leonidas J. Guibas,et al. A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications , 1991, Theor. Comput. Sci..
[12] Micha Sharir,et al. On the zone of a surface in a hyperplane arrangement , 1993, Discret. Comput. Geom..
[13] John F. Canny. Improved Algorithms for Sign Determination and Existential Quantifier Elimination , 1993, Comput. J..
[14] H. Whitney. Elementary Structure of Real Algebraic Varieties , 1957 .
[15] K. Mulmuley. A fast planar partition algorithm: Part I , 1988 .
[16] Richard Cole,et al. On k-Hulls and Related Problems , 1987, SIAM J. Comput..
[17] Ketan Mulmuley,et al. A fast planar partition algorithm. I , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[18] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.
[19] D. Grigor'ev. Complexity of deciding Tarski algebra , 1988 .
[20] Kenneth L. Clarkson,et al. RANDOMIZED GEOMETRIC ALGORITHMS , 1992 .
[21] Micha Sharir,et al. Triangles in space or building (and analyzing) castles in the air , 1990, Comb..
[22] Micha Sharir,et al. A Combinatorial Bound for Linear Programming and Related Problems , 1992, STACS.
[23] George E. Collins,et al. Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.
[24] Endre Szemerédi,et al. An Optimal-Time Algorithm for Slope Selection , 1989, SIAM J. Comput..
[25] József Beck,et al. An Algorithmic Approach to the Lovász Local Lemma. I , 1991, Random Struct. Algorithms.
[26] Herbert Edelsbrunner,et al. Triangulating topological spaces , 1994, SCG '94.
[27] Leonidas J. Guibas,et al. Parallel computational geometry , 1988, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[28] Richard Cole,et al. Slowing down sorting networks to obtain faster sorting algorithms , 2015, JACM.
[29] James Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals , 1992, J. Symb. Comput..
[30] Kurt Mehlhorn,et al. Intersecting two polyhedra one of which is convex , 1985, FCT.
[31] Leonidas J. Guibas,et al. Diameter, width, closest line pair, and parametric searching , 1992, SCG '92.
[32] Ketan Mulmuley. Randomized geometric algorithms and pseudo-random generators , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[33] R. Pollack,et al. Geometric Transversal Theory , 1993 .
[34] Richard Cole,et al. Visibility Problems for Polyhedral Terrains , 2018, J. Symb. Comput..
[35] Boris Aronov,et al. Counting facets and incidences , 1992, Discret. Comput. Geom..
[36] Bernard Chazelle. Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..
[37] Nimrod Megiddo,et al. A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension , 1992, STOC '92.
[38] David G. Kirkpatrick,et al. Polygon triangulation inO(n log logn) time with simple data structures , 1992, Discret. Comput. Geom..
[39] Bernard Chazelle,et al. On linear-time deterministic algorithms for optimization problems in fixed dimension , 1996, SODA '93.
[40] Kenneth L. Clarkson,et al. Safe and effective determinant evaluation , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[41] Michael T. Goodrich,et al. Dynamic trees and dynamic point location , 1991, STOC '91.
[42] Bernard Chazelle,et al. A deterministic view of random sampling and its use in geometry , 1990, Comb..
[43] Ketan Mulmuley,et al. Computational geometry : an introduction through randomized algorithms , 1993 .
[44] Jirí Matousek,et al. Efficient partition trees , 1991, SCG '91.
[45] John H. Reif,et al. The complexity of elementary algebra and geometry , 1984, STOC '84.
[46] Haijo Schipper,et al. Determining contractibility of curves , 1992, SCG '92.
[47] Christoph M. Hoffmann,et al. Geometric and Solid Modeling , 1989 .
[48] Gert Vegter. Kink-free deformations of polygons , 1989, SCG '89.
[49] Jirí Matousek. Linear Optimization Queries , 1993, J. Algorithms.
[50] Micha Sharir,et al. Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences , 2015, J. Comb. Theory, Ser. A.
[51] Franz Aurenhammer,et al. Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.
[52] Robert E. Tarjan,et al. Planar point location using persistent search trees , 1986, CACM.
[53] Ketan Mulmuley,et al. On levels in arrangements and voronoi diagrams , 1991, Discret. Comput. Geom..
[54] B. M. Fulk. MATH , 1992 .
[55] Ketan Mulmuley. On obstructions in relation to a fixed viewpoint , 1989, 30th Annual Symposium on Foundations of Computer Science.
[56] Endre Szemerédi,et al. An upper bound on the number of planarK-sets , 1992, Discret. Comput. Geom..
[57] Ketan Mulmuley,et al. Randomized Multidimensional Search Trees: Dynamic Sampling (Extended Abstract) , 1991, SCG.
[58] B. Chazelle. Lower bounds on the complexity of polytope range searching , 1989 .
[59] Herbert Edelsbrunner,et al. An incremental algorithm for Betti numbers of simplicial complexes , 1993, SCG '93.
[60] Dima Grigoriev,et al. Solving Systems of Polynomial Inequalities in Subexponential Time , 1988, J. Symb. Comput..
[61] Kenneth L. Clarkson,et al. Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.
[62] Herbert Edelsbrunner,et al. The union of balls and its dual shape , 1993, SCG '93.
[63] David E. Muller,et al. Finding the Intersection of two Convex Polyhedra , 1978, Theor. Comput. Sci..
[64] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[65] Chandrajit L. Bajaj,et al. Convex Decomposition of Polyhedra and Robustness , 1992, SIAM J. Comput..
[66] David Eppstein,et al. MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .
[67] J. Renegar,et al. On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .
[68] László Lovász,et al. Linear decision trees: volume estimates and topological bounds , 1992, STOC '92.
[69] Bernard Chazelle,et al. An optimal convex hull algorithm in any fixed dimension , 1993, Discret. Comput. Geom..
[70] Kokichi Sugihara,et al. A solid modelling system free from topological inconsistency , 1990 .
[71] Kurt Mehlhorn,et al. Four Results on Randomized Incremental Constructions , 1992, Comput. Geom..
[72] Micha Sharir,et al. New bounds for lower envelopes in three dimensions, with applications to visibility in terrains , 1993, SCG '93.
[73] Raimund Seidel,et al. Constructing higher-dimensional convex hulls at logarithmic cost per face , 1986, STOC '86.
[74] John E. Hopcroft,et al. Robust set operations on polyhedral solids , 1987, IEEE Computer Graphics and Applications.
[75] Bruce Randall Donald,et al. On the complexity of kinodynamic planning , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[76] David G. Kirkpatrick,et al. The Ultimate Planar Convex Hull Algorithm? , 1986, SIAM J. Comput..
[77] Steven Fortune,et al. Numerical stability of algorithms for 2D Delaunay triangulations , 1992, SCG '92.
[78] D. Huttenlocher. Three-Dimensional Recognition of Solid Objects from a Two- Dimensional Image , 1988 .
[79] SeidelRaimund,et al. Four results on randomized incremental constructions , 1993 .
[80] Leonidas J. Guibas,et al. Ray Shooting in Polygons Using Geodesic Triangulations , 1991, ICALP.
[81] Leonidas J. Guibas,et al. The complexity of many cells in arrangements of planes and related problems , 1990, Discret. Comput. Geom..
[82] Micha Sharir,et al. Optimal Slope Selection Via Expanders , 1993, CCCG.
[83] Leonidas J. Guibas,et al. The complexity and construction of many faces in arrangements of lines and of segments , 1990, Discret. Comput. Geom..
[84] Joseph O'Rourke,et al. Computational Geometry in C. , 1995 .
[85] Martin E. Dyer,et al. A class of convex programs with applications to computational geometry , 1992, SCG '92.
[86] B. Chazelle,et al. Optimal Convex Decompositions , 1985 .
[87] Ketan Mulmuley. Randomized multidimensional search trees: further results in dynamic sampling , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[88] Michael L. Fredman,et al. A Lower Bound on the Complexity of Orthogonal Range Queries , 1981, JACM.
[89] David G. Kirkpatrick,et al. Polygon triangulation in O(n log log n) time with simple data-structures , 1990, SCG '90.
[90] Pravin M. Vaidya. Space-Time Trade-Offs for Orthogonal Range Queries , 1989, SIAM J. Comput..
[91] Noga Alon,et al. Point Selections and Weak ε-Nets for Convex Hulls , 1992, Combinatorics, Probability and Computing.
[92] Jirí Matousek. Construction of ɛ-nets , 1990, Discret. Comput. Geom..
[93] Moni Naor,et al. The Probabilistic Method Yields Deterministic Parallel Algorithms , 1994, J. Comput. Syst. Sci..
[94] Ketan Mulmuley. Randomized multidimensional search trees: lazy balancing and dynamic shuffling , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[95] B.R. Donald,et al. On the complexity of computing the homology type of a triangulation , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[96] Michael F. Cohen,et al. Radiosity and realistic image synthesis , 1993 .
[97] Henry Crapo,et al. Scene analysis and geometric homology , 1986, SCG '86.
[98] R. Pollack,et al. On the number of cells defined by a set of polynomials , 1993 .
[99] János Pach,et al. Combinatorial Geometry , 2012 .
[100] Kurt Mehlhorn,et al. Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry , 2012, EATCS Monographs on Theoretical Computer Science.
[101] Andrew Chi-Chih Yao,et al. A general approach to d-dimensional geometric queries , 1985, STOC '85.
[102] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[103] John Canny,et al. The complexity of robot motion planning , 1988 .
[104] Chee-Keng Yap,et al. Computational complexity of combinatorial surfaces , 1990, SCG '90.
[105] Richard Cole,et al. On k-hulls and related problems , 1984, STOC '84.
[106] Leonidas J. Guibas,et al. Visibility and intersection problems in plane geometry , 1989, Discret. Comput. Geom..
[107] Leonidas J. Guibas,et al. Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..
[108] Scott A. Mitchell,et al. Quality mesh generation in three dimensions , 1992, SCG '92.
[109] Raimund Seidel,et al. On the difficulty of triangulating three-dimensional Nonconvex Polyhedra , 1992, Discret. Comput. Geom..
[110] Bernard Chazelle,et al. An Algorithm for Generalized Point Location and its Applications , 1990, J. Symb. Comput..
[111] Olivier Devillers,et al. Fully Dynamic Delaunay Triangulation in Logarithmic Expected Time Per Operation , 1992, Comput. Geom..
[112] Micha Sharir,et al. On the sum of squares of cell complexities in hyperplane arrangements , 1991, SCG '91.
[113] Michael T. Goodrich,et al. Planar Separators and Parallel Polygon Triangulation , 1995, J. Comput. Syst. Sci..
[114] Nimrod Megiddo,et al. Linear Programming in Linear Time When the Dimension Is Fixed , 1984, JACM.
[115] Jirí Matousek,et al. Discrepancy and approximations for bounded VC-dimension , 1993, Comb..
[116] Dan E. Willard,et al. Polygon Retrieval , 1982, SIAM journal on computing (Print).
[117] Chee Yap. Symbolic treatment of geometric degeneracies: Proceedings of the International IFIPS Conference on System Modeling and Optimization. Tokyo, 1987 , 1987 .
[118] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[119] Zhenyu Li,et al. Constructing strongly convex hulls using exact or rounded arithmetic , 1990, SCG '90.
[120] Andrew Chi-Chih Yao. Lower bounds for algebraic computation trees with integer inputs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[121] David G. Kirkpatrick,et al. Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..
[122] Jirí Matousek,et al. Reporting Points in Halfspaces , 1992, Comput. Geom..
[123] David Eppstein,et al. Triangulating polygons without large angles , 1995, Int. J. Comput. Geom. Appl..
[124] Michael L. Fredman,et al. Lower Bounds on the Complexity of Some Optimal Data Structures , 1981, SIAM J. Comput..
[125] Micha Sharir,et al. Castles in the air revisited , 1992, SCG '92.
[126] Chee-Keng Yap. Geometric Consistency Theorem for a Symbolic Perturbation Scheme , 1990, J. Comput. Syst. Sci..
[127] Christopher J. Van Wyk,et al. Efficient exact arithmetic for computational geometry , 1993, SCG '93.
[128] Tamal K. Dey,et al. Triangulation and CSG representation of polyhedra with arbitrary genus , 1991, SCG '91.
[129] Roberto Tamassia,et al. Fully dynamic techniques for point location and transitive closure in planar structures , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[130] Micha Sharir,et al. On the Zone Theorem for Hyperplane Arrangements , 1991, SIAM J. Comput..
[131] Rolf Klein,et al. Abstract Voronoi Diagrams and their Applications , 1988, Workshop on Computational Geometry.
[132] Kenneth L. Clarkson,et al. New applications of random sampling in computational geometry , 1987, Discret. Comput. Geom..
[133] Bernard Chazelle,et al. An optimal algorithm for intersecting three-dimensional convex polyhedra , 1989, 30th Annual Symposium on Foundations of Computer Science.
[134] David Eppstein,et al. Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[135] John E. Hopcroft,et al. Towards implementing robust geometric computations , 1988, SCG '88.
[136] John Mylopoulos,et al. Some Results in Computational Topology , 1973, JACM.
[137] Raimund Seidel,et al. Small-dimensional linear programming and convex hulls made easy , 1991, Discret. Comput. Geom..
[138] Edith Cohen,et al. Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs , 1989, STOC '89.
[139] V. Milenkovic. Rounding Face Lattices in D Dimensions , 1990 .
[140] Gil Kalai,et al. A subexponential randomized simplex algorithm (extended abstract) , 1992, STOC '92.
[141] Bernard Chazelle,et al. Lower bounds for orthogonal range searching: part II. The arithmetic model , 1990, JACM.
[142] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[143] J. Schwartz,et al. On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .
[144] Bernard Chazelle,et al. Cutting hyperplanes for divide-and-conquer , 1993, Discret. Comput. Geom..
[145] Moni Naor,et al. Small-bias probability spaces: efficient constructions and applications , 1990, STOC '90.
[146] F. P. Preparata,et al. Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.
[147] Leonidas J. Guibas,et al. Lines in space - combinatorics, algorithms and applications , 1989, Symposium on the Theory of Computing.
[148] Raimund Seidel,et al. A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons , 1991, Comput. Geom..
[149] Bruce Randall Donald,et al. A rational rotation method for robust geometric algorithms , 1991, SCG '92.
[150] Emo Welzl,et al. Partition trees for triangle counting and other range searching problems , 1988, SCG '88.
[151] F. Frances Yao,et al. Finite-resolution computational geometry , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[152] Kenneth L. Clarkson,et al. Applications of random sampling in computational geometry, II , 1988, SCG '88.
[153] R. Pollack,et al. The intrinsic spread of a configuration in , 1990 .
[154] Bonnie Berger,et al. Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry , 1994, J. Comput. Syst. Sci..
[155] Bruce Randall Donald,et al. Kinodynamic motion planning , 1993, JACM.
[156] Richard Cole,et al. Searching and Storing Similar Lists , 2018, J. Algorithms.
[157] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.
[158] Franz Aurenhammer,et al. Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..
[159] Leonidas J. Guibas,et al. Implicitly representing arrangements of lines or segments , 2011, SCG '88.
[160] David P. Dobkin,et al. Recipes for geometry and numerical analysis - Part I: an empirical study , 1988, SCG '88.
[161] Ketan Mulmuley,et al. A fast planar partition algorithm, II , 1991, SCG '89.
[162] Richard Pollack,et al. Upper bounds for configurations and polytopes inRd , 1986, Discret. Comput. Geom..
[163] David Haussler,et al. ɛ-nets and simplex range queries , 1987, Discret. Comput. Geom..
[164] Kenneth L. Clarkson,et al. A Randomized Algorithm for Closest-Point Queries , 1988, SIAM J. Comput..
[165] Micha Sharir,et al. Applications of a new space-partitioning technique , 1993, Discret. Comput. Geom..
[166] Andrew Chi-Chih Yao,et al. A Lower Bound to Finding Convex Hulls , 1981, JACM.
[167] Bud Mishra,et al. Algorithmic Algebra , 1993, Texts and Monographs in Computer Science.
[168] Prabhakar Raghavan,et al. Probabilistic construction of deterministic algorithms: Approximating packing integer programs , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[169] Bernard Chazelle,et al. Derandomizing an Output-sensitive Convex Hull Algorithm in Three Dimensions , 1995, Comput. Geom..
[170] Jirí Matousek,et al. A deterministic algorithm for the three-dimensional diameter problem , 1993, STOC '93.
[171] Tomás Recio,et al. Algorithms in Real Algebraic Geometry and Applications to Computational Geometry , 1990, Discrete and Computational Geometry.
[172] Leonidas J. Guibas,et al. Improved Bounds on Weak epsilon-Nets for Convex Sets , 1995, Discrete & Computational Geometry.
[173] Bernard Chazelle,et al. How hard is halfspace range searching? , 1992, SCG '92.
[174] Jirí Matousek. Cutting hyperplane arrangements , 1991, Discret. Comput. Geom..
[175] Bernard Chazelle,et al. Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm , 1984, SIAM J. Comput..
[176] Sivan Toledo,et al. Applications of parametric searching in geometric optimization , 1992, SODA '92.
[177] Esther M. Arkin,et al. An efficiently computable metric for comparing polygonal shapes , 1991, SODA '90.
[178] Joos Heintz,et al. Sur la complexité du principe de Tarski-Seidenberg , 1989 .
[179] Chee-Keng Yap,et al. A geometric consistency theorem for a symbolic perturbation scheme , 1988, SCG '88.
[180] John F. Canny,et al. A general approach to removing degeneracies , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[181] James Renegar. On the computational complexity and geome-try of the first-order theory of the reals , 1992 .
[182] Mariette Yvinec,et al. Applications of random sampling to on-line algorithms in computational geometry , 1992, Discret. Comput. Geom..
[183] Bernard Chazelle,et al. Triangulating a non-convex polytype , 1989, SCG '89.
[184] Bernard Chazelle. Filtering Search: A New Approach to Query-Answering , 1983, FOCS.
[185] Christoph M. Hoffmann,et al. Geometric and Solid Modeling: An Introduction , 1989 .
[186] Emo Welzl,et al. On Spanning Trees with Low Crossing Numbers , 1992, Data Structures and Efficient Algorithms.
[187] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.
[188] Éva Tardos,et al. Using separation algorithms in fixed dimension , 1990, SODA '90.
[189] Roberto Tamassia,et al. Efficient Point Location in a Convex Spatial Cell-Complex , 1989, SIAM J. Comput..
[190] Bernard Chazelle,et al. Lower Bounds on the Complexity of Simplex Range Reporting on a Pointer Machine , 1992, ICALP.
[191] David Prill. On Approximations and Incidence in Cylindrical Algebraic Decompositions , 1986, SIAM J. Comput..
[192] Andrew Chi-Chih Yao. On the Complexity of Maintaining Partial Sums , 1985, SIAM J. Comput..
[193] Roberto Tamassia,et al. A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps , 1996, SODA '93.
[194] Victor J. Milenkovic,et al. Verifiable Implementations of Geometric Algorithms Using Finite Precision Arithmetic , 1989, Artif. Intell..
[195] Lee R. Nackman,et al. Efficient Delaunay triangulation using rational arithmetic , 1991, TOGS.
[196] Robert E. Tarjan,et al. An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon , 1988, SIAM J. Comput..
[197] John F. Canny,et al. Generalised Characteristic Polynomials , 1990, J. Symb. Comput..
[198] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[199] Bernd Gärtner. A Subexponential Algorithm for Abstract Optimization Problems , 1995, SIAM J. Comput..
[200] Ketan Mulmuley. Randomized multidimensional search trees (extended abstract): dynamic sampling , 1991, SCG '91.
[201] H. Ni. Product Range Spaces, Sensitive Sampling, and Derandomization , 1993 .
[202] Pankaj K. Agarwal,et al. Ray shooting and other applications of spanning trees with low stabbing number , 1992, SCG '89.
[203] Victor J. Milenkovic,et al. Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic , 1989, 30th Annual Symposium on Foundations of Computer Science.
[204] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[205] Geetha Ramanathan. Algorithmic motion planning in robotics , 1985 .
[206] R. Seidel. Backwards Analysis of Randomized Geometric Algorithms , 1993 .
[207] Jean-Daniel Boissonnat,et al. On the Randomized Construction of the Delaunay Tree , 1993, Theor. Comput. Sci..
[208] Jirí Matousek,et al. Geometric range searching , 1994, CSUR.
[209] Victor J. Milenkovic,et al. Numerical stability of algorithms for line arrangements , 1991, SCG '91.
[210] Tamal K. Dey. Optimal Algorithms to Detect Null-Homologous Cycles on 2-Manifolds , 1993, Int. J. Comput. Geom. Appl..
[211] Robert E. Tarjan,et al. Triangulating a Simple Polygon , 1978, Inf. Process. Lett..
[212] John E. Hopcroft,et al. Reducing Multiple Object Motion Planning to Graph Searching , 1984, SIAM J. Comput..
[213] Bernard Chazelle,et al. Bounds on the size of tetrahedralizations , 1994, SCG '94.
[214] Bernard Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra , 1989, 30th Annual Symposium on Foundations of Computer Science.
[215] M. Sharir,et al. An Efficient Multi-Dimensional Searching Technique and itsApplications , 1993 .
[216] Bernard Chazelle,et al. Quasi-optimal range searching in spaces of finite VC-dimension , 1989, Discret. Comput. Geom..
[217] Noga Alon,et al. Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.
[218] Kenneth L. Clarkson,et al. A fast las vegas algorithm for triangulating a simple polygon , 1989, Discret. Comput. Geom..
[219] Leonidas J. Guibas,et al. Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..
[220] Noga Alon,et al. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem , 1985, J. Algorithms.
[221] Jirí Matousek,et al. On range searching with semialgebraic sets , 1992, Discret. Comput. Geom..
[222] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[223] Ketan Mulmuley,et al. Hidden surface removal with respect to a moving view point , 1991, STOC '91.
[224] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[225] George E. Collins,et al. Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .
[226] Michael T. Goodrich,et al. Constructing arrangements optimally in parallel , 1993, Discret. Comput. Geom..
[227] Leonidas J. Guibas,et al. Lines in space-combinators, algorithms and applications , 1989, STOC '89.
[228] Micha Sharir,et al. Almost tight upper bounds for the single cell and zone problems in three dimensions , 1995, Discret. Comput. Geom..
[229] Olivier Devillers. Randomization yields simple O(n log* n) algorithms for difficult Omega(n) problems , 1992, Int. J. Comput. Geom. Appl..
[230] Marco Pellegrini,et al. On point location and motion planning among simplices , 1994, STOC '94.
[231] Bernard Chazelle,et al. Lower bounds for orthogonal range searching: I. The reporting case , 1990, JACM.
[232] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[233] 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).
[234] Jirí Matousek,et al. Ham-sandwich cuts in Rd , 1992, STOC '92.
[235] D. Yu Grigor. Complexity of Deciding Tarski Algebra , 1988 .
[236] Kenneth L. Clarkson,et al. Linear Programming in O(n * (3_d)_2) Time , 1986, Inf. Process. Lett..
[237] John F. Canny,et al. Some algebraic and geometric computations in PSPACE , 1988, STOC '88.
[238] Mikhail J. Atallah,et al. Output-Sensitive Methods for Rectilinear Hidden Surface Removal , 1993, Inf. Comput..
[239] Nimrod Megiddo. Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..
[240] Jirí Matousek,et al. Ray Shooting and Parametric Search , 1993, SIAM J. Comput..
[241] John F. Canny. Some practical tools for algebraic geometry , 1995 .
[242] Micha Sharir,et al. A Subexponential Bound for Linear Programming , 1992, Symposium on Computational Geometry.
[243] Martin E. Dyer,et al. On a Multidimensional Search Technique and its Application to the Euclidean One-Centre Problem , 1986, SIAM J. Comput..
[244] Jirí Matousek,et al. Approximations and optimal geometric divide-and-conquer , 1991, STOC '91.
[245] Micha Sharir. Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions , 1993, FOCS.
[246] Bonnie Berger,et al. Simulating (logcn)-wise independence in NC , 1991, JACM.
[247] Martin E. Dyer,et al. A randomized algorithm for fixed-dimensional linear programming , 1989, Math. Program..
[248] James H. Davenport,et al. Real Quantifier Elimination is Doubly Exponential , 1988, J. Symb. Comput..
[249] Pankaj K. Agarwal,et al. Partitioning arrangements of lines II: Applications , 2011, Discret. Comput. Geom..
[250] M. Karasick. On the representation and manipulation of rigid solids , 1989 .
[251] Leonidas J. Guibas,et al. Epsilon geometry: building robust algorithms from imprecise computations , 1989, SCG '89.
[252] Volker Weispfenning,et al. The Complexity of Linear Problems in Fields , 1988, Journal of symbolic computation.
[253] Raimund Seidel,et al. Voronoi diagrams and arrangements , 1986, Discret. Comput. Geom..
[254] David G. Kirkpatrick,et al. Fast Detection of Polyhedral Intersection , 1983, Theor. Comput. Sci..
[255] Micha Sharir,et al. The union of convex polyhedra in three dimensions , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.