Home › Books › Computing external-farthest neighbors for a simple polygon
Computing external-farthest neighbors for a simple polygon Buy on Amazon

https://www.ebooknetworking.net/books_detail-B00XKVI69S.html

Computing external-farthest neighbors for a simple polygon

AuthorPankaj K. Agarwal
PublisherLeopold Classic Library
Shop on Amazon — choose your country
🇺🇸 USA 🇨🇦 Canada 🇬🇧 UK 🇩🇪 Germany 🇫🇷 France 🇮🇳 India
9.95 USD
Buy New on Amazon 🇺🇸

Book Details

Author(s)Pankaj K. Agarwal
PublisherLeopold Classic Library
ISBN / ASINB00XKVI69S
ISBN-13978B00XKVI699
MarketplaceUnited States  🇺🇸

More Books by Pankaj K. Agarwal

Intersection and Decomposition Algorithms for Planar Arrangements
Intersection and Decomposition Algorithms for Planar A…
View
Intersection and Decomposition Algorithms for Planar Arrangements
Intersection and Decomposition Algorithms for Planar A…
View
Financial Management
Financial Management
View
New York University, Dept. of Computer Science. Ray shooting and other applications of spanning trees with low stabbing number. Tehnical Report No. 448, Robotics Report No. 199, may 1989
New York University, Dept. of Computer Science. Ray sh…
View
Robotics Research. Tecnical Report No. 477. Robotics Report No. 198, May 1989. Partitioning arrangements of lines: II. Aplications
Robotics Research. Tecnical Report No. 477. Robotics R…
View
Partitioning arrangements of lines: I. An efficient deterministic algorithm; Technical report No. 446, Roboties report No. 197, May, 1989
Partitioning arrangements of lines: I. An efficient de…
View
Donate to EbookNetworking
Prev
Next