research
∙
03/15/2023
Shortest Paths in Portalgons
Any surface that is intrinsically polyhedral can be represented by a col...
share
research
∙
03/06/2023
The Complexity of Geodesic Spanners
A geometric t-spanner for a set S of n point sites is an edge-weighted g...
research
∙
03/01/2023
Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
We devise a data structure that can answer shortest path queries for two...
research
∙
04/30/2022
Chromatic k-Nearest Neighbor Queries
Let P be a set of n colored points. We develop efficient data structures...
research
∙
03/03/2022
Efficient Fréchet distance queries for segments
We study the problem of constructing a data structure that can store a t...
research
∙
01/10/2022
Segment Visibility Counting Queries in Polygons
Let P be a simple polygon with n vertices, and let A be a set of m point...
research
∙
09/24/2021
Dynamic Data Structures for k-Nearest Neighbor Queries
Our aim is to develop dynamic data structures that support k-nearest nei...
research
∙
04/16/2021
Approximating the Earth Mover's Distance between sets of geometric objects
Given two distributions P and S of equal total mass, the Earth Mover's D...
research
∙
03/11/2021
Terrain prickliness: theoretical grounds for low complexity viewsheds
An important task when working with terrain models is computing viewshed...
research
∙
01/25/2021
Covering a set of line segments with a few squares
We study three covering problems in the plane. Our original motivation f...
research
∙
02/14/2020
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
We study the geodesic Voronoi diagram of a set S of n linearly moving si...
research
∙
05/03/2019
Most vital segment barriers
We study continuous analogues of "vitality" for discrete network flows/p...
research
∙
09/26/2018
Convex partial transversals of planar regions
We consider the problem of testing, for a given set of planar regions R...
research
∙
03/15/2018
Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon
We present an efficient dynamic data structure that supports geodesic ne...
research
∙
02/19/2018
Convexity-Increasing Morphs of Planar Graphs
We study the problem of convexifying drawings of planar graphs. Given an...
research
∙
07/10/2017
Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon
We present an efficient dynamic data structure that supports geodesic ne...
research
∙
06/30/2017
