3 papers
cs.CG2025
Efficient Enumeration of At Most -Out Polygons
Waseem Akram, Katsuhisa Yamanaka
Let be a set of points in the Euclidean plane and general position i.e., no three points are collinear. An \emph{at most -out polygon of } is a simple polygon such th…
cs.DS2025
Data Structures for Range Sorted Consecutive Occurrence Queries
Waseem Akram, Takuya Mieno
The string indexing problem is a fundamental computational problem with numerous applications, including information retrieval and bioinformatics. It aims to efficiently solve the…
cs.DS2024
Top-k Stabbing Interval Queries
Waseem Akram, Sanjeev Saxena
We investigate a weighted variant of the interval stabbing problem, where the goal is to design an efficient data structure for a given set of weighted intervals such…