: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
We propose a new randomized algorithm for maintaining a set of clusters among moving nodes in the plane. Given a specified cluster radius, our algorithm selects and maintains a va...
Jie Gao, Leonidas J. Guibas, John Hershberger, Li ...
Atheoreticalframeworkisintroducedfortheperceptionofspecularsurfacegeometry.Whenanobserver moves in three-dimensional space, real scene features such as surface markings remain stat...
Staffing and scheduling optimization in large multiskill call centers is time-consuming, mainly because it requires lengthy simulations to evaluate performance measures and their ...
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
Noga Alon, Dan Halperin, Oren Nechushtan, Micha Sh...