Coarse Quad Layouts Through Robust Simplification of Cross Field Separatrix Partitions

Streamline-based quad meshing algorithms use smooth cross fields to partition surfaces into quadrilateral regions by tracing cross field separatrices. In practice, re-entrant corners and misalignment of singularities lead to small regions and limit cycles, negating some of the benefits a quad layout...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2019-08
Hauptverfasser: Viertel, Ryan, Osting, Braxton, Staten, Matthew
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Viertel, Ryan
Osting, Braxton
Staten, Matthew
description Streamline-based quad meshing algorithms use smooth cross fields to partition surfaces into quadrilateral regions by tracing cross field separatrices. In practice, re-entrant corners and misalignment of singularities lead to small regions and limit cycles, negating some of the benefits a quad layout can provide in quad meshing. We introduce three novel methods to improve on a pipeline for coarse quad partitioning. First, we formulate an efficient method to compute high-quality cross fields on curved surfaces by extending the diffusion generated method from Viertel and Osting (SISC, 2019). Next, we introduce a method for accurately computing the trajectory of streamlines through singular triangles that prevents tangential crossings. Finally, we introduce a robust method to produce coarse quad layouts by simplifying the partitions obtained via naive separatrix tracing. Our methods are tested on a database of 100 objects and the results are analyzed. The algorithm performs well both in terms of efficiency and visual results on the database when compared to state-of-the-art methods.
format Article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2229493271</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2229493271</sourcerecordid><originalsourceid>FETCH-proquest_journals_22294932713</originalsourceid><addsrcrecordid>eNqNysEOwUAQgOGNRKLBO0ziLGlnSzk3xMEBFVcZbHWlOrWzm_D2SDyA03_4v46KUOtkPEsRe2oocovjGKcZTiY6UoecyYmBbaALrOnFwQvsK8fhWsGOT0E8FPbe1ra0Z_KWG-AScscisLSmvkBhWnLknX3Chpy3XyMD1S2pFjP8ta9Gy8U-X41bx49gxB9vHFzzWUdEnKdzjVmi_1NvH3NBdA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2229493271</pqid></control><display><type>article</type><title>Coarse Quad Layouts Through Robust Simplification of Cross Field Separatrix Partitions</title><source>Free E- Journals</source><creator>Viertel, Ryan ; Osting, Braxton ; Staten, Matthew</creator><creatorcontrib>Viertel, Ryan ; Osting, Braxton ; Staten, Matthew</creatorcontrib><description>Streamline-based quad meshing algorithms use smooth cross fields to partition surfaces into quadrilateral regions by tracing cross field separatrices. In practice, re-entrant corners and misalignment of singularities lead to small regions and limit cycles, negating some of the benefits a quad layout can provide in quad meshing. We introduce three novel methods to improve on a pipeline for coarse quad partitioning. First, we formulate an efficient method to compute high-quality cross fields on curved surfaces by extending the diffusion generated method from Viertel and Osting (SISC, 2019). Next, we introduce a method for accurately computing the trajectory of streamlines through singular triangles that prevents tangential crossings. Finally, we introduce a robust method to produce coarse quad layouts by simplifying the partitions obtained via naive separatrix tracing. Our methods are tested on a database of 100 objects and the results are analyzed. The algorithm performs well both in terms of efficiency and visual results on the database when compared to state-of-the-art methods.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Layouts ; Meshing ; Methods ; Misalignment ; Partitions ; Quadrilaterals ; Singularities</subject><ispartof>arXiv.org, 2019-08</ispartof><rights>2019. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>776,780</link.rule.ids></links><search><creatorcontrib>Viertel, Ryan</creatorcontrib><creatorcontrib>Osting, Braxton</creatorcontrib><creatorcontrib>Staten, Matthew</creatorcontrib><title>Coarse Quad Layouts Through Robust Simplification of Cross Field Separatrix Partitions</title><title>arXiv.org</title><description>Streamline-based quad meshing algorithms use smooth cross fields to partition surfaces into quadrilateral regions by tracing cross field separatrices. In practice, re-entrant corners and misalignment of singularities lead to small regions and limit cycles, negating some of the benefits a quad layout can provide in quad meshing. We introduce three novel methods to improve on a pipeline for coarse quad partitioning. First, we formulate an efficient method to compute high-quality cross fields on curved surfaces by extending the diffusion generated method from Viertel and Osting (SISC, 2019). Next, we introduce a method for accurately computing the trajectory of streamlines through singular triangles that prevents tangential crossings. Finally, we introduce a robust method to produce coarse quad layouts by simplifying the partitions obtained via naive separatrix tracing. Our methods are tested on a database of 100 objects and the results are analyzed. The algorithm performs well both in terms of efficiency and visual results on the database when compared to state-of-the-art methods.</description><subject>Algorithms</subject><subject>Layouts</subject><subject>Meshing</subject><subject>Methods</subject><subject>Misalignment</subject><subject>Partitions</subject><subject>Quadrilaterals</subject><subject>Singularities</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqNysEOwUAQgOGNRKLBO0ziLGlnSzk3xMEBFVcZbHWlOrWzm_D2SDyA03_4v46KUOtkPEsRe2oocovjGKcZTiY6UoecyYmBbaALrOnFwQvsK8fhWsGOT0E8FPbe1ra0Z_KWG-AScscisLSmvkBhWnLknX3Chpy3XyMD1S2pFjP8ta9Gy8U-X41bx49gxB9vHFzzWUdEnKdzjVmi_1NvH3NBdA</recordid><startdate>20190802</startdate><enddate>20190802</enddate><creator>Viertel, Ryan</creator><creator>Osting, Braxton</creator><creator>Staten, Matthew</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20190802</creationdate><title>Coarse Quad Layouts Through Robust Simplification of Cross Field Separatrix Partitions</title><author>Viertel, Ryan ; Osting, Braxton ; Staten, Matthew</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_22294932713</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Layouts</topic><topic>Meshing</topic><topic>Methods</topic><topic>Misalignment</topic><topic>Partitions</topic><topic>Quadrilaterals</topic><topic>Singularities</topic><toplevel>online_resources</toplevel><creatorcontrib>Viertel, Ryan</creatorcontrib><creatorcontrib>Osting, Braxton</creatorcontrib><creatorcontrib>Staten, Matthew</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Viertel, Ryan</au><au>Osting, Braxton</au><au>Staten, Matthew</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Coarse Quad Layouts Through Robust Simplification of Cross Field Separatrix Partitions</atitle><jtitle>arXiv.org</jtitle><date>2019-08-02</date><risdate>2019</risdate><eissn>2331-8422</eissn><abstract>Streamline-based quad meshing algorithms use smooth cross fields to partition surfaces into quadrilateral regions by tracing cross field separatrices. In practice, re-entrant corners and misalignment of singularities lead to small regions and limit cycles, negating some of the benefits a quad layout can provide in quad meshing. We introduce three novel methods to improve on a pipeline for coarse quad partitioning. First, we formulate an efficient method to compute high-quality cross fields on curved surfaces by extending the diffusion generated method from Viertel and Osting (SISC, 2019). Next, we introduce a method for accurately computing the trajectory of streamlines through singular triangles that prevents tangential crossings. Finally, we introduce a robust method to produce coarse quad layouts by simplifying the partitions obtained via naive separatrix tracing. Our methods are tested on a database of 100 objects and the results are analyzed. The algorithm performs well both in terms of efficiency and visual results on the database when compared to state-of-the-art methods.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2019-08
issn 2331-8422
language eng
recordid cdi_proquest_journals_2229493271
source Free E- Journals
subjects Algorithms
Layouts
Meshing
Methods
Misalignment
Partitions
Quadrilaterals
Singularities
title Coarse Quad Layouts Through Robust Simplification of Cross Field Separatrix Partitions
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T15%3A59%3A01IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Coarse%20Quad%20Layouts%20Through%20Robust%20Simplification%20of%20Cross%20Field%20Separatrix%20Partitions&rft.jtitle=arXiv.org&rft.au=Viertel,%20Ryan&rft.date=2019-08-02&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2229493271%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2229493271&rft_id=info:pmid/&rfr_iscdi=true