Computing the link center of a simple polygon
From MaRDI portal
Publication:1104086
DOI10.1007/BF02187913zbMATH Open0646.68056OpenAlexW4299815227WikidataQ62037524 ScholiaQ62037524MaRDI QIDQ1104086FDOQ1104086
Authors: Jörg-Rüdiger Sack, Raimund Seidel, Micha Sharir, Godfried Toussaint, William Lenhart, Richard Pollack, Subhash Suri, Sue Whitesides, Chee K. Yap 
Publication date: 1988
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131051
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
- Title not available (Why is that?)
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Visibility and intersection problems in plane geometry
- Euclidean shortest paths in the presence of rectilinear barriers
- Title not available (Why is that?)
- Computing the geodesic center of a simple polygon
- Triangulating a simple polygon
- Title not available (Why is that?)
- A linear algorithm for computing the visibility polygon from a point
- Erratum: An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
Cited In (25)
- Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications.
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Geodesic convexity in discrete spaces
- Minimal link visibility paths inside a simple polygon
- Diffuse reflection radius in a simple polygon
- An \(O(n\log n)\) algorithm for computing the link center of a simple polygon
- Visibility with multiple diffuse reflections
- Helly-gap of a graph and vertex eccentricities
- An optimal algorithm for the rectilinear link center of a rectilinear polygon
- Rectilinear paths among rectilinear obstacles
- Settling the bound on the rectilinear link radius of a simple rectilinear polygon
- On the polygonal diameter (= link diameter) of the interior, resp. exterior, of a simple closed polygon in the plane
- Finding shortest paths in the presence of orthogonal obstacles using a combined L 1 and link metric
- An O(n log n) algorithm for computing a link center in a simple polygon
- Optimal parallel algorithms for rectilinear link-distance problems
- Optimal on-line algorithms for walking with minimum number of turns in unknown streets
- An O(n log n) ALGORITHM FOR FINDING A SHORTEST CENTRAL LINK SEGMENT
- Diffuse reflection diameter and radius for convex-quadrilateralizable polygons
- Connect the Dot: Computing Feed-Links with Minimum Dilation
- Minimum-link paths among obstacles in the plane
- On rectilinear link distance
- Computing the geodesic center of a simple polygon
- Computing the L 1-diameter and center of a simple rectilinear polygon in parallel
- Efficient piecewise-linear function approximation using the uniform metric
- Parallel algorithms for all minimum link paths and link center problems
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)
