Results 51 to 60 of about 71,729 (167)
On deletion in Delaunay triangulations [PDF]
Proceedings of the fifteenth annual symposium on Computational geometry, 1999 This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the deleted vertex, the complexity is O(k log k), but we notice that this number only applies to low cost operations, while time consuming computations are only done a linear ...
openaire +7 more sources
Parametric Loop Division for 3D Localization in Wireless Sensor Networks
Sensors, 2017 Localization in Wireless Sensor Networks (WSNs) has been an active topic for more than two decades. A variety of algorithms were proposed to improve the localization accuracy.
Tanveer Ahmad +2 more
doaj +1 more source
Differentiation on spaces of triangulations and optimized triangulations.
Journal of Physics: Conference Series, 2016 We describe a smooth structure, called Frölicher space, on CW complexes and spaces of triangulations. This structure enables differential methods for e.g. minimization of functionnals. As an application, we exhibit how an optimized triangulation can be obtained in order to solve a standard PDE.
openaire +2 more sources
The Chinese Junk Keying and American Racialization of Chinese
American Studies in Scandinavia, 2019 As the first Chinese wooden boat that ever reached the United States, the Keying, with its 40 Chinese sailors who composed the hitherto largest group of Chinese in America, not only satisfied Americans’ curiosity at Chinese junks and Chinese people, but ...
Tao Zhang
doaj +1 more source
Triangulation in Rewriting. [PDF]
, 2012 23rd International Conference on Rewriting Techniques and Applications (RTA'12)
Vincent van Oostrom, Hans Zantema
openaire +5 more sources
Discrete Mathematics, 1972 AbstractThis paper establishes the possibility of performing certain transformations of triangulations of finite planar point sets.
openaire +1 more source
, 2011 In this theoretical paper we consider the problem of accurately triangulating a scene plane. Rather than first triangulating a set of points and then fitting a plane to these points, we try to minimize the back-projection errors as functions of the plane parameters directly. As this is both geometrically and statistically meaningful our method performs
Carl Olsson, Anders P. Eriksson
openaire +3 more sources
Theoretical Computer Science, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oswin Aichholzer +8 more
openaire +3 more sources
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2018 Multiple-view triangulation by $\ell_{\infty}$ minimisation has become established in computer vision. State-of-the-art $\ell_{\infty}$ triangulation algorithms exploit the quasiconvexity of the cost function to derive iterative update rules that deliver the global minimum.
Qianggong Zhang, Tat-Jun Chin
openaire +4 more sources
Journal of Combinatorial Theory, Series A, 1976 In this note we consider the problem of determining a minimal triangulation of I”, the n-dimensional cube. While the problem seems intrinsically interesting, our purpose in presenting it is motivated by the interest evinced in connection with the simplicial approximation of fixed points of continuous mappings [5, 71.
openaire +3 more sources