• CGAL

  • Referenced in 396 articles [sw00118]
  • Library (CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations and Delaunay triangulations ... periodic triangulations in 3D), Voronoi diagrams (for 2D and 3D points, 2D additively weighted Voronoi ... ridges and umbilics), alpha shapes, convex hull algorithms (in 2D, 3D and dD), search structures...
  • TOPCOM

  • Referenced in 66 articles [sw04867]
  • graph of triangulations, enumerate all triangulations. The core algorithms implemented in TOPCOM are described...
  • DeWall

  • Referenced in 24 articles [sw01745]
  • fast divide and conquer Delaunay triangulation algorithm in $E^d$. The paper deals with Delaunay ... Triangulations (DT) in E d space. This classic computational geometry problem is studied from ... this new algorithm is its generality: it can be simply extended to triangulate point sets ... together with a comparison with other DT algorithms...
  • STRIPACK

  • Referenced in 30 articles [sw00921]
  • Algorithm 772: STRIPACK: Delaunay triangulation and Voronoi diagram on the surface of a sphere. STRIPACK ... that employs an incremental algorithm to construct a Delaunay triangulation and, optionally, a Voronoi diagram ... nodes, the storage requirement for the triangulation is 13N integer storage locations in addition ... line algorithm and work space of size 3N, the triangulation can be constructed with time...
  • Algorithm 792

  • Referenced in 36 articles [sw04774]
  • published as ACM algorithms. The algorithms include seven triangulation-based methods and three modified Shepard...
  • DistMesh

  • Referenced in 310 articles [sw12766]
  • choice of meshpoints (vertex nodes) and a triangulation. We want to offer a short ... reset the topology by the Delaunay algorithm. The geometry is described implicitly by its distance...
  • FIST

  • Referenced in 10 articles [sw08802]
  • triangulation of polygons. We discuss a triangulation algorithm that is based on repeatedly clipping ears ... implement, and (3) fast in practice. The algorithm was implemented on ANSIC, based on floating ... detects deficiencies in the input polygon, our triangulation code can only handle any type ... algorithm. Our code, named FIST as an acronym for fast industrial-strength triangulation, forms...
  • VTK

  • Referenced in 120 articles [sw10593]
  • supports a wide variety of visualization algorithms including: scalar, vector, tensor, texture, and volumetric methods ... reduction, mesh smoothing, cutting, contouring, and Delaunay triangulation. VTK has an extensive information visualization framework...
  • Q-Morph

  • Referenced in 29 articles [sw08563]
  • algorithm for generating all-quadrilateral meshes on bounded three-dimensional surfaces. After first triangulating ... quadrilateral mesh. An advancing front algorithm determines the sequence of triangle transformations. Quadrilaterals are formed ... using existing edges in the triangulation, by inserting additional nodes, or by performing local transformations...
  • Algorithm 624

  • Referenced in 11 articles [sw36279]
  • Algorithm 624: Triangulation and Interpolation at Arbitrarily Distributed Points in the Plane...
  • plantri

  • Referenced in 72 articles [sw10864]
  • basis for its efficiency and the recursive algorithms behind many of its capabilities are shown ... many classes of planar graphs, including triangulations, quadrangulations and convex polytopes. Many applications...
  • Regina

  • Referenced in 46 articles [sw04862]
  • algorithms, heuristics and implementations. Regina is a software package for studying 3-manifold triangulations ... angle structures, census enumeration, combinatorial recognition of triangulations, and high-level functions such ... literature some of the key algorithms, heuristics and implementations that are central to Regina...
  • TRIOPT

  • Referenced in 6 articles [sw02486]
  • TRIOPT: A triangulation-based partitioning algorithm for global optimization. We propose a triangulation-based partitioning ... algorithm, TRIOPT, for solving low-dimensional bound-constrained black box global optimization problems. The method ... starts by forming a Delaunay triangulation of a given set of samples in the feasible...
  • CAVE

  • Referenced in 3 articles [sw09282]
  • based on the recently suggested enveloping triangulation algorithm [J. Buša et al., J. Comp. Chem...
  • TRIPACK

  • Referenced in 16 articles [sw00978]
  • Algorithm 751: TRIPACK: A constrained two-dimensional Delaunay triangulation package. TRIPACK is a Fortran...
  • ANGENER

  • Referenced in 13 articles [sw09674]
  • creates an anisotropic triangulation, where better solution can be reached. The algorithm is base...
  • geometry

  • Referenced in 14 articles [sw10010]
  • point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs ... Quickhull algorithm for computing the convex hull. Qhull does not support constrained Delaunay triangulations...
  • Algorithm 964

  • Referenced in 7 articles [sw23695]
  • Euler characteristic formula is presented. The algorithm applies to objects obtained by thresholding a scalar ... require any triangulation of the data. This makes the algorithm fast, memory efficient, and suitable...
  • Library of Triangulations

  • Referenced in 14 articles [sw20482]
  • Morse theory and a new library of triangulations. The discrete Morse theory, as defined ... Forman, is used in a random algorithm. This means that the function is chosen randomly ... kind of measuring the complexity of the triangulation. The discrete Morse vector can be much...
  • Veering

  • Referenced in 7 articles [sw20132]
  • computer program which algorithmically implements the construction of ideal veering triangulations of mapping tori given...