Professor of Computer Science at UC Irvine, researching graph algorithms and computational geometry. Wikipedian. Amateur photographer. Father of two.
0xDE's Latest Posts
Until 2006 (when bigger ones were found elsewhere) this was the home to the tallest known tree in the world. But it's not marked, so you just have to look at them all and guess which one might be the biggest.( More )
Aka that wide spot in the road on the way to Montgomery Woods( More )
I was wondering whether the outerplanar strict confluent drawings I studied in a Graph Drawing paper last year had underlying diagrams whose treewidth is bounded, similarly to the treewidth bound for the usual outerplanar graphs. The confluent graphs themselves can't have low treewidth, because they include large complete bipartite graphs, but I was hoping that a treewidth bound for the diagram could be used to prove that the graphs themselves have low clique-width. Sadly, it turns out not to […]
The diagram below describes a finite state machine that takes as input a description of an indifference graph, and produces as output a 1-planar drawing of it (that is, a drawing with each edge crossed at most once).Indifference graphs are the graphs that can be constructed by the following process. Initialize an active set of vertices to be the empty set, and then perform a sequence of steps of two types: either add a new vertex to the active set and make it adjacent to all previous active […]
I noticed that there was a higher-than-usual density of arxiv preprints among the web pages I'd been bookmarking lately, so I thought maybe I'd share. The first one, especially, is very timely:From the "Brazuca" ball to Octahedral Fullerenes: Their Construction and Classification, Yuan-Jia Fan, Bih-Yaw Jin, arXiv:1406.7058, via. The classical pentagon and hexagon soccer ball pattern (introduced for the 1970 World Cup) later became even more famous as the structure of the buckminsterfullerene […]
Log in to leave a comment