thi.ng is an open source collection of 20+ computational design tools for Clojure & Clojurescript: generative design, data visualization, digital fabrication, linked data, graph processing and more...
This is the Graph Neural Networks: Hands-on Session from the Stanford 2019 Fall CS224W course.
In this tutorial, we will explore the implementation of graph neural networks and investigate what representations these networks learn. Along the way, we'll see how PyTorch Geometric and TensorBoardX can help us with constructing and training graph models.
Pytorch Geometric tutorial part starts at -- 0:33:30
Details on:
* Graph Convolutional Neural Networks (GCN)
* Custom Convolutional Model
* Message passing
* Aggregation functions
* Update
* Graph Pooling
While simple approximations to the bbox are trivial (such as computing the bounding box of their control points), in this article we deduce the exact bounding box analytically.
A pair of mathematicians has built on an obscure, 30-year-old mathematical theory to show that soap-filmlike minimal surfaces appear abundantly in a wide range
I made another thing! This is a torus, made from 24 crescent-shaped pieces of paper with slots cut into them so they interlock with each other. I followed these instructions on cutoutfoldup.com. There is also a template with some ideas for nice variations here. The idea of this model is to highlight Villarceau circles. Everyone…
This book explains the algorithms behind those collisions using basic shapes like circles, rectangles, and lines so you can implement them into your own projects.
GPUs are designed to do many things well, but drawing transparent 3D objects is not one of them. Opacity doesn't commute so that the order in which you draw surfaces makes a big difference. Of course simple additive blending does commute, but it's not really what we think of as "transparent objects". The simplest way to draw transparent objects is from back to front via the painter's algorithm. In this approach we sort geometry and draw only from back to front. This requires sorting triangles, which, in add
John D. Cook, Greg Egan, Dan Piponi and I had a fun mathematical adventure on Twitter. It started when John Cook wrote a program to compute the probability distribution of distances $latex |xy - yx|$ where $latex x$ and $latex y$ were two randomly chosen unit quaternions: • John D. Cook, How far is xy…
A minimal surface is the surface of minimal area between any given boundaries. In nature such shapes result from an equilibrium of homogeneous tension, e.g. in a soap film. Minimal surfaces have a constant mean curvature of zero, i.e. the sum of the principal curvatures at each point is zero. Particularly fascinating are minimal surfaces…
- Aug. 19 – Aug. 28, 2020
- Nike Sun (Massachusetts Institute of Technology; chair), Jian Ding (University of Pennsylvania), Ronen Eldan (Weizmann Institute), Elchanan Mossel (Massachusetts Institute of Technology), Joe Neeman (University of Texas at Austin), Jelani Nelson (UC Berkeley), Tselil Schramm (Stanford University; Microsoft Research Fellow)
It is a live weekly hour-long webseries showcasing geometry processing research. Topics range from computer science, mathematics, and engineering including 3D deep learning, computational fabrication, and computer graphics. The unique format of the Toronto Geometry Colloquium pairs a 10-min opener speaking about a recent work with a 50-min headliner giving a keynote-style address
Tungsteno is a project whose goal is to make mathematics accessible to everybody, completely free, based on open collaboration and the best pedagogical tools
Top Journals For Geometry And Topology with Impact Factor, Citescore, Overall Ranking/Rating, h-index, SCImago Journal Rank (SJR), ISSN, Publisher, and other Important Details