From sarahd at dimacs.rutgers.edu Fri Nov 1 16:50:53 2002 From: sarahd at dimacs.rutgers.edu (Sarah Donnelly) Date: Fri, 1 Nov 2002 16:50:53 -0500 (EST) Subject: [Sy-cg-global] Program: DIMACS Workshop on Implementation of Geometric Algorithms Message-ID: <200211012150.QAA06324@dimacs.rutgers.edu> DIMACS Workshop on Implementation of Geometric Algorithms December 4 - 6, 2002 DIMACS Center, Rutgers University, Piscataway NJ Organizers: Herve Bronnimann, Polytechnic University, hbr at poly.edu Steven Fortune, Bell Laboratories, Lucent Technologies, sjf at bell-labs.com Presented under the auspices of the Special Focus on Computational Geometry and Applications. *************************************************************** It is notoriously difficult to implement geometric algorithms. This difficulty arises in part from the conceptual complexity of geometric algorithms, the proliferation of special cases, the dependence of combinatorial decisions on numerical computation, and frequent theoretical focus on worst-case asymptotic behavior. This workshop will address research issues related to the implementation of geometric algorithms. Typical, but not exclusive topics include: Numerical issues Noisy data and data repair Geometric data structures Massive geometric data sets Algorithm library design Algorithm engineering Experimental studies Numerical issues have long been an important concern in the implementation of geometric algorithms. In the last decade the issue has become a central research topic in computational geometry, and a reasonably successful approach based on the use of exact (extended-precision) arithmetic has been developed. However, many significant problems remain---high-level rounding, extension to curved objects, performance---and the practical impact of the research is not yet clear. Geometric data sets based on physical measurements are inherently noisy. If such geometric data also has combinatorial structure, the geometric and combinatorial information may be inconsistent. To be useful, geometric algorithms must be able to repair such data, that is, in some fashion eliminate inconsistencies. Unfortunately, there is little relevant theory, and current data repair is heuristic at best. Geometric data structures are known that can represent complex structures in any dimension. However massive data sets in two dimensions, or even modest data sets in high dimension, can require enormous amounts of memory. A challenging research topic is to design algorithms and data structures that are cognizant of the memory hierarchy---cache, main memory, disk---and to provide appropriate implementations. These are just some of the problems faced by general purpose geometric algorithms libraries. Considerable effort has been expended developing the geometric algorithm library CGAL, which is now reasonably mature. CGAL,just together with the LEDA algorithm library, provide an unparalleled resource for users of geometric algorithms. Further development of algorithm libraries requires attention to many issues---those mentioned above, but also functionality, interface, performance, and support for specific application areas. We plan to bring together both researchers and practitioners. We hope that practitioners will benefit from discussions of the state of the art in research, and that researchers will benefit by being exposed to implementation issues of practical importance. ************************************************************** WEDNESDAY December 4 8:15 - 8:55 Breakfast and registration 8:55 - 9:00 Opening remarks, Fred Roberts, Director of DIMACS 9:00 - 9:30 Root-comparison techniques and applications to the Voronoi diagram of Disks Ioannis Emiris, University of Athens 9:30 - 10:00 Progress in constructive root bounds Chee Yap, NYU 10:00 - 10:30 Iterative conditioning as an algorithm design schema for robust geometric predicates Steven Fortune, Bell Labs 10:30 - 11:00 break 11:00 - 11:30 Controlled Perturbation for Arrangements of Circles Dan Halperin, Tel Aviv University 11:30 - 12:00 Geometric Conditioning Victor Milenkovic, University of Miami 12:00 - 2:00 lunch 2:00 - 2:30 A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons Michael Hemmer, Max-Planck-Institut fur Informatik 2:30 - 3:00 An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics Nicola Wolpert, Max-Planck-Institute for Computer Science 3:00 - 3:30 Robust Operations on Curved Solids John Keyser, Texas A&M University 3:30 - 4:00 break 4:00 - 4:30 TBA Monique Teillaud, INRIA 4:30 - 5:00 Efficient Exact Geometric Predicates for Delaunay Triangulations Sylvain Pion, MPI Saarbruecken Thursday December 5 8:30 - 9:00 Breakfast 9:00 - 9:30 Data Structures and Design of a 3D Mesh Generator Jonathan Shewchuk, Berkeley 9:30 - 10:00 Boolean Operations on 3D Surfaces Using Nef Polyhedra Lutz Kettner, MPI Informatik, Germany 10:00 - 10:30 TBA Stefan Schirra 10:30 - 11:00 break 11:00 - 11:30 Experiences With Designing and Implementing "Industrial- Strength" Codes for Handling "Industrial-Quality" Data in Real-World Applications Martin Held, Salzburg 11:30 - 12:00 TBA Andreas Fabri 12:00 - 2:00 lunch 2:00 - 2:30 JDSL: the Data Structures Library in Java Roberto Tamassia, Brown 2:30 - 3:00 TBA Herve Bronnimann, Polytechnic 3:00 - 3:30 Algorithm library development for complex biological and mechanical systems: functionality, interoperability and numerical stability Marina Gavrilova, University of Calgary 3:30 - 4:00 break 4:00 - 6:00 Panel Discussion: What next for computational geometry software? Nina Amenta, Andreas Fabri, Steven Fortune, Jonathan Shewchuk 6:00 - 7:30 Dinner (DIMACS Lounge, Room 401, CoRE Bldg.) Friday December 6 8:30 - 9:00 Breakfast 9:00 - 9:30 TBA Shankar Krishnan, ATT 9:30 - 10:00 Blocked Randomized Incremental Constructions Nina Amenta, Sunghee Choi, University of Texas, Austin 10:00 - 10:30 A Parallel Implementation of an Arrangement Construction Algorithm Komei Fukuda, McGill 10:30 - 11:00 break 11:00 - 11:30 Fast Penetration Depth Estimation: Algorithms, Implementation & Applications Ming Lin, UNC Chapel Hill 11:30 - 12:00 Voronoi diagrams for VLSI manufacturing: Robustness and implementation issues Evanthia Papadopoulou, IBM T.J. Watson Research Center 12:00 - 1:30 lunch 1:30 - 2:00 TBA David Warme, L-3Com 2:00 - 2:30 Polyhedral Surface Decomposition and Applications Ayellet Tal, Princeton/Technion ************************************************************** Registration Fees: Registration: (Pre-registration date: November 27, 2002) 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 at 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, Bell Labs, NEC Research Institute and Telcordia Technologies. Fees for employees of DIMACS affiliate members Avaya Labs and Microsoft Research are also waived. Fees are not waived for IBM Watson Research Center employees (the terms of the IBM membership are different from the Avaya and Microsoft agreements). ***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/GeomAlgorithms/ **PLEASE BE SURE TO PRE-REGISTER EARLY** From spassion at dimacs.rutgers.edu Wed Nov 6 15:09:27 2002 From: spassion at dimacs.rutgers.edu (Christine Spassione) Date: Wed, 06 Nov 2002 15:09:27 -0500 Subject: [Sy-cg-global] Announcement: Reconnect 2003 Programs Message-ID: <5.1.0.14.0.20021106150722.02f023e8@dimacs.rutgers.edu> DIMACS would like to call your attention to Reconnect 2003 programs. Please pass this announcement along to anyone you think might be interested. Sincerely, Christine Spassione DIMACS Visitor Coordinator ****************************************************************************** DIMACS Reconnect Conferences 2003 Reconnecting Teaching Faculty to the Mathematical Sciences Research Enterprise In Summer 2003, DIMACS will hold three "Reconnect Conferences": Satellite Program: Salem State College Some Current Problems in Coding Theory Principal Speaker: Judy Walker, University of Nebraska - Lincoln, jwalker at math.unl.edu June 15 - June 21, 2003 (Sunday evening through Saturday afternoon) Satellite Program: Illinois Institute of Technology Centrality in Graphs with Applications to the Theory of Location of Facilities Principal Speaker: K. Brooks Reid, California State University San Marcos, breid at csusm.edu July 16 - July 23, 2003 (A break day will be provided in between the program schedule) DIMACS/Rutgers University Internet Algorithms: Modeling the Web as a Graph, with Applications to Information Gathering and Search Principal Speaker: Lenore Cowen, Tufts College, cowen at eecs.tufts.edu August 10 - August 16, 2003 (Sunday evening through Saturday afternoon) About the Reconnect Conferences: These conferences expose faculty teaching undergraduates to the mathematical sciences research enterprise by introducing them to a current research topic relevant to the classroom through a series of lectures by a leading expert and involving them in writing materials useful in the classroom. Participants have the possibility of following up by preparing these materials for publication in the DIMACS Educational Modules Series. These workshops offer the opportunity for junior faculty as well as mid-level and senior faculty to advance to research questions in a new area of the mathematical sciences. Participants will also acquire materials and gain ideas for seminar presentations and for undergraduate research projects. These conferences are also aimed at reconnecting faculty to the mathematical sciences enterprise by involving them in a leading research center, which is a consortium of Princeton University, Rutgers University, AT&T Labs, Bell Labs/Lucent Technologies, NEC Research and Telcordia Technologies. There will be opportunities to follow up after the conference by getting connected to DIMACS researchers and other DIMACS programs throughout the year. Conference Organizers: Rochelle Leibowitz, Wheaton College (rochelle_leibowitz at wheatonma.edu) Fred S. Roberts, Rutgers University (froberts at dimacs.rutgers.edu) Funds for Lodging, Meals and Travel: Lodging and meals will be provided through anticipated NSF funding. Limited funds are expected to be available for travel awards. Who may apply? Anyone may apply. Please apply for any one of the conferences or all of them. Preference will be given to faculty whose primary job is undergraduate teaching. Two-year college faculty are welcome to apply. Faculty from groups under-represented in mathematics are encouraged to apply. To receive more information, visit our web site at http://dimacs.rutgers.edu/reconnect/. Or, contact the Reconnect Program Coordinator, at reconnect at dimacs.rutgers.edu, or telephone at (732) 445-5928. Reconnect Program Administrator DIMACS / CoRE Building / 4th Floor Rutgers, the State University of New Jersey 96 Frelinghuysen Road Piscataway, NJ 08854-8018 USA DIMACS was founded as a National Science Foundation Science and Technology Center and a joint Project of Rutgers, Princeton University, AT&T Labs, Bell Labs, NEC Research and Telcordia Technologies. Affiliate Members: Avaya Labs, IBM Watson Research Center, Microsoft Research. From sarahd at dimacs.rutgers.edu Wed Nov 13 10:57:48 2002 From: sarahd at dimacs.rutgers.edu (Sarah Donnelly) Date: Wed, 13 Nov 2002 10:57:48 -0500 (EST) Subject: [Sy-cg-global] DIMACS Workshop on Medical Applications in Computational Geometry Message-ID: <200211131557.KAA26600@dimacs.rutgers.edu> DIMACS Workshop on Medical Applications in Computational Geometry April 2-4, 2003 DIMACS Center, Rutgers University, Piscataway, NJ Organizers: Danny Chen University of Notre Dame dchen at cse.nd.edu Jean-Claude Latombe Stanford University latombe at cs.stanford.edu Presented under the auspices of the DIMACS Special Focus on Computational Geometry and Applications. *********************************************************** Computer technology plays an increasingly important role in modern medicine and life sciences. Many medical problems are of a strong geometric nature and may benefit from computational geometry techniques. The DIMACS workshop on Computational Geometry and Medical Applications aims to provide a forum for researchers working in computational geometry, medicine, and other related areas to get together and exchange ideas, and to promote cross-fertilization and collaborations among these areas. The theme of the workshop is on the exploration of the applicability of computational geometry to medical problems and the new challenges posed by the current medical research and practice to the geometric computing study. Examples of topics include surgical simulation and planning, geometric representation and modeling of medical objects and human-body tissue structures, geometric problems in medical imaging, computational anatomy, registration and matching of medical objects, etc. The workshop will consist of both invited and solicited contributions. ********************************************************** Call for Participation: Authors are invited to submit abstracts for talks to be given at the workshop. Please e-mail to: dimacs at cse.nd.edu or send one of the organizers an abstract (up to 2 pages) and a draft of a paper (if available). Since there are no formal proceedings for the workshop, submission of material that is to be submitted to (or to appear in) a refereed conference is allowed and encouraged. Submissions will be due February 1, 2003. Notification of acceptance: March 1, 2003. ********************************************************** Registration Fees: Registration: (Pre-registration date: March 26, 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 at 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, Bell Labs, NEC Research Institute and Telcordia Technologies. Fees for employees of DIMACS affiliate members Avaya Labs, IBM Research and Microsoft Research are also waived. ***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/Medicalapps/ **PLEASE BE SURE TO PRE-REGISTER EARLY** From eluhrs at dimacs.rutgers.edu Thu Nov 14 15:48:34 2002 From: eluhrs at dimacs.rutgers.edu (Eric Luhrs) Date: Thu, 14 Nov 2002 15:48:34 -0500 (EST) Subject: [Sy-cg-global] DIMACS Working Group Meeting on Streaming Data Analysis Message-ID: <200211142048.PAA14076@dimacs.rutgers.edu> CALL FOR PAPERS DIMACS Working Group Meeting on Streaming Data Analysis March 24 - 26, 2003 DIMACS Center, Rutgers University, Piscataway, New Jersey ORGANIZERS Adam Buchsbaum AT&T Labs - Research, alb at research.att.com Rajeev Motwani Stanford University, rajeev at cs.stanford.edu The DIMACS Working Group on Streaming Data Analysis will hold a public workshop on the topic Mar. 24-26, 2003, at DIMACS. The workshop is open to speakers presenting current work on analyzing data streams. Data stream analysis presents many practical and theoretical challenges. Many critical applications require immediate (seconds) decision making based on current information: e.g., intrusion detection and fault monitoring. Data must be analyzed as it arrives, not off-line after being stored in a central database. Processing and integrating the massive amounts of data generated by a number of continuously operating, heterogeneous sources poses is not straightforward. At some point, data sets become so large as to preclude most computations that require more than one scan of the data, as they stream by. Analysis of data streams also engenders new problems in data visualization. How is time-critical information best displayed? Can automatic response systems be created to deal with common cases? Etc. The workshop will be organized as a series of talks with time for focused discussions. We solicit general participation and invite presentations on all aspects of data stream analysis: theoretical issues, including modeling; practical issues, including work on existing systems; and bridges and bottlenecks, both current and potential, between theory and practice, The goal of the workshop and working group is to foster interdisciplinary collaborations among researchers studying data streams from many disparate perspectives and application areas. Prospective speakers should submit an at-most two-page writeup (preferably in ASCII, but PS and PDF are acceptable) of the abstract of the talk, with references to literature and a description of the specific flavor of the talk. Email abstracts to alb at research.att.com. Submission Deadline: Dec. 2, 2002 Notification Deadline: Dec. 16, 2002 Presented under the auspices of the Special Focus on Data Analysis and Mining. For more information, please see: http://dimacs.rutgers.edu/Workshops/StreamingII From sarahd at dimacs.rutgers.edu Mon Nov 25 17:27:12 2002 From: sarahd at dimacs.rutgers.edu (Sarah Donnelly) Date: Mon, 25 Nov 2002 17:27:12 -0500 (EST) Subject: [Sy-cg-global] Program: DIMACS Workshop on Implementation of Geometric Algorithms Message-ID: <200211252227.RAA17179@dimacs.rutgers.edu> DIMACS Workshop on Implementation of Geometric Algorithms December 4 - 6, 2002 DIMACS Center, Rutgers University, Piscataway NJ Organizers: Herve Bronnimann, Polytechnic University, hbr at poly.edu Steven Fortune, Bell Laboratories, Lucent Technologies, sjf at bell-labs.com Presented under the auspices of the Special Focus on Computational Geometry and Applications. *************************************************************** It is notoriously difficult to implement geometric algorithms. This difficulty arises in part from the conceptual complexity of geometric algorithms, the proliferation of special cases, the dependence of combinatorial decisions on numerical computation, and frequent theoretical focus on worst-case asymptotic behavior. This workshop will address research issues related to the implementation of geometric algorithms. Typical, but not exclusive topics include: Numerical issues Noisy data and data repair Geometric data structures Massive geometric data sets Algorithm library design Algorithm engineering Experimental studies Numerical issues have long been an important concern in the implementation of geometric algorithms. In the last decade the issue has become a central research topic in computational geometry, and a reasonably successful approach based on the use of exact (extended-precision) arithmetic has been developed. However, many significant problems remain---high-level rounding, extension to curved objects, performance---and the practical impact of the research is not yet clear. Geometric data sets based on physical measurements are inherently noisy. If such geometric data also has combinatorial structure, the geometric and combinatorial information may be inconsistent. To be useful, geometric algorithms must be able to repair such data, that is, in some fashion eliminate inconsistencies. Unfortunately, there is little relevant theory, and current data repair is heuristic at best. Geometric data structures are known that can represent complex structures in any dimension. However massive data sets in two dimensions, or even modest data sets in high dimension, can require enormous amounts of memory. A challenging research topic is to design algorithms and data structures that are cognizant of the memory hierarchy---cache, main memory, disk---and to provide appropriate implementations. These are just some of the problems faced by general purpose geometric algorithms libraries. Considerable effort has been expended developing the geometric algorithm library CGAL, which is now reasonably mature. CGAL,just together with the LEDA algorithm library, provide an unparalleled resource for users of geometric algorithms. Further development of algorithm libraries requires attention to many issues---those mentioned above, but also functionality, interface, performance, and support for specific application areas. We plan to bring together both researchers and practitioners. We hope that practitioners will benefit from discussions of the state of the art in research, and that researchers will benefit by being exposed to implementation issues of practical importance. ************************************************************** Workshop Program WEDNESDAY December 4 8:15 - 8:55 Breakfast and registration 8:55 - 9:00 Opening remarks, Fred Roberts, Director of DIMACS 9:00 - 9:30 Root-comparison techniques and applications to the Voronoi diagram of Disks Ioannis Emiris, University of Athens 9:30 - 10:00 Progress in constructive root bounds Chee Yap, NYU 10:00 - 10:30 Progress on the number type leda::real Stefan Schirra 10:30 - 11:00 Break 11:00 - 11:30 Fast Penetration Depth Estimation: Algorithms, Implementation & Applications Ming Lin, UNC Chapel Hill 11:30 - 12:00 Controlled Perturbation for Arrangements of Circles Dan Halperin, Tel Aviv University 12:00 - 12:30 Geometric Conditioning Victor Milenkovic, University of Miami 12:30 - 2:00 Lunch 2:00 - 2:30 A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons Michael Hemmer, Max-Planck-Institut fur Informatik 2:30 - 3:00 An Exact and Efficient Approach for Computing a Cell in an Arrangement of Quadrics Nicola Wolpert, Max-Planck-Institute for Computer Science 3:00 - 3:30 Robust Operations on Curved Solids John Keyser, Texas A&M University 3:30 - 4:00 Break 4:00 - 4:30 Towards a CGAL Geometric Kernel with Circular Arcs Monique Teillaud, INRIA 4:30 - 5:00 Efficient Exact Geometric Predicates for Delaunay Triangulations Sylvain Pion, MPI Saarbruecken 5:00 - 5:30 Iterative conditioning as an algorithm design schema for robust geometric predicates Steven Fortune, Bell Labs Thursday December 5 8:30 - 9:00 Breakfast and registration 9:00 - 9:30 Data Structures and Design of a 3D Mesh Generator Jonathan Shewchuk, Berkeley 9:30 - 10:00 Boolean Operations on 3D Surfaces Using Nef Polyhedra Lutz Kettner, MPI Informatik, Germany 10:00 - 10:30 Algorithms in polytope theory and polymake Michael Joswig, Technische Universit?t 10:30 - 11:00 Break 11:00 - 11:30 Experiences With Designing and Implementing "Industrial- Strength" Codes for Handling "Industrial-Quality" Data in Real-World Applications Martin Held, Salzburg 11:30 - 12:00 From a Library to Geometric Software Components Andreas Fabri, Geometry Factory 12:00 - 2:00 Lunch 2:00 - 2:30 JDSL: the Data Structures Library in Java Roberto Tamassia, Brown 2:30 - 3:00 Towards Generic Software Components? Herve Bronnimann, Polytechnic 3:00 - 3:30 Algorithm library development for complex biological and mechanical systems: functionality, interoperability and numerical stability Marina Gavrilova, University of Calgary 3:30 - 4:00 Break 4:00 - 6:00 Panel Discussion: What next for computational geometry software? Nina Amenta, Andreas Fabri, Steven Fortune, Jonathan Shewchuk 6:00 - 7:30 Dinner (DIMACS Lounge, Room 401, CoRE Bldg.) Friday December 6 8:30 - 9:00 Breakfast and registration 9:00 - 9:30 Implementing Geometric Algorithms using Graphics Hardware Shankar Krishnan, ATT 9:30 - 10:00 Blocked Randomized Incremental Constructions Nina Amenta, Sunghee Choi, University of Texas, Austin 10:00 - 10:30 A Parallel Implementation of an Arrangement Construction Algorithm Komei Fukuda, McGill 10:30 - 11:00 Break 11:00 - 11:30 TBA Kenneth L. Clarkson, Bell Labs 11:30 - 12:00 Voronoi diagrams for VLSI manufacturing: Robustness and implementation issues Evanthia Papadopoulou, IBM T.J. Watson Research Center 12:00 - 1:30 Lunch 1:30 - 2:00 Geometric and Numeric Stability Issues in GeoSteiner David Warme, L-3Com 2:00 - 2:30 Polyhedral Surface Decomposition and Applications Ayellet Tal, Princeton/Technion ************************************************************** Registration Fees: Registration: (Pre-registration date: November 27, 2002) 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 at 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, Bell Labs, NEC Research Institute and Telcordia Technologies. Fees for employees of DIMACS affiliate members Avaya Labs, IBM Research and Microsoft Research are also waived. ***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/GeomAlgorithms/ **PLEASE BE SURE TO PRE-REGISTER EARLY**