scientific article; zbMATH DE number 7559212
From MaRDI portal
Publication:5088939
DOI10.4230/LIPIcs.SoCG.2019.12MaRDI QIDQ5088939
Publication date: 18 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons ⋮ Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon ⋮ \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the geodesic center of a simple polygon
- A linear-time algorithm for the geodesic center of a simple polygon
- 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
- The furthest-site geodesic Voronoi diagram
- Computing geodesic furthest neighbors in simple polygons
- Computing a geodesic two-center of points in a simple polygon
- The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
- Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
- Matrix Searching with the Shortest-Path Metric
- k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
- Optimal Algorithm for Geodesic Nearest-point Voronoi Diagrams in Simple Polygons
- Detecting Weakly Simple Polygons
This page was built for publication:
