Filters








2,192 Hits in 4.0 sec

REPAIRING NON-MANIFOLD TRIANGLE MESHES USING SIMULATED ANNEALING

MARC WAGNER, ULF LABSIK, GÜNTHER GREINER
2003 International journal of shape modeling  
The algorithm is based on a randomized optimization technique from probability calculus called simulated annealing.  ...  In this paper we present a novel approach for generating manifold triangle meshes from such incomplete or imperfect triangulations.  ...  Closing complex holes using simulated annealing The idea of using simulated annealing to solve optimization problems on triangulations was first proposed by Schumaker [11] .  ... 
doi:10.1142/s0218654303000085 fatcat:57pxfmrnmrgife2mu7kbrctafy

Automated meshing of sparse 3D point clouds

Oli Cooper, Neill Campbell, David Gibson
2003 Proceedings of the SIGGRAPH 2003 conference on Sketches & applications in conjunction with the 30th annual conference on Computer graphics and interactive techniques - GRAPH '03  
We propose a novel method that uses simulated annealing to create an optimal surface mesh by selecting a subset of a 3D point cloud and a triangulation that reliably represents the actual topology of the  ...  Using the simulated annealing algorithm, a cost function is iteratively minimised by selecting a point in the current subset and 'moving' it by swapping it for a point not in the subset.  ...  Additionally, by using simulated annealing as opposed to greedy search techniques, the chance of getting stuck in a local minimum, rather than converging to a global minimum, is greatly decreased.  ... 
doi:10.1145/965400.965444 dblp:conf/siggraph/CooperCG03 fatcat:cshothtzjfbyrib72il3v4boo4

Automated meshing of sparse 3D point clouds

Oli Cooper, Neill Campbell, David Gibson
2003 Proceedings of the SIGGRAPH 2003 conference on Sketches & applications in conjunction with the 30th annual conference on Computer graphics and interactive techniques - GRAPH '03  
We propose a novel method that uses simulated annealing to create an optimal surface mesh by selecting a subset of a 3D point cloud and a triangulation that reliably represents the actual topology of the  ...  Using the simulated annealing algorithm, a cost function is iteratively minimised by selecting a point in the current subset and 'moving' it by swapping it for a point not in the subset.  ...  Additionally, by using simulated annealing as opposed to greedy search techniques, the chance of getting stuck in a local minimum, rather than converging to a global minimum, is greatly decreased.  ... 
doi:10.1145/965441.965444 fatcat:nm2imcql4rdmvo7nqxgehfowuu

N-dimensional Data-Dependent Reconstruction Using Topological Changes [chapter]

Zsolt Tóth, Ivan Viola, Andrej Ferko, Eduard Gröller
2007 Mathematics and Visualization  
It is the generalization of a 2D reconstruction approach based on data-dependent triangulation and Lawson's optimization procedure.  ...  Our goal is to generate an n-dimensional triangulation, which preserves the high frequency regions via local topology changes.  ...  Experiments and Results DDT triangulations can be computed by stochastic processes. Such a technique is the simulated annealing optimization approach.  ... 
doi:10.1007/978-3-540-70823-0_13 fatcat:mz62n4hu3nai5csdna7zruegt4

On simulated annealing and the construction of linear spline approximations for scattered data

O. Kreylos, B. Hamann
2001 IEEE Transactions on Visualization and Computer Graphics  
We start with an initial approximation consisting of a fixed number of vertices and improve this approximation by choosing different vertices, governed by a simulated annealing algorithm.  ...  In a second version of this algorithm, specifically designed for the bivariate case, we choose vertex sets and also change the triangulation to achieve both optimal vertex placement and optimal triangulation  ...  The simulated annealing algorithm is an adaption of the natural annealing process for arbitrary optimization problems.  ... 
doi:10.1109/2945.910818 fatcat:twgdqfdsrzaf7i7q5f6jgrwhbm

Filling holes in triangular meshes by curve unfolding

Alan Brunton, Stefanie Wuhrer, Chang Shu, Prosenjit Bose, Erik D. Demaine
2009 2009 IEEE International Conference on Shape Modeling and Applications  
First, we unfold the hole boundary onto a plane using energy minimization. Second, we triangulate the unfolded hole using a constrained Delaunay triangulation.  ...  We propose a novel approach to automatically fill holes in triangulated models. Each hole is filled using a minimum energy surface that is obtained in three steps.  ...  Michiel Smid of the School of Computer Science, Carleton University, for the use of the laser range scanner. This research is supported in part by OGS.  ... 
doi:10.1109/smi.2009.5170165 dblp:conf/smi/BruntonWSBD09 fatcat:udjqnjpqrveu3njpmqir52bb3a

Placement Optimization of Reference Sensors for Indoor Tracking

2015 Acta Polytechnica Hungarica  
In this paper, we propose OptiRef, our simulated annealing based method to find, in a given area, the optimal number and placement of the reference sensors to be used for indoor positioning.  ...  One possibility is deploying cheap ZigBee sensors as reference points and using triangulation to compute the position of the visiting node.  ...  For our case, we propose simulated annealing to approximate the optimal reference point setup. Simulated annealing is a generic probabilistic algorithm for global optimization [19] .  ... 
doi:10.12700/aph.12.2.2015.2.8 fatcat:73cmzk4zbvfmndwo4wgizd54ia

On Simulated Annealing and the Construction of Linear Spline Approximations for Scattered Data [chapter]

