델로네 삼각분할

수학노트
둘러보기로 가기 검색하러 가기

노트

위키데이터

말뭉치

  1. By considering circumscribed spheres, the notion of Delaunay triangulation extends to three and higher dimensions.[1]
  2. If the Delaunay triangulation is calculated using the Bowyer–Watson algorithm then the circumcenters of triangles having a common vertex with the "super" triangle should be ignored.[1]
  3. For a set P of points in the (d-dimensional) Euclidean space, a Delaunay triangulation is a triangulation DT(P) such that no point in P is inside the circum-hypersphere of any d-simplex in DT(P).[1]
  4. Each frame of the animation shows a Delaunay triangulation of the four points.[1]
  5. The next illustration shows a simple 3-D Delaunay triangulation made up of two tetrahedra.[2]
  6. If the edge {V2, V4} were replaced by an edge joining V1 and V3 , the minimum angle would be maximized and the triangulation would become a Delaunay triangulation.[2]
  7. For a set of points in 2-D, a Delaunay triangulation of these points ensures the circumcircle associated with each triangle contains no other point in its interior.[2]
  8. Constrain edges in the triangulation—this is called a constrained Delaunay triangulation.[2]
  9. It is well known that the complexity of the Delaunay triangulation of N points in R 3, i.e. the number of its faces, can be O (N2).[3]
  10. In this paper, we bound the complexity of the Delaunay triangulation of points distributed on generic smooth surfaces of R 3.[3]
  11. Under a mild uniform sampling condition, we show that the complexity of the 3D Delaunay triangulation of the points is O(N log N).[3]
  12. Click the mouse in the drawing region to add new sites to the Voronoi Diagram or Delaunay Triangulation.[4]
  13. The Delaunay Triangulation is built within a large triangle whose vertices are well off-screen.[4]
  14. That's why in the Delaunay Triangulation there are lines heading off-screen.[4]
  15. For morphing images the Delaunay triangulation provides a 'good' way to create a triangular mesh from points that are going to be moved.[5]
  16. For a set P of points in the plane the Delaunay triangulation is a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P).[5]
  17. On the basis of triangulation in computational geometry, we develop a kind of method for fingerprint matching based on Delaunay Triangulation net in this paper.[6]
  18. Moreover, we combine our approach of min-error triangulation with k-order Delaunay triangulation to stabilize the triangles geometrically.[7]
  19. We show how to learn a min-error triangulation and a min-error k-order Delaunay triangulation using an exact algorithm based on integer linear programming.[7]
  20. We confront our reconstructions against the Delaunay triangulation which had been proposed earlier for sea-surface modeling and find superior quality.[7]
  21. Coordinates of points to triangulate furthest_site bool, optional Whether to compute a furthest-site Delaunay triangulation.[8]
  22. Note Unless you pass in the Qhull option “QJ”, Qhull does not guarantee that each input point appears as a vertex in the Delaunay triangulation.[8]
  23. A new point creation scheme is presented for generating unstructured uniform size two‐dimensional triangular meshes using the Delaunay triangulation method.[9]
  24. Those points are then processed using a Delaunay triangulation algorithm to divide the whole image into a series of linked triangular facets.[10]
  25. Many 2D triangulation methods exist, and the representative method is Delaunay triangulation.[10]
  26. The most commonly used Delaunay triangulation algorithms include insertion methods, incremental method, and divide and conquer method.[10]
  27. Meanwhile, divide and conquer method has been shown to be the fastest Delaunay triangulation generation technique.[10]
  28. The class Delaunay_triangulation_2<Traits,Tds> is designed to represent the Delaunay triangulation of a set of data points in the plane.[11]
  29. The side_of_oriented_circle predicate actually defines the Delaunay triangulation.[11]
  30. The number of flips that have to be performed is \( O(d)\) if the new vertex has degree \( d\) in the updated Delaunay triangulation.[11]
  31. The following code creates a Delaunay triangulation with the usual Euclidean metric for the vertical projection of a terrain model.[11]
  32. We develop a method for constructing the Delaunay triangulation of a point set which is massively parallel and designed for the many-core architecture of graphical processing units (GPUs).[12]
  33. We therefore focus on a data-parallel algorithm for Delaunay triangulation, aiming to accelerate parts of the algorithm using CUDA.[12]
  34. In general, it is easier to construct the Delaunay triangulation and then obtain the corresponding Voronoi diagram.[12]
  35. Figure 4: Sketch-map of Delaunay triangulation for predicting the toxicity of binary mixture.[13]
  36. adds constraint curves to a Delaunay triangulation.[14]
  37. tests a data structure representing a Delaunay triangulation.[14]
  38. constructs a Delaunay triangulation of 2D vertices.[15]
  39. prints information about a Delaunay triangulation.[15]

소스

  1. ↑ 1.0 1.1 1.2 1.3 Delaunay triangulation
  2. ↑ 2.0 2.1 2.2 2.3 Working with Delaunay Triangulations
  3. ↑ 3.0 3.1 3.2 Complexity of the delaunay triangulation of points on surfaces the smooth case
  4. ↑ 4.0 4.1 4.2 Delaunay Applet
  5. ↑ 5.0 5.1 Trigonometry/For Enthusiasts/Delaunay triangulation
  6. ↑ A method based on Delaunay triangulation for fingerprint matching
  7. ↑ 7.0 7.1 7.2 (PDF) Two Algorithms for Constructing a Delaunay Triangulation
  8. ↑ 8.0 8.1 scipy.spatial.Delaunay — SciPy v1.5.4 Reference Guide
  9. ↑ A new point creation scheme for uniform Delaunay triangulation
  10. ↑ 10.0 10.1 10.2 10.3 Stereo Matching Algorithm Based on 2D Delaunay Triangulation
  11. ↑ 11.0 11.1 11.2 11.3 2D Triangulation: User Manual
  12. ↑ 12.0 12.1 12.2 Delaunay Triangulation using Parallel Incremental Extrapolation on GPUs
  13. ↑ Using Delaunay triangulation and Voronoi tessellation to predict the toxicities of binary mixtures containing hormetic compound
  14. ↑ 14.0 14.1 Constrained Delaunay Triangulation
  15. ↑ 15.0 15.1 Delaunay triangulation

메타데이터

위키데이터

Spacy 패턴 목록

  • [{'LOWER': 'delaunay'}, {'LEMMA': 'triangulation'}]
  • [{'LOWER': 'delone'}, {'LEMMA': 'triangulation'}]
원본 주소 "https://wiki.mathnt.net/index.php?title=델로네_삼각분할&oldid=51314"