Given a set of points labeled with k labels, we introduce the heat map
s...
In a metric space, a set of point sets of roughly the same size and an
i...
Sublinear time complexity is required by the massively parallel computat...
A sparse graph that preserves an approximation of the shortest paths bet...
Delaunay Triangulation(DT) is one of the important geometric problems th...
Consider two entities with constant but not necessarily equal velocities...
Given a simple polygon P, in the Art Gallery problem the goal is to
find...
The classic cake-cutting problem provides a model for addressing the fai...
The k-center problem is to choose a subset of size k from a set of n
poi...
Given a simple polygon P, in the Art Gallery problem, the goal is to
fin...
A polygonal curve P with n vertices is c-packed, if the sum of the
lengt...
This paper studies a variant of the Art-gallery problem in which "walls"...
Accessing to required data on the internet is wide via search engines in...
An arrangement of n curves in the plane is given. The query is a point q...
Given p, k and a set of polygonal curves P_1,…,P_L, the p-mean
curve M o...
A set of points P in a metric space and a constant integer k are given.
...
In Spatial Voting Theory, distortion is a measure of how good the winner...
We consider extending the visibility polygon of a given point q, inside ...
One of the important yet insufficiently studied subjects in fair allocat...
The edit distance between two strings is defined as the smallest number ...
We consider extending visibility polygon (VP) of a given point q
(VP(q))...