research
∙
03/15/2023
Shortest Paths in Portalgons
Any surface that is intrinsically polyhedral can be represented by a col...
share
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
∙
11/27/2021
On approximating shortest paths in weighted triangular tessellations
We study the quality of weighted shortest paths when a continuous 2-dime...
research
∙
03/22/2021
Continuous mean distance of a weighted graph
We study the concept of the continuous mean distance of a weighted graph...
research
∙
03/11/2021
Terrain prickliness: theoretical grounds for low complexity viewsheds
An important task when working with terrain models is computing viewshed...
research
∙
11/04/2020
Affine invariant triangulations
We study affine invariant 2D triangulation methods. That is, methods tha...
research
∙
03/01/2020
New production matrices for geometric graphs
We use production matrices to count several classes of geometric graphs....
research
∙
02/26/2019
A new lower bound on the maximum number of plane graphs using production matrices
We use the concept of production matrices to show that there exist sets ...
research
∙
02/22/2019
Matching points with disks with a common intersection
We consider matchings with diametral disks between two sets of points R ...
research
∙
07/26/2018
Computing optimal shortcuts for networks
We study augmenting a plane Euclidean network with a segment, called a s...
research
∙
02/09/2018
Colored ray configurations
We study the cyclic color sequences induced at infinity by colored rays ...
research
∙
12/21/2017
A Note on Flips in Diagonal Rectangulations
Rectangulations are partitions of a square into axis-aligned rectangles....
research
∙
08/21/2017
Balanced partitions of 3-colored geometric sets in the plane
Let S be a finite set of geometric objects partitioned into classes or c...
research
∙
08/18/2017