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

Saved in:

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!

Abstract	•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 approximation algorithm for VCP.•We present our experimental results. For a set of n disjoint line segments S in R2, the visibility testing problem (VTP) is to test whether the query point p sees a query segment s∈S. For this configuration, the visibility counting problem (VCP) is to preprocess S such that the number of visible segments in S from any query point p can be computed quickly. In this paper, we solve VTP in expected logarithmic query time using quadratic preprocessing time and space. Moreover, we propose a (1+δ)-approximation algorithm for VCP using at most quadratic preprocessing time and space. The query time of this method is Oϵ(1δ2n) where Oϵ(f(n))=O(f(n)nϵ) and ϵ>0 is an arbitrary constant number.
AbstractList	•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 approximation algorithm for VCP.•We present our experimental results. For a set of n disjoint line segments S in R2, the visibility testing problem (VTP) is to test whether the query point p sees a query segment s∈S. For this configuration, the visibility counting problem (VCP) is to preprocess S such that the number of visible segments in S from any query point p can be computed quickly. In this paper, we solve VTP in expected logarithmic query time using quadratic preprocessing time and space. Moreover, we propose a (1+δ)-approximation algorithm for VCP using at most quadratic preprocessing time and space. The query time of this method is Oϵ(1δ2n) where Oϵ(f(n))=O(f(n)nϵ) and ϵ>0 is an arbitrary constant number. For a set of n disjoint line segments S in R..., the visibility testing problem (VTP) is to test whether the query point p sees a query segment s...S. For this configuration, the visibility counting problem (VCP) is to preprocess S such that the number of visible segments in S from any query point p can be computed quickly. This paper solves VTP in expected logarithmic query time using quadratic preprocessing time and space. Moreover, we propose a (1+d)-approximation algorithm for VCP using at most quadratic preprocessing time and space. The query time of this method is ... where ...(f(n))=O(f(n)n...) and ...>0 is an arbitrary constant number. (ProQuest: ... denotes formulae/symbols omitted.)
Author	Alipour, Sharareh Ghodsi, Mohammad Pourreza, Maryam Zarei, Alireza
Author_xml	– sequence: 1 givenname: Sharareh surname: Alipour fullname: Alipour, Sharareh email: shalipour@ce.sharif.edu organization: Sharif University of Technology, Iran – sequence: 2 givenname: Mohammad surname: Ghodsi fullname: Ghodsi, Mohammad email: Ghodsi@sharif.edu organization: Sharif University of Technology, Institute for Research in Fundamental Sciences (IPM), Iran – sequence: 3 givenname: Alireza surname: Zarei fullname: Zarei, Alireza email: zarei@sharif.ir organization: Sharif University of Technology, Iran – sequence: 4 givenname: Maryam surname: Pourreza fullname: Pourreza, Maryam email: pourreza@ce.sharif.ir organization: Sharif University of Technology, Iran
BookMark	eNp9kE1LAzEQhoNUsK3-AE8WPO86k2Szu3iSYlUoeFGvIc1mJcua1CQV-u9NqScPPQ0D7zMfz4xMnHeGkGuEEgHF3VDa7VhSwKoEVgK0Z2SKTU0LgdhOyBSAQgHYwgWZxTgAgOCsnpKbDxvtxo427RfJxGTd50K5bqH9zh2aS3LeqzGaq786J--rx7flc7F-fXpZPqwLzWiVClr1pgesldKKUSM0rypAzTcKDaqm10L3YtNBrVXTMaGAq7qlHFnXtFgBY3Nye5y7Df57lw-Rg98Fl1dKFI3gvEHW5hQeUzr4GIPp5TbYLxX2EkEePMhBZg_y4EECk9lDZup_jLZJJetdCsqOJ8n7I2ny4z_WBBm1NU6bzgajk-y8PUH_ApyIeFQ
CODEN	IFPLAT
CitedBy_id	crossref_primary_10_1016_j_tcs_2019_01_035 crossref_primary_10_1155_2016_6340856
Cites_doi	10.1137/0220055 10.1007/s00454-001-0089-9 10.1016/j.comgeo.2012.10.004 10.1016/S0925-7721(01)00070-0 10.1142/S0218195996000204
ContentType	Journal Article
Copyright	2015 Elsevier B.V. Copyright Elsevier Sequoia S.A. Sep 2015
Copyright_xml	– notice: 2015 Elsevier B.V. – notice: Copyright Elsevier Sequoia S.A. Sep 2015
DBID	AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/j.ipl.2015.03.009
DatabaseName	CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1872-6119
EndPage	654
ExternalDocumentID	3707604181 10_1016_j_ipl_2015_03_009 S0020019015000484
Genre	Feature
GroupedDBID	--K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 E.L EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HMJ HVGLF HZ~ IHE J1W KOM LG9 M26 M41 MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SEW SME SPC SPCBC SSV SSZ T5K TN5 UQL WH7 WUQ XPP ZMT ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD AFXIZ AGCQF AGRNS JQ2 L7M L~C L~D SSH
ID	FETCH-LOGICAL-c325t-25fef017aaca32e6c45501c4ba1e1a8fc6cf6bd07ca8d36a04a792413d8915033
ISICitedReferencesCount	3
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000356751100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0020-0190
IngestDate	Mon Jul 14 09:18:29 EDT 2025 Tue Nov 18 22:25:53 EST 2025 Sat Nov 29 03:44:21 EST 2025 Fri Feb 23 02:16:27 EST 2024
IsPeerReviewed	true
IsScholarly	true
Issue	9
Keywords	Computational geometry Visibility Randomized algorithm Approximation algorithm
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c325t-25fef017aaca32e6c45501c4ba1e1a8fc6cf6bd07ca8d36a04a792413d8915033
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14
PQID	1686448139
PQPubID	45522
PageCount	6
ParticipantIDs	proquest_journals_1686448139 crossref_primary_10_1016_j_ipl_2015_03_009 crossref_citationtrail_10_1016_j_ipl_2015_03_009 elsevier_sciencedirect_doi_10_1016_j_ipl_2015_03_009
PublicationCentury	2000
PublicationDate	September 2015 2015-09-00 20150901
PublicationDateYYYYMMDD	2015-09-01
PublicationDate_xml	– month: 09 year: 2015 text: September 2015
PublicationDecade	2010
PublicationPlace	Amsterdam
PublicationPlace_xml	– name: Amsterdam
PublicationTitle	Information processing letters
PublicationYear	2015
Publisher	Elsevier B.V Elsevier Sequoia S.A
Publisher_xml	– name: Elsevier B.V – name: Elsevier Sequoia S.A
References	Asano (br0010) 1985; 68 Ghosh (br0130) 2007 Fischer, Hilbig, Jähn, auf der Heide, Ziegler (br0050) Zarei, Ghodsi (br0110) 2005 Fischer, Hilbig, Jähn, Meyer auf der Heide, Ziegler (br0060) 2009 Ghosh, Mount (br0070) 1991; 20 Vegter (br0030) 1990; vol. 447 Bose, Lubiw, Munro (br0090) 2002; 23 Aronov, Guibas, Teichmann, 0001 (br0080) 2002; 27 Suri, O'Rourke (br0020) 1986 Baygi, Ghodsi (br0150) 2013; 46 Gudmundsson, Morin (br0040) 2010 Pocchiola (br0160) 1990; vol. 447 Pocchiola, Vegter (br0100) 1996; 6 Chen, Wang (br0120) 2013; vol. 8037 Alipour, Zarei (br0140) 2011 Chen (10.1016/j.ipl.2015.03.009_br0120) 2013; vol. 8037 Gudmundsson (10.1016/j.ipl.2015.03.009_br0040) 2010 Ghosh (10.1016/j.ipl.2015.03.009_br0070) 1991; 20 Ghosh (10.1016/j.ipl.2015.03.009_br0130) 2007 Bose (10.1016/j.ipl.2015.03.009_br0090) 2002; 23 Fischer (10.1016/j.ipl.2015.03.009_br0060) 2009 Vegter (10.1016/j.ipl.2015.03.009_br0030) 1990; vol. 447 Asano (10.1016/j.ipl.2015.03.009_br0010) 1985; 68 Suri (10.1016/j.ipl.2015.03.009_br0020) 1986 Zarei (10.1016/j.ipl.2015.03.009_br0110) 2005 Pocchiola (10.1016/j.ipl.2015.03.009_br0100) 1996; 6 Pocchiola (10.1016/j.ipl.2015.03.009_br0160) 1990; vol. 447 Aronov (10.1016/j.ipl.2015.03.009_br0080) 2002; 27 Baygi (10.1016/j.ipl.2015.03.009_br0150) 2013; 46 Alipour (10.1016/j.ipl.2015.03.009_br0140) 2011 Fischer (10.1016/j.ipl.2015.03.009_br0050)
References_xml	– volume: 20 start-page: 888 year: 1991 end-page: 910 ident: br0070 article-title: An output-sensitive algorithm for computing visibility publication-title: SIAM J. Comput. – start-page: 314 year: 2005 end-page: 320 ident: br0110 article-title: Efficient computation of query point visibility in polygons with holes publication-title: Symposium on Computational Geometry – start-page: 343 year: 2011 end-page: 351 ident: br0140 article-title: Visibility testing and counting publication-title: Proceedings of the 5th Joint International Frontiers in Algorithmics, and 7th International Conference on Algorithmic Aspects in Information and Management – volume: vol. 447 start-page: 85 year: 1990 end-page: 96 ident: br0160 article-title: Graphics in flatland revisited publication-title: SWAT 90 – volume: 6 start-page: 279 year: 1996 end-page: 308 ident: br0100 article-title: The visibility complex publication-title: Int. J. Comput. Geom. Appl. – start-page: 14 year: 1986 end-page: 23 ident: br0020 article-title: Worst-case optimal algorithms for constructing visibility polygons with holes publication-title: Proceedings of the Second Annual Symposium on Computational Geometry – volume: vol. 8037 start-page: 244 year: 2013 end-page: 255 ident: br0120 article-title: Visibility and ray shooting queries in polygonal domains publication-title: Algorithms and Data Structures – volume: 68 start-page: 557 year: 1985 end-page: 589 ident: br0010 article-title: An efficient algorithm for finding the visibility polygon for a polygonal region with holes publication-title: IEICE Trans. (1976–1990) – volume: 23 start-page: 313 year: 2002 end-page: 335 ident: br0090 article-title: Efficient visibility queries in simple polygons publication-title: Comput. Geom. Theory Appl. – year: 2007 ident: br0130 article-title: Visibility Algorithms in the Plane – volume: 46 start-page: 371 year: 2013 end-page: 381 ident: br0150 article-title: Space/query-time tradeoff for computing the visibility polygon publication-title: Comput. Geom. – start-page: 203 year: 2009 end-page: 206 ident: br0060 article-title: Planar visibility counting publication-title: Proc. 25th European Workshop on Computational Geometry – volume: vol. 447 start-page: 97 year: 1990 end-page: 110 ident: br0030 article-title: The visibility diagram: a data structure for visibility problems and motion planning publication-title: SWAT – volume: 27 start-page: 461 year: 2002 end-page: 483 ident: br0080 article-title: Visibility queries and maintenance in simple polygons publication-title: Discrete Comput. Geom. – ident: br0050 article-title: Planar visibility counting – start-page: 77 year: 2010 end-page: 86 ident: br0040 article-title: Planar visibility: testing and counting publication-title: Symposium on Computational Geometry – volume: 20 start-page: 888 issue: 5 year: 1991 ident: 10.1016/j.ipl.2015.03.009_br0070 article-title: An output-sensitive algorithm for computing visibility publication-title: SIAM J. Comput. doi: 10.1137/0220055 – ident: 10.1016/j.ipl.2015.03.009_br0050 – volume: 27 start-page: 461 issue: 4 year: 2002 ident: 10.1016/j.ipl.2015.03.009_br0080 article-title: Visibility queries and maintenance in simple polygons publication-title: Discrete Comput. Geom. doi: 10.1007/s00454-001-0089-9 – start-page: 314 year: 2005 ident: 10.1016/j.ipl.2015.03.009_br0110 article-title: Efficient computation of query point visibility in polygons with holes – volume: vol. 8037 start-page: 244 year: 2013 ident: 10.1016/j.ipl.2015.03.009_br0120 article-title: Visibility and ray shooting queries in polygonal domains – year: 2007 ident: 10.1016/j.ipl.2015.03.009_br0130 – volume: 46 start-page: 371 issue: 3 year: 2013 ident: 10.1016/j.ipl.2015.03.009_br0150 article-title: Space/query-time tradeoff for computing the visibility polygon publication-title: Comput. Geom. doi: 10.1016/j.comgeo.2012.10.004 – start-page: 14 year: 1986 ident: 10.1016/j.ipl.2015.03.009_br0020 article-title: Worst-case optimal algorithms for constructing visibility polygons with holes – volume: vol. 447 start-page: 85 year: 1990 ident: 10.1016/j.ipl.2015.03.009_br0160 article-title: Graphics in flatland revisited – volume: 68 start-page: 557 issue: 9 year: 1985 ident: 10.1016/j.ipl.2015.03.009_br0010 article-title: An efficient algorithm for finding the visibility polygon for a polygonal region with holes publication-title: IEICE Trans. (1976–1990) – start-page: 77 year: 2010 ident: 10.1016/j.ipl.2015.03.009_br0040 article-title: Planar visibility: testing and counting – volume: 23 start-page: 313 issue: 3 year: 2002 ident: 10.1016/j.ipl.2015.03.009_br0090 article-title: Efficient visibility queries in simple polygons publication-title: Comput. Geom. Theory Appl. doi: 10.1016/S0925-7721(01)00070-0 – volume: 6 start-page: 279 issue: 3 year: 1996 ident: 10.1016/j.ipl.2015.03.009_br0100 article-title: The visibility complex publication-title: Int. J. Comput. Geom. Appl. doi: 10.1142/S0218195996000204 – volume: vol. 447 start-page: 97 year: 1990 ident: 10.1016/j.ipl.2015.03.009_br0030 article-title: The visibility diagram: a data structure for visibility problems and motion planning – start-page: 343 year: 2011 ident: 10.1016/j.ipl.2015.03.009_br0140 article-title: Visibility testing and counting – start-page: 203 year: 2009 ident: 10.1016/j.ipl.2015.03.009_br0060 article-title: Planar visibility counting
SSID	ssj0006437
Score	2.0841498
Snippet	•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... For a set of n disjoint line segments S in R..., the visibility testing problem (VTP) is to test whether the query point p sees a query segment s...S. For this...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	649
SubjectTerms	Algorithms Approximation algorithm Computational geometry Computer science Information processing Mathematical problems Quadratic programming Randomized algorithm Studies Test methods Visibility
Title	Visibility testing and counting
URI	https://dx.doi.org/10.1016/j.ipl.2015.03.009 https://www.proquest.com/docview/1686448139
Volume	115
WOSCitedRecordID	wos000356751100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6119 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: AIEXJ dateStart: 19950113 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9tAEF5VgUMvQCmIZ_Ghp0pGXr_We4wQ0KIWcaAot9V6vRZGiWMlAQG_ntlnolSgcuBiJdZ6Y-98mR3PzDeD0PeqKtIkLUmIszINwf6Pw7LKeQjquCYyIzTTzWBufpPLy2IwoFc23Xaq2wmQti0eH2n3oaKGcyBsRZ19h7j9pHACPoPQ4Qhih-N_Cf6msRmvYFeqEhqWhOiaQixao5aLpCHQGcaAGj7UFB9vbPeHTQc_rP2kqrzzRHoX8vntuJrqfIA_41s-GvHKO6JhWGMYNKBUn73yv1I-R_hueUJPfLTod8CZT6ya8wBUSptp9ul1qeFmWtDQBc2Ym8qkdpPNTeXof_S3cSXcHTedCgvhzBSgpfPNygXol_Ywn1noktbuGEzB1BQsSpimeK7EJKNFD630f50OLvx2rSKXJg_IPI4LfeskwKX7eM14WdrGtW1yvYHW7EtF0Ddg-II-yXYTrbuGHYHV31_R0RwbgcVGANgIHDa20N-z0-uTn6HtkBGKJM5mYZzVsgadyrngSSxzoTjqWKQlxxLzoha5qPOyiojgRZXkPEo5oSqSWhUUqwD2Nuq141buoEBxlCNS45JiCaMwr0sK5rFMOE1lTeguityjM2HLx6suJkP26pLvoh_-ks7UTnlrcOrWk1njzxh1DLDx1mUHbu2Z_RNOGc4L5XaAl5u999zCPvo8B_oB6s0m9_IQrYqHWTOdfLO4eQHzGINm
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Visibility+testing+and+counting&rft.jtitle=Information+processing+letters&rft.au=Alipour%2C+Sharareh&rft.au=Ghodsi%2C+Mohammad&rft.au=Zarei%2C+Alireza&rft.au=Pourreza%2C+Maryam&rft.date=2015-09-01&rft.issn=0020-0190&rft.volume=115&rft.issue=9&rft.spage=649&rft.epage=654&rft_id=info:doi/10.1016%2Fj.ipl.2015.03.009&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ipl_2015_03_009
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon