Robotics Research Technical Report: Computing the Geodesic Center of a Simple Polygon (Classic Reprint) - Tapa blanda
Sinopsis
Excerpt from Robotics Research Technical Report: Computing the Geodesic Center of a Simple Polygon
The total time complexity of our algorithm is o(u log2u). The final stage (that of finding the smallest spanning circle of circles), which may be of independent interest in location theory, runs in time o(u log n log log n).
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 Geodesic Center of a Simple Polygon
The total time complexity of our algorithm is o(u log2u). The final stage (that of finding the smallest spanning circle of circles), which may be of independent interest in location theory, runs in time o(u log n log log n).
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 Geodesic Center of a Simple Polygon
Work on this paper by the first author has been supported by National Science Foundation Grant DMS-8501947. Work on this paper by the second author has been supported by Office of Naval Research Grant N00014-82-K-0381, National Science Foundation Grant No. NSF- DCR-83-20085, and by grants from the Digital Equipment Corporation, and the IBM Corporation. Part of the work on this paper has been carried out at the Workshop on Movable Separability of Sets at the Billairs Research Institute of McGill University, Barbados, Feb. 1986.
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.
Resultados de la búsqueda para Robotics Research Technical Report: Computing the Geodesic...
Imagen del vendedor
Robotics Research Technical Report (Classic Reprint)
Impresión bajo demandaLibrería: Forgotten Books, London, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Paperback. Condición: New. Print on Demand. This book introduces an algorithm designed to locate the geodesic center of a simple polygon, which is a point inside the polygon with the minimal maximum distance to any point within the polygon. This geodesic center problem is an expansion of the classic Euclidean facility location problem, where the objective is to find the point that minimizes the distance between the facility and the furthest point in a given set. The algorithm provided by the author calculates the geodesic center of a simple polygon in time O(n log2n), where n is the number of vertices in the polygon. This is an improvement over the existing algorithm by Asano and Toussaint, which achieves O(n4log n) time complexity. The book explores the geometric definitions of geodesic diameter and geodesic center, and explains how to compute the geodesic diameter of a given polygon using a method by Suri. It also discusses topics such as the link diameter and link center, P-convex sets, and shortest path trees within a polygon. The author presents a linear-time technique by Megiddo for linear programming in R2, which is utilized within the algorithm. By decomposing the problem into smaller subproblems and employing fast parallel algorithms, the author achieves efficient sequential optimization. Overall, this book provides a valuable contribution to the field of computational geometry, offering a practical algorithm for a complex problem and advancing the understanding of geodesic center computation. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Nº de ref. del artículo: 9781332115457_0
Comprar nuevo
EUR 15,05
Gastos de envío gratis
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Robotics Research Technical Report Computing the Geodesic Center of a Simple Polygon Classic Reprint
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332115457
Comprar nuevo
EUR 21,07
Gastos de envío gratis
Se envía dentro de Estados Unidos de America
Se envía dentro de Estados Unidos de America
Cantidad disponible: 15 disponibles
Imagen de archivo
Robotics Research Technical Report Computing the Geodesic Center of a Simple Polygon Classic Reprint
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332115457
Comprar nuevo
EUR 20,35
Envío por EUR 3,79
Se envía de Reino Unido a Estados Unidos de America
Se envía de Reino Unido a Estados Unidos de America
Cantidad disponible: 15 disponibles