Search Sciweavers | Sciweavers

19

COMPGEOM
2006
ACM

147views Discrete Geometry» more COMPGEOM 2006»

An optimal-time algorithm for shortest paths on a convex polytope in three dimensions

14 years 1 months ago

We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a ﬁxed source s on the surface of a convex polytope P in three dime...

Yevgeny Schreiber, Micha Sharir

claim paper

Read More »

23

click to vote

IROS
2006
IEEE

143views Robotics» more IROS 2006»

3D Field D: Improved Path Planning and Replanning in Three Dimensions

14 years 1 months ago

Download www.ri.cmu.edu

— We present an interpolation-based planning and replanning algorithm that is able to produce direct, lowcost paths through three-dimensional environments. Our algorithm builds u...

Joseph Carsten, Dave Ferguson, Anthony Stentz

claim paper

Read More »

27

click to vote

EJC
2008

113views Information Technology» more EJC 2008»

Constructive characterizations of 3-connected matroids of path width three

13 years 6 months ago

Download beavs.net

A matroid M is sequential or has path width 3 if M is 3-connected and its ground set has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . ...

Brian Beavers, James Oxley

claim paper

Read More »

21

click to vote

EJC
2007

89views Information Technology» more EJC 2007»

The structure of 3-connected matroids of path width three

13 years 7 months ago

Download www.math.lsu.edu

A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a sequential ordering, that is, an ordering (e1, e2, . . . , en) such that ({e1, e2, . . . , ek...

Rhiannon Hall, James G. Oxley, Charles Semple

claim paper

Read More »

19

click to vote

SOFSEM
2010
Springer

157views Theoretical Computer Science» more SOFSEM 2010»

A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks

14 years 4 months ago