Filters








39,583 Hits in 14.1 sec

THE PRESIDENT'S PRIZE ESSAY

Gordon Petrie
<span title="2006-08-26">2006</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cj7pes4qvbhm7bkgt2hgw6mhkm" style="color: black;">Photogrammetric Record</a> </i> &nbsp;
triangulation can be superseded.  ...  Subject Review the present position of control by photogrammetric methods, and discuss in the light of possible developnients in apparatus and techniques the extent to which you think ground traverse and  ...  Super-wide-angle photography can of course be used for mosaicing and interpretation work without rectification.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1111/j.1477-9730.1959.tb01265.x">doi:10.1111/j.1477-9730.1959.tb01265.x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/oqnaqaj3hbccvbir4ps4zhca3a">fatcat:oqnaqaj3hbccvbir4ps4zhca3a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808213921/http://www.petriefied.info/Petrie_Presidents_Essay_Prize_1959.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f9/45/f945ff0889b806b88fcc0b3723a560d843a5bcba.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1111/j.1477-9730.1959.tb01265.x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

LMT-skeleton heuristics for several new classes of optimal triangulations☆☆This research is supported by the Grant-in-Aid of Ministry of Education, Science, Sports and Culture, of Japan, Grant-in-Aid for Scientific Research(C), 08680377, 1997, and Grant-in-Aid for Scientific Research(B), 10205214, 1998

Yang Dai, Naoki Katoh, Siu-Wing Cheng
<span title="">2000</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/is2k7576zbherpepqy3y7zkzuy" style="color: black;">Computational geometry</a> </i> &nbsp;
Computational experiments demonstrate that the method successfully identifies large portion of edges of the optimal triangulations of each class for all problem instances tested, and hence optimal triangulations  ...  triangulation), (2) the angular balanced triangulation which minimizes the sum of the ratios of the maximum angle to the minimum angle for each triangle, and (3) the area balanced triangulation which  ...  Manabu Sugai, Professor Kokichi Sugihara and Professor Masao Iri [23] for kindly providing us their programs for the implementation of our algorithms.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0925-7721(00)00016-x">doi:10.1016/s0925-7721(00)00016-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7gfeqvbfafbctcjcvblc6eird4">fatcat:7gfeqvbfafbctcjcvblc6eird4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100630001402/http://array.bioengr.uic.edu/~yangdai/pub/LMK.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1a/c2/1ac27d1bf749cc792a0c809890c7bf685267b04a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/s0925-7721(00)00016-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

POLYNOMIAL-SIZE NONOBTUSE TRIANGULATION OF POLYGONS

MARSHALL BERN, DAVID EPPSTEIN
<span title="">1992</span> <i title="World Scientific Pub Co Pte Lt"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqzte2yzdrcbbm3r6t44cctd4u" style="color: black;">International journal of computational geometry and applications</a> </i> &nbsp;
We describe methods for triangulating polygonal regions of the plane so that no triangle has a large angle.  ...  We also show that any triangulation (without Steiner points) of a simple polygon has a refinement with O(n 4 ) nonobtuse triangles.  ...  Acknowledgements We would like to thank Warren Smith for drawing our attention to this problem, Anna Lubiw for the term "path polygon", and David Dobkin, John Gilbert, and Mike Paterson for some helpful  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0218195992000159">doi:10.1142/s0218195992000159</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/j6lf7l7x45gbzj2nwexlykx7t4">fatcat:j6lf7l7x45gbzj2nwexlykx7t4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120128204524/http://www.ics.uci.edu/~eppstein/pubs/BerEpp-IJCGA-92.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/20/7f20f5620d4773f9da40e16eec50c60ac18d773b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/s0218195992000159"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>

Polynomial-size nonobtuse triangulation of polygons

Marshall Bern, David Eppstein
<span title="">1991</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqbrzpfj5rc3pcxpllbrit3n4q" style="color: black;">Proceedings of the seventh annual symposium on Computational geometry - SCG &#39;91</a> </i> &nbsp;
We describe methods for triangulating polygonal regions of the plane so that no triangle has a large angle.  ...  We also show that any triangulation (without Steiner points) of a simple polygon has a refinement with O(n 4 ) nonobtuse triangles.  ...  Acknowledgements We would like to thank Warren Smith for drawing our attention to this problem, Anna Lubiw for the term "path polygon", and David Dobkin, John Gilbert, and Mike Paterson for some helpful  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/109648.109686">doi:10.1145/109648.109686</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/compgeom/BernE91.html">dblp:conf/compgeom/BernE91</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yjbdgcv3ubfw7cdlmdujq2q6ii">fatcat:yjbdgcv3ubfw7cdlmdujq2q6ii</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120128204524/http://www.ics.uci.edu/~eppstein/pubs/BerEpp-IJCGA-92.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/20/7f20f5620d4773f9da40e16eec50c60ac18d773b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/109648.109686"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Triangulations with Locally Optimal Steiner Points [article]

Hale Erten, Alper Uengoer
<span title="">2007</span> <i title="The Eurographics Association"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/u6bzfwsiebh6fipmh5m5axmdoq" style="color: black;">Symposium on geometry processing : [proceedings]. Symposium on Geometry Processing</a> </i> &nbsp;
For a given input domain (a set of points in the plane or a planar straight line graph), and a threshold angle a, the Delaunay refinement algorithms compute triangulations that have all angles at least  ...  The original Delaunay refinement algorithm of Ruppert is proven to terminate with size-optimal quality triangulations for a  ...  We also thank Jyungryun Seo and Burçin Ünel for their careful reading and feedback.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2312/sgp/sgp07/143-152">doi:10.2312/sgp/sgp07/143-152</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5pao6qvxrzfvvnvgcjdjyti2uu">fatcat:5pao6qvxrzfvvnvgcjdjyti2uu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220118014902/https://diglib.eg.org/xmlui/bitstream/handle/10.2312/SGP.SGP07.143-152/143-152.pdf;jsessionid=A0599E08A8690562E021405D860CE46E?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/87/23/8723ffecd27ea9726727681f3354c8d994f9a48e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2312/sgp/sgp07/143-152"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Triangle: Engineering a 2D quality mesh generator and Delaunay triangulator [chapter]

Jonathan Richard Shewchuk
<span title="">1996</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
(This difference is typical for large meshes with a strong angle constraint, but thankfully disappears for small meshes and small constraints.)  ...  No algorithm can produce a finite triangulation of such a PSLG without violating the angle constraint.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0014497">doi:10.1007/bfb0014497</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bic3fwk6fbaj7byhcxyq5tvqv4">fatcat:bic3fwk6fbaj7byhcxyq5tvqv4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20060902233142/http://www.scs.fsu.edu/~burkardt/pdf/shewchuk.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/eb/24/eb240d8336d5828c89e080db793cf35f427c9fc2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bfb0014497"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

High quality compatible triangulations

V. Surazhsky, C. Gotsman
<span title="2003-11-06">2003</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ymqgj2vst5dkta5iksg3negvmi" style="color: black;">Engineering with Computers</a> </i> &nbsp;
We present a method to compute compatible triangulations of planar polygons with a very small number of Steiner (interior) vertices.  ...  Figure 11: 3D visualizations of sweeps between letters U and S using compatible triangulations from Figure 8(e)-(f). The optimal compatible triangulations of U and S appear in Figure 8(a)-(b).  ...  ACKNOWLEDGEMENTS Thanks to Tatiana Surazhsky and Michael Floater for their contribution to the area-based remeshing method, to Alla Sheffer for helpful discussions on sweeps, and to Gill Barequet for helpful  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00366-004-0282-6">doi:10.1007/s00366-004-0282-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/emphvlpqv5fijacbhx3ibak5xu">fatcat:emphvlpqv5fijacbhx3ibak5xu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808195220/http://imr.sandia.gov/papers/imr11/surazhsky.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1e/b4/1eb4fc6a8aa8f47019b77b11a98139ee2493dede.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00366-004-0282-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Page 3073 of Mathematical Reviews Vol. , Issue 96e [page]

<span title="">1996</span> <i title="American Mathematical Society"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_mathematical-reviews" style="color: black;">Mathematical Reviews </a> </i> &nbsp;
without large angles.  ...  Previous work has shown how to compute triangulations with interior (Steiner) points with no small angles, no obtuse angles, or both.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_mathematical-reviews_1996-05_96e/page/3073" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_mathematical-reviews_1996-05_96e/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Unstructured Mesh Generation [chapter]

Jonathan Shewchuk
<span title="2012-01-25">2012</span> <i title="Chapman and Hall/CRC"> Combinatorial Scientific Computing </i> &nbsp;
First, large angles (near 180 • ) can cause large interpolation errors.  ...  other regions might be better served by coarse (large) elements, to keep their number small and avoid imposing an overwhelming computational burden on the application.  ...  Today, the two research issues presenting the most difficulty in tetrahedral meshing are sliver removal and domains with small angles.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1201/b11644-11">doi:10.1201/b11644-11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zjfel6436jhwlidqrtkvjt3ezy">fatcat:zjfel6436jhwlidqrtkvjt3ezy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120130215416/http://www.cs.berkeley.edu/~jrs/papers/umg.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/bd/33/bd33d2322714e1ab2726fcfb5d254a3cda1ca86f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1201/b11644-11"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Page 2605 of American Society of Civil Engineers. Proceedings of the American Society of Civil Engineers Vol. 55, Issue 10 [page]

<span title="">1929</span> <i title="American Society of Civil Engineers"> <a target="_blank" rel="noopener" href="https://archive.org/details/pub_american-society-of-civil-engineers-proceedings" style="color: black;">American Society of Civil Engineers. Proceedings of the American Society of Civil Engineers </a> </i> &nbsp;
positions and the azimuths and distances between the angle points computed.  ...  If the angle is of great importance or very small, this process should be repeated several times and the average of all the observations taken as the true angle.  ... 
<span class="external-identifiers"> </span>
<a target="_blank" rel="noopener" href="https://archive.org/details/sim_american-society-of-civil-engineers-proceedings_1929-12_55_10/page/2605" title="read fulltext microfilm" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Archive [Microfilm] <div class="menu fulltext-thumbnail"> <img src="https://archive.org/serve/sim_american-society-of-civil-engineers-proceedings_1929-12_55_10/__ia_thumb.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a>

Linear-size nonobtuse triangulation of polygons

M. Bern, S. Michell, J. Ruppert
<span title="">1995</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cu3ouk4pmzhsroy4l5k2c35xtu" style="color: black;">Discrete &amp; Computational Geometry</a> </i> &nbsp;
We give an algorithm for triangulating n-vertex polygonal regions (with holes) so that no angle in the nal triangulation measures more than =2.  ...  The number of triangles in the triangulation is only O(n), improving a previous bound of O(n 2 ), and the worstcase running time is O(n log 2 n).  ...  Acknowledgments We would like to thank Paul Chew and Shang-Hua Teng for some valuable discussions and Dan Asimov and Micha Sharir for proofs of Lemma 3.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf02570715">doi:10.1007/bf02570715</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nc3myytfhrfdfmcijwz223v7im">fatcat:nc3myytfhrfdfmcijwz223v7im</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922022011/https://people.eecs.berkeley.edu/~jrs/meshpapers/BernMitchellRuppert.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/79/c3/79c363e399e3003571bb962514c60b5ec9379c07.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/bf02570715"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Linear-size nonobtuse triangulation of polygons

Marshall Bern, Scott Mitchell, Jim Ruppert
<span title="">1994</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zqbrzpfj5rc3pcxpllbrit3n4q" style="color: black;">Proceedings of the tenth annual symposium on Computational geometry - SCG &#39;94</a> </i> &nbsp;
We give an algorithm for triangulating n-vertex polygonal regions (with holes) so that no angle in the nal triangulation measures more than =2.  ...  The number of triangles in the triangulation is only O(n), improving a previous bound of O(n 2 ), and the worstcase running time is O(n log 2 n).  ...  Acknowledgments We would like to thank Paul Chew and Shang-Hua Teng for some valuable discussions and Dan Asimov and Micha Sharir for proofs of Lemma 3.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/177424.177974">doi:10.1145/177424.177974</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/compgeom/BernMR94.html">dblp:conf/compgeom/BernMR94</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/o7fmmq4qxvcatgd5zks5yb6go4">fatcat:o7fmmq4qxvcatgd5zks5yb6go4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922022011/https://people.eecs.berkeley.edu/~jrs/meshpapers/BernMitchellRuppert.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/79/c3/79c363e399e3003571bb962514c60b5ec9379c07.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/177424.177974"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Efficient Two-View Geometry Classification [chapter]

Johannes L. Schönberger, Alexander C. Berg, Jan-Michael Frahm
<span title="">2015</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Two-view triangulation or multi-model estimation approaches can reveal the relative geometric configuration of two views, e.g., small or large baseline and forward or sideward motion.  ...  Typical Structure-from-Motion systems spend major computational effort on geometric verification.  ...  To answer the two binary classification problems C A and C B , we divide the set of image pairs into three different categories: small and large mean triangulation angle (using an angle threshold), and  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-24947-6_5">doi:10.1007/978-3-319-24947-6_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ux4wvjqu6jcurcoiindxago2v4">fatcat:ux4wvjqu6jcurcoiindxago2v4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160319093112/http://acberg.com/papers/schoenberger2015efficient.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a6/9a/a69abb30195f37fa8f38540b9f22a51163768034.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-24947-6_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Non-Obtuse Remeshing with Centroidal Voronoi Tessellation

Dong-Ming Yan, Peter Wonka
<span title="2016-09-01">2016</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/hjrujdrg7zaghbdsp5pdzq7cmm" style="color: black;">IEEE Transactions on Visualization and Computer Graphics</a> </i> &nbsp;
We present a novel remeshing algorithm that avoids triangles with small and triangles with large (obtuse) angles. Our solution is based on an extension to Centroidal Voronoi Tesselation (CVT).  ...  The condition number of the Lapla-11 cian matrix is directly affected by small angles and 12 even a single bad triangle can have a big impact on the 13 computation [2].  ...  both 314 small and large angles are considered undesirable.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tvcg.2015.2505279">doi:10.1109/tvcg.2015.2505279</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/26661470">pmid:26661470</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fj7yuk2plvhl7joytkz3d6ufey">fatcat:fj7yuk2plvhl7joytkz3d6ufey</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921210500/http://repository.kaust.edu.sa/kaust/bitstream/10754/583281/1/07346512.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7a/58/7a58f13893d4ccb66640031eb8148378fbd056bf.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tvcg.2015.2505279"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

MESH GENERATION AND OPTIMAL TRIANGULATION [chapter]

MARSHALL BERN, DAVID EPPSTEIN
<span title="">1992</span> <i title="WORLD SCIENTIFIC"> Lecture Notes Series on Computing </i> &nbsp;
We survey the computational geometry relevant to nite element mesh generation. We especially focus on optimal triangulations of geometric domains in two-and three-dimensions.  ...  We discuss algorithms both for the optimization of triangulations on a xed set of vertices and for the placement of new vertices (Steiner points).  ...  Conclusions We have described work in computational geometry motivated by nite element mesh generation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/9789814355858_0002">doi:10.1142/9789814355858_0002</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zjlfgakee5df7nihosmpeuhco4">fatcat:zjlfgakee5df7nihosmpeuhco4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20110607190620/http://www.eecs.berkeley.edu/~jrs/meshpapers/BernEppstein.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/47/b7/47b796b3f4b54f54c83b4a73ad4d4a7e60ced73e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1142/9789814355858_0002"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> worldscientific.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 39,583 results