scientific article; zbMATH DE number 7236462
From MaRDI portal
Publication:5116518
DOI10.4230/LIPIcs.SoCG.2018.58zbMath1489.68366MaRDI QIDQ5116518
Publication date: 18 August 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon ⋮ Unnamed Item ⋮ A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon ⋮ Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks
Cites Work
- Unnamed Item
- Unnamed Item
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Triangulating a simple polygon in linear time
- A new data structure for shortest path queries in a simple polygon
- A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
- Scanning multiple sequences via cache memory
- Optimal shortest path queries in a simple polygon
- Updating a balanced search tree in 0(1) rotations
- Optimal Point Location in a Monotone Subdivision
This page was built for publication:
