scientific article; zbMATH DE number 7559212

DOI10.4230/LIPICS.SOCG.2019.12MaRDI QIDQ5088939zbMATH OpenFDO

Authors Luis Barba

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.SOCG.2019.12

zbMATH Keywords

farthest-point Voronoi diagramgeodesic distancesimple polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites work

• A linear-time algorithm for the geodesic center of a simple polygon
• A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
• Computing geodesic furthest neighbors in simple polygons
• Computing the geodesic center of a simple polygon
• Detecting weakly simple polygons
• scientific article; zbMATH DE number 1424303 (Why is no real title available?)
• scientific article; zbMATH DE number 1433426 (Why is no real title available?)
• k-PAIRS NON-CROSSING SHORTEST PATHS IN A SIMPLE POLYGON
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Matrix Searching with the Shortest-Path Metric
• On the geodesic Voronoi diagram of point sites in a simple polygon
• Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
• The furthest-site geodesic Voronoi diagram
• Triangulating a simple polygon in linear time
• Voronoi diagrams for a moderate-sized point-set in a simple polygon

Cited in

(9)

• Optimal computation of the Voronoi diagram of disjoint clusters
• \(L_1\) geodesic farthest neighbors in a simple polygon and related problems
• scientific article; zbMATH DE number 3889235 (Why is no real title available?)
• scientific article; zbMATH DE number 140459 (Why is no real title available?)
• The optimal algorithm for dynamic support of the Voronoi Diagram for a set of points
• An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
• Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
• The geodesic edge center of a simple polygon
• An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088939)