Visibility testing and counting

•Given a set of n disjoint line segments and a segment s, we consider 2 problems.•Visibility testing problem is to check whether a given point p is visible to s.•Visibility counting problem is to count the number of segments visible from p.•We give a new randomized algorithm for VTP and an approxima...

Full description

Bibliographic Details

Published in:	Information processing letters Vol. 115; no. 9; pp. 649 - 654
Main Authors:	Alipour, Sharareh, Ghodsi, Mohammad, Zarei, Alireza, Pourreza, Maryam
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.09.2015 Elsevier Sequoia S.A
Subjects:	Algorithms Approximation algorithm Computational geometry Computer science Information processing Mathematical problems Quadratic programming Randomized algorithm Studies Test methods Visibility Computational geometry Visibility Randomized algorithm Approximation algorithm
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!