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...

Celý popis

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 115; číslo 9; s. 649 - 654
Hlavní autori:	Alipour, Sharareh, Ghodsi, Mohammad, Zarei, Alireza, Pourreza, Maryam
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.09.2015 Elsevier Sequoia S.A
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!