Approximating the smallest k-enclosing geodesic disc in a simple polygon
From MaRDI portal
Publication:6179409
Cites work
- scientific article; zbMATH DE number 4051002 (Why is no real title available?)
- scientific article; zbMATH DE number 7030514 (Why is no real title available?)
- scientific article; zbMATH DE number 7559212 (Why is no real title available?)
- A linear-time algorithm for the geodesic center of a simple polygon
- A new data structure for shortest path queries in a simple polygon
- Applications of the theory of records in the study of random trees
- Computing the geodesic center of a simple polygon
- Computing the geodesic centers of a polygonal domain
- Computing the smallest \(k\)-enclosing circle and related problems
- Dynamic data structures for \(k\)-nearest neighbor queries
- Euclidean shortest paths in the presence of rectilinear barriers
- Fast Deterministic Selection
- Fast algorithms for computing the smallest \(k\)-enclosing circle
- Finding k points with minimum diameter and related problems
- Geodesic disks and clustering in a simple polygon
- Geodesic-preserving polygon simplification
- Geometric applications of a randomized optimization technique
- Geometric approximation algorithms
- Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
- Introduction to algorithms.
- Iterated nearest neighbors and finding minimal polytopes
- Lectures on analysis on metric spaces
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On enclosing k points by a circle
- On geometric optimization with few violated constraints
- On the geodesic Voronoi diagram of point sites in a simple polygon
- Optimal Search in Planar Subdivisions
- Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
- Optimal shortest path queries in a simple polygon
- Routing past unions of disjoint linear barriers
- Static and Dynamic Algorithms for k-Point Clustering Problems
- The furthest-site geodesic Voronoi diagram
- The geodesic 2-center problem in a simple polygon
- Time bounds for selection
- Triangulating a simple polygon in linear time
- Visibility and intersection problems in plane geometry
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
This page was built for publication: Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6179409)
