Upper bounds for minimum dilation triangulation in two special cases

DOI10.1016/J.IPL.2018.01.001MaRDI QIDQ1705701zbMATH OpenOpenAlexFDO

Authors Sattar Sattari, Mohammad 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

computational geometrytriangulationdilationpoint set

Mathematics Subject Classification ID

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

Recommendations

• Upper Bound on Dilation of Triangulations of Cyclic Polygons
• An exact algorithm for the minimum dilation triangulation problem
• Most finite point sets in the plane have dilation \(>1\)
• EMBEDDING POINT SETS INTO PLANE GRAPHS OF SMALL DILATION
• An improved upper bound on dilation of regular polygons

Cites work

• scientific article; zbMATH DE number 1424297 (Why is no real title available?)
• scientific article; zbMATH DE number 3299324 (Why is no real title available?)
• A plane 1.88-spanner for points in convex position
• An exact algorithm for the minimum dilation triangulation problem
• The stretch factor of the Delaunay triangulation is less than 1.998
• Towards plane spanners of degree 3
• Upper Bound on Dilation of Triangulations of Cyclic Polygons

Cited in

(4)

• Upper Bound on Dilation of Triangulations of Cyclic Polygons
• An Upper Bound for the Least Dilatation
• An exact algorithm for the minimum dilation triangulation problem
• A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation

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

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