On the geodesic Voronoi diagram of point sites in a simple polygon
From MaRDI portal
(Redirected from Publication:1115602)
Recommendations
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- The geodesic farthest-point Voronoi diagram in a simple polygon
- The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
- Optimal algorithm for geodesic nearest-point Voronoi diagrams in simple polygons
Cites work
- scientific article; zbMATH DE number 4149601 (Why is no real title available?)
- scientific article; zbMATH DE number 4051001 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- A sweepline algorithm for Voronoi diagrams
- An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
- An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments
- An optimal algorithm for constructing the weighted Voronoi diagram in the plane
- Computing the geodesic center of a simple polygon
- Computing the link center of a simple polygon
- Constrained Delaunay triangulations
- Euclidean shortest paths in the presence of rectilinear barriers
- Generalized Delaunay triangulation for planar graphs
- Generalized Voronoi diagrams for a ladder. II: Efficient construction of the diagram
- Generalized voronoi diagrams for moving a ladder. I: Topological analysis
- Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
- On the shortest paths between two convex polyhedra
- Power Diagrams: Properties, Algorithms and Applications
- The furthest-site geodesic Voronoi diagram
- Triangulating a simple polygon
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- Voronoi Diagram in the Laguerre Geometry and Its Applications
- Voronoi diagrams and arrangements
- Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
Cited in
(35)- The complexity of geodesic Voronoi diagrams on triangulated 2-manifold surfaces
- Boat-sail Voronoi diagram and its computation based on a cone-approximation scheme
- Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
- A new algorithm for shortest paths among obstacles in the plane
- The furthest-site geodesic Voronoi diagram
- Efficient piecewise-linear function approximation using the uniform metric
- scientific article; zbMATH DE number 4051001 (Why is no real title available?)
- A linear-time algorithm for the geodesic center of a simple polygon
- BOAT-SAIL VORONOI DIAGRAM AND ITS APPLICATION
- The Geometric Stability of Voronoi Diagrams with Respect to Small Changes of the Sites
- The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon
- Higher-order geodesic Voronoi diagrams in a polygonal domain with holes
- Stable marker-particle method for the Voronoi diagram in a flow field
- An optimal deterministic algorithm for geodesic farthest-point Voronoi diagrams in simple polygons
- Proximity problems for points on a rectilinear plane with rectangular obstacles
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- Voronoi diagrams for a moderate-sized point-set in a simple polygon
- scientific article; zbMATH DE number 7559212 (Why is no real title available?)
- Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
- A nearly optimal algorithm for the geodesic Voronoi diagram of points in a simple polygon
- Improved dynamic geodesic nearest neighbor searching in a simple polygon
- Approximating Voronoi Diagrams of Convex Sites in Any Dimension
- Polygon Area Decomposition for Multiple-Robot Workspace Division
- SEPARATING POINT SETS IN POLYGONAL ENVIRONMENTS
- Geodesic disks and clustering in a simple polygon
- On determining optimal strategies in pursuit games in the plane
- Constructing the internal Voronoi diagram of polygonal figure using the sweepline method
- Farthest-point Voronoi diagrams in the presence of rectangular obstacles
- Computing the \(L_1\) geodesic diameter and center of a polygonal domain
- Boat-sail Voronoi diagram on a curved surface
- On the Triangle-Perimeter Two-Site Voronoi Diagram
- A note on visibility-constrained Voronoi diagrams
- The geodesic farthest-point Voronoi diagram in a simple polygon
- Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
This page was built for publication: On the geodesic Voronoi diagram of point sites in a simple polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1115602)
