111 reputation
5
bio website vvvv.org
location Berlin, Germany
age
visits member for 1 year, 7 months
seen Dec 6 at 20:27

mathematician, working in a software company


Dec
3
comment Once and for all, clarity about conversion between different Cartesian coordinate systems
yes, by object i mean a set of 3d points. and in the example case it is true that (a, b, c) in A becomes (a, b, -c) in B. this appears trivial at first but leads to a lot of confusion when it comes to transformations.
Dec
3
awarded  Scholar
Dec
3
accepted Find subgraphs in a directed graph which are isolated by edge properties
Dec
3
answered Find subgraphs in a directed graph which are isolated by edge properties
Dec
3
asked Once and for all, clarity about conversion between different Cartesian coordinate systems
Sep
24
awarded  Autobiographer
Mar
8
awarded  Student
Mar
7
awarded  Editor
Mar
7
comment Find subgraphs in a directed graph which are isolated by edge properties
now updated the picture...
Mar
7
revised Find subgraphs in a directed graph which are isolated by edge properties
improved title and image
Mar
7
comment Find subgraphs in a directed graph which are isolated by edge properties
have a small update on this... the graph is directed. from top to bottom. so the rightmost vertex which is yellow should NOT be in the subgraph, because it comes from above... does this help or simplify the finding algorithm?
Mar
5
comment Find subgraphs in a directed graph which are isolated by edge properties
@hbm, they are arbitrary, theoretically every vertex from above could be connected to each vertex below. it would not make much sense for the actual output, but it is allowed and quite common that a vertex from above is connected to more than one vertex below.
Mar
5
comment Find subgraphs in a directed graph which are isolated by edge properties
@jamisans, the right image is still a simplification there can be edges between the blue vertices as well. those edges would need no special 'treatment' since the data type would be 'many'...
Mar
5
asked Find subgraphs in a directed graph which are isolated by edge properties
May
22
awarded  Supporter