Computing the link center of a simple polygon

Recommendations

An $O(n\log n)$ algorithm for computing the link center of a simple polygon
Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications.
An $O(n \log n)$ algorithm for computing a link center in a simple polygon
An optimal algorithm for the rectilinear link center of a rectilinear polygon
scientific article; zbMATH DE number 4051002

Cites work

scientific article; zbMATH DE number 3171651 (Why is no real title available?)
scientific article; zbMATH DE number 3859178 (Why is no real title available?)
scientific article; zbMATH DE number 4051002 (Why is no real title available?)
A linear algorithm for computing the visibility polygon from a point
Computing the geodesic center of a simple polygon
Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
Euclidean shortest paths in the presence of rectilinear barriers
Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
Triangulating a simple polygon
Visibility and intersection problems in plane geometry

Cited in

(24)

Computing the geodesic center of a simple polygon
On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane
Optimal on-line algorithms for walking with minimum number of turns in unknown streets
Geodesic convexity in discrete spaces
An $O(n \log n)$ algorithm for computing a link center in a simple polygon
Efficient piecewise-linear function approximation using the uniform metric
Connect the Dot: Computing Feed-Links with Minimum Dilation
On the geodesic Voronoi diagram of point sites in a simple polygon
Visibility with multiple diffuse reflections
An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT
Helly-gap of a graph and vertex eccentricities
Rectilinear paths among rectilinear obstacles
An optimal algorithm for the rectilinear link center of a rectilinear polygon
Parallel algorithms for all minimum link paths and link center problems
Minimal link visibility paths inside a simple polygon
Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
Settling the bound on the rectilinear link radius of a simple rectilinear polygon
An $O(n\log n)$ algorithm for computing the link center of a simple polygon
Minimum-link paths among obstacles in the plane
Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications.
On rectilinear link distance
Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
Optimal parallel algorithms for rectilinear link-distance problems
Diffuse reflection diameter and radius for convex-quadrilateralizable polygons

This page was built for publication: Computing the link center of a simple polygon

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