3 papers
cs.CG2017
The Stretch Factor of Hexagon-Delaunay Triangulations
Michael Dennis, Ljubomir Perković, Duru Türkoğlu
The problem of computing the exact stretch factor (i.e., the tight bound on the worst case stretch factor) of a Delaunay triangulation is one of the longstanding open problems in c…
cs.DS2017
Edge-Based Wedge Sampling to Estimate Triangle Counts in Very Large Graphs
Duru Türkoğlu, Ata Turk
The number of triangles in a graph is useful to deduce a plethora of important features of the network that the graph is modeling. However, finding the exact value of this number i…
cs.CG2016
Degree Four Plane Spanners: Simpler and Better
Iyad Kanj, Ljubomir Perković, Duru Türkoǧlu
Let be a set of points embedded in the plane, and let be the complete Euclidean graph whose point-set is . Each edge in between two p…