From aupetit at dase.bruyeres.cea.fr Tue Apr 1 10:06:26 2003 From: aupetit at dase.bruyeres.cea.fr (aupetit) Date: Mon Jan 9 13:41:09 2006 Subject: styochastic approximation of proximity graph... Message-ID: <200304010806.KAA26001@tupai.bruyeres.cea.fr> Hello, do you know some works about approximating a proximity graph, that is finding a subgraph of Delaunay graph, using some stochastic optimization process (The closer the subgraph to Delaunay, the better the approximation). Note that I have high-dimensionnal points (d>20) so I cannot afford a straight computation of Delaunay graph (complexity scaling in exponential of the dimension for D>3). Thank you for your help Michael ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From agudimal at eng.usf.edu Wed Apr 2 09:36:03 2003 From: agudimal at eng.usf.edu (Architha Gudimalla) Date: Mon Jan 9 13:41:09 2006 Subject: Data sets Message-ID: <200304021436.JAA27658@dinos.eng.usf.edu> Could anyone please let me know where I can find real- world 2D point (x,y) data sets which I can use for my algorithm for searching k - nearest neighbors. Thanks, Architha ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From Szoraster at lgc.com Fri Apr 4 09:42:44 2003 From: Szoraster at lgc.com (Steve Zoraster) Date: Mon Jan 9 13:41:09 2006 Subject: Delaunay Triangulation in JAVA? Message-ID: I need a robust implementation of Delaunay triangulation in JAVA. A web search has not provided an obvious choice. Of course I am planning to pay nothing. Pointers code online, or to articles or dissertations with code appreciated. Steven Zoraster Research Manager/Surface Modeling Landmark Graphics/Austin ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From o.cheong at tue.nl Fri Apr 4 13:50:55 2003 From: o.cheong at tue.nl (Otfried Cheong) Date: Mon Jan 9 13:41:09 2006 Subject: Position for PhD student at TU Eindhoven (Netherlands) Message-ID: <16013.29087.690000.791774@gargle.gargle.HOWL> %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % OPENING for a PhD POSITION % % % % on the project % % % % Similarity of Graph Drawings % % % % at the TU EINDHOVEN (THE NETHERLANDS) % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% PROJECT DESCRIPTION ------------------- Computational geometry has studied the matching and analysis of geometric shapes from a theoretical perspective, and developed efficient algorithms measuring the similarity of geometric objects. Two objects are similar if they do not differ much geometrically. The goal of this project is to extend and generalize this work to a model where patterns are considered drawings of planar graphs, and to develop algorithms measuring the similarity of graph drawings. This will have to take into account not only the geometry of the shapes, but also their topological or combinatorial structure. Such a model captures some practical pattern recognition problems better than a purely geometric definition - recognizing logos, Egyptian hieroglyphics, Chinese characters, or electronic components in a circuit diagram are typical examples where this is the case. The goal of the project is to give suitable definitions for the similarity of graph drawings, to find asymptotically efficient algorithms measuring the similarity of two given drawings, and to design data structures for storing large sets of graph drawings such that the one most closely matching a given drawing can be retrieved quickly. THE ALGORITHMS GROUP AT THE TU EINDHOVEN ---------------------------------------- The Algorithms group is a new research group at the TU Eindhoven, established in late 2002. One of the focal points of the group is computational geometry. The group consists of prof.dr. Mark de Berg, dr. Otfried Cheong, dr. Bettina Speckmann (permanent staff members), dr. Joachim Gudmundsson (postdoc), and Micha Streppel (PhD student). It is expected that the group will grow in the future to several postdocs and PhD students. The webpage of the group is at "http://www.win.tue.nl/algo/" THE CANDIDATE ------------- The candidate should have a masters degree in computer science or mathematics, with a firm background in algorithms. BEING A PhD STUDENT IN THE NETHERLANDS -------------------------------------- In the Netherlands, every PhD student gets paid a salary; no additional grants are needed. Moreover, although PhD students sometimes take courses, there is no minimum requirement. Hence, PhD students are more like employees than like students. Indeed, the Dutch word for PhD student translates to "research trainee". The work of a PhD student may include assisting in courses of BSc or MSc programs of the department. This amounts to at most 20% of the time; the remaining time is spent on research and research-related activities. Foreign PhD students need not speak Dutch: it is easy to get by with English, not only at the university but also in everyday life. WE OFFER -------- * A research position in a young, enthousiastic, and internationally oriented research group. * A four-year position with an evaluation after one year. * A salary of 1526 euro/month in the first year, increasing to 2063 euro/month in the final year. * Well organized support for your personal development and career policy. * Excellent fringe benefits: reimbursement of the PhD thesis' costs up to 1800 euro, outstanding sporting facilities, children's day care, company savings. MORE INFORMATION ---------------- If you want to know more about the project or how to apply, please contact Otfried Cheong (o.cheong@tue.nl) or Mark de Berg (m.t.d.berg@tue.nl). ==================================================================== ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From jsbm at ams.sunysb.edu Tue Apr 8 14:06:05 2003 From: jsbm at ams.sunysb.edu (jsbm@ams.sunysb.edu) Date: Mon Jan 9 13:41:09 2006 Subject: Workshop Program: DIMACS Workshop on Geometric Optimization Message-ID: <200304081701.h38H1sm12632@catbert.ams.sunysb.edu> [Note: please register as soon as possible if you plan to attend any or all of the 3-day workshop -- this will help us in planning how many people to expect (and how much food to order!). See registration information and links at the bottom of this email. Thanks! --Joe] ---------------------------------------------------------- DIMACS Workshop on Geometric Optimization May 19 - 21, 2003 DIMACS Center, CoRE Building, Rutgers University Organizers: Pankaj Agarwal, Duke University, pankaj@cs.duke.edu Joe Mitchell, SUNY Stony Brook, jsbm@ams.sunysb.edu Presented under the auspices of the Special Focus on Computational Geometry and Applications. ---------------------------------------------------------- Workshop Program: MONDAY May 19 08:15-08:55 Breakfast and registration 08:55-09:00 Opening remarks Fred Roberts, Director of DIMACS 09:00-10:00 Unique Sink Orientations of Cubes and its Relations to Optimization Emo Welzl, ETH Zurich 10:00-10:30 Smoothed Analysis of Algorithms: Simplex Algorithm and Numerical Analysis Shanghua Teng, Boston University 10:30-11:00 Break 11:00-11:30 The Protein Side-Chain Positioning Problem Carl Kingsford, Princeton University 11:30-12:00 Approximate Protein Structural Alignment in Polynomial Time Rachel Kolodny, Stanford University 12:00-12:30 Hausdorff Distance under Translation for Points and Balls Yusu Wang, Duke University 12:30-02:00 Lunch 02:00-03:00 Emerging Trends in Optimization Dan Bienstock, Columbia University 03:00-03:30 Exact Parallel Algorithm for Computing Maximum Feasible Subsystems of Linear Relations Vera Rosta, McGill University 03:30-04:00 Improved Embeddings of Metrics into Trees Satish Rao, UC Berkeley 04:00-04:30 Break 04:30-05:00 Online Searching with Turn Cost Erik Demaine, MIT 05:00-05:30 Leave no Stones Unturned: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees Raja Jothi, UT Dallas 05:30-06:00 Constructing Spanners of Different Flavors Joachim Gudmundsson TUESDAY May 20 08:15-09:00 Breakfast and registration 09:00-10:00 Random Walks and Geometric Algorithms Santosh Vempala, MIT 10:00-10:30 Approximation Algorithms for k-Center Clustering Piyush Kumar, SUNY Sony Brook 10:30-11:00 Break 11:00-11:30 Computing Projective Clusters via Certificates Cecilia M. Procopiuc, AT&T Labs 11:30-12:00 Shape Fitting with Outliers Sariel Har-Peled, UIUC 12:00-12:30 Approximate Minimum Volume Enclosing Ellipsoids Using Core Sets Alper Yildirim, SUNY Sony Brook 12:30-02:00 Lunch 02:00-03:00 Geometric Optimization and Arrangements Micha Sharir, Tel Aviv University 03:00-03:30 Approximating the k-Radius of High-Dimensional Point Sets Kasturi Varadarajan, University of Iowa 03:30-04:00 Break 04:00-05:00 Approximation Schemes for Geometric NP-Hard Problems: A Survey Sanjeev Arora, Princeton University 05:00-05:30 TSP with Neighborhoods of Varying Size Matya Katz, Ben Gurion University 05:30-06:00 Touring a Sequence of Polygons Alon Efrat, University of Arizona WEDNESDAY May 21 09:00-10:00 Quasiconvex Programming David Eppstein, UC Irvine 10:00-10:30 Engineering Geometric Optimization Algorithms: Some Experiments Herve Bronnimann, Polytechnic University 10:30-11:00 Subtraction in Geometric Searching Bernard Chazelle 11:00-11:30 Minimum Separation in Weighted Subdivisions Ovidiu Daescu and James Palmer 11:30-12:30 Lunch 12:30-01:00 Some Data Streaming Problems in Computational Geometry S. Muthukrishnan, Rutgers University 01:00-01:30 Streaming Geometric Optimization Using Graphics Hardware Suresh Venkatasubramanian, AT&T Labs 01:30-02:00 Efficient Algorithms for Shared Camera Control Vladlen Koltun, UC Berkeley Registration: (Pre-registration date: May 04, 2003) Regular rate Preregister before deadline $120/day After preregistration deadline $140/day Reduced Rate* Preregister before deadline $60/day After preregistration deadline $70/day Postdocs Preregister before deadline $10/day After preregistration deadline $15/day DIMACS Postdocs $0 Non-Local Graduate & Undergraduate students Preregister before deadline $5/day After preregistration deadline $10/day Local Graduate & Undergraduate students $0 (Rutgers & Princeton) DIMACS partner institution employees** $0 DIMACS long-term visitors*** $0 Registration fee to be collected on site, cash, check, VISA/Mastercard accepted. Our funding agencies require that we charge a registration fee for the workshop. Registration fees cover participation in the workshop, all workshop materials, breakfast, lunch, breaks, and any scheduled social events (if applicable). * College/University faculty and employees of non-profit organizations will automatically receive the reduced rate. Other participants may apply for a reduction of fees. They should email their request for the reduced fee to the Workshop Coordinator at workshop@dimacs.rutgers.edu. Include your name, the Institution you work for, your job title and a brief explanation of your situation. All requests for reduced rates must be received before the preregistration deadline. You will promptly be notified as to the decision about it. ** Fees for employees of DIMACS partner institutions are waived. DIMACS partner institutions are: Rutgers University, Princeton University, AT&T Labs - Research, Avaya, Bell Labs, NEC Research Institute and Telcordia Technologies. ***DIMACS long-term visitors who are in residence at DIMACS for two or more weeks inclusive of dates of workshop. Information on participation, registration, accommodations, and travel can be found at: http://dimacs.rutgers.edu/Workshops/GeomOpt/index.html ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From tamaldey at cis.ohio-state.edu Fri Apr 11 16:19:17 2003 From: tamaldey at cis.ohio-state.edu (tamal dey) Date: Mon Jan 9 13:41:09 2006 Subject: DIMACS Surface Reconstruction Implementation Challenge Message-ID: <200304111919.h3BJJH721638@cis.ohio-state.edu> This is the final call for participation in the Surface Reconstruction Implementation Challenge whose results will be reported in the upcoming DIMACS workshop on Surface Reconstruction. Please visit http://www.cis.ohio-state.edu/dimacs-sr-challenge to see the details for participation. ---Tamal Dey and Claudio Silva Organizers for the challenge ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From mcallist at cs.dal.ca Tue Apr 15 09:38:47 2003 From: mcallist at cs.dal.ca (Michael McAllister) Date: Mon Jan 9 13:41:09 2006 Subject: CCCG '03: Second Call for Papers Message-ID: <20030415083847.A28322@cs.dal.ca> -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- Second Call for Papers 15th Canadian Conference on Computational Geometry August 11-13, 2003 Dalhousie University http://www.cs.dal.ca/~cccg -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- Objectives The Canadian Conference on Computational Geometry (CCCG) focuses on the mathematics of discrete geometry from a computational point of view. Abstracting and studying the geometry problems that underly important applications of computing (such as geographic information systems, computer-aided design, simulation, robotics, solid modeling, databases, and graphics) leads not only to new mathematical results, but also to improvements in these applications. Despite its international following, CCCG maintains the informality of a smaller workshop and attracts a large number of students. Call for Papers Authors are invited to submit papers describing research of theoretical and practical significance to computational geometry. Electronic submissions, in standard PostScript and not exceeding 4 pages length, should be made from the conference web page. Invited Speakers Tetsuo Asano, Osaka Electro-Communication University Mark de Berg, Technische Universiteit Eindhoven Ferran Hurtado, Universitat Politecnica de Catalunya Special Issue The program committee will invite the authors of approximately 6 of the accepted papers to submit a final version to a special issue of Computational Geometry: Theory and Applications. These papers will go through a full refereeing process for the journal. Important Dates Submission May 2, 2003 Notification May 31, 2003 Final version June 27, 2003 Conference August 11-13, 2003 Program Committee Therese Biedl (Univ. of Waterloo) Mark Keil (Univ. of Saskatchewan) Alex Lopez-Ortiz (Univ. of Waterloo) Michael McAllister (Dalhousie University) Henk Meijer (Queen's University) Tom Shermer (Simon Fraser University) Bettina Speckmann (ETH Zurich) Cao-An Wang (Memorial University) Steven Wismath (Univ. of Lethbridge) Local Contact Michael McAllister Faculty of Computer Science Dalhousie University 6050 University Avenue Halifax, Nova Scotia Canada B3H 1W5 phone: (902) 494-3151 fax: (902) 492-1517 email: mcallist@cs.dal.ca ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From sjf at research.bell-labs.com Fri Apr 18 11:31:01 2003 From: sjf at research.bell-labs.com (Steve Fortune) Date: Mon Jan 9 13:41:09 2006 Subject: 2003 Symposium on Computational Geometry Message-ID: <3EA00C25.14CC4112@research.bell-labs.com> The 2003 Symposium on Computational Geometry (SOCG) http://www.cs.umd.edu/areas/Theory/socg03/ will be held in San Diego, California, on June 8 - 10, 2003, as part of the Federated Computing Science Research Conference (FCRC). The program for SOCG is available at http://www.cs.umd.edu/areas/Theory/socg03/program.html More information on FCRC is available at http://www.acm.org/sigs/conferences/fcrc/ Registration for SOCG (and FCRC) can be performed on the web at http://www.regmaster.com/fcrc2003.html The registration fee consists of an overhead fee for the FCRC and a conference-specific fee for SOCG. For preregistered ACM/IEEE members, the fees are $80 + $330; for preregistered students the fees are $0 + $155. If you are not an ACM/IEEE member, the combined nonstudent fees go up by $135, so it is slightly cheaper to join ACM ($99) and get the discounted rate. **** PREREGISTRATION DEADLINE IS MAY 7, 2003 ***** **** PREREGISTRATION IS STRONGLY URGED **** The registration fee goes up SUBSTANTIALLY after the preregistration deadline, particularly for students. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From sjf at research.bell-labs.com Tue Apr 29 11:05:29 2003 From: sjf at research.bell-labs.com (Steve Fortune) Date: Mon Jan 9 13:41:09 2006 Subject: REMINDER: Student activities at SOCG/FCRC Message-ID: <3EAE86A9.F121DC40@research.bell-labs.com> The 2003 Symposium on Computational Geometry (SOCG) will be part of FCRC (http://www.acm.org/fcrc/) in San Diego, June 8 - 10, 2003. FCRC has two activities directed towards student participants. One activity is a series of breakfasts with senior researchers. The purpose is to allow students to meet with senior researchers informally. If you would like to participate in the research breakfasts, there is an online registration form accessible through the FCRC website. The second activity is a series of two sessions where students can present posters about research results. The sessions are currently scheduled for monday June 9 and thursday Jun 12, from 5:30 to 7:00pm. (Unfortunately the SOCG business meeting is also scheduled for monday evening.) A flyer about the poster sessions is included below. The sessions are open to any student. However, students need to register planned participation so we can get a count (and if there are many registrants, it's possible participation may be limited). If you are a student attending SOCG with research results, please feel welcome to participate in the poster session; similarly, if you know a student with research results who is attending, please encourage them to participate. To register for the poster session or for more information, please contact Steven Fortune sjf@bell-labs.com ------------------------------------------------------------------------------------------------------ FCRC Student Attendees: Interested in displaying your work to the greater Computer Science community? Interested in a chance to make connections? Then apply to participate in the FCRC Student Poster Session. Tentatively scheduled from 5:30 to 7:00 on Monday and Thursday nights, the poster session will be a chance for you to display your research on one of these nights, and to interact with conferences attendees from a wide range of areas. Applicants will be selected by their conferences, and will be given space for a poster display. Held in conjunction with an FCRC social event for all conference attendees, researchers will have ample opportunity to view your poster and discuss your research with you. Interested students should apply though their own conference; each conference will select students for participation under the conference-specific criteria. Students will be assigned to the night corresponding to the conference that has selected them. For more information see the Student Activities link on the FCRC web page (http://www.acm.org/fcrc/). John Karro Student Activities Chair ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From gert at cs.rug.nl Wed Apr 23 10:44:53 2003 From: gert at cs.rug.nl (Vegter) Date: Mon Jan 9 13:41:09 2006 Subject: assistent professorship Message-ID: <3EA64475.3080606@cs.rug.nl> Tenure-Track Position for Assistant Professor in Scientific Visualisation and Computer Graphics at the Institute of Mathematics and Computing Science University of Groningen The Faculty of Mathematics and Natural Sciences is offering young, talented researchers positions which are on the same level as those of assistant professor via the tenure-track system. The appointment will be on a temporary basis for a maximum of 6 years. On completion of 5 years of employment there will be an assessment of performance based on established criteria. If the outcome of the assessment is positive, the assistant professor will be promoted to the rank of associate professor with tenure. There will be another assessment at the end of a further 5-year period during which a full professorial appointment will be discussed. The position is in the newly established research group Scientific Visualisation and Computer Graphics. Candidates should have research experience in one or more of the following areas: computer graphics, virtual reality, scientific visualisation, medical imaging, computer vision and strong interest in biomedical research. For more information, see: http://www.rug.nl/informatica/vacatures/iwivacatures/at203102 Contact person: Prof. Dr. Jos Roerdink (roe@cs.rug.nl), Tel: 050-3633931 -- Gert Vegter University of Groningen, Department of Mathematics and Computing Science P.O.Box 800, 9700 AV Groningen, The Netherlands URL: http://www.cs.rug.nl/~gert/ Tel: +31 50 363 39 30 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From sjf at research.bell-labs.com Mon Apr 28 09:39:16 2003 From: sjf at research.bell-labs.com (Steve Fortune) Date: Mon Jan 9 13:41:09 2006 Subject: 2nd reminder: 2003 Symposium on Computational Geometry Message-ID: <3EAD20F4.5BE9F9FA@research.bell-labs.com> The 2003 Symposium on Computational Geometry (SOCG) http://www.cs.umd.edu/areas/Theory/socg03/ will be held in San Diego, California, on June 8 - 10, 2003, as part of the Federated Computing Science Research Conference (FCRC). The program for SOCG is available at http://www.cs.umd.edu/areas/Theory/socg03/program.html More information on FCRC is available at http://www.acm.org/sigs/conferences/fcrc/ Registration for SOCG (and FCRC) can be performed on the web at http://www.regmaster.com/fcrc2003.html The registration fee consists of an overhead fee for the FCRC and a conference-specific fee for SOCG. For preregistered ACM/IEEE members, the fees are $80 + $330; for preregistered students the fees are $0 + $155. If you are not an ACM/IEEE member, the combined nonstudent fees go up by $135, so it is slightly cheaper to join ACM ($99) and get the discounted rate. **** PREREGISTRATION DEADLINE IS MAY 7, 2003 ***** **** PREREGISTRATION IS STRONGLY URGED **** The registration fee goes up SUBSTANTIALLY after the preregistration deadline, particularly for students. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From emo at inf.ethz.ch Thu Apr 24 12:36:47 2003 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:41:09 2006 Subject: WORKSHOP IN DISCRETE AND COMPUTATIONAL GEOMETRY AT MSRI Message-ID: <200304240936.LAA07161@blabla.inf.ethz.ch> INTRODUCTORY WORKSHOP IN DISCRETE AND COMPUTATIONAL GEOMETRY AT MSRI Wednesday, August 20 through Thursday, August 28, 2003 Organizing Comm.: Jesus A. De Loera, Herbert Edelsbrunner, Jacob E. Goodman, Janos Pach, Micha Sharir, Emo Welzl, and Guenter M. Ziegler We are happy to announce that the list of speakers is now set for the first workshop of the special semester on Discrete and Computational Geometry that will take place at the Mathematical Sciences Research Institute this coming fall in Berkeley. This workshop is intended to introduce the area of discrete and computational geometry to mathematicians and computer scientists not (yet) active in the field, or just entering it, and is aimed particularly at graduate students and postdocs and at researchers who may already be working in other but related areas. It will highlight the interaction between mathematical and algorithmic aspects of the field. The speakers, each of whom will give a pair of one-hour talks, are all leading researchers in the field and have been chosen especially for their accessible styles. They are as follows: Bernd Sturmfels: Tropical Geometry Joel Hass: Minimal Surfaces and Normal Surfaces in 3-Manifolds Jeff Lagarias: Quasicrystals and Discrete Geometry; Density of Sphere Packings Erik Demaine: Folding & Unfolding: Linkage Folding; Computational Origami Ron Graham: Euclidean Ramsey Theory; Packing Equal Discs in Planar Regions Guenter M. Ziegler: 4-Dimensional Polytopes Joe O'Rourke: Folding & Unfolding: Folding Polygons to Convex Polyhedra; Unfolding Polyhedra Emo Welzl: Combinatorial Models for Solving Linear Programs; k-Sets and j-Facets Gil Kalai: Graphs and Skeleta of Polytopes David Eppstein: Computational Geometry and Robust Statistics; Hyperbolic Geometry, Moebius Transformations, and Geometric Optimization Richard Gardner: Discrete Tomography: a Survey; Reconstruction of Convex Bodies from Brightness Functions Imre Barany: Combinatorial Convexity: Theorems of Caratheodory, Helly, Radon and Tverberg (MSRI-Evans Lecture); Algebraic Topology Applied in Geometry Robin Forman: Topics in Combinatorial Differential Geometry Nina Amenta: Finding Objects in the Delaunay Triangulation; Actually Doing It: Algorithms and Programs for 3D Delaunay Triangulation Janos Pach: Geometric Graph Theory Alexander Barvinok: Complexity of Convex Bodies in Higher Dimensions MSRI is committed to the principles of Equal Opportunity and Affirmative Action. Please keep in mind, and let your students and postdocs know as well, that the deadline for applying for travel support to the workshop is May 15. For more information and to register online, go to http://www.msri.org and click on `Programs', `Discrete and Computational Geometry', `Introductory Workshop', and `register on-line'. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.