Voronoi diagrams with barriers and the shortest diagonal problem
From MaRDI portal
(Redirected from Publication:1123618)
Recommendations
Cites work
- Generalized Delaunay triangulation for planar graphs
- scientific article; zbMATH DE number 4037201 (Why is no real title available?)
- scientific article; zbMATH DE number 4064506 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3635510 (Why is no real title available?)
Cited in
(10)- Fast algorithms for greedy triangulation
- On the complexity of two circle connecting problems
- Finding constrained and weighted Voronoi diagrams in the plane
- Voronoi diagrams with barriers and on polyhedra for minimal path planning
- Algorithms for computing best coverage path in the presence of obstacles in a sensor field
- scientific article; zbMATH DE number 1542607 (Why is no real title available?)
- Fast algorithms for greedy triangulation
- Fast skeleton construction
- Finding a shortest diagonal of a simple polygon in linear time
- Efficiently updating constrained Delaunay triangulations
This page was built for publication: Voronoi diagrams with barriers and the shortest diagonal problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123618)