• # Convex

• Referenced in 33 articles [sw07770]
• Convex - a Maple package for convex geometry. Convex is a Maple package for computations ... rational convex geometry. Here ”rational” means that all coordinates must be rational numbers. The package ... linear” as well as ”affine” convex geometry. In the affine setting, the basic objects ... Polyhedra can also be described as the convex hull of finitely many points and rays...
• # CGAL

• Referenced in 384 articles [sw00118]
• surface and volume mesh generation, skin surfaces), geometry processing (surface mesh simplification, subdivision and parameterization ... approximation of ridges and umbilics), alpha shapes, convex hull algorithms...
• # PolyMesher

• Referenced in 154 articles [sw13340]
• implicit description of the domain geometry. The mesh generator can provide, among other things ... element and optimization codes that use linear convex polygons. In topology optimization, polygonal discretizations have ... polygonal elements makes possible meshing of complicated geometries with a self-contained Matlab code...
• # PALP

• Referenced in 70 articles [sw00672]
• with lattice polytopes and applications to toric geometry, which is freely available on the internet ... lattice points in the convex hull of a given set of points. In addition, there ... reflexive subpolytopes, and applications to toric geometry and string theory, like the computation of Hodge...
• # geometry

• Referenced in 13 articles [sw10010]
• package geometry: Mesh generation and surface tesselation: This package makes the qhull library (www.qhull.org) available ... Octave and MATLAB. Qhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi...
• # QuickhullDisk

• Referenced in 5 articles [sw31399]
• disks. Convex hull is one of the most fundamental constructs in geometry and its construction ... There are many prior works on the convex hull of points. However, its counterpart...
• # LyapunovFunDR

• Referenced in 2 articles [sw34755]
• applications, proving it is still limited to convex and a handful of other special cases ... lines, but globally the geometry is non-convex and the Douglas-Rachford operator multi-valued ... Douglas-Rachford iteration in more complex geometries that can be approximated by polygonal sets through...
• # MinPerim

• Referenced in 4 articles [sw40493]
• perimeter-minimizing convex hulls. We present and solve a new computational geometry optimization problem ... boundary, i.e., the perimeter, of the convex hull enclosing the non-overlapping circles is minimized...
• # rcdd

• Referenced in 5 articles [sw08186]
• package rcdd (Computational Geometry). R interface to (some of) cddlib (http://www.ifor.math.ethz.ch/ fukuda/cdd_home/cdd.html). Converts back ... forth between two representations of a convex polytope: as solution of a set of linear...
• # UNAMALLA

• Referenced in 7 articles [sw13144]
• often non convex, until a smooth and convex grid is obtained;using discrete functional defined ... algebra, large scale optimization methods and computer geometry, among others, and promotes the interaction between...
• # IRIT

• Referenced in 6 articles [sw21528]
• unique features that help in handling freeform geometry including strong symbolic, numeric and algebraic based ... extensive bisector computation for curves and surfaces, convex hulls and kernels, freeform curve and surface ... implicit forms. A rich set of computational geometry tools for freeform splines is offered including...
• # NominalLogisticBiplot

• Referenced in 1 article [sw32659]
• plane and the variables are represented as convex prediction regions rather than vectors ... binary biplot. Using the methods from Computational Geometry, the set of prediction regions is converted...
• # PolyMat

• Referenced in 5 articles [sw40601]
• problem without any penalization to a non-convex problem in which material mixing and intermediate ... associated with each local constraint of arbitrary geometry. A number of examples are presented...
• # FastGEO

• Referenced in 0 articles [sw05613]
• efficient and highly optimized path for computational geometry solutions. Hence FastGEO’s primitives are mainly ... complex algorithms such as triangulation and convex hulls it is recommended that an object oriented ... environment where mathematical theory regarding computational geometry can be observed in the real-world using...