000			02064nam a22003138i 4500
001			CR9780511543340
003			UkCbUP
005			20170526205637.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			090505s2007||||enk o ||1 0|eng|d
020			_a9780511543340 (ebook)
020			_z9780521875745 (hardback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aTA1634 _b.G485 2007
082	0	0	_a006.37 _222
100	1		_aGhosh, Subir Kumar, _eauthor.
245	1	0	_aVisibility Algorithms in the Plane / _cSubir Kumar Ghosh.
264		1	_aCambridge : _bCambridge University Press, _c2007.
300			_a1 online resource (332 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
500			_aTitle from publisher's bibliographic system (viewed on 28 Feb 2017).
520			_aA 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.
650		0	_aComputer vision
776	0	8	_iPrint version: _z9780521875745
856	4	0	_uhttps://doi.org/10.1017/CBO9780511543340
999			_c123952 _d123952