Computing the geodesic center of a simple polygon
From MaRDI portal
Publication:582099
DOI10.1007/BF02187751zbMath0689.68067MaRDI QIDQ582099
Günter Rote, Richard Pollack, Micha Sharir
Publication date: 1989
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131100
68Q25: Analysis of algorithms and problem complexity
68U99: Computing methodologies and applications
52A10: Convex sets in (2) dimensions (including convex curves)
Related Items
GEODESIC DISKS AND CLUSTERING IN A SIMPLE POLYGON, SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS, The geodesic diameter of polygonal domains, Computing the geodesic center of a simple polygon, Computing the external geodesic diameter of a simple polygon, Blaschke-type theorem and separation of disjoint closed geodesic convex sets, Computing the link center of a simple polygon, On the geodesic Voronoi diagram of point sites in a simple polygon, Computing external farthest neighbors for a simple polygon, An \(O(n\log n)\) algorithm for computing the link center of a simple polygon, The furthest-site geodesic Voronoi diagram, On the ball spanned by balls, Centers of sets of pixels, Multiple-guard kernels of simple polygons, Computing geodesic furthest neighbors in simple polygons, PARETO ENVELOPES IN SIMPLE POLYGONS, Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon
Cites Work
- Unnamed Item
- Computing the geodesic center of a simple polygon
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- Computing the link center of a simple polygon
- Triangulating a simple polygon
- On the ball spanned by balls
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Euclidean shortest paths in the presence of rectilinear barriers
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- Linear Programming in Linear Time When the Dimension Is Fixed
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
