The following is a selection of the papers published by Dr. P. Prusinkiewicz and his students and colleagues.
Här finns även boken The Algorithmic Beauty of Plants att ladda ned gratis.
We are proud to announce a new computer graphics journal: “The Journal of Computer Graphics Techniques.” JCGT embraces the changing world of scientific publishing, which is moving away from for-profit print journals and towards free, online, digital publications. JCGT is a high-quality, peer-reviewed, and free journal for techniques: short papers of clear practical or theoretical value. We are dedicated to advancing the field of computer graphics through the publication of techniques in all areas of computer graphics, including software, hardware, games, and interaction.
JCGT is the next step in a respected tradition. When the best way to disseminate new, self-contained graphics techniques was in book form, the Graphics Gems Series was born. When we wanted to add peer review and a more timely publication schedule, many of the former Graphics Gems editors banded together to form the Journal of Graphics Tools. Today, we can publish even more promptly and eliminate all subscription and author’s fees by moving to online digital publication. Thus, the JGT founding editor, advisory board, and much of the 2012 editorial board have resigned from JGT, and together we have created the free and non-profit Journal of Computer Graphics Techniques.
JCGT’s editorial board will continue our commitment to rigorous peer review in a tight review cycle with high-quality editorial feedback. We will use modern online tools to produce and host our articles. Thanks to the nature of online publishing, papers can be published immediately after their review cycle concludes and they are approved by the Editor-in-Chief. Because it’s online, JCGT can host supplementary material such as source code and images, and link them to the original article. In keeping with volunteer-driven, non-profit Open Access models, JCGT will use a minimal, non-exclusive copyright and publish all source code as Open Source.
Trevligt litet blogginlägg om parallellprogrammering (/concurrency).
Udacity. Peter Norvig.
CS212 - Design of Computer Programs Improve your programming skills with new patterns and techniques.
The key to progressing from a novice programmer to an expert is mindful practice. In this class you will practice going from a problem description to a solution, using a series of assignments. With each problem you will learn new concepts, patterns, and methods that will expand your ability and help move you along the path from novice towards expertise.
In this course, we will study the concepts and algorithms behind some of the remarkable successes of computer vision - capabilities such as face detection, handwritten digit recognition, reconstructing three-dimensional models of cities, automated monitoring of activities, segmenting out organs or tissues in biological images, and sensing for control of robots.
Skriven av Thomas P. Hayes, 5:e December 2011.
We study a very simple and natural algorithm for for finding a matching of “hats” with “men”: line up the men in a random order, then, taking the hats in random order, assign each hat to the first man still in line who wants it, removing the man and hat. The competitive ratio of this algorithm, defined as the expected size of the matching obtained, divided by the size of the maximum matching possible, is not known. We prove that, in the case of n men and n hats, where hat i is acceptable to man j whenever i <= j, the competitive ratio is nearly optimal, specifically 1-O(n^-(1/5)). This input has been a “hard case” for a number of other online matching algorithms. We conjecture that, in general, this algorithm has a competitive ratio of 1-o(1) for any acceptability graph whose minimum degree tends to infnity. This may be the simplest known algorithm for “random arrival order online matching” for which such a conjecture has been made. We also conjecture that the worst-case competitive ratio of our algorithm is 1 - 1/e, which is also optimal.
Very short computer programs, sometimes consisting of as few as three arithmetic operations in an infinite loop, can generate data that sounds like music when output as raw PCM audio. The space of such programs was recently explored by dozens of individuals within various on-line communities. This paper discusses the programs resulting from this exploratory work and highlights some rather unusual methods they use for synthesizing sound and generating musical structure.
Artikel skriven av Ville-Matias Heikkilä
This page collects links around papers that try to settle the “P versus NP” question (in either way).
[Equal]: In October 2011, Jason W. Steinmetz established P=NP. His paper “Algorithm that Solves 3-SAT in Polynomial Time presents a polynomial time solution for the NP-hard 3-SAT problem. It is available at http://arxiv.org/abs/1110.1658.
Knepig fråga med många olika ansatser till svar.
Throughout history, geometric patterns have formed an important part of art and ornamental design. Today we have unprecedented ability to understand ornamental styles of the past, to recreate traditional designs, and to innovate with new interpretations of old styles and with new styles altogether.
The power to further the study and practice of ornament stems from three sources. We have new mathematical tools: a modern conception of geometry that enables us to describe with precision what designers of the past could only hint at. We have new algorithmic tools: computers and the abstract mathematical processing they enable allow us to perform calculations that were intractable in previous generations. Finally, we have technological tools: manufacturing devices that can turn a synthetic description provided by a computer into a real-world artifact. Taken together, these three sets of tools provide new opportunities for the application of computers to the analysis and creation of ornament.
In this dissertation, I present my research in the area of computer-generated geometric art and ornament. I focus on two projects in particular. First I develop a collection of tools and methods for producing traditional Islamic star patterns. Then I examine the tessellations of M.C. Escher, developing an “Escherization” algorithm that can derive novel Escher-like tessellations of the plane from arbitrary user-supplied shapes. Throughout, I show how modern mathematics, algorithms, and technology can be applied to the study of these ornamental styles.
Skriven av Craig S. Kaplan. Han har även skrivit en Java-applet för att leka med Penrose-mönster.
Trevlig tråd med tips på kvalitetsartiklar.
DAMN COOL! Artikeln är skriven av Nick Johnson
Aahh den gamla pumping lemman, minns den med värme från Automata theory, Languages and Computation.