Computing geodesic furthest neighbors in simple polygons
From MaRDI portal
(Redirected from Publication:1822979)
Recommendations
- Computing external farthest neighbors for a simple polygon
- scientific article; zbMATH DE number 1796963
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
- The geodesic farthest-point Voronoi diagram in a simple polygon
- Computing farthest neighbors on a convex polytope.
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- Computing the Fréchet distance between simple polygons
- Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
Cites work
- scientific article; zbMATH DE number 4051002 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
- Computing the geodesic center of a simple polygon
- Euclidean shortest paths in the presence of rectilinear barriers
- Geodesic methods in quantitative image analysis
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Triangulating a simple polygon
Cited in
(31)- The geodesic farthest-point Voronoi diagram in a simple polygon
- The furthest-site geodesic Voronoi diagram
- Rectilinear link diameter and radius in a rectilinear polygonal domain
- Geodesic Fréchet distance inside a simple polygon
- Some computational aspects of geodesic convex sets in a simple polygon
- An optimal parallel algorithm for computing furthest neighbors in a tree
- Parallel methods for visibility and shortest-path problems in simple polygons
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
- Computing the geodesic centers of a polygonal domain
- Computing the external geodesic diameter of a simple polygon
- A linear-time algorithm for the geodesic center of a simple polygon
- PARALLEL COMPUTATION OF INTERNAL AND EXTERNAL FARTHEST NEIGHBORS IN SIMPLE POLYGONS
- Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
- A linear time algorithm for finding all farthest neighbors in a convex polygon
- The geodesic edge center of a simple polygon
- Computing external farthest neighbors for a simple polygon
- Matrix Searching with the Shortest-Path Metric
- EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS
- Guarding Exterior Region of a Simple Polygon
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- Optimal parallel algorithms for rectilinear link-distance problems
- A coreset for approximate furthest-neighbor queries in a simple polygon
- The symmetric all-furthest-neighbor problem
- scientific article; zbMATH DE number 7559212 (Why is no real title available?)
- Pareto envelopes in simple polygons
- Blaschke-type theorem and separation of disjoint closed geodesic convex sets
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
- Efficient piecewise-linear function approximation using the uniform metric
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
- \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain
This page was built for publication: Computing geodesic furthest neighbors in simple polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822979)
