Davenport-Schinzel sequences and their geometric applications
暂无分享,去创建一个
[1] Micha Sharir,et al. On minima of function, intersection patterns of curves, and davenport-schinzel sequences , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[2] Davenport-schinzel Sequences , 2022 .
[3] Micha Sharir,et al. Largest Placements and Motion Planning of a Convex Polygon , 1996 .
[4] Richard C. T. Lee,et al. Voronoi Diagrams of Moving Points in the Plane , 1990, FSTTCS.
[5] Thomas Roos,et al. Tighter Bounds on Voronoi Diagrams of Moving Points , 1993, CCCG.
[6] Steven Fortune,et al. A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.
[7] Godfried T. Toussaint,et al. Movable Separability of Sets , 1985 .
[8] Micha Sharir,et al. Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences , 2015, J. Comb. Theory, Ser. A.
[9] Micha Sharir,et al. A Note on the Papadimitriou-Silverberg Algorithm for Planning Optimal Piecewise-Linear Motion of a Ladder , 2019, Inf. Process. Lett..
[10] J.. SOME DYNAMIC COMPUTATIONAL GEOMETRY PROBLEMS , 2009 .
[11] Ketan Mulmuley,et al. On levels in arrangements and voronoi diagrams , 1991, Discret. Comput. Geom..
[12] Micha Sharir,et al. An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract) , 1985, SCG '85.
[13] J. Paris. A Mathematical Incompleteness in Peano Arithmetic , 1977 .
[14] Leonidas J. Guibas,et al. Topologically sweeping an arrangement , 1986, STOC '86.
[15] Edgar A. Ramos,et al. Intersection of Unit-balls and Diameter of a Point Set in 3 , 1997, Comput. Geom..
[16] Richard C. T. Lee,et al. Voronoi diagrams of moving points in the plane , 1990, Int. J. Comput. Geom. Appl..
[17] Raimund Seidel,et al. Constructing arrangements of lines and hyperplanes with applications , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[18] N. S. Barnett,et al. Private communication , 1969 .
[19] Micha Sharir,et al. Separating two simple polygons by a sequence of translations , 2015, Discret. Comput. Geom..
[20] Micha Sharir,et al. Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams , 2016, Discret. Comput. Geom..
[21] Micha Sharir,et al. On the Zone Theorem for Hyperplane Arrangements , 1991, SIAM J. Comput..
[22] David M. Mount,et al. The Number of Shortest Paths on the Surface of a Polyhedron , 1990, SIAM J. Comput..
[23] Leonidas J. Guibas,et al. Visibility and intersectin problems in plane geometry , 1985, SCG '85.
[24] Micha Sharir,et al. On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..
[25] Martin Klazar,et al. A Linear Upper Bound in Extremal Theory of Sequences , 1994, J. Comb. Theory, Ser. A.
[26] David Avis,et al. Polyhedral line transversals in space , 1988, Discret. Comput. Geom..
[27] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[28] 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).
[29] Hisao Tamaki,et al. How to cut pseudo-parabolas into segments , 1995, SCG '95.
[30] John Hershberger,et al. Finding the Upper Envelope of n Line Segments in O(n log n) Time , 1989, Inf. Process. Lett..
[31] Ervin Györi,et al. An Extremal Problem on Sparse 0-1 Matrices , 1991, SIAM J. Discret. Math..
[32] Rephael Wenger,et al. Ordered stabbing of pairwise disjoint convex sets in linear time , 1991, Discret. Appl. Math..
[33] Bernard Chazelle,et al. A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[34] Micha Sharir,et al. The upper envelope of voronoi surfaces and its applications , 1991, SCG '91.
[35] Sivan Toledo,et al. Computing a Segment Center for a Planar Point Set , 1993, J. Algorithms.
[36] Jirí Matousek,et al. Constructing levels in arrangements and higher order Voronoi diagrams , 1994, SCG '94.
[37] Boris Aronov,et al. Star Unfolding of a Polytope with Applications , 1997, SIAM J. Comput..
[38] Micha Sharir,et al. Red-Blue intersection detection algorithms, with applications to motion planning and collision detection , 1990, SCG '88.
[39] Chee-Keng Yap,et al. Algorithmic and geometric aspects of robotics , 1987 .
[40] Hazel Everett,et al. An optimal algorithm for the (≤ k)-levels, with applications to separation and transversal problems , 1993, SCG '93.
[41] Micha Sharir,et al. New bounds for lower envelopes in three dimensions, with applications to visibility in terrains , 1993, SCG '93.
[42] D. T. Lee,et al. Two-Dimensional Voronoi Diagrams in the Lp-Metric , 1980, J. ACM.
[43] Leonidas J. Guibas,et al. The complexity and construction of many faces in arrangements of lines and of segments , 1990, Discret. Comput. Geom..
[44] Noga Alon,et al. The number of small semispaces of a finite set of points in the plane , 1986, J. Comb. Theory, Ser. A.
[45] W. Ackermann. Zum Hilbertschen Aufbau der reellen Zahlen , 1928 .
[46] Kenneth L. Clarkson,et al. RANDOMIZED GEOMETRIC ALGORITHMS , 1992 .
[47] David Avis,et al. Lower Bounds for Line Stabbing , 1989, Inf. Process. Lett..
[48] T. Ottmann,et al. Dynamical sets of points , 1984 .
[49] P. Erdös,et al. Dissection Graphs of Planar Point Sets , 1973 .
[50] M. Klazar,et al. Two results on a partial ordering of finite sequences , 1993 .
[51] Micha Sharir,et al. Almost linear upper bounds on the length of general davenport—schinzel sequences , 1987, Comb..
[52] Kenneth L. Clarkson,et al. Approximation algorithms for shortest path motion planning , 1987, STOC.
[53] Martin Klazar,et al. Generalized Davenport-Schinzel sequences with linear upper bound , 1992, Discret. Math..
[54] Micha Sharir,et al. On the Two-Dimensional Davenport Schinzel Problem , 2018, J. Symb. Comput..
[55] Hiroshi Imai,et al. Minimax geometric fitting of two corresponding sets of points , 1989, SCG '89.
[56] Kenneth L. Clarkson,et al. Applications of random sampling in computational geometry, II , 1988, SCG '88.
[57] Daniel P. Huttenlocher,et al. Computing the minimum Hausdorff distance for point sets under translation , 1990, SCG '90.
[58] Péter Komjáth,et al. A simplified construction of nonlinear Davenport-Schinzel sequences , 1988, J. Comb. Theory, Ser. A.
[59] Esther M. Arkin,et al. Arrangements of segments that share endpoints: Single face results , 1995, Discret. Comput. Geom..
[60] Richard Cole,et al. Searching and Storing Similar Lists , 2018, J. Algorithms.
[61] Ady Wiernik,et al. Planar realizations of nonlinear davenport-schinzel sequences by segments , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[62] J. Pach,et al. An upper bound on the number of planar k-sets , 1989, 30th Annual Symposium on Foundations of Computer Science.
[63] Jussi KETONENt,et al. Rapidly growing Ramsey functions , 1981 .
[64] Takeshi Tokuyama,et al. On minimum and maximum spanning trees of linearly moving points , 1995, Discret. Comput. Geom..
[65] Thomas Roos,et al. Voronoi Diagrams over Dynamic Scenes , 1993, Discret. Appl. Math..
[66] Matthew J. Katz. 3-D Vertical Ray Shooting and 2-D Point Enclosure, Range Searching, and Arc Shooting Amidst Convex Fat Objects , 1997, Comput. Geom..
[67] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[68] Clyde L. Monma,et al. Transitions in geometric minimum spanning trees , 1991, SCG '91.
[69] Leonidas J. Guibas,et al. On the general motion-planning problem with two degrees of freedom , 2015, SCG '88.
[70] Maria M. Klawe,et al. Superlinear bounds on matrix searching , 1990, SODA '90.
[71] A. Liu,et al. The different ways of stabbing disjoint convex sets , 1992, Discret. Comput. Geom..
[72] Robert L. Grossman,et al. Visibility with a moving point of view , 1994, SODA '90.
[73] Michael McKenna. Worst-case optimal hidden-surface removal , 1987, TOGS.
[74] L. Paul Chew,et al. Near-quadratic Bounds for the L1Voronoi Diagram of Moving Points , 1993, Comput. Geom..
[75] Micha Sharir,et al. An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles , 1985, SCG '85.
[76] Leonidas J. Guibas,et al. Combinatorial complexity bounds for arrangements of curves and spheres , 1990, Discret. Comput. Geom..
[77] W ShorPeter,et al. Applications of random sampling in computational geometry, II , 1989 .
[78] Thomas Roos,et al. Voronoi Diagrams of Moving Points in Higher Dimensional Spaces , 1992, SWAT.
[79] Vladlen Koltun. Almost tight upper bounds for lower envelopes in higher dimensions , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.
[80] Hiroshi Imai,et al. Maximin location of convex objects in a polygon and related dynamic Voronoi diagrams , 1990, SCG '90.
[81] H. Davenport. A combinatorial problem connected with differential equations II , 1971 .
[82] M. Klazar,et al. A general upper bound in extremal theory of sequences , 1992 .
[83] Franz Aurenhammer,et al. Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.
[84] David Avis,et al. Algorithms for line transversals in space , 1987, SCG '87.
[85] R. Pollack,et al. Geometric Transversal Theory , 1993 .
[86] Richard Cole,et al. Visibility Problems for Polyhedral Terrains , 2018, J. Symb. Comput..
[87] Jon M. Kleinberg,et al. On dynamic Voronoi diagrams and the minimum Hausdorff distance for point sets under Euclidean motion in the plane , 1992, SCG '92.
[88] E. Szemerédi. On a problem of Davenport and Schinzel , 1974 .
[89] Martin Klazar,et al. Generalized Davenport-Schinzel sequences , 1994, Comb..
[90] Christos H. Papadimitriou,et al. An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..
[91] Mark de Berg,et al. On lazy randomized incremental construction , 1994, STOC '94.
[92] Joseph S. B. Mitchell,et al. The Discrete Geodesic Problem , 1987, SIAM J. Comput..
[93] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[94] Charles R. Dyer,et al. An algorithm for constructing the aspect graph , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[95] Micha Sharir,et al. Computing Depth Orders and Related Problems , 1994, SWAT.
[96] David Eppstein,et al. Horizon Theorems for Lines and Polygons , 1990, Discrete and Computational Geometry.
[97] Richard Pollack,et al. Discrete and Computational Geometry: Papers from the DIMACS Special Year , 1991, Discrete and Computational Geometry.
[98] Martin Klazar,et al. Combinatorial aspects of Davenport-Schinzel sequences , 1997, Discret. Math..
[99] Nancy M. Amato,et al. Computing faces in segment and simplex arrangements , 1995, STOC '95.
[100] Matthew J. Kaltz. 3-D vertical ray shooting and 2-D point enclosure, range searching, and arc shooting amidst convex fat objects , 1997 .
[101] Sivan Toledo,et al. Applications of parametric searching in geometric optimization , 1992, SODA '92.
[102] R. Stanton,et al. Some properties of Davenport-Schinzel sequences , 1971 .
[103] Franz Aurenhammer,et al. Improved Algorithms for Discs and Balls Using Power Diagrams , 1988, J. Algorithms.
[104] Helmut Alt,et al. Approximate matching of polygonal shapes , 1995, SCG '91.
[105] 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..
[106] Micha Sharir,et al. On shortest paths in polyhedral spaces , 1986, STOC '84.
[107] Micha Sharir,et al. Fat Triangles Determine Linearly Many Holes , 1994, SIAM J. Comput..
[108] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[109] Mikhail J. Atallah,et al. Efficient Algorithms for Common Transversals , 1987, Inf. Process. Lett..
[110] Chee-Keng Yap,et al. Approximate Euclidean shortest path in 3-space , 1994, SCG '94.
[111] Leonidas J. Guibas,et al. Maintaining the Extent of a Moving Point Set , 1997, WADS.
[112] Micha Sharir,et al. On the shortest paths between two convex polyhedra , 2018, JACM.
[113] Timothy M. Chan,et al. The complexity of a single face of a minkowski sum , 1995, CCCG.
[114] Leonidas J. Guibas,et al. Arrangements of Curves in the Plane - Topology, Combinatorics and Algorithms , 2018, Theor. Comput. Sci..
[115] Leonidas J. Guibas,et al. The number of edges of many faces in a line segment arrangement , 1992, Comb..
[116] Micha Sharir,et al. On Vertical Visibility in Arrangements of Segments and the Queue Size in the Bentley-Ottmann Line Sweeping Algorithm , 1991, SIAM J. Comput..
[117] H. Davenport,et al. A Combinatorial Problem Connected with Differential Equations , 1965 .
[118] R. Seidel. Backwards Analysis of Randomized Geometric Algorithms , 1993 .
[119] N. Megiddo. Dynamic location problems , 1986 .
[120] Michiel H. M. Smid,et al. Fast Algorithms for Collision and Proximity Problems Involving Moving Geometric Objects , 1994, Comput. Geom..
[121] Sivan Toledo,et al. On critical orientations in the kedem-sharir motion planning algorithm , 1997, CCCG.
[122] Yijie Han,et al. Shortest paths on a polyhedron , 1990, SCG '90.
[123] Mikhail J. Atallah,et al. Dynamic computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[124] Arnold L. Rosenberg,et al. Stabbing line segments , 1982, BIT.
[125] Micha Sharir,et al. A near-linear algorithm for the planar segment-center problem , 1994, SODA '94.
[126] Klara Kedem,et al. A Convex Polygon Among Polygonal Obstacles: Placement and High-clearance Motion , 1993, Comput. Geom..
[127] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[128] Sivan Toledo,et al. Extremal polygon containment problems , 1991, SCG '91.
[129] Ketan Mulmuley,et al. Computational geometry : an introduction through randomized algorithms , 1993 .
[130] Leonidas J. Guibas,et al. Fractional Cascading: A Data Structuring Technique with Geometric Applications , 1985, ICALP.
[131] Micha Sharir,et al. The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2 , 1990, Discret. Comput. Geom..
[132] I. G. Gowda,et al. Dynamic Voronoi diagrams , 1983, IEEE Trans. Inf. Theory.
[133] Micha Sharir,et al. A new efficient motion-planning algorithm for a rod in polygonal space , 1986, SCG '86.
[134] Zoltán Füredi,et al. Davenport-Schinzel theory of matrices , 1992, Discret. Math..
[135] Micha Sharir,et al. Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes , 1986, FOCS.
[136] R. Canham. A theorem on arrangements of lines in the plane , 1969 .
[137] Leonidas J. Guibas,et al. Computing a face in an arrangement of line segments , 1991, SODA '91.
[138] Micha Sharir,et al. Improved lower bounds on the length of Davenport-Schinzel sequences , 1988, Comb..
[139] R. Mullin,et al. A map-theoretic approach to Davenport-Schinzel sequences. , 1972 .
[140] Leonidas J. Guibas,et al. Visibility and intersection problems in plane geometry , 1989, Discret. Comput. Geom..
[141] David E. Muller,et al. Finding the Intersection of n Half-Spaces in Time O(n log n) , 1979, Theor. Comput. Sci..
[142] Robert E. Tarjan,et al. Making data structures persistent , 1986, STOC '86.
[143] Arie Tamir,et al. Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures , 1988, SIAM J. Discret. Math..
[144] Leonidas J. Guibas,et al. On arrangements of Jordan arcs with three intersections per pair , 2018, SCG '88.