3 citations · 6 across the 4 of their papers we have counts for
7 papers
Computing Feasible Trajectories for an Articulated Probe in Three Dimensions
Ovidiu Daescu, Ka Yaw Teo
Consider an input consisting of a set of disjoint triangular obstacles in and a target point in the free space, all enclosed by a large sphere of radius…
Characterization and Computation of Feasible Trajectories for an Articulated Probe with a Variable-Length End Segment
Ovidiu Daescu, Ka Yaw Teo
An articulated probe is modeled in the plane as two line segments, and , joined at , with being very long, and of some small length . We investigate a traj…
City Guarding with Limited Field of View
Ovidiu Daescu, Hemant Malik
Drones and other small unmanned aerial vehicles are starting to get permission to fly within city limits. While video cameras are easily available in most cities, their purpose is…
Edge Disjoint Spanning Trees in an Undirected Graph with E=2(V-1)
Hemant Malik, Ovidiu Daescu, Ramaswamy Chandrasekaran
Given a connected undirected graph G = [V; E] where |E| =2(|V| -1), we present two algorithms to check if G can be decomposed into two edge disjoint spanning trees, and provide suc…
Does a robot path have clearance c?
Ovidiu Daescu, Hemant Malik
Most path planning problems among polygonal obstacles ask to find a path that avoids the obstacles and is optimal with respect to some measure or a combination of measures, for exa…
k-Maximum Subarrays for Small k: Divide-and-Conquer made simpler
Hemant Malik, Ovidiu Daescu
Given an array A of n real numbers, the maximum subarray problem is to find a contiguous subarray which has the largest sum. The k-maximum subarrays problem is to find k such subar…