Robotics Research Technical Report: Computing the Link Center of a Simple Polygon (Classic Reprint) - Tapa blanda

Lenhart, W.

 
9781332115464: Robotics Research Technical Report: Computing the Link Center of a Simple Polygon (Classic Reprint)

Sinopsis

Excerpt from Robotics Research Technical Report: Computing the Link Center of a Simple Polygon

This paper concerns itself with analysis and calculation of the link center of a simple planar polygon P having n sides. The notion of a link distance between two points x, y inside P has been recently introduced in [sul]; it is defined as the smallest number of links (i.s. Straight segments) in a polygonal path connecting x and y within P, and is a useful metric for path planning within P when straight motion is easy to accomplish but turns are expensive.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

"Sinopsis" puede pertenecer a otra edición de este libro.

Reseña del editor

Excerpt from Robotics Research Technical Report: Computing the Link Center of a Simple Polygon

This paper concerns itself with analysis and calculation of the link center of a simple planar polygon P having n sides. The notion of a link distance between two points x, y inside P has been recently introduced in [sul]; it is defined as the smallest number of links (i.s. Straight segments) in a polygonal path connecting x and y within P, and is a useful metric for path planning within P when straight motion is easy to accomplish but turns are expensive.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

Reseña del editor

Excerpt from Robotics Research Technical Report: Computing the Link Center of a Simple Polygon

The link center of a simple polygon P is the set of points x inside P at which the maximal link-distance from x to any other point in P is minimized. Here the link distance between two points x,y inside P is defined to be the smallest number of straight edges in a polygonal path inside P connecting x to y. We also give an 0{n log n) algorithm for finding a point x in an approximate link center, namely the maximal link distance from x to any point in P is at most one more than the value attained from the link center.

This paper concerns itself with analysis and calculation of the link center of a simple planar polygon P having n sides. The notion of a link distance between two points x,y inside P has been recently introduced in [Sul]; it is defined as the smallest number of 'links" (i.e. straight segments) in a polygonal path connecting x and y within P, and is a useful metric for path planning within P when straight motion is easy to accomplish but turns are expensive.

About the Publisher

Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com

This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.

"Sobre este título" puede pertenecer a otra edición de este libro.

Otras ediciones populares con el mismo título

9780656023271: Robotics Research Technical Report: Computing the Link Center of a Simple Polygon (Classic Reprint)

Edición Destacada

ISBN 10:  0656023279 ISBN 13:  9780656023271
Editorial: Forgotten Books, 2019
Tapa dura