scientific article
From MaRDI portal
Publication:3787491
zbMath0644.68072MaRDI QIDQ3787491
Godfried T. Toussaint, Tetsuo Asano
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Discrete mathematics in relation to computer science (68R99)
Related Items (14)
The geodesic 2-center problem in a simple polygon ⋮ Computing the link center of a simple polygon ⋮ The polygon burning problem ⋮ The geodesic diameter of polygonal domains ⋮ An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons ⋮ Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon ⋮ Computing the \(L_1\) geodesic diameter and center of a polygonal domain ⋮ The furthest-site geodesic Voronoi diagram ⋮ Computing the geodesic center of a simple polygon ⋮ Diffuse reflection radius in a simple polygon ⋮ A linear-time algorithm for the geodesic center of a simple polygon ⋮ The geodesic farthest-point Voronoi diagram in a simple polygon ⋮ Multiple-guard kernels of simple polygons ⋮ Computing geodesic furthest neighbors in simple polygons
This page was built for publication:
