An exact algorithm for the minimum dilation triangulation problem (Q1679486): Difference between revisions

@@ Property / author @@
-Mohammad A. Izadi
@@ Property / author: Mohammad A. Izadi / rank @@
-Normal rank
@@ Property / author @@
+Mohammad A. Izadi
@@ Property / author: Mohammad A. Izadi / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CGAL
@@ Property / describes a project that uses: CGAL / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+TSPLIB
@@ Property / describes a project that uses: TSPLIB / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10898-017-0517-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2605639086
@@ Property / OpenAlex ID: W2605639086 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5369527
@@ Property / cites work: Q5369527 / rank @@
+Normal rank
@@ Property / cites work @@
+Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\)
+Normal rank
@@ Property / cites work @@
+Computing a minimum-dilation spanning tree is NP-hard
+Normal rank
@@ Property / cites work @@
+The computational geometry algorithms library CGAL
+Normal rank
@@ Property / cites work @@
+There are planar graphs almost as good as the complete graph
+Normal rank
@@ Property / cites work @@
+Delaunay graphs are almost as good as complete graphs
+Normal rank
@@ Property / cites work @@
+Lower Bounds on the Dilation of Plane Spanners
@@ Property / cites work: Lower Bounds on the Dilation of Plane Spanners / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945509
@@ Property / cites work: Q4945509 / rank @@
+Normal rank
@@ Property / cites work @@
+COMPUTING GEOMETRIC MINIMUM-DILATION GRAPHS IS NP-HARD
+Normal rank
@@ Property / cites work @@
+Q4028874
@@ Property / cites work: Q4028874 / rank @@
+Normal rank
@@ Property / cites work @@
+A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric Spanner Networks
@@ Property / cites work: Geometric Spanner Networks / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the minimum dilation triangulation problem
+Normal rank
@@ Property / cites work @@
+On degrees in random triangulations of point sets
@@ Property / cites work: On degrees in random triangulations of point sets / rank @@
+Normal rank
@@ Property / cites work @@
+On stable line segments in all triangulations of a planar point set
+Normal rank
@@ Property / cites work @@
+The Stretch Factor of the Delaunay Triangulation Is Less than 1.998
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1679486