Computing the minimum covering circle of a set of discs:
Abstract: "We present an algorithm to compute the minimum covering circle of n circular discs. The algorithm runs in O(n log n) time and uses O(n) space. the algorithm is conceptually easy and should perform quite well in practice."
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Kingston, Ontario, Canada
1989
|
| Schriftenreihe: | Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report
249 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "We present an algorithm to compute the minimum covering circle of n circular discs. The algorithm runs in O(n log n) time and uses O(n) space. the algorithm is conceptually easy and should perform quite well in practice." |
| Beschreibung: | 7 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010657213 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960315s1989 |||| 00||| engod | ||
| 035 | |a (OCoLC)20977664 | ||
| 035 | |a (DE-599)BVBBV010657213 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Rappaport, David H. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computing the minimum covering circle of a set of discs |c David Rappaport |
| 264 | 1 | |a Kingston, Ontario, Canada |c 1989 | |
| 300 | |a 7 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report |v 249 | |
| 520 | 3 | |a Abstract: "We present an algorithm to compute the minimum covering circle of n circular discs. The algorithm runs in O(n log n) time and uses O(n) space. the algorithm is conceptually easy and should perform quite well in practice." | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Geometry | |
| 810 | 2 | |a Department of Computing and Information Science: Technical report |t Queen's University <Kingston, Ontario> |v 249 |w (DE-604)BV010020284 |9 249 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007113643 | ||
Datensatz im Suchindex
| _version_ | 1804125136224256000 |
|---|---|
| any_adam_object | |
| author | Rappaport, David H. |
| author_facet | Rappaport, David H. |
| author_role | aut |
| author_sort | Rappaport, David H. |
| author_variant | d h r dh dhr |
| building | Verbundindex |
| bvnumber | BV010657213 |
| ctrlnum | (OCoLC)20977664 (DE-599)BVBBV010657213 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01228nam a2200289 cb4500</leader><controlfield tag="001">BV010657213</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960315s1989 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20977664</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010657213</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Rappaport, David H.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computing the minimum covering circle of a set of discs</subfield><subfield code="c">David Rappaport</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Kingston, Ontario, Canada</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">7 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report</subfield><subfield code="v">249</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We present an algorithm to compute the minimum covering circle of n circular discs. The algorithm runs in O(n log n) time and uses O(n) space. the algorithm is conceptually easy and should perform quite well in practice."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometry</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computing and Information Science: Technical report</subfield><subfield code="t">Queen's University <Kingston, Ontario></subfield><subfield code="v">249</subfield><subfield code="w">(DE-604)BV010020284</subfield><subfield code="9">249</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007113643</subfield></datafield></record></collection> |
| id | DE-604.BV010657213 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:56:45Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007113643 |
| oclc_num | 20977664 |
| open_access_boolean | |
| physical | 7 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report |
| spelling | Rappaport, David H. Verfasser aut Computing the minimum covering circle of a set of discs David Rappaport Kingston, Ontario, Canada 1989 7 S. txt rdacontent n rdamedia nc rdacarrier Queen's University <Kingston, Ontario> / Department of Computing and Information Science: Technical report 249 Abstract: "We present an algorithm to compute the minimum covering circle of n circular discs. The algorithm runs in O(n log n) time and uses O(n) space. the algorithm is conceptually easy and should perform quite well in practice." Algorithms Geometry Department of Computing and Information Science: Technical report Queen's University <Kingston, Ontario> 249 (DE-604)BV010020284 249 |
| spellingShingle | Rappaport, David H. Computing the minimum covering circle of a set of discs Algorithms Geometry |
| title | Computing the minimum covering circle of a set of discs |
| title_auth | Computing the minimum covering circle of a set of discs |
| title_exact_search | Computing the minimum covering circle of a set of discs |
| title_full | Computing the minimum covering circle of a set of discs David Rappaport |
| title_fullStr | Computing the minimum covering circle of a set of discs David Rappaport |
| title_full_unstemmed | Computing the minimum covering circle of a set of discs David Rappaport |
| title_short | Computing the minimum covering circle of a set of discs |
| title_sort | computing the minimum covering circle of a set of discs |
| topic | Algorithms Geometry |
| topic_facet | Algorithms Geometry |
| volume_link | (DE-604)BV010020284 |
| work_keys_str_mv | AT rappaportdavidh computingtheminimumcoveringcircleofasetofdiscs |