Yahoo! JAPAN

検索設定 - この検索結果ページについて

Unobstructed shortest paths in polyhedral environments で検索した結果 1~10件目 / 約47,500件 - 0.37秒

ウェブ

  1. On Shortest Paths in Polyhedral Spaces | SIAM Journal on ...
    (2015) Querying visible points in large obstructed space. GeoInformatica 19:3, 435-461. ... Paths, 231-309. (2010) Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. ... V3-97-V3-100. (2010) An Optimal- Time Algorithm for Shortest Paths on Realistic Polyhedra. .... (1997) Environment representation using enclosed obstacles and minimum- ...
    epubs.siam.org/doi/abs/10.1137/0215014
  2. New Results on Shortest Paths in Three Dimensions - Applied ...
    cles in the plane, shortest paths in a polyhedral domain need not lie on a ..... is the construction of a planar L1-shortest path in a polygonal environment, which ..... the (purple/medium gray) type I q-rectangle R2, unobstructed. In contrast, the  ...
    www.ams.sunysb.edu/~jsbm/papers/p166-mitchell.pdf
  3. Approximating Shortest Paths on a Nonconvex Polyhedron
    Computing a shortest path on a polyhedral surface is a central problem in numerous areas, including ...... 3] V. Akman, Unobstructed Shortest Paths in Polyhedral Environments, Lecture Notes in Computer Sci- ence, vol. 251 ...
    www.cs.duke.edu/~pankaj/publications/.../terr-short.pdf
  4. Shortest paths in the plane with polygonal obstacles
    mozlev's problem allows the object to be moved to consist of a collection of polyhedra freely linked together at various ... algorithm for finding shortest paths in the plane is to construct a graph containing one vertex for each obstacle vertex .... provides a simple machine independent environment in which to study practical constructive computational geomet~ ..... obstructed by ...
    users.cs.duke.edu/~reif/paper/.../shotestpathplane.pdf
  5. Deriving an Obstacle-Avoiding Shortest Path in Continuous Space ...
    path in continuous space has been referred to as Euclidean shortest path (ESP), and attracted the attention ..... performance of the convexpath algorithm in a high density obstacle environment. Although convexpath .... Unobstructed travel is often assumed in most continuous space location models. Obstacles/barriers ...... A reduction result for location problems with  ...
    repository.asu.edu/.../Hong_asu_0010E_14943.pdf
  6. Efficient Energy Flight Path Planning Algorithm Using 3-D ... - Hindawi
    Reif and Storer [32] proposed the algorithm for finding the shortest path in the 3-D environment in a single exponential ... The line of sight checking algorithm considers an obstacle as a convex polyhedron Ω consisting a set of ...
    www.hindawi.com/journals/ijae/2017/2849745/
  7. Pursuit Evasion on Polyhedral Surfaces - UCSB Computer Science
    “straight line” shortest paths in the unobstructed planar arena to geodesics on the polyhedral surface; in the ... The geometric environment for our pursuit-evasion problem is the (closed) surface of a 3-dimensional polyhedron ...
    sites.cs.ucsb.edu/~suri/psdir/isaac13Pursuit.pdf
  8. ANY-ANGLE PATH PLANNING by Alex Nash A Dissertation ...
    find-path algorithms to be both longer and less realistic looking than the true shortest paths (that is, the shortest paths in ..... tices is unobstructed. ...... type of regular polyhedron can be used to tessellate a continuous 3D environment, namely.
    idm-lab.org/bib/abstracts/papers/dissertation-nash.pdf
  9. Geodesic Methods in Computer Vision and Graphics - Now Publishers
    geodesic curves (local length minimizers) and shortest paths (global ... infinite number of shortest paths between two antipodal points on a sphere. Full text available ..... [3] V. Akman, Unobstructed Shortest Paths in Polyhedral Environments.
    www.nowpublishers.com/article/.../CGV-029
  1  2  3  4  5  6  7  8  9  10  次へ »
検索設定 - この検索結果ページについて

Copyright (C) 2019 Yahoo Japan Corporation. All Rights Reserved.