Maintaining Visibility of a Polygon with a Moving Point of View*

Chapters in this book

1. Front Matter i
2. Contents v
3. Preface x
4. Robust Proximity Queries in Implicit Voronoi Diagrams 1
5. O-Convexity: Computing Hulls, Approximations, and Orientation Sets¹ 2
6. Efficient Algorithms for Counting and Reporting Pairwise Intersections between Convex Polygons 8
7. Convex hulls of bounded curvature 14
8. Enclosing k points in the smallest axis parallel rectangle 20
9. Finding the Set of All Minimal Nested Convex Polygons 26
10. Optimizing a Corridor between Two Polygons with an Application to Polyhedral Interpolation* 32
11. Heuristics for the Generation of Random Polygons* 38
12. Orthogonal Polygon Reconstruction* 44
13. Correcting topological defects of Tessellations 50
14. Generating Rooted Triangulations with Minimum Degree Four 56
15. On Stable Line Segments in Triangulations 62
16. Diamonds are not a Minimum Weight Triangulation’s Best Friend 68
17. Stabbing Information of a Simple Polygon* 74
18. K-transversals of parallel convex sets 80
19. Fast Stabbing of Boxes in High Dimensions* 87
20. Shooter Location Problems 93
21. Computational Geometry for Interrogative Visualization 99
22. An optimal algorithm for dynamic post-office problem in R²₁ and related problems 101
23. A Topology-Oriented Algorithm for the Voronoi Diagram of Polygons 107
24. On non-smooth convex distance functions 113
25. Time-Optimal Proximity Graph Computations on Enhanced Meshes 119
26. Deforming Curves in the Plane for Tethered-Robot Motion Planning 125
27. Heuristic Motion Planning with Movable Obstacles 131
28. Viewing a Set of Spheres while Moving on a Linear Flightpath 137
29. Approximating shortest paths in arrangements of lines 143
30. Velocity planning for a robot moving along the shortest straight line path among moving obstacles* 149
31. Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths 155
32. On the Reachable Regions of Chains 161
33. Heuristic Motion Planning with Many Degrees of Freedom 167
34. Computing Largest Circles Separating Two Sets of Segments 173
35. On the Permutations Generated by Rotational Sweeps of Planar Point Sets 179
36. Maximal Length Common Non-Intersecting Paths 185
37. Maintaining Multiple Levels of Detail in the Overlay of Hierarchical Subdivisions 190
38. Distance-Based Subdivision for Translational LP Containment 196
39. Variable Resolution Terrain Surfaces 202
40. Generalizing Halfspaces¹ 211
41. Efficient Algorithms for Guarding or Illuminating the Surface of a Polyhedral Terrain 217
42. The Surveillance of the Walls of an Art Gallery 223
43. On Rectangle Visibility Graphs III. External Visibility and Complexity 234
44. Maintaining Visibility of a Polygon with a Moving Point of View* 240
45. Visibility graph of a set of line segments: A dynamic sequential algorithm and its parallel version 246
46. Dynamic algorithms for approximate neighbor searching 252
47. Thee-Dimensional Restricted-Orientation Convexity¹ 258
48. Efficient Algorithms for the Smallest Enclosing Cylinder Problem 264
49. On the Ω(n4/3) Weak Lower Bounds for Some 3D Geometric Problems* 270
50. Computational Geometry Impact Potential: A Business and Industrial Perspective 276
51. Probabilistic algorithms for efficient grasping and fixturing 277
52. On a problem of immobilizing polygons. 283
53. Finding an o(n ² log n) algorithm is sometimes hard 289
54. Improved orthogonal drawings of 3-graphs 295
55. Algorithms on Polygonal Embeddings of Graphs* 300
56. Optimal orthogonal drawings of connected plane graphs* 306
57. Straight Line Embeddings of Planar Graphs on Point Sets 312
58. Extending Rectangular Range Reporting with Query Sensitive Analysis 319
59. The Complexity of Rivers in Triangulated Terrains 325
60. Computing the Angularity Tolerance 331
61. The Complexity of Illuminating Polygons by α-Flood-Lights 337
62. Author Index 343