scientific article; zbMATH DE number 4051002

MaRDI QIDQ3787491zbMATH OpenFDO

Authors Godfried Toussaint, Tetsuo Asano

Publication date 1987

zbMATH Keywords

polynomial-time algorithmVoronoi diagramsimple polygongeodesic centershortest internal path

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99) Convex sets in (2) dimensions (including convex curves) (52A10)

Recommendations

• Computing the geodesic center of a simple polygon
• scientific article; zbMATH DE number 6789192
• A linear-time algorithm for the geodesic center of a simple polygon
• Computing the geodesic centers of a polygonal domain

Cited in

(32)

• On the central path problem
• The geodesic farthest-point Voronoi diagram in a simple polygon
• The furthest-site geodesic Voronoi diagram
• Geodesic Disks and Clustering in a Simple Polygon
• On the central path problem
• Geodesic Fréchet distance inside a simple polygon
• Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications.
• Computing the geodesic centers of a polygonal domain
• Computing geodesic furthest neighbors in simple polygons
• Point selections from Jordan domains in Riemannian surfaces
• A linear-time algorithm for the geodesic center of a simple polygon
• scientific article; zbMATH DE number 140467 (Why is no real title available?)
• Computing a maxian point of a simple rectilinear polygon
• Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
• Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
• Computing the link center of a simple polygon
• The polygon burning problem
• Constrained geodesic centers of a simple polygon
• The geodesic 2-center problem in a simple polygon
• The Visibility Center of a Simple Polygon
• The geodesic edge center of a simple polygon
• scientific article; zbMATH DE number 597698 (Why is no real title available?)
• Geodesic center of a simple polygon using a logarithmic number of extra variables
• Matrix Searching with the Shortest-Path Metric
• Multiple-guard kernels of simple polygons
• The geodesic diameter of polygonal domains
• On the geodesic centers of polygonal domains
• Computing the geodesic center of a simple polygon
• Geodesic disks and clustering in a simple polygon
• An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
• scientific article; zbMATH DE number 6789192 (Why is no real title available?)
• Computing the \(L_1\) geodesic diameter and center of a polygonal domain

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787491)