Daniel Leven

According to our database, Daniel Leven authored at least 9 papers between 1983 and 1987.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

1987

An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers.

Daniel Leven, Micha Sharir

J. Algorithms, 1987

On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal Space.

Daniel Leven, Micha Sharir

Discret. Comput. Geom., 1987

Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi Diagrams.

Daniel Leven, Micha Sharir

Discret. Comput. Geom., 1987

Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons.

Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan

Algorithmica, 1987

1986

Efficient algorithms for motion planning of robot systems amidst obstacles

Daniel Leven

PhD thesis, 1986

Geometric Applications of Davenport-Schinzel Sequences

Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple Polygons.

Leonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract).

Daniel Leven, Micha Sharir

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1983

NP Completeness of Finding the Chromatic Index of Regular Graphs.

Daniel Leven, Zvi Galil

J. Algorithms, 1983