Results 1  10
of
30
On multiple moving objects
 Algorithmica
, 1987
"... This paper explores the motion planning problem for multiple mov ing objects. The approach taken consists of assigning priorities to the objects, then planning motions one object at a time. For each moving object, the planner constructs a configuration spacetime that represents the timevarying co ..."
Abstract

Cited by 171 (0 self)
 Add to MetaCart
This paper explores the motion planning problem for multiple mov ing objects. The approach taken consists of assigning priorities to the objects, then planning motions one object at a time. For each moving object, the planner constructs a configuration spacetime that represents the timevarying constraints im posed on the moving object by the other moving and stationary objects. The planner represents this spacetime approximately, using twodimensional slices. The spacetime is then searched for a collisionfree path. The paper demonstrates this approach in two domains. One domain consists of translating planar objects; the other domain consists of twolink planar articulated arms.
Geometric Shortest Paths and Network Optimization
 Handbook of Computational Geometry
, 1998
"... Introduction A natural and wellstudied problem in algorithmic graph theory and network optimization is that of computing a "shortest path" between two nodes, s and t, in a graph whose edges have "weights" associated with them, and we consider the "length" of a path to be the sum of the weights of t ..."
Abstract

Cited by 147 (12 self)
 Add to MetaCart
Introduction A natural and wellstudied problem in algorithmic graph theory and network optimization is that of computing a "shortest path" between two nodes, s and t, in a graph whose edges have "weights" associated with them, and we consider the "length" of a path to be the sum of the weights of the edges that comprise it. Efficient algorithms are well known for this problem, as briefly summarized below. The shortest path problem takes on a new dimension when considered in a geometric domain. In contrast to graphs, where the encoding of edges is explicit, a geometric instance of a shortest path problem is usually specified by giving geometric objects that implicitly encode the graph and its edge weights. Our goal in devising efficient geometric algorithms is generally to avoid explicit construction of the entire underlying graph, since the full induced graph may be very large (even exponential in the input size, or infinite). Computing an optimal
Topologically Sweeping Visibility Complexes via Pseudotriangulations
, 1996
"... This paper describes a new algorithm for constructing the set of free bitangents of a collection of n disjoint convex obstacles of constant complexity. The algorithm runs in time O(n log n + k), where k is the output size, and uses O(n) space. While earlier algorithms achieve the same optimal run ..."
Abstract

Cited by 86 (9 self)
 Add to MetaCart
This paper describes a new algorithm for constructing the set of free bitangents of a collection of n disjoint convex obstacles of constant complexity. The algorithm runs in time O(n log n + k), where k is the output size, and uses O(n) space. While earlier algorithms achieve the same optimal running time, this is the first optimal algorithm that uses only linear space. The visibility graph or the visibility complex can be computed in the same time and space. The only complicated data structure used by the algorithm is a splittable queue, which can be implemented easily using redblack trees. The algorithm is conceptually very simple, and should therefore be easy to implement and quite fast in practice. The algorithm relies on greedy pseudotriangulations, which are subgraphs of the visibility graph with many nice combinatorial properties. These properties, and thus the correctness of the algorithm, are partially derived from properties of a certain partial order on the faces of th...
An Optimal Algorithm for Euclidean Shortest Paths in the Plane
 SIAM J. Comput
, 1997
"... We propose an optimaltime algorithm for a classical problem in plane computational geometry: computing a shortest path between two points in the presence of polygonal obstacles. Our algorithm runs in worstcase time O(n log n) and requires O(n log n) space, where n is the total number of vertice ..."
Abstract

Cited by 86 (1 self)
 Add to MetaCart
We propose an optimaltime algorithm for a classical problem in plane computational geometry: computing a shortest path between two points in the presence of polygonal obstacles. Our algorithm runs in worstcase time O(n log n) and requires O(n log n) space, where n is the total number of vertices in the obstacle polygons. The algorithm is based on an efficient implementation of wavefront propagation among polygonal obstacles, and it actually computes a planar map encoding shortest paths from a fixed source point to all other points of the plane; the map can be used to answer singlesource shortest path queries in O(logn) time. The time complexity of our algorithm is a significant improvement over all previously published results on the shortest path problem. Finally, we also discuss extensions to more general shortest path problems, involving nonpoint and multiple sources. 1 Introduction 1.1 The Background and Our Result The Euclidean shortest path problem is one of the o...
Computing the Visibility Graph via Pseudotriangulations
 In Proc. 11th Annu. ACM Sympos. Comput. Geom
, 1995
"... We show that the k free bitangents of a collection of n pairwise disjoint convex plane sets can be computed in time O(k+n log n) and O(n) working space. The algorithm uses only one advanced data structure, namely a splittable queue. We introduce (weakly) greedy pseudotriangulations, whose combinat ..."
Abstract

Cited by 31 (2 self)
 Add to MetaCart
We show that the k free bitangents of a collection of n pairwise disjoint convex plane sets can be computed in time O(k+n log n) and O(n) working space. The algorithm uses only one advanced data structure, namely a splittable queue. We introduce (weakly) greedy pseudotriangulations, whose combinatorial properties are crucial for our method. 1 Introduction Consider a collection O of pairwise disjoint convex objects in the plane. We are interested in problems in which these objects arise as obstacles, either in connection with visibility problems where they can block the view from an other geometric object, or in motion planning, where these objects may prevent a moving object from moving along a straight line path. The visibility graph is a central object in such contexts. For polygonal obstacles the vertices of these polygons are the nodes of the visibility graph, and two nodes are connected by an arc if the corresponding vertices can see each other. [9] describes the first nontriv...
Efficient Visibility Queries in Simple Polygons
"... We present a method of decomposing a simple polygon that allows the preprocessing of the polygon to efficiently answer visibility queries of various forms in an output sensitive manner. Using O(n3 log n) preprocessing time and O(n3) space, we can, given a query point q inside or outside an n verte ..."
Abstract

Cited by 24 (2 self)
 Add to MetaCart
We present a method of decomposing a simple polygon that allows the preprocessing of the polygon to efficiently answer visibility queries of various forms in an output sensitive manner. Using O(n3 log n) preprocessing time and O(n3) space, we can, given a query point q inside or outside an n vertex polygon, recover the visibility polygon of q in O(log n + k) time, where k is the size of the visibility polygon, and recover the number of vertices visible from q in O(log n) time. The key notion
Rectilinear Paths among Rectilinear Obstacles
 Discrete Applied Mathematics
, 1996
"... Given a set of obstacles and two distinguished points in the plane the problem of finding a collision free path subject to a certain optimization function is a fundamental problem that arises in many fields, such as motion planning in robotics, wire routing in VLSI and logistics in operations resear ..."
Abstract

Cited by 23 (3 self)
 Add to MetaCart
Given a set of obstacles and two distinguished points in the plane the problem of finding a collision free path subject to a certain optimization function is a fundamental problem that arises in many fields, such as motion planning in robotics, wire routing in VLSI and logistics in operations research. In this survey we emphasize its applications to VLSI design and limit ourselves to the rectilinear domain in which the goal path to be computed and the underlying obstacles are all rectilinearly oriented, i.e., the segments are either horizontal or vertical. We consider different routing environments, and various optimization criteria pertaining to VLSI design, and provide a survey of results that have been developed in the past, present current results and give open problems for future research. 1 Introduction Given a set of obstacles and two distinguished points in the plane, the problem of finding a collision free path subject to a certain optimization function is a fundamental probl...
Approximating Shortest Paths on a Nonconvex Polyhedron
 In Proc. 38th Annu. IEEE Sympos. Found. Comput. Sci
, 1997
"... We present an approximation algorithm that, given a simple, possibly nonconvex polyhedron P with n vertices in R 3 , and two points s and t on its surface @P , constructs a path on @P between s and t whose length is at most 7(1 + ")ae, where ae is the length of the shortest path between s and t ..."
Abstract

Cited by 21 (3 self)
 Add to MetaCart
We present an approximation algorithm that, given a simple, possibly nonconvex polyhedron P with n vertices in R 3 , and two points s and t on its surface @P , constructs a path on @P between s and t whose length is at most 7(1 + ")ae, where ae is the length of the shortest path between s and t on @P , and " ? 0 is an arbitararily small positive constant. The algorithm runs in O(n 5=3 log 5=3 n) time. We also present a slightly faster algorithm that runs in O(n 8=5 log 8=5 n) time and returns a path whose length is at most 15(1 + ")ae. Work on this paper has been supported by National Science Foundation Grant CCR9301259, by an Army Research Office MURI grant DAAH049610013, by a Sloan fellowship, by an NYI award, by matching funds from Xerox Corporation, and by a grant from the U.S.Israeli Binational Science Foundation. y Department of Computer Science, Box 90129, Duke University, krv@cs.duke.edu z Department of Computer Science, Box 90129, Duke University, pa...
A Computational Geometric Approach To Visual Hulls
, 1997
"... Recognizing 3D objects from their 2D silhouettes is a popular topic in computer vision. Object reconstruction can be performed using the volume intersection approach. The visual hull of an object is the best approximation of an object that can be obtained by volume intersection. From the point of vi ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
Recognizing 3D objects from their 2D silhouettes is a popular topic in computer vision. Object reconstruction can be performed using the volume intersection approach. The visual hull of an object is the best approximation of an object that can be obtained by volume intersection. From the point of view of recognition from silhouettes, the visual hull can not be distinguished from the original object. In this paper, we present efficient algorithms for computing visual hulls. We start with the case of planar figures (polygons and curved objects) and base our approach on an efficient algorithm for computing the visibility graph of planar figures. We present and tackle many topics related to the query of visual hulls and to the recognition of objects equal to their visual hulls. We then move on to the 3dimensional case and give a flavor of how it may be approached. Keywords: Object reconstruction, volume intersection, visual hulls, visibility graphs, visibility complexes 1. Introduction ...
Autonomous Vehicle Navigation Utilizing Electrostatic Potentional Fields and Fuzzy Logic
 IEEE Trans. Robotic. Autom
, 2001
"... for online handling of live objects, Part I: Analytical model, ” in ..."
Abstract

Cited by 15 (9 self)
 Add to MetaCart
for online handling of live objects, Part I: Analytical model, ” in