1 citations · 2 across the 7 of their papers we have counts for
11 papers
Lane-Level Route Planning for Autonomous Vehicles
Mitchell Jones, Maximilian Haas-Heger, Jur van den Berg
We present an algorithm that, given a representation of a road network in lane-level detail, computes a route that minimizes the expected cost to reach a given destination. In doin…
A Note on Stabbing Convex Bodies with Points, Lines, and Flats
Sariel Har-Peled, Mitchell Jones
Consider the problem of constructing weak $\eps$-nets where the stabbing elements are lines or -flats instead of…
Cutting cycles of rods in space is FPT
Mitchell Jones
In this short note, we show that cutting cycles of rods is fixed-parameter tractable by reducing the problem to computing a feedback vertex set in a mixed graph.
Proof of Dudley's Convex Approximation
Sariel Har-Peled, Mitchell Jones
We provide a self contained proof of a result of Dudley [Dud64]} which shows that a bounded convex-body in can be -approximated, by the intersection of $O_d\bi…
Optimal Algorithms for Geometric Centers and Depth
Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
We develop a general randomized technique for solving "implic it" linear programming problems, where the collection of constraints are defined impl…
Some Geometric Applications of Anti-Chains
Sariel Har-Peled, Mitchell Jones
We present an algorithmic framework for computing anti-chains of maximum size in geometric posets. Specifically, posets in which the entities are geometric objects, where comparabi…
Active Learning a Convex Body in Low Dimensions
Sariel Har-Peled, Mitchell Jones, Saladi Rahul
Consider a set of points, and a convex body provided via a separation oracle. The task at hand is to decide for each point of if it is in using…
On Locality-Sensitive Orderings and their Applications
Timothy M. Chan, Sariel Har-Peled, Mitchell Jones
For any constant and parameter , we show the existence of (roughly) orderings on the unit cube , such that any two points $p,q\in [0…
Few Cuts Meet Many Point Sets
Sariel Har-Peled, Mitchell Jones
We study the problem of how to breakup many point sets in into smaller parts using a few splitting (shared) hyperplanes. This problem is related to the classical Ham…
Journey to the Center of the Point Set
Sariel Har-Peled, Mitchell Jones
We revisit an algorithm of Clarkson et…
On Separating Points by Lines
Sariel Har-Peled, Mitchell Jones
Given a set of points in the plane, its separability is the minimum number of lines needed to separate all its pairs of points from each other. We show that the minimum num…