Edge insertion for optimal triangulations:
Abstract: "The edge-insertion paradigm improves a triangulation of a finite point set in R² iteratively by adding a new edge, deleting intersecting old edges, and retriangulating the resulting two polygonal regions. After presenting an abstract view of the paradigm, this paper shows that it can...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Urbana, Ill.
Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science
1992
|
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The edge-insertion paradigm improves a triangulation of a finite point set in R² iteratively by adding a new edge, deleting intersecting old edges, and retriangulating the resulting two polygonal regions. After presenting an abstract view of the paradigm, this paper shows that it can be used to obtain polynomial time algorithms for several types of optimal triangulations." |
| Beschreibung: | 16 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV035637338 | ||
| 003 | DE-604 | ||
| 005 | 20090728 | ||
| 007 | t | ||
| 008 | 090721s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)26221162 | ||
| 035 | |a (DE-599)GBV168782774 | ||
| 040 | |a DE-604 |b ger | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 082 | 0 | |a 510.78 |b I29r, no. 1722 | |
| 088 | |a UILU-ENG-92-1702 | ||
| 088 | |a UIUCDCS-R-92-1722 | ||
| 100 | 1 | |a Bern, M. |e Verfasser |0 (DE-588)122614836 |4 aut | |
| 245 | 1 | 0 | |a Edge insertion for optimal triangulations |c by M. Bern ; H. Edelsbrunner ; D. Eppstein [u.a.] |
| 246 | 1 | 3 | |a UIUCDCS R 92-1722 |
| 264 | 1 | |a Urbana, Ill. |b Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science |c 1992 | |
| 300 | |a 16 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 520 | 3 | |a Abstract: "The edge-insertion paradigm improves a triangulation of a finite point set in R² iteratively by adding a new edge, deleting intersecting old edges, and retriangulating the resulting two polygonal regions. After presenting an abstract view of the paradigm, this paper shows that it can be used to obtain polynomial time algorithms for several types of optimal triangulations." | |
| 650 | 4 | |a Geometry | |
| 650 | 4 | |a Triangulation | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-017692183 | ||
Datensatz im Suchindex
| _version_ | 1804139316436271104 |
|---|---|
| any_adam_object | |
| author | Bern, M. |
| author_GND | (DE-588)122614836 |
| author_facet | Bern, M. |
| author_role | aut |
| author_sort | Bern, M. |
| author_variant | m b mb |
| building | Verbundindex |
| bvnumber | BV035637338 |
| ctrlnum | (OCoLC)26221162 (DE-599)GBV168782774 |
| dewey-full | 510.78 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 510 - Mathematics |
| dewey-raw | 510.78 |
| dewey-search | 510.78 |
| dewey-sort | 3510.78 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01340nam a2200325 c 4500</leader><controlfield tag="001">BV035637338</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090728 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">090721s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26221162</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBV168782774</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">510.78</subfield><subfield code="b">I29r, no. 1722</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UILU-ENG-92-1702</subfield></datafield><datafield tag="088" ind1=" " ind2=" "><subfield code="a">UIUCDCS-R-92-1722</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bern, M.</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)122614836</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Edge insertion for optimal triangulations</subfield><subfield code="c">by M. Bern ; H. Edelsbrunner ; D. Eppstein [u.a.]</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">UIUCDCS R 92-1722</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Urbana, Ill.</subfield><subfield code="b">Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The edge-insertion paradigm improves a triangulation of a finite point set in R² iteratively by adding a new edge, deleting intersecting old edges, and retriangulating the resulting two polygonal regions. After presenting an abstract view of the paradigm, this paper shows that it can be used to obtain polynomial time algorithms for several types of optimal triangulations."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Geometry</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Triangulation</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-017692183</subfield></datafield></record></collection> |
| id | DE-604.BV035637338 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T21:42:09Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-017692183 |
| oclc_num | 26221162 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 16 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| publisher | Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science |
| record_format | marc |
| spelling | Bern, M. Verfasser (DE-588)122614836 aut Edge insertion for optimal triangulations by M. Bern ; H. Edelsbrunner ; D. Eppstein [u.a.] UIUCDCS R 92-1722 Urbana, Ill. Univ. of Illinois at Urbana-Champaign, Dept. of Computer Science 1992 16 S. txt rdacontent n rdamedia nc rdacarrier Abstract: "The edge-insertion paradigm improves a triangulation of a finite point set in R² iteratively by adding a new edge, deleting intersecting old edges, and retriangulating the resulting two polygonal regions. After presenting an abstract view of the paradigm, this paper shows that it can be used to obtain polynomial time algorithms for several types of optimal triangulations." Geometry Triangulation |
| spellingShingle | Bern, M. Edge insertion for optimal triangulations Geometry Triangulation |
| title | Edge insertion for optimal triangulations |
| title_alt | UIUCDCS R 92-1722 |
| title_auth | Edge insertion for optimal triangulations |
| title_exact_search | Edge insertion for optimal triangulations |
| title_full | Edge insertion for optimal triangulations by M. Bern ; H. Edelsbrunner ; D. Eppstein [u.a.] |
| title_fullStr | Edge insertion for optimal triangulations by M. Bern ; H. Edelsbrunner ; D. Eppstein [u.a.] |
| title_full_unstemmed | Edge insertion for optimal triangulations by M. Bern ; H. Edelsbrunner ; D. Eppstein [u.a.] |
| title_short | Edge insertion for optimal triangulations |
| title_sort | edge insertion for optimal triangulations |
| topic | Geometry Triangulation |
| topic_facet | Geometry Triangulation |
| work_keys_str_mv | AT bernm edgeinsertionforoptimaltriangulations AT bernm uiucdcsr921722 |