Results 1  10
of
122,439
Facility Location and the Geometric MinimumDiameter Spanning Tree
, 2003
"... Let P be a set of n points in the plane. The geometric minimumdiameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono or a dipolar MDST, i.e. a MDST with one or two nodes of degree greater 1, respecti ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Let P be a set of n points in the plane. The geometric minimumdiameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono or a dipolar MDST, i.e. a MDST with one or two nodes of degree greater 1
Approximating the Geometric MinimumDiameter Spanning Tree
 Institut für Mathematik und Informatik, Universität Greifswald
, 2002
"... Let P be a set of n points in the plane. The geometric minimumdiameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono or a dipolar MDST, i.e. a MDST whose longest path consists of two or three edges, ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Let P be a set of n points in the plane. The geometric minimumdiameter spanning tree (MDST) of P is a tree that spans P and minimizes the Euclidian length of the longest path. It is known that there is always a mono or a dipolar MDST, i.e. a MDST whose longest path consists of two or three edges
Approximating the Geometric Minimum Diameter Spanning Tree
 15 th Canadian Conference on Computational Geometry
, 2003
"... Given a set P of points in the plane, a geometric minimumdiameter spanning tree (GMDST) of P is a spanning tree of P such that the longest path through the tree is minimized. In this paper, we present an approximation algorithm that generates a tree whose diameter is no more than (1 + ɛ) times that ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Given a set P of points in the plane, a geometric minimumdiameter spanning tree (GMDST) of P is a spanning tree of P such that the longest path through the tree is minimized. In this paper, we present an approximation algorithm that generates a tree whose diameter is no more than (1 + ɛ) times
Computing a (1 + ffl)Approximate Geometric MinimumDiameter Spanning Tree
, 2003
"... Abstract Given a set P of points in the plane, a geometric minimumdiameter spanning tree (GMDST)of P is a spanning tree of P such that the longest path through the tree is minimized. Forseveral years, the best upper bound on the time to compute a GMDST was cubic with respect to the number of points ..."
Abstract
 Add to MetaCart
Abstract Given a set P of points in the plane, a geometric minimumdiameter spanning tree (GMDST)of P is a spanning tree of P such that the longest path through the tree is minimized. Forseveral years, the best upper bound on the time to compute a GMDST was cubic with respect to the number
Computing a (1+ɛ)approximate geometric minimumdiameter spanning tree. Private communication
, 2002
"... Given a set P of points in the plane, a geometric minimumdiameter spanning tree (GMDST) of P is a spanning tree of P such that the longest path through the tree is minimized. For several years, the best upper bound on the time to compute a GMDST was cubic with respect to the number of points in the ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Given a set P of points in the plane, a geometric minimumdiameter spanning tree (GMDST) of P is a spanning tree of P such that the longest path through the tree is minimized. For several years, the best upper bound on the time to compute a GMDST was cubic with respect to the number of points
unknown title
"... Abstract Given a set P of points in the plane, a geometricminimumdiameter spanning tree (GMDST) of P is aspanning tree of P such that the longest path throughthe tree is minimized. In this paper, we present an approximation algorithm that generates a tree whose diameter is no more than (1 + s^) ti ..."
Abstract
 Add to MetaCart
between two points of P as the Euclidean (L2) distance between the points. Compute a spanning tree of P such that the longest path through the tree between any two points is minimized. This tree is known as a geometric minimum diameter spanning tree (GMDST) of the point set. In the most efficient known
ON FINDING MINIMUMDIAMETER CLIQUE TREES
 NORDIC JOURNAL OF COMPUTING 1(1994), 173–201.
, 1994
"... A cliquetree representation of a chordal graph often reduces the size of the data structure needed to store the graph, permitting the use of extremely efficient algorithms that take advantage of the compactness of the representation. Since some chordal graphs have many distinct cliquetree represen ..."
On finding minimumdiameter clique trees
 Nordic Journal of Computing
, 1991
"... Research was supported by the Applied Mathematical Sciences Research Program of the Office of Energy Reseaxch, U.S. Department of Energy. Prepared by the ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Research was supported by the Applied Mathematical Sciences Research Program of the Office of Energy Reseaxch, U.S. Department of Energy. Prepared by the
On the Construction of EnergyEfficient Broadcast and Multicast Trees in Wireless Networks
, 2000
"... wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil ..."
Abstract

Cited by 554 (13 self)
 Add to MetaCart
wieselthier @ itd.nrl.navy.mil nguyen @ itd.nrl.navy.mil
A Tutorial on Visual Servo Control
 IEEE Transactions on Robotics and Automation
, 1996
"... This paper provides a tutorial introduction to visual servo control of robotic manipulators. Since the topic spans many disciplines our goal is limited to providing a basic conceptual framework. We begin by reviewing the prerequisite topics from robotics and computer vision, including a brief review ..."
Abstract

Cited by 822 (25 self)
 Add to MetaCart
This paper provides a tutorial introduction to visual servo control of robotic manipulators. Since the topic spans many disciplines our goal is limited to providing a basic conceptual framework. We begin by reviewing the prerequisite topics from robotics and computer vision, including a brief
Results 1  10
of
122,439