Questions tagged [vertices]

A vertex (plural: vertices) has a slightly different meaning depending on context. Computer graphics - data structure that describes position of a point in 2D or 3D space. Geometry - point where higher-dimensional geometric objects meet; Graph theory - fundamental unit of graphs;

A vertex in computer graphics is a data structure that describes certain attributes, like the position of a point in 2-Dimensional or 3-Dimensional space, at multiple points on a surface.

In geometry, a vertex is a point where two or more curves, lines, or edges meet. As a consequence of this definition, the point where two lines meet to form an angle and the corners of polygons and polyhedra are vertices.

In mathematics, and more specifically in graph theory, a vertex or node is the fundamental unit of which graphs are formed (usually represented by a circle with a label)

471 questions
6
votes
1 answer

Three.js Show single vertex as ie. a dot

Is it any way possible to show vertices of a mesh as ie. colored dots? Thanks.
Ejnaren
  • 63
  • 1
  • 5
6
votes
1 answer

LibGDX BOX2D change maxPolygonVertices

I need to make a body with more than 8 vertices, and i get the error. AL lib: (EE) alc_cleanup: 1 device not closed Assertion failed! Program: C:\Program Files\Java\jre7\bin\javaw.exe File:…
Boldijar Paul
  • 5,405
  • 9
  • 46
  • 94
6
votes
1 answer

Geometry from Scenekit primitives

I am successfully extracting vector data from SceneKit primitives, very much along the lines as in the question/answer here: Extracting vertices from scenekit This does not seem to work for all the geometries SceneKit generates though. I can extract…
flxldn
  • 61
  • 5
6
votes
1 answer

Vertices counter/clockwise

I am reading several books about OpenGL and in two of them they always define the vertices counter clockwise. From what I read this is very crucial because it determines where the front and back is. But I am also reading the tutorial on…
Maik Klein
  • 15,548
  • 27
  • 101
  • 197
5
votes
3 answers

Best Algorithm to find the edges (polygon) of vertices

I have a large array of vertices, some of them are edges, some are redundant (inside the shape) and I want to remove those. The simplest algorithm I could think of is checking one by one if they hit the shape formed by the others. But it should be a…
fabiopedrosa
  • 2,521
  • 7
  • 29
  • 42
5
votes
2 answers

How can I suppress the prompt to "Unify Duplicated Vertices" when opening several meshes from regular GUI

I have a folder with hundreds of STL meshes and I want to merge them in meshlab using the flatten command. I´m using the regular GUI and when I go to file open and pick all these STL files, I´m prompted for each and every file if I want to "Unify…
Daniel Santos
  • 188
  • 2
  • 15
5
votes
1 answer

OpenGL updating vertices array/buffer

When I first add some vertices to the buffer, these are the relevant functions I'm calling // Create and bind the object's Vertex Array Object: glGenVertexArrays(1, &_vao); glBindVertexArray(_vao); // Create and load vertex data…
James Adams
  • 678
  • 4
  • 11
  • 21
5
votes
0 answers

How to get vertices in shortest path using python igraph?

I can create a very simple graph using python-igraph... import igraph g=igraph.Graph.TupleList([("a", "b", 3.0), ("c", "d", 4.0), ("a", "c", 5.0)], weights=True) print( igraph.summary(g, full=True) ) which looks like this: IGRAPH UNW- 4 3 -- +…
dinkelk
  • 2,676
  • 3
  • 26
  • 46
5
votes
2 answers

Can I delete a float array when I have used glBufferData?

I'm studying OpenGL API and I would like to ask you if I can delete a float array of vertices after passing it to OpenGL. Example code: GLuint VBO; float *vertices = new float[2]; vertices[0] = 0.0f; vertices[1] = 1.0f; glGenBuffers(1,…
Seyro97
  • 93
  • 8
5
votes
3 answers

Python: Combination in lists of lists (?)

First of all I wanted to say that my title is probably not describing my question correctly. I don't know how the process I am trying to accomplish is called, which made searching for a solution on stackoverflow or google very difficult. A hint…
user4911943
  • 137
  • 1
  • 1
  • 5
5
votes
2 answers

Reverse Rectangle Packing

I have a connected shape that consists of squares put together, e.g. take a squared paper and draw a line along the existing lines that ends at its beginning and does not cross itself. The goal is now to find an algorithm (not brute-force) that…
aZen
  • 223
  • 1
  • 8
5
votes
1 answer

Minimum set of vertices that allow reaching all other vertices in max. one edge

this is probably a stupid question, but what is the canonical problem that asks for the minimum set of vertices out of a graph, so that from these vertices, all other vertices can be reached by "traveling" no more than one edge? The real-life…
user1769925
  • 588
  • 1
  • 6
  • 15
5
votes
1 answer

Controlling which edges are visible in a network diagram in igraph in r

I have a the following diagram created in igraph set.seed(1410) df<-data.frame( "site.x"=c(rep("a",4),rep("b",4),rep("c",4),rep("d",4)), "site.y"=c(rep(c("e","f","g","h"),4)), "bond.strength"=sample(1:100,16,…
Elizabeth
  • 6,391
  • 17
  • 62
  • 90
4
votes
1 answer

OpenLayers get Lat, Lon from polygon vertices

I am trying to get the boundary box using a square polygon in openlayers. I need to get the North, South, West, and East values from the box. Right now I am using : var topleft = vectors.features[0].geometry.getVertices()[0]; to get the top left…
gberg927
  • 1,636
  • 9
  • 38
  • 51
4
votes
2 answers

How to find Edges and Vertices of a hand drawn polygon

I would like to make a shape recognition program that would trace a mouse and record it's location at each 1/2 second. How could I use these points to find a rough polygon? In other words, if you just draw a shape resembling a triangle or square, it…
1
2
3
31 32