FINDING AN OPTIMAL BRIDGE BETWEEN TWO POLYGONS
From MaRDI portal
Publication:4818559
DOI10.1142/S0218195902000852zbMath1152.68676OpenAlexW2109713969MaRDI QIDQ4818559
Publication date: 29 September 2004
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195902000852
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Cites Work
- A classification of the probabilistic polynomial time hierarchy under fault tolerant access to oracle classes
- The furthest-site geodesic Voronoi diagram
- An optimal algorithm for constructing an optimal bridge between two simple rectilinear polygons
- On optimal bridges between two convex regions
- Optimal shortest path queries in a simple polygon
- Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations