3 citations · 6 across the 8 of their papers we have counts for
6 papers · 1 filter
Approximating the discrete and continuous median line segments in dimensions
Ovidiu Daescu, Ka Yaw Teo
Consider a set of points in . In the discrete median line segment problem, the objective is to find a line segment bounded by a pair of points in such tha…
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…
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…
Maximum Area Rectangle Separating Red and Blue Points
Bogdan Armaselu, Ovidiu Daescu
Given a set R of n red points and a set B of m blue points, we study the problem of finding a rectangle that contains all the red points, the minimum number of blue points and has…