Computing Vision Points in Polygons
Abstract. We consider a restricted version of the art gallery problem within simple polygons in which the guards are required to lie on a given one-dimensional object, a watchman route. We call this problem the visionpointproblem . We prove the following: • The original art gallery problem is NP-har...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Carlsson, S. [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
1999 |
|---|
| Anmerkung: |
© Springer-Verlag New York Inc. 1999 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Algorithmica - Springer-Verlag, 1986, 24(1999), 1 vom: Mai, Seite 50-75 |
|---|---|
| Übergeordnetes Werk: |
volume:24 ; year:1999 ; number:1 ; month:05 ; pages:50-75 |
| Links: |
|---|
| DOI / URN: |
10.1007/PL00009271 |
|---|
| Katalog-ID: |
OLC2054833185 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2054833185 | ||
| 003 | DE-627 | ||
| 005 | 20230403073907.0 | ||
| 007 | tu | ||
| 008 | 200819s1999 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/PL00009271 |2 doi | |
| 035 | |a (DE-627)OLC2054833185 | ||
| 035 | |a (DE-He213)PL00009271-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q VZ |
| 082 | 0 | 4 | |a 510 |a 004 |q VZ |
| 100 | 1 | |a Carlsson, S. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Computing Vision Points in Polygons |
| 264 | 1 | |c 1999 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer-Verlag New York Inc. 1999 | ||
| 520 | |a Abstract. We consider a restricted version of the art gallery problem within simple polygons in which the guards are required to lie on a given one-dimensional object, a watchman route. We call this problem the visionpointproblem . We prove the following: • The original art gallery problem is NP-hard for the very restricted class of street polygons. • The vision point problem can be solved efficiently for the class of street polygons. • A linear time algorithm for the vision point problem exists for the subclass of street polygons called straightwalkable polygons. | ||
| 700 | 1 | |a Nilsson, B. J. |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Algorithmica |d Springer-Verlag, 1986 |g 24(1999), 1 vom: Mai, Seite 50-75 |w (DE-627)129197564 |w (DE-600)53958-2 |w (DE-576)014456958 |x 0178-4617 |7 nnns |
| 773 | 1 | 8 | |g volume:24 |g year:1999 |g number:1 |g month:05 |g pages:50-75 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/PL00009271 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_11 | ||
| 912 | |a GBV_ILN_20 | ||
| 912 | |a GBV_ILN_22 | ||
| 912 | |a GBV_ILN_24 | ||
| 912 | |a GBV_ILN_30 | ||
| 912 | |a GBV_ILN_31 | ||
| 912 | |a GBV_ILN_32 | ||
| 912 | |a GBV_ILN_65 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_105 | ||
| 912 | |a GBV_ILN_110 | ||
| 912 | |a GBV_ILN_130 | ||
| 912 | |a GBV_ILN_2004 | ||
| 912 | |a GBV_ILN_2006 | ||
| 912 | |a GBV_ILN_2012 | ||
| 912 | |a GBV_ILN_2015 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_2020 | ||
| 912 | |a GBV_ILN_2021 | ||
| 912 | |a GBV_ILN_2045 | ||
| 912 | |a GBV_ILN_2190 | ||
| 912 | |a GBV_ILN_2244 | ||
| 912 | |a GBV_ILN_4036 | ||
| 912 | |a GBV_ILN_4266 | ||
| 912 | |a GBV_ILN_4277 | ||
| 912 | |a GBV_ILN_4306 | ||
| 912 | |a GBV_ILN_4307 | ||
| 912 | |a GBV_ILN_4313 | ||
| 912 | |a GBV_ILN_4318 | ||
| 912 | |a GBV_ILN_4319 | ||
| 912 | |a GBV_ILN_4323 | ||
| 951 | |a AR | ||
| 952 | |d 24 |j 1999 |e 1 |c 05 |h 50-75 | ||
| author_variant |
s c sc b j n bj bjn |
|---|---|
| matchkey_str |
article:01784617:1999----::optnvsopit |
| hierarchy_sort_str |
1999 |
| publishDate |
1999 |
| allfields |
10.1007/PL00009271 doi (DE-627)OLC2054833185 (DE-He213)PL00009271-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Carlsson, S. verfasserin aut Computing Vision Points in Polygons 1999 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1999 Abstract. We consider a restricted version of the art gallery problem within simple polygons in which the guards are required to lie on a given one-dimensional object, a watchman route. We call this problem the visionpointproblem . We prove the following: • The original art gallery problem is NP-hard for the very restricted class of street polygons. • The vision point problem can be solved efficiently for the class of street polygons. • A linear time algorithm for the vision point problem exists for the subclass of street polygons called straightwalkable polygons. Nilsson, B. J. aut Enthalten in Algorithmica Springer-Verlag, 1986 24(1999), 1 vom: Mai, Seite 50-75 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:24 year:1999 number:1 month:05 pages:50-75 https://doi.org/10.1007/PL00009271 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_32 GBV_ILN_65 GBV_ILN_70 GBV_ILN_105 GBV_ILN_110 GBV_ILN_130 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2012 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2045 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 AR 24 1999 1 05 50-75 |
| spelling |
10.1007/PL00009271 doi (DE-627)OLC2054833185 (DE-He213)PL00009271-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Carlsson, S. verfasserin aut Computing Vision Points in Polygons 1999 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1999 Abstract. We consider a restricted version of the art gallery problem within simple polygons in which the guards are required to lie on a given one-dimensional object, a watchman route. We call this problem the visionpointproblem . We prove the following: • The original art gallery problem is NP-hard for the very restricted class of street polygons. • The vision point problem can be solved efficiently for the class of street polygons. • A linear time algorithm for the vision point problem exists for the subclass of street polygons called straightwalkable polygons. Nilsson, B. J. aut Enthalten in Algorithmica Springer-Verlag, 1986 24(1999), 1 vom: Mai, Seite 50-75 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:24 year:1999 number:1 month:05 pages:50-75 https://doi.org/10.1007/PL00009271 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_32 GBV_ILN_65 GBV_ILN_70 GBV_ILN_105 GBV_ILN_110 GBV_ILN_130 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2012 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2045 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 AR 24 1999 1 05 50-75 |
| allfields_unstemmed |
10.1007/PL00009271 doi (DE-627)OLC2054833185 (DE-He213)PL00009271-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Carlsson, S. verfasserin aut Computing Vision Points in Polygons 1999 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1999 Abstract. We consider a restricted version of the art gallery problem within simple polygons in which the guards are required to lie on a given one-dimensional object, a watchman route. We call this problem the visionpointproblem . We prove the following: • The original art gallery problem is NP-hard for the very restricted class of street polygons. • The vision point problem can be solved efficiently for the class of street polygons. • A linear time algorithm for the vision point problem exists for the subclass of street polygons called straightwalkable polygons. Nilsson, B. J. aut Enthalten in Algorithmica Springer-Verlag, 1986 24(1999), 1 vom: Mai, Seite 50-75 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:24 year:1999 number:1 month:05 pages:50-75 https://doi.org/10.1007/PL00009271 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_32 GBV_ILN_65 GBV_ILN_70 GBV_ILN_105 GBV_ILN_110 GBV_ILN_130 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2012 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2045 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 AR 24 1999 1 05 50-75 |
| allfieldsGer |
10.1007/PL00009271 doi (DE-627)OLC2054833185 (DE-He213)PL00009271-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Carlsson, S. verfasserin aut Computing Vision Points in Polygons 1999 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1999 Abstract. We consider a restricted version of the art gallery problem within simple polygons in which the guards are required to lie on a given one-dimensional object, a watchman route. We call this problem the visionpointproblem . We prove the following: • The original art gallery problem is NP-hard for the very restricted class of street polygons. • The vision point problem can be solved efficiently for the class of street polygons. • A linear time algorithm for the vision point problem exists for the subclass of street polygons called straightwalkable polygons. Nilsson, B. J. aut Enthalten in Algorithmica Springer-Verlag, 1986 24(1999), 1 vom: Mai, Seite 50-75 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:24 year:1999 number:1 month:05 pages:50-75 https://doi.org/10.1007/PL00009271 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_32 GBV_ILN_65 GBV_ILN_70 GBV_ILN_105 GBV_ILN_110 GBV_ILN_130 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2012 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2045 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 AR 24 1999 1 05 50-75 |
| allfieldsSound |
10.1007/PL00009271 doi (DE-627)OLC2054833185 (DE-He213)PL00009271-p DE-627 ger DE-627 rakwb eng 004 VZ 510 004 VZ Carlsson, S. verfasserin aut Computing Vision Points in Polygons 1999 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag New York Inc. 1999 Abstract. We consider a restricted version of the art gallery problem within simple polygons in which the guards are required to lie on a given one-dimensional object, a watchman route. We call this problem the visionpointproblem . We prove the following: • The original art gallery problem is NP-hard for the very restricted class of street polygons. • The vision point problem can be solved efficiently for the class of street polygons. • A linear time algorithm for the vision point problem exists for the subclass of street polygons called straightwalkable polygons. Nilsson, B. J. aut Enthalten in Algorithmica Springer-Verlag, 1986 24(1999), 1 vom: Mai, Seite 50-75 (DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 0178-4617 nnns volume:24 year:1999 number:1 month:05 pages:50-75 https://doi.org/10.1007/PL00009271 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_32 GBV_ILN_65 GBV_ILN_70 GBV_ILN_105 GBV_ILN_110 GBV_ILN_130 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2012 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2045 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 AR 24 1999 1 05 50-75 |
| language |
English |
| source |
Enthalten in Algorithmica 24(1999), 1 vom: Mai, Seite 50-75 volume:24 year:1999 number:1 month:05 pages:50-75 |
| sourceStr |
Enthalten in Algorithmica 24(1999), 1 vom: Mai, Seite 50-75 volume:24 year:1999 number:1 month:05 pages:50-75 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Algorithmica |
| authorswithroles_txt_mv |
Carlsson, S. @@aut@@ Nilsson, B. J. @@aut@@ |
| publishDateDaySort_date |
1999-05-01T00:00:00Z |
| hierarchy_top_id |
129197564 |
| dewey-sort |
14 |
| id |
OLC2054833185 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2054833185</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403073907.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1999 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/PL00009271</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054833185</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)PL00009271-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Carlsson, S.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computing Vision Points in Polygons</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1999</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag New York Inc. 1999</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract. We consider a restricted version of the art gallery problem within simple polygons in which the guards are required to lie on a given one-dimensional object, a watchman route. We call this problem the visionpointproblem . We prove the following: • The original art gallery problem is NP-hard for the very restricted class of street polygons. • The vision point problem can be solved efficiently for the class of street polygons. • A linear time algorithm for the vision point problem exists for the subclass of street polygons called straightwalkable polygons.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nilsson, B. J.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Algorithmica</subfield><subfield code="d">Springer-Verlag, 1986</subfield><subfield code="g">24(1999), 1 vom: Mai, Seite 50-75</subfield><subfield code="w">(DE-627)129197564</subfield><subfield code="w">(DE-600)53958-2</subfield><subfield code="w">(DE-576)014456958</subfield><subfield code="x">0178-4617</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:24</subfield><subfield code="g">year:1999</subfield><subfield code="g">number:1</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:50-75</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/PL00009271</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2045</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">24</subfield><subfield code="j">1999</subfield><subfield code="e">1</subfield><subfield code="c">05</subfield><subfield code="h">50-75</subfield></datafield></record></collection>
|
| author |
Carlsson, S. |
| spellingShingle |
Carlsson, S. ddc 004 ddc 510 Computing Vision Points in Polygons |
| authorStr |
Carlsson, S. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129197564 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0178-4617 |
| topic_title |
004 VZ 510 004 VZ Computing Vision Points in Polygons |
| topic |
ddc 004 ddc 510 |
| topic_unstemmed |
ddc 004 ddc 510 |
| topic_browse |
ddc 004 ddc 510 |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Algorithmica |
| hierarchy_parent_id |
129197564 |
| dewey-tens |
000 - Computer science, knowledge & systems 510 - Mathematics |
| hierarchy_top_title |
Algorithmica |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129197564 (DE-600)53958-2 (DE-576)014456958 |
| title |
Computing Vision Points in Polygons |
| ctrlnum |
(DE-627)OLC2054833185 (DE-He213)PL00009271-p |
| title_full |
Computing Vision Points in Polygons |
| author_sort |
Carlsson, S. |
| journal |
Algorithmica |
| journalStr |
Algorithmica |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 500 - Science |
| recordtype |
marc |
| publishDateSort |
1999 |
| contenttype_str_mv |
txt |
| container_start_page |
50 |
| author_browse |
Carlsson, S. Nilsson, B. J. |
| container_volume |
24 |
| class |
004 VZ 510 004 VZ |
| format_se |
Aufsätze |
| author-letter |
Carlsson, S. |
| doi_str_mv |
10.1007/PL00009271 |
| dewey-full |
004 510 |
| title_sort |
computing vision points in polygons |
| title_auth |
Computing Vision Points in Polygons |
| abstract |
Abstract. We consider a restricted version of the art gallery problem within simple polygons in which the guards are required to lie on a given one-dimensional object, a watchman route. We call this problem the visionpointproblem . We prove the following: • The original art gallery problem is NP-hard for the very restricted class of street polygons. • The vision point problem can be solved efficiently for the class of street polygons. • A linear time algorithm for the vision point problem exists for the subclass of street polygons called straightwalkable polygons. © Springer-Verlag New York Inc. 1999 |
| abstractGer |
Abstract. We consider a restricted version of the art gallery problem within simple polygons in which the guards are required to lie on a given one-dimensional object, a watchman route. We call this problem the visionpointproblem . We prove the following: • The original art gallery problem is NP-hard for the very restricted class of street polygons. • The vision point problem can be solved efficiently for the class of street polygons. • A linear time algorithm for the vision point problem exists for the subclass of street polygons called straightwalkable polygons. © Springer-Verlag New York Inc. 1999 |
| abstract_unstemmed |
Abstract. We consider a restricted version of the art gallery problem within simple polygons in which the guards are required to lie on a given one-dimensional object, a watchman route. We call this problem the visionpointproblem . We prove the following: • The original art gallery problem is NP-hard for the very restricted class of street polygons. • The vision point problem can be solved efficiently for the class of street polygons. • A linear time algorithm for the vision point problem exists for the subclass of street polygons called straightwalkable polygons. © Springer-Verlag New York Inc. 1999 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_24 GBV_ILN_30 GBV_ILN_31 GBV_ILN_32 GBV_ILN_65 GBV_ILN_70 GBV_ILN_105 GBV_ILN_110 GBV_ILN_130 GBV_ILN_2004 GBV_ILN_2006 GBV_ILN_2012 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2045 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4266 GBV_ILN_4277 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4318 GBV_ILN_4319 GBV_ILN_4323 |
| container_issue |
1 |
| title_short |
Computing Vision Points in Polygons |
| url |
https://doi.org/10.1007/PL00009271 |
| remote_bool |
false |
| author2 |
Nilsson, B. J. |
| author2Str |
Nilsson, B. J. |
| ppnlink |
129197564 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/PL00009271 |
| up_date |
2024-07-04T00:32:55.683Z |
| _version_ |
1803606478760706048 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2054833185</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230403073907.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1999 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/PL00009271</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2054833185</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)PL00009271-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Carlsson, S.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computing Vision Points in Polygons</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1999</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag New York Inc. 1999</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract. We consider a restricted version of the art gallery problem within simple polygons in which the guards are required to lie on a given one-dimensional object, a watchman route. We call this problem the visionpointproblem . We prove the following: • The original art gallery problem is NP-hard for the very restricted class of street polygons. • The vision point problem can be solved efficiently for the class of street polygons. • A linear time algorithm for the vision point problem exists for the subclass of street polygons called straightwalkable polygons.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Nilsson, B. J.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Algorithmica</subfield><subfield code="d">Springer-Verlag, 1986</subfield><subfield code="g">24(1999), 1 vom: Mai, Seite 50-75</subfield><subfield code="w">(DE-627)129197564</subfield><subfield code="w">(DE-600)53958-2</subfield><subfield code="w">(DE-576)014456958</subfield><subfield code="x">0178-4617</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:24</subfield><subfield code="g">year:1999</subfield><subfield code="g">number:1</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:50-75</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/PL00009271</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_30</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2045</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4277</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">24</subfield><subfield code="j">1999</subfield><subfield code="e">1</subfield><subfield code="c">05</subfield><subfield code="h">50-75</subfield></datafield></record></collection>
|
| score |
7.402767 |