research
∙
01/21/2022
Approximating the discrete and continuous median line segments in d dimensions
Consider a set P of n points in ℝ^d. In the discrete median line segment...
research
∙
11/23/2020
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions
Consider an input consisting of a set of n disjoint triangular obstacles...
research
∙
11/23/2020
Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment
An articulated probe is modeled in the plane as two line segments, ab an...
research
∙
07/12/2020
City Guarding with Limited Field of View
Drones and other small unmanned aerial vehicles are starting to get perm...
research
∙
08/15/2018
Edge Disjoint Spanning Trees in an Undirected Graph with E=2(V-1)
Given a connected undirected graph G = [V; E] where |E| =2(|V| -1), we p...
research
∙
07/24/2018
Does a robot path have clearance c?
Most path planning problems among polygonal obstacles ask to find a path...
research
∙
04/16/2018
k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler
Given an array A of n real numbers, the maximum subarray problem is to f...
research
∙
06/10/2017