ALMOST RECTANGULAR TRIANGULATIONS
Triangulating quadrilaterals. A method includes accessing an irregular grid comprising a plurality of irregular quadrilaterals. A determination is made that each of the irregular quadrilaterals in the irregular grid is not a concave and is a convex quadrilateral. On a grid basis and as a result of d...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Patent |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | REDDISH ANDREW D BECKMAN BRIAN C |
| description | Triangulating quadrilaterals. A method includes accessing an irregular grid comprising a plurality of irregular quadrilaterals. A determination is made that each of the irregular quadrilaterals in the irregular grid is not a concave and is a convex quadrilateral. On a grid basis and as a result of determining that each of the irregular quadrilaterals in the irregular grid is not a concave and is a convex quadrilateral, each of the irregular quadrilaterals in the irregular grid is triangulated to create a triangular mesh by defining diagonals from at least one vertex point of each of the irregular quadrilaterals in the irregular grid to the diagonally opposed vertex point of the same irregular quadrilateral. The triangular mesh is stored in a computer readable storage medium that can be accessed by an application for performing tasks related to data visualization, computer graphics, computational geometry, etc. |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2010086208A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2010086208A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2010086208A13</originalsourceid><addsrcrecordid>eNrjZFB09PH1Dw5RCHJ1DnH0cw_1cQxSCAnyhDBDPP39gnkYWNMSc4pTeaE0N4Oym2uIs4duakF-fGpxQWJyal5qSXxosJGBoYGBhZmRgYWjoTFxqgDECiNu</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>ALMOST RECTANGULAR TRIANGULATIONS</title><source>esp@cenet</source><creator>REDDISH ANDREW D ; BECKMAN BRIAN C</creator><creatorcontrib>REDDISH ANDREW D ; BECKMAN BRIAN C</creatorcontrib><description>Triangulating quadrilaterals. A method includes accessing an irregular grid comprising a plurality of irregular quadrilaterals. A determination is made that each of the irregular quadrilaterals in the irregular grid is not a concave and is a convex quadrilateral. On a grid basis and as a result of determining that each of the irregular quadrilaterals in the irregular grid is not a concave and is a convex quadrilateral, each of the irregular quadrilaterals in the irregular grid is triangulated to create a triangular mesh by defining diagonals from at least one vertex point of each of the irregular quadrilaterals in the irregular grid to the diagonally opposed vertex point of the same irregular quadrilateral. The triangular mesh is stored in a computer readable storage medium that can be accessed by an application for performing tasks related to data visualization, computer graphics, computational geometry, etc.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; HANDLING RECORD CARRIERS ; PHYSICS ; PRESENTATION OF DATA ; RECOGNITION OF DATA ; RECORD CARRIERS</subject><creationdate>2010</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20100408&DB=EPODOC&CC=US&NR=2010086208A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76318</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20100408&DB=EPODOC&CC=US&NR=2010086208A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>REDDISH ANDREW D</creatorcontrib><creatorcontrib>BECKMAN BRIAN C</creatorcontrib><title>ALMOST RECTANGULAR TRIANGULATIONS</title><description>Triangulating quadrilaterals. A method includes accessing an irregular grid comprising a plurality of irregular quadrilaterals. A determination is made that each of the irregular quadrilaterals in the irregular grid is not a concave and is a convex quadrilateral. On a grid basis and as a result of determining that each of the irregular quadrilaterals in the irregular grid is not a concave and is a convex quadrilateral, each of the irregular quadrilaterals in the irregular grid is triangulated to create a triangular mesh by defining diagonals from at least one vertex point of each of the irregular quadrilaterals in the irregular grid to the diagonally opposed vertex point of the same irregular quadrilateral. The triangular mesh is stored in a computer readable storage medium that can be accessed by an application for performing tasks related to data visualization, computer graphics, computational geometry, etc.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>HANDLING RECORD CARRIERS</subject><subject>PHYSICS</subject><subject>PRESENTATION OF DATA</subject><subject>RECOGNITION OF DATA</subject><subject>RECORD CARRIERS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2010</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZFB09PH1Dw5RCHJ1DnH0cw_1cQxSCAnyhDBDPP39gnkYWNMSc4pTeaE0N4Oym2uIs4duakF-fGpxQWJyal5qSXxosJGBoYGBhZmRgYWjoTFxqgDECiNu</recordid><startdate>20100408</startdate><enddate>20100408</enddate><creator>REDDISH ANDREW D</creator><creator>BECKMAN BRIAN C</creator><scope>EVB</scope></search><sort><creationdate>20100408</creationdate><title>ALMOST RECTANGULAR TRIANGULATIONS</title><author>REDDISH ANDREW D ; BECKMAN BRIAN C</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2010086208A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2010</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>HANDLING RECORD CARRIERS</topic><topic>PHYSICS</topic><topic>PRESENTATION OF DATA</topic><topic>RECOGNITION OF DATA</topic><topic>RECORD CARRIERS</topic><toplevel>online_resources</toplevel><creatorcontrib>REDDISH ANDREW D</creatorcontrib><creatorcontrib>BECKMAN BRIAN C</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>REDDISH ANDREW D</au><au>BECKMAN BRIAN C</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>ALMOST RECTANGULAR TRIANGULATIONS</title><date>2010-04-08</date><risdate>2010</risdate><abstract>Triangulating quadrilaterals. A method includes accessing an irregular grid comprising a plurality of irregular quadrilaterals. A determination is made that each of the irregular quadrilaterals in the irregular grid is not a concave and is a convex quadrilateral. On a grid basis and as a result of determining that each of the irregular quadrilaterals in the irregular grid is not a concave and is a convex quadrilateral, each of the irregular quadrilaterals in the irregular grid is triangulated to create a triangular mesh by defining diagonals from at least one vertex point of each of the irregular quadrilaterals in the irregular grid to the diagonally opposed vertex point of the same irregular quadrilateral. The triangular mesh is stored in a computer readable storage medium that can be accessed by an application for performing tasks related to data visualization, computer graphics, computational geometry, etc.</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_epo_espacenet_US2010086208A1 |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING HANDLING RECORD CARRIERS PHYSICS PRESENTATION OF DATA RECOGNITION OF DATA RECORD CARRIERS |
| title | ALMOST RECTANGULAR TRIANGULATIONS |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T12%3A54%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=REDDISH%20ANDREW%20D&rft.date=2010-04-08&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2010086208A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |