Daniel Leven - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 10 from 10

1987

Linear-Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple PolygonsLeonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan. algorithmica, 2:209-233, 1987.

An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal BarriersDaniel Leven, Micha Sharir. jal, 8(2):192-215, 1987.

Planning a Purely Translational Motion for a Convex Object in Two-Dimensional Space Using Generalized Voronoi DiagramsDaniel Leven, Micha Sharir. dcg, 2:9-31, 1987.

On the Number of Critical Free Contacts of a Convex Polygonal Object Moving in Two-Dimensional Polygonal SpaceDaniel Leven, Micha Sharir. dcg, 2:255-270, 1987.

1986

Linear Time Algorithms for Visibility and Shortest Path Problems Inside Simple PolygonsLeonidas J. Guibas, John Hershberger, Daniel Leven, Micha Sharir, Robert Endre Tarjan. compgeom 1986: 1-13 [doi]

Efficient algorithms for motion planning of robot systems amidst obstaclesDaniel Leven. PhD thesis, Tel Aviv University, Israel, 1986. [doi]

Geometric Applications of Davenport-Schinzel SequencesMicha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony. focs 1986: 77-86

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. compgeom 1985: 221-227 [doi]

1983

NP Completeness of Finding the Chromatic Index of Regular GraphsDaniel Leven, Zvi Galil. jal, 4(1):35-44, 1983.

1980

Alternating sequential/parallel versions of the simplex algorithmYehuda Wallach, Daniel Leven. jsa, 6(4):237-242, 1980. [doi]

Sign in or sign up to see more results.

runs on WebDSL