On determining optimal strategies in pursuit games in the plane
From MaRDI portal
Publication:1269731
DOI10.1016/S0304-3975(97)00229-6zbMath0911.90376OpenAlexW2027960530MaRDI QIDQ1269731
Publication date: 28 October 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00229-6
Differential games (aspects of game theory) (91A23) Automated systems (robots, etc.) in control theory (93C85) Positional games (pursuit and evasion, etc.) (91A24)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding the upper envelope of n line segments in O(n log n) time
- Continuous alternation: the complexity of pursuit in continuous domains
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Convex hulls of objects bounded by algebraic curves
- Computational geometry in a curved world
- Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences
- Computing convolutions by reciprocal search
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Decomposition and intersection of simple splinegons
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Generation of configuration space obstacles: The case of moving algebraic curves
- Almost tight upper bounds for lower envelopes in higher dimensions
- Optimal Algorithms for the Intersection and the Minimum Distance Problems Between Planar Polygons
- Spatial Planning: A Configuration Space Approach
- A linear algorithm for determining the separation of convex polyhedra
- Computing the extreme distances between two convex polygons
- A linear algorithm for computing the visibility polygon from a point
- Alternation
- DETERMINING THE SEPARATION OF SIMPLE POLYGONS
