Upper bounds for minimum dilation triangulation in two special cases

DOI10.1016/j.ipl.2018.01.001zbMath1426.68277OpenAlexW2794322524MaRDI QIDQ1705701

Sattar Sattari, Mohammad A. Izadi

Publication date: 16 March 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.01.001

zbMATH Keywords

triangulationdilationcomputational geometrypoint set

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• An exact algorithm for the minimum dilation triangulation problem
• The Stretch Factor of the Delaunay Triangulation Is Less than 1.998
• A plane 1.88-spanner for points in convex position
• Towards plane spanners of degree 3
• Upper Bound on Dilation of Triangulations of Cyclic Polygons
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper bounds for minimum dilation triangulation in two special cases