SGP 2012
SYMPOSIUM ON GEOMETRY PROCESSING
Invited speakers

Takeo Igarashi (University of Tokyo)
http://www-ui.is.s.u-tokyo.ac.jp/~takeo

Title:"Design Everything by Yourself.interfaces for graphics, CAD modeling, and robots."

Abstract:"I will introduce our research project (design interface project) aiming at the development of various design tools for end-users. We live in a mass-production society today and everyone buy and use same things all over the world. This is cheap, but not necessarily ideal for individual persons. We envision that computer tools that help people to design things by themselves can enrich their lives. To that end, we develop innovative interaction techniques for end users to (1) create rich graphics such as three-dimensional models and animations by simple sketching (2) design their own real-world, everyday objects such as clothing and furniture with realtime physical simulation integrated in a simple geometry editor, and (3) design the behavior of their personal robots and give instructions to them to satisfy their particular needs."

Short Biography:Takeo Igarashi is a professor at CS department, the University of Tokyo. He received PhD from Dept of Information Engineering, the University of Tokyo in 2000. His research interest is in user interface in general and current focus is on interaction techniques for 3D graphics. He is known as the inventor of sketch-based modeling system called Teddy, and received The Significant New Researcher Award at SIGGRAPH 2006. He is currently leading a JST ERATO Igarashi Design Interface Project as a director.



Erik Demaine (Massachussets Institute of Technology)
http://erikdemaine.org/

Title:"Geometric Folding Algorithms: Linkages, Origami, Polyhedra."

Abstract:What forms of origami can be designed automatically by algorithms? How might we build reconfigurable robots like Transformers or Terminator 3, hinging together a collection of pieces that dynamically reconfigure into arbitrary shapes? When can a robotic arm of rigid rods be folded into a desired configuration? What shapes can result by folding a piece of paper flat and making one complete straight cut? What 3D surfaces can be manufactured from a single sheet of material? How might proteins fold?
Geometric folding is a branch of discrete and computational geometry that addresses these and many other intriguing questions. I will give a taste of the many results that have been proved in the past several years, as well as the several exciting unsolved problems that remain open. Many folding problems have applications in areas including manufacturing, robotics, graphics, and protein folding.

Short Biography:Erik Demaine is a Professor in Computer Science at the Massachusetts Institute of Technology. Demaine's research interests range throughout algorithms, from data structures for improving web searches to the geometry of understanding how proteins fold to the computational difficulty of playing games. He received a MacArthur Fellowship (2003) as a "computational geometer tackling and solving difficult problems related to folding and bending--moving readily between the theoretical and the playful, with a keen eye to revealing the former in the latter". Erik cowrote a book about the theory of folding, together with Joseph O'Rourke (Geometric Folding Algorithms, 2007), and a book about the computational complexity of games, together with Robert Hearn (Games, Puzzles, and Computation, 2009). His interests span the connections between mathematics and art, including curved origami sculptures in the permanent collection of the Museum of Modern Art (MoMA), New York.



Marc Pollefeys (ETH Zürich)
http://www.cs.unc.edu/~marc/

Title:"Geometry from images"

Abstract:One of the fundamental problems of computer vision is to extract 3D shape and motion from images. This can be achieved when a scene or object is observed from different viewpoints or over a period of time. In this talk, I will present several approaches we have developed. I will specifically address modeling of urban scenes from images where symmetries pose extra challenges as well as opportunities.

Short Biography:Marc Pollefeys is a full professor in the Dept. of Computer Science of ETH Zurich since 2007. He currently also remains associated with the Dept. of Computer Science of UNC at Chapel Hill where he started as an assistant professor in 2002. He holds a Ph.D. (1999) from the KULeuven. His main area of research is geometric computer vision and he aims to develop flexible approaches to capture visual representations of real world objects, scenes and events. Dr.Pollefeys received several awards, including a Marr prize (1998), NSF CAREER award (2003), Packard Fellowship (2005) and an ERC grant (2008). He is the author of more than 170 peer-reviewed publications. He is the General Chair for ECCV2014 and was a Program Co-Chair for CVPR2009. Prof. Pollefeys is on the Editorial Board of IJCV and was an associate editor for the IEEE PAMI. He is a Fellow of the IEEE.

SYMPOSIUM
July 16-18, 2012
Tallinn University of Tech.
Estonia