Oliver Kreylos, Bernd Hamann
1999 Eurographics  
We start with an initial approximation consisting of a fixed number of vertices and improve this approximation by choosing different vertices, governed by a simulated annealing algorithm.  ...  In a second version of this algorithm, specifically designed for the bivariate case, we choose vertex sets and also change the triangulation to achieve both optimal vertex placement and optimal triangulation  ...  The simulated annealing algorithm is an adaption of the natural annealing process for arbitrary optimization problems.  ... 
doi:10.1007/978-3-7091-6803-5_18 fatcat:xuo4xrsfp5ajzheolfxlqvhpqe

Differentiable Surface Triangulation [article]

Marie-Julie Rakotosaona, Noam Aigerman, Niloy Mitra, Maks Ovsjanikov, Paul Guerrero
2021 arXiv   pre-print
We translate this result into a computational algorithm by proposing a soft relaxation of the classical weighted Delaunay triangulation and optimizing over vertex weights and vertex locations.  ...  In this work, we present a differentiable surface triangulation that enables optimization for any per-vertex or per-face differentiable objective function over the space of underlying surface triangulations  ...  Optimization Choice of optimizer. We evaluate the effect of different optimization methods, comparing ADAM, LBFGS, and Simulated Annealing.  ... 
arXiv:2109.10695v1 fatcat:wh2ej3w65zerrimznunkl2pvba

Anisotropic Triangulation Methods in Adaptive Image Approximation [chapter]

Laurent Demaret, Armin Iske
2010 Springer Proceedings in Mathematics  
The discussion includes generic triangulations obtained by simulated annealing, adaptive thinning on Delaunay triangulations, anisotropic geodesic triangulations, and greedy triangle bisections.  ...  This article first addresses selected computational aspects concerning image approximation on triangular meshes, before four recent image approximation algorithms, each relying on anisotropic triangulations  ...  Further improvements may be used to speed-up the convergence of the simulated annealing procedure, where the reduction of computational complexity is done by working with local probabilities [18] .  ... 
doi:10.1007/978-3-642-16876-5_3 fatcat:67ikqfncuzcfhkn4ncranpra3e

Image reconstruction using data-dependent triangulation

Xiaohua Yu, B.S. Bryan, T.W. Sederberg
2001 IEEE Computer Graphics and Applications  
Figures 7a and 8b Simulated annealing The only other optimization method in the DDT literature is Schumaker's discussion of simulated annealing. 11 We implemented the algorithm as described and  ...  Not only does our algorithm run faster, it also usually finds a lower cost triangulation than simulated annealing (although neither can guarantee global optimality).  ... 
doi:10.1109/38.920628 fatcat:wwl4rlcpwfagdccpzpqvk7d6eu

Page 4073 of Mathematical Reviews Vol. , Issue 94g [page]

1994 Mathematical Reviews  
Our aim is to show how simulated annealing can be used to search for globally optimal triangulations for a wide class of optimality criteria.  ...  {For the entire collection see MR 94c:65008.} 949:65023 65D17 Schumaker, Larry L. (1-VDB; Nashville, TN) Computing optimal triangulations using simulated annealing.  ... 

FILLING HOLES IN TRIANGULAR MESHES USING DIGITAL IMAGES BY CURVE UNFOLDING

ALAN BRUNTON, STEFANIE WUHRER, SHU CHANG, PROSENJIT BOSE, ERIK DEMAINE
2010 International journal of shape modeling  
First, we unfold the hole boundary onto a plane using energy minimization. Second, we triangulate the unfolded hole using a constrained Delaunay triangulation.  ...  Communicated by (xxxxxxxxxx) We propose a novel approach to automatically fill holes in triangulated models. Each hole is filled using a minimum energy surface that is obtained in three steps.  ...  Michiel Smid of the School of Computer Science, Carleton University, for the use of the laser range scanner. This research is supported in part by OGS.  ... 
doi:10.1142/s0218654310001328 fatcat:2cqvvyhdwjastn3gs2gzchehf4

Robust structural identification via polyhedral template matching

Peter Mahler Larsen, Søren Schmidt, Jakob Schiøtz
2016 Modelling and Simulation in Materials Science and Engineering  
We demonstrate that the method can reliably be used to identify structures even in simulations near the melting point, and that it can identify the most common ordered alloy structures as well.  ...  The polar decomposition of the deformation gradient is computed using a SVD library optimized for 3 × 3 matrices [38] .  ...  The sample has first been quenched using the FIRE minimization method [25] , and subsequently annealed at 1100K for 820 picoseconds using molecular dynamics with a 5 fs time step.  ... 
doi:10.1088/0965-0393/24/5/055007 fatcat:iszldjbmf5gjtlj2umdmadijti

Best data-dependent triangulations

Lyuba Alboul, Gertjan Kloosterman, Cornelis Traas, Ruud van Damme
2000 Journal of Computational and Applied Mathematics  
A comparison is made with data-dependent triangulation methods that exist in the literature.  ...  When reconstructing a surface from irregularly spaced data we need to decide how to identify a good triangulation.  ...  3 Results for f (2) on data (2) , with the use of simulated annealing we obtain a triangulation that is very similar to the Tight triangulation.  ... 
doi:10.1016/s0377-0427(00)00368-x fatcat:alt3i2ef5fbrrlzuchqu37l6qa
« Previous Showing results 1 — 15 out of 2,192 results