Hakan Yıldız

E-mail

hakan@metu.edu.tr

Department

Department of Computer Engineering

ORCID

0000-0002-9579-4338

Scopus Author ID

52063878800

Web of Science Researcher ID

ABB-3286-2020

A NEAR-OPTIMAL ALGORITHM FOR SHORTEST PATHS AMONG CURVED OBSTACLES IN THE PLANE Hershberger, John; Suri, Subhash; Yıldız, Hakan (2022-01-01) © 2022 Society for Industrial and Applied Mathematics.We propose an algorithm for the problem of computing shortest paths among curved obstacles in the plane. If the obstacles have O(n) description complexity, then the alg...
Convex Hulls Under Uncertainty Agarwal, Pankaj K.; Har-Peled, Sariel; Suri, Subhash; Yıldız, Hakan; Zhang, Wuzhou (2017-10-01) We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-based services and computer vision. In our f...
Computing Klee's Measure of Grounded Boxes Yıldız, Hakan (2015-02-01) A well-known problem in computational geometry is Klee's measure problem, which asks for the volume of a union of axis-aligned boxes in d-space. In this paper, we consider Klee's measure problem for the special case where ...
Geometric k shortest paths Eriksson-Bique, Sylvester; Hershberger, John; Polishchuk, Valentin; Speckii, Bettina; Suri, Subhash; Talvitie, Topi; Verbeek, Kevin; Yıldız, Hakan (2015-01-01) Copyright © 2015 by the Society for Industrial and Applied Mathmatics.We consider the problem of computing k shortest paths in a two-dimensional environment with polygonal obstacles, where the jth path, for 1 ≤ j ≤ k, is t...
Convex Hulls under Uncertainty Agarwal, Pankaj K.; Har-Peled, Sariel; Suri, Subhash; Yıldız, Hakan; Zhang, Wuzhou (2014-01-01) We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-based services and computer vision. In our f...
A near-optimal algorithm for shortest paths among curved obstacles in the plane Hershberger, John; Suri, Subhash; Yıldız, Hakan (2013-01-01) We propose an algorithm for the problem of computing shortest paths among curved obstacles in the plane. If the obstacles have O(n) description complexity, then the algorithm runs in O(nlogn) time plus a term dependent on ...
On the Most Likely Convex Hull of Uncertain Points Suri, Subhash; Verbeek, Kevin; Yıldız, Hakan (2013-01-01) Consider a set of points in d dimensions where the existence or the location of each point is determined by a probability distribution. The convex hull of this set is a random variable distributed over exponentially many c...
On Klee's measure problem for grounded boxes Yıldız, Hakan (2012-07-23) A well-known problem in computational geometry is Klee's measure problem, which asks for the volume of a union of axis-aligned boxes in d-space. In this paper, we consider Klee's measure problem for the special case where ...
Detecting social cliques for automated privacy control in online social networks Yıldız, Hakan (2012-06-01) As a result of the increasing popularity of online social networking sites, millions of people spend a considerable portion of their social life on the Internet. The information exchanged in this context has obvious privac...
A discrete and dynamic version of klee's measure problem Yıldız, Hakan; Suri, Subhash (2011-12-01) Given a set of axis-aligned boxes B = {B1,B2, . . . ,Bn} and a set of points P = {p1, p2, . . ., pm} in d-space, let the discrete measure of B with respect to P be defined as meas(B,P) = P ∩ { ∪n i=1 Bi}, namely, the numbe...

Citation Formats