enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Geometric primitive - Wikipedia

    en.wikipedia.org/wiki/Geometric_primitive

    Common geometric primitive extensions include: three-dimensional coordinates for points, lines, and polygons; a fourth "dimension" to represent a measured attribute or time; curved segments in lines and polygons; text annotation as a form of geometry; and polygon meshes for three-dimensional objects.

  3. Graph-tool - Wikipedia

    en.wikipedia.org/wiki/Graph-tool

    graph-tool is a Python module for manipulation and statistical analysis of graphs (AKA networks). The core data structures and algorithms of graph-tool are implemented in C++ , making extensive use of metaprogramming , based heavily on the Boost Graph Library . [ 1 ]

  4. Superquadrics - Wikipedia

    en.wikipedia.org/wiki/Superquadrics

    Because of their flexibility and relative simplicity, they are popular geometric modeling tools, especially in computer graphics. It becomes an important geometric primitive widely used in computer vision, [ 2 ] [ 3 ] robotics, [ 4 ] and physical simulation.

  5. Signed distance function - Wikipedia

    en.wikipedia.org/wiki/Signed_distance_function

    In mathematics and its applications, the signed distance function or signed distance field (SDF) is the orthogonal distance of a given point x to the boundary of a set Ω in a metric space (such as the surface of a geometric shape), with the sign determined by whether or not x is in the interior of Ω.

  6. Random geometric graph - Wikipedia

    en.wikipedia.org/wiki/Random_geometric_graph

    In graph theory, a random geometric graph (RGG) is the mathematically simplest spatial network, namely an undirected graph constructed by randomly placing N nodes in some metric space (according to a specified probability distribution) and connecting two nodes by a link if and only if their distance is in a given range, e.g. smaller than a certain neighborhood radius, r.

  7. Euclidean tilings by convex regular polygons - Wikipedia

    en.wikipedia.org/wiki/Euclidean_tilings_by...

    Euclidean tilings are usually named after Cundy & Rollett’s notation. [1] This notation represents (i) the number of vertices, (ii) the number of polygons around each vertex (arranged clockwise) and (iii) the number of sides to each of those polygons.

  8. Gauss circle problem - Wikipedia

    en.wikipedia.org/wiki/Gauss_circle_problem

    This problem is known as the primitive circle problem, as it involves searching for primitive solutions to the original circle problem. [9] It can be intuitively understood as the question of how many trees within a distance of r are visible in the Euclid's orchard , standing in the origin.

  9. Mathematical morphology - Wikipedia

    en.wikipedia.org/wiki/Mathematical_morphology

    Mathematical Morphology was developed in 1964 by the collaborative work of Georges Matheron and Jean Serra, at the École des Mines de Paris, France.Matheron supervised the PhD thesis of Serra, devoted to the quantification of mineral characteristics from thin cross sections, and this work resulted in a novel practical approach, as well as theoretical advancements in integral geometry and ...