Computing geodesic furthest neighbors in simple polygons
From MaRDI portal
Publication:1822979
DOI10.1016/0022-0000(89)90045-7zbMath0679.68100OpenAlexW2055982472MaRDI QIDQ1822979
Publication date: 1989
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(89)90045-7
Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Real and complex geometry (51M99)
Related Items
Rectilinear link diameter and radius in a rectilinear polygonal domain, Computing the geodesic centers of a polygonal domain, Optimal parallel algorithms for rectilinear link-distance problems, Efficient piecewise-linear function approximation using the uniform metric, An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons, SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS, Computing external farthest neighbors for a simple polygon, Blaschke-type theorem and separation of disjoint closed geodesic convex sets, Parallel methods for visibility and shortest-path problems in simple polygons, Computing the \(L_1\) geodesic diameter and center of a polygonal domain, Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon, The furthest-site geodesic Voronoi diagram, Unnamed Item, A linear-time algorithm for the geodesic center of a simple polygon, Guarding Exterior Region of a Simple Polygon, PARETO ENVELOPES IN SIMPLE POLYGONS, EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS, The geodesic farthest-point Voronoi diagram in a simple polygon, Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
Cites Work
- Unnamed Item
- Unnamed Item
- Computing the geodesic center of a simple polygon
- Geodesic methods in quantitative image analysis
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Triangulating a simple polygon
- Euclidean shortest paths in the presence of rectilinear barriers
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
