<?xml version="1.1" encoding="utf-8"?>
<article xsi:noNamespaceSchemaLocation="http://jats.nlm.nih.gov/publishing/1.1/xsd/JATS-journalpublishing1-mathml3.xsd" dtd-version="1.1" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><front><journal-meta><journal-id journal-id-type="publisher-id">JERA</journal-id><journal-title-group><journal-title>Journal of Electronic Research and Application</journal-title></journal-title-group><issn>2208-3502</issn><eissn>2208-3510</eissn><publisher><publisher-name>Bio-Byword Scientific Publishing Pty. Ltd.</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.26689/jera.v9i2.10086</article-id><article-categories><subj-group subj-group-type="heading"><subject>Article</subject></subj-group></article-categories><title>Web Visualization Application of Large Mesh Models Based on Simplification Algorithms</title><url>https://artdesignp.com/journal/JERA/9/2/10.26689/jera.v9i2.10086</url><author>ShiShengtai</author><pub-date pub-type="publication-year"><year>2025</year></pub-date><volume>9</volume><issue>2</issue><history><date date-type="pub"><published-time>2025-04-03</published-time></date></history><abstract>This paper studies polygon simplification algorithms for 3D models, focuses on the optimization algorithm of quadratic error metric (QEM), explores the impacts of different methods on the simplification of different models, and develops a web-based visualization application. Metrics such as the Hausdorff distance are used to evaluate the balance between the degree of simplification and the retention of model details.</abstract><keywords/></article-meta></front><body/><back><ref-list><ref id="B1" content-type="article"><label>1</label><element-citation publication-type="journal"><p>Durk J, 2019, Model Simplification in Manufacturing Simulation – Review and Framework. Computers &amp; Industrial Engineering, 127: 1056–1067.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B2" content-type="article"><label>2</label><element-citation publication-type="journal"><p>Arvo J, Euranto A, Jarvenpaa L, et al., 2015, 3D Mesh Simplification: A Survey of Algorithms and CAD Model Simplification Tests, University of Turku, Technology Research Center, Finland.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B3" content-type="article"><label>3</label><element-citation publication-type="journal"><p>Rossignac J, Borrel P, 1993, Multi-resolution 3D Approximations for Rendering Complex Scenes, Springer Berlin Heidelberg, 455–465.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B4" content-type="article"><label>4</label><element-citation publication-type="journal"><p>Erikson C, Luebke D, 1997, View-dependent Simplification of Arbitrary Polygonal Environments. Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH ’97), New York, NY, USA, 199–208.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B5" content-type="article"><label>5</label><element-citation publication-type="journal"><p>Schroeder W, 1997, A Topology Modifying Progressive Decimation Algorithm, IEEE Visualization ’97, Phoenix Arizona USA, 205–212.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B6" content-type="article"><label>6</label><element-citation publication-type="journal"><p>Voutchkov I, Keane A, Shahpar S, et al., 2018, (Re-)Meshing Using Interpolative Mapping and Control Point Optimization. Journal of Computational Design and Engineering, 5(3): 305–318.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B7" content-type="article"><label>7</label><element-citation publication-type="journal"><p>Podolak J, Funkhouser T, Golovinskiy A, 2009, Symmetry-aware Mesh Processing, Mathematics of Surfaces XIII, Springer Berlin Heidelberg, 170–188.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B8" content-type="article"><label>8</label><element-citation publication-type="journal"><p>Heckbert P, Garland M, 1997, View-dependent Simplification of Arbitrary Polygonal Environments. Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH ’97), New York, NY, USA, 209–216.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B9" content-type="article"><label>9</label><element-citation publication-type="journal"><p>Hugues H, 1996, Progressive meshes. Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH ’96), Association for Computing Machinery, New York, NY, USA, 99–108.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B10" content-type="article"><label>10</label><element-citation publication-type="journal"><p>Klanderman G, Rucklidge W, Huttenlocher D, 1993, Comparing Images Using the Hausdorff Distance. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(9): 850–863.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B11" content-type="article"><label>11</label><element-citation publication-type="journal"><p>Munkres J, 1999, Topology, 2nd ed, Upper Saddle River, NJ, USA, Prentice Hall.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B12" content-type="article"><label>12</label><element-citation publication-type="journal"><p>Rucklidge W, 1997, Efficiently Locating Objects Using the Hausdorff Distance. International Journal of Computer Vision, 24(3): 251–270.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B13" content-type="article"><label>13</label><element-citation publication-type="journal"><p>Vito D, Valery S, 1999, Distance-based Functions for Image Comparison. Pattern Recognition Letters, 20(3): 207–214.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B14" content-type="article"><label>14</label><element-citation publication-type="journal"><p>Stan M, 1998, A Simple, Fast, and Effective Polygon Reduction Algorithm. Game Developer Magazine, 5(11): 44–49.</p><pub-id pub-id-type="doi"/></element-citation></ref><ref id="B15" content-type="article"><label>15</label><element-citation publication-type="journal"><p>Taha A, Hanbury A, 2015, An Efficient Algorithm for Calculating the Exact Hausdorff Distance. IEEE Transactions on Pattern Analysis and Machine Intelligence, 37(11): 2153–2163.</p><pub-id pub-id-type="doi"/></element-citation></ref></ref-list></back></article>
