Multiresolution indexing of triangulated irregular networks
We show how to build a continuous, one-dimensional index of the points on a triangulated irregular network (TIN). The index is constructed by first finding an ordering of the triangles in which consecutive triangles share a vertex or an edge. Then, the space within each triangle is continuously inde...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on visualization and computer graphics 2004-07, Vol.10 (4), p.484-495 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 495 |
|---|---|
| container_issue | 4 |
| container_start_page | 484 |
| container_title | IEEE transactions on visualization and computer graphics |
| container_volume | 10 |
| creator | Bartholdi, J.J. Goldsman, P. |
| description | We show how to build a continuous, one-dimensional index of the points on a triangulated irregular network (TIN). The index is constructed by first finding an ordering of the triangles in which consecutive triangles share a vertex or an edge. Then, the space within each triangle is continuously indexed with a space-filling curve that begins at one vertex of the triangle and ends at another. The space-filling curve is oriented such that the first point in each triangle is a vertex shared with the previous triangle and the last point is a vertex shared with the next triangle. Furthermore, our index can be refined locally and, therefore, efficiently when the TIN is augmented by filling any face with another TIN (to make a hierarchical TIN). Such processes arise, for example, in the elaboration of detail on a graphical surface. |
| doi_str_mv | 10.1109/TVCG.2004.14 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_miscellaneous_28390721</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1298805</ieee_id><sourcerecordid>28390721</sourcerecordid><originalsourceid>FETCH-LOGICAL-c365t-d9b54f302eeea2218a8735ace333424b524ad8f3e0342213d3b228e551745c2c3</originalsourceid><addsrcrecordid>eNqF0M9LwzAUwPEgis7pzZsgxYMnO19-NQmeZPgLFC_Ta8ja1xHt2pm0qP-9LRsMvHjKC_nwIF9CTihMKAVzNXub3k8YgJhQsUNG1AiagoRst59BqZRlLDsghzG-A1AhtNknB1RLZYySI3L93FWtDxibqmt9Uye-LvDb14ukKZM2eFcvusq1WCQ-BBzmkNTYfjXhIx6RvdJVEY8355i83t3Opg_p08v94_TmKc15Jtu0MHMpSg4MER1jVDutuHQ5cs4FE3PJhCt0yRH6K6O84HPGNEpJlZA5y_mYXKz3rkLz2WFs7dLHHKvK1dh00WaKgzKa_guZ5gYUG-D5H_jedKHuP2G1FqAzyqBHl2uUhybGgKVdBb904cdSsEN6O6S3Q3pLRc_PNju7-RKLLd607sHpGvg-xPaZGa1B8l8gDoZI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>884086120</pqid></control><display><type>article</type><title>Multiresolution indexing of triangulated irregular networks</title><source>IEEE Electronic Library (IEL)</source><creator>Bartholdi, J.J. ; Goldsman, P.</creator><creatorcontrib>Bartholdi, J.J. ; Goldsman, P.</creatorcontrib><description>We show how to build a continuous, one-dimensional index of the points on a triangulated irregular network (TIN). The index is constructed by first finding an ordering of the triangles in which consecutive triangles share a vertex or an edge. Then, the space within each triangle is continuously indexed with a space-filling curve that begins at one vertex of the triangle and ends at another. The space-filling curve is oriented such that the first point in each triangle is a vertex shared with the previous triangle and the last point is a vertex shared with the next triangle. Furthermore, our index can be refined locally and, therefore, efficiently when the TIN is augmented by filling any face with another TIN (to make a hierarchical TIN). Such processes arise, for example, in the elaboration of detail on a graphical surface.</description><identifier>ISSN: 1077-2626</identifier><identifier>EISSN: 1941-0506</identifier><identifier>DOI: 10.1109/TVCG.2004.14</identifier><identifier>PMID: 18579975</identifier><identifier>CODEN: ITVGEA</identifier><language>eng</language><publisher>United States: IEEE</publisher><subject>Algorithms ; Computer Graphics ; Filling ; Geographic Information Systems ; hierarchical triangulation ; Image Enhancement - methods ; Image Interpretation, Computer-Assisted - methods ; Imaging, Three-Dimensional - methods ; Indexing ; Information retrieval ; multiresolution triangulation ; Rendering (computer graphics) ; Signal Processing, Computer-Assisted ; space-filling curve ; spatial index ; Spatial indexes ; Spatial resolution ; Strips ; Tin ; triangle mesh ; Triangulated irregular network</subject><ispartof>IEEE transactions on visualization and computer graphics, 2004-07, Vol.10 (4), p.484-495</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2004</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c365t-d9b54f302eeea2218a8735ace333424b524ad8f3e0342213d3b228e551745c2c3</citedby><cites>FETCH-LOGICAL-c365t-d9b54f302eeea2218a8735ace333424b524ad8f3e0342213d3b228e551745c2c3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1298805$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1298805$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/18579975$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Bartholdi, J.J.</creatorcontrib><creatorcontrib>Goldsman, P.</creatorcontrib><title>Multiresolution indexing of triangulated irregular networks</title><title>IEEE transactions on visualization and computer graphics</title><addtitle>TVCG</addtitle><addtitle>IEEE Trans Vis Comput Graph</addtitle><description>We show how to build a continuous, one-dimensional index of the points on a triangulated irregular network (TIN). The index is constructed by first finding an ordering of the triangles in which consecutive triangles share a vertex or an edge. Then, the space within each triangle is continuously indexed with a space-filling curve that begins at one vertex of the triangle and ends at another. The space-filling curve is oriented such that the first point in each triangle is a vertex shared with the previous triangle and the last point is a vertex shared with the next triangle. Furthermore, our index can be refined locally and, therefore, efficiently when the TIN is augmented by filling any face with another TIN (to make a hierarchical TIN). Such processes arise, for example, in the elaboration of detail on a graphical surface.</description><subject>Algorithms</subject><subject>Computer Graphics</subject><subject>Filling</subject><subject>Geographic Information Systems</subject><subject>hierarchical triangulation</subject><subject>Image Enhancement - methods</subject><subject>Image Interpretation, Computer-Assisted - methods</subject><subject>Imaging, Three-Dimensional - methods</subject><subject>Indexing</subject><subject>Information retrieval</subject><subject>multiresolution triangulation</subject><subject>Rendering (computer graphics)</subject><subject>Signal Processing, Computer-Assisted</subject><subject>space-filling curve</subject><subject>spatial index</subject><subject>Spatial indexes</subject><subject>Spatial resolution</subject><subject>Strips</subject><subject>Tin</subject><subject>triangle mesh</subject><subject>Triangulated irregular network</subject><issn>1077-2626</issn><issn>1941-0506</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><sourceid>EIF</sourceid><recordid>eNqF0M9LwzAUwPEgis7pzZsgxYMnO19-NQmeZPgLFC_Ta8ja1xHt2pm0qP-9LRsMvHjKC_nwIF9CTihMKAVzNXub3k8YgJhQsUNG1AiagoRst59BqZRlLDsghzG-A1AhtNknB1RLZYySI3L93FWtDxibqmt9Uye-LvDb14ukKZM2eFcvusq1WCQ-BBzmkNTYfjXhIx6RvdJVEY8355i83t3Opg_p08v94_TmKc15Jtu0MHMpSg4MER1jVDutuHQ5cs4FE3PJhCt0yRH6K6O84HPGNEpJlZA5y_mYXKz3rkLz2WFs7dLHHKvK1dh00WaKgzKa_guZ5gYUG-D5H_jedKHuP2G1FqAzyqBHl2uUhybGgKVdBb904cdSsEN6O6S3Q3pLRc_PNju7-RKLLd607sHpGvg-xPaZGa1B8l8gDoZI</recordid><startdate>200407</startdate><enddate>200407</enddate><creator>Bartholdi, J.J.</creator><creator>Goldsman, P.</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>RIA</scope><scope>RIE</scope><scope>CGR</scope><scope>CUY</scope><scope>CVF</scope><scope>ECM</scope><scope>EIF</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7X8</scope></search><sort><creationdate>200407</creationdate><title>Multiresolution indexing of triangulated irregular networks</title><author>Bartholdi, J.J. ; Goldsman, P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c365t-d9b54f302eeea2218a8735ace333424b524ad8f3e0342213d3b228e551745c2c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Algorithms</topic><topic>Computer Graphics</topic><topic>Filling</topic><topic>Geographic Information Systems</topic><topic>hierarchical triangulation</topic><topic>Image Enhancement - methods</topic><topic>Image Interpretation, Computer-Assisted - methods</topic><topic>Imaging, Three-Dimensional - methods</topic><topic>Indexing</topic><topic>Information retrieval</topic><topic>multiresolution triangulation</topic><topic>Rendering (computer graphics)</topic><topic>Signal Processing, Computer-Assisted</topic><topic>space-filling curve</topic><topic>spatial index</topic><topic>Spatial indexes</topic><topic>Spatial resolution</topic><topic>Strips</topic><topic>Tin</topic><topic>triangle mesh</topic><topic>Triangulated irregular network</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bartholdi, J.J.</creatorcontrib><creatorcontrib>Goldsman, P.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>Medline</collection><collection>MEDLINE</collection><collection>MEDLINE (Ovid)</collection><collection>MEDLINE</collection><collection>MEDLINE</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>MEDLINE - Academic</collection><jtitle>IEEE transactions on visualization and computer graphics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bartholdi, J.J.</au><au>Goldsman, P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multiresolution indexing of triangulated irregular networks</atitle><jtitle>IEEE transactions on visualization and computer graphics</jtitle><stitle>TVCG</stitle><addtitle>IEEE Trans Vis Comput Graph</addtitle><date>2004-07</date><risdate>2004</risdate><volume>10</volume><issue>4</issue><spage>484</spage><epage>495</epage><pages>484-495</pages><issn>1077-2626</issn><eissn>1941-0506</eissn><coden>ITVGEA</coden><abstract>We show how to build a continuous, one-dimensional index of the points on a triangulated irregular network (TIN). The index is constructed by first finding an ordering of the triangles in which consecutive triangles share a vertex or an edge. Then, the space within each triangle is continuously indexed with a space-filling curve that begins at one vertex of the triangle and ends at another. The space-filling curve is oriented such that the first point in each triangle is a vertex shared with the previous triangle and the last point is a vertex shared with the next triangle. Furthermore, our index can be refined locally and, therefore, efficiently when the TIN is augmented by filling any face with another TIN (to make a hierarchical TIN). Such processes arise, for example, in the elaboration of detail on a graphical surface.</abstract><cop>United States</cop><pub>IEEE</pub><pmid>18579975</pmid><doi>10.1109/TVCG.2004.14</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1077-2626 |
| ispartof | IEEE transactions on visualization and computer graphics, 2004-07, Vol.10 (4), p.484-495 |
| issn | 1077-2626 1941-0506 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_28390721 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Computer Graphics Filling Geographic Information Systems hierarchical triangulation Image Enhancement - methods Image Interpretation, Computer-Assisted - methods Imaging, Three-Dimensional - methods Indexing Information retrieval multiresolution triangulation Rendering (computer graphics) Signal Processing, Computer-Assisted space-filling curve spatial index Spatial indexes Spatial resolution Strips Tin triangle mesh Triangulated irregular network |
| title | Multiresolution indexing of triangulated irregular networks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T15%3A50%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multiresolution%20indexing%20of%20triangulated%20irregular%20networks&rft.jtitle=IEEE%20transactions%20on%20visualization%20and%20computer%20graphics&rft.au=Bartholdi,%20J.J.&rft.date=2004-07&rft.volume=10&rft.issue=4&rft.spage=484&rft.epage=495&rft.pages=484-495&rft.issn=1077-2626&rft.eissn=1941-0506&rft.coden=ITVGEA&rft_id=info:doi/10.1109/TVCG.2004.14&rft_dat=%3Cproquest_RIE%3E28390721%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=884086120&rft_id=info:pmid/18579975&rft_ieee_id=1298805&rfr_iscdi=true |