|
Showing 1 - 2 of
2 matches in All Departments
This book constitutes the refereed proceedings of the 7th
International Workshop on Algorithms and Computation, WALCOM 2013,
held in Kharagpur, India, in February 2013. The 29 full papers
presented were carefully reviewed and selected from 86 submissions.
The papers are organized in topical sections on computational
geometry, approximation and randomized algorithms, parallel and
distributed computing, graph algorithms, complexity and bounds, and
graph drawing.
A human observer can effortlessly identify visible portions of
geometric objects present in the environment. However, computations
of visible portions of objects from a viewpoint involving thousands
of objects is a time consuming task even for high speed computers.
To solve such visibility problems, efficient algorithms have been
designed. This book presents some of these visibility algorithms in
two dimensions. Specifically, basic algorithms for point
visibility, weak visibility, shortest paths, visibility graphs,
link paths and visibility queries are all discussed. Several
geometric properties are also established through lemmas and
theorems. With over 300 figures and hundreds of exercises, this
book is ideal for graduate students and researchers in the field of
computational geometry. It will also be useful as a reference for
researchers working in algorithms, robotics, computer graphics and
geometric graph theory, and some algorithms from the book can be
used in a first course in computational geometry.
|
You may like...
Gloria
Sam Smith
CD
R407
Discovery Miles 4 070
Brightside
The Lumineers
CD
R194
R92
Discovery Miles 920
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
|