Waseem Akram

activity

20212025

most citedPoint Enclosure Problem for Homothetic Polygons

2 citations · 3 across the 7 of their papers we have counts for

collaborators

Showing cs.CGShow all

2 papers · 1 filter

cs.CG2025

Efficient Enumeration of At Most $k$ -Out Polygons

Waseem Akram, Katsuhisa Yamanaka

Let $S$ be a set of $n$ points in the Euclidean plane and general position i.e., no three points are collinear. An \emph{at most $k$ -out polygon of $S$ } is a simple polygon such th…

cs.CG2021★ 2 cited

Point Enclosure Problem for Homothetic Polygons

Waseem Akram, Sanjeev Saxena

In this paper, we investigate the homothetic point enclosure problem: given a set $S$ of $n$ triangles with sides parallel to three fixed directions, find a data structure for $S$ …

Efficient Enumeration of At Most k-Out Polygons

Point Enclosure Problem for Homothetic Polygons

Efficient Enumeration of At Most $k$ -Out Polygons