نتایج جستجو برای: similar triangles
تعداد نتایج: 679726 فیلتر نتایج به سال:
Marching triangles is a method for producing a polygon mesh surface approximation composed of triangular facets which are approximately equilateral. This paper improves the Marching Triangles algorithm where the inputs are multiple range images of scenes. C discontinuities (fold edges) are detected and used to constrain the final triangulation, thus increasing the accuracy of the mesh at sharp ...
Isosceles trapezoids are dissected into three similar triangles and rearranged to form two additional isosceles trapezoids. Moreover, triangle centers, one from each similar triangle, form the vertices of a centric triangle which has special properties. For example, the centroidal triangles are congruent to each other and have an area one-ninth of the area of the trapezoids; whereas, the circum...
We investigate the problem of cutting a triangle ABC into N congruent triangles (the “tiles”), each of which is similar to ABC. The more general problem when the tile is not similar to ABC is not treated in this paper; see [1]. We give a complete characterization of the numbers N for which some triangle ABC can be tiled by N tiles similar to ABC, and also a complete characterization of the numb...
This paper presents an adaptive method for polygonisation of implicit surfaces. The method is based on the shape of triangles and the accuracy of resulting approximation. The main advantages of the triangulation presented are simplicity and the stable features that can be used for the next expansion. The presented algorithm is based on the surface tracking scheme, and it is compared with other ...
An adaptive method for polygonization of implicit surfaces is presented. The method insists on the shape of triangles and the accuracy of resulting approximation as well. The presented algorithm is based on the surface tracking scheme and it is compared with the other algorithms based on the similar principle, such as the Marching cubes and the Marching triangles methods. The main advantages of...
We consider the sequences of triangles where each triangle is formed out of the apices of three similar triangles built on the sides of its predecessor. We show under what conditions such sequences converge in shape, or are periodic.
We show that there is no (1 + ε)-approximation algorithm for the problem of covering points in the plane by minimum number of fat triangles of similar size (with the minimum angle of the triangles being close to 45 degrees). Here, the available triangles are prespecified in advance. Since a constant factor approximation algorithm is known for this problem [CV07], this settles the approximabilit...
We present three streaming algorithms that (2, δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presented algorithms are inversely proportional to the number of triangles while, for some families of graphs, the space usage is improved. We also prove a lower bound, based on the number of triangles, which indicates that our first algo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید