From geert at cs.uu.nl Tue Feb 1 14:17:19 2000 From: geert at cs.uu.nl (Geert-Jan Giezeman) Date: Mon Jan 9 13:40:56 2006 Subject: CGAL 2.1, Computational Geometry Algorithms Library Message-ID: We are pleased to announce release 2.1 of CGAL, the Computational Geometry Algorithms Library. CGAL 2.1 is the first release to support the Windows platform. Additions to release 2.0 include: - Triangulations in 3D - Alpha shapes - Several algorithms on sets of points in 2D - Support for compilers under Windows NT/98/95 (VC++, g++). - and more The CGAL project is a collaborative effort to develop a robust, easy to use, and efficient C++ software library of geometric data structures and algorithms. The CGAL library contains: - Basic geometric primitives such as points, vectors, lines, predicates such as for relative positions of points, and operations such as intersections and distance calculation. - A collection of standard data structures and geometric algorithms, such as convex hull, (Delaunay) triangulation, planar map, polyhedron, smallest enclosing sphere, and multidimensional query structures. - Interfaces to other packages, e.g. for visualisation, and I/O, and other support facilities. For further information and for downloading the library and its documentation, please visit the CGAL web page: http://www.cs.uu.nl/CGAL/ Should you have any questions or comments, please send a message to cgal@cs.uu.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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From popinet at lmm.jussieu.fr Wed Feb 2 13:29:59 2000 From: popinet at lmm.jussieu.fr (StÂphane Popinet) Date: Mon Jan 9 13:40:56 2006 Subject: GTS 0.2.0 Message-ID: <38983157.4025F33B@lmm.jussieu.fr> Release 0.2.0 of GTS is avalaible for download at http://gts.sourceforge.net The GNU Triangulated Surface Library (GTS) provides a set of useful functions to deal with 3D surfaces meshed with interconnected triangles. It features metric operations (area, volume, curvature, etc.), 2D Delaunay and constrained Delaunay triangulations, robust geometric predicates and set operations on surfaces (union, intersection, etc.), surface refinement and coarsening (multiresolution models), bounding-boxes trees for collision/intersection detection and triangle strips generation for fast-rendering. GTS is licensed under the Library General Public License (LGPL) which gives you entire freedom to use it in an educational or commercial environment free of charge. Thank you for your attention, St?phane Popinet ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From Andrzej.Lingas at cs.lth.se Wed Feb 2 14:35:39 2000 From: Andrzej.Lingas at cs.lth.se (Andrzej Lingas) Date: Mon Jan 9 13:40:56 2006 Subject: SWAT'2000 Message-ID: <200002021335.OAA07146@hannar.cs.lth.se> Call for papers --------------- The deadline submission for SWAT'2000, February 15, is approaching. It is time to remind you about this great opportunity to attend one of the oldest European algorithm conferences and see the lovely fjords of Norway in the historic town of Bergen the coming summer. For more details have a look at the website of the conference at http://www.ii.uib.no/swat2000/. ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From bremner at unb.ca Wed Feb 2 10:16:44 2000 From: bremner at unb.ca (David Bremner) Date: Mon Jan 9 13:40:56 2006 Subject: CCCG 2000 First Call for Papers Message-ID: <14488.15436.992086.386007@convex.cs.unb.ca> 12th Canadian Conference on Computational Geometry Fredericton, New Brunswick August 16-19, 2000 First Call for Papers Introduction ============ Computational Geometry is a discipline concerned with algorithms, software, and mathematical foundations for the treatment of geometric data by computer. The Canadian Conference on Computational Geometry (CCCG) reflects this diversity of interest, with invited speakers and contributed papers on topics ranging from geometric applications in industry to the frontiers of pure mathematics. Invited Speakers ================ - Gil Kalai, Hebrew University of Jerusalem (to be confirmed) The Paul Erdos Memorial Lecture on Discrete Geometry - Naoki Kato, University of Kyoto Applications of Computational Geometry in Architecture Contributions ============= Papers are solicited on both experimental and theoretical topics within computational geometry. An illustrative, but not exclusive list of topics - Applications of computational geometry - Art gallery problems - Discrete and combinatorial Geometry - Geometric data structures - Graph drawing - Lower bounds for geometric problems - Motion planning - Robustness in geometric algorithms Authors should submit a 4 page extended abstract by the submission deadline given below. Accepted papers will be allocated approximately twenty minutes for presentation at the conference. The preferred method of submission is electronic; details will be available on the conference web site (http://www.cs.unb.ca/conf/cccg) closer to the deadline. If you are unable to submit electronically, please ensure a paper copy of your extended abstract reaches Canadian Conference for Computational Geometry c/o David Bremner Faculty of Computer Science University of New Brunswick P.O. Box 4400 Fredericton, NB E3B 5A3 by the submission deadline. 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, but have the advantage of relatively speedy publication. Deadlines ========= 2000/04/14 Extended abstracts due 2000/06/01 Notification of acceptence or rejection 2000/07/03 Proceedings version of the paper due 2000/08/01 Special issue papers due Location and Dates ================== CCCG 2000 will be held at the Sheraton Hotel in Fredericton, New Brunswick from August 16 to August 19 of 2000. The technical program will take place August 16-18, with an optional excursion on August 19. Personel ======== Conference Chair: David Bremner Program Committee ----------------- Prosenjit Bose Carleton University David Bremner University of New Brunswick Claudia Iturriaga University of New Brunswick Mark Keil University of Saskatchewan Alex Lopez-Ortiz University of New Brunswick Anna Lubiw University of Waterloo Barry Monson University of New Brunswick David Rappaport Queen's University Godfried Toussaint McGill University Stephen Wismath University of Lethbridge Organizing Committee -------------------- David Bremner Joe Horton Claudia Iturriaga Alex Lopez-Ortiz Barry Monson Brad Nickerson (all at University of New Brunswick) Questions? ========== For more information see the conference web site at http://www.cs.unb.ca/conf/cccg Or contact us by email: cccg@unb.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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From luebke at cs.virginia.edu Fri Feb 4 15:54:35 2000 From: luebke at cs.virginia.edu (David Luebke) Date: Mon Jan 9 13:40:56 2006 Subject: VDSlib: view-dependent polygonal simplification package Message-ID: <200002042054.PAA25204@viper.cs.Virginia.EDU> [I recently posted the below announcement on comp.graphics.algorithms; a couple of people have since recommended that I post it to this list.] ------------------------------------------------------------------------- I'd like to announce the alpha release of VDSlib, a public-domain package for view-dependent simplification and rendering of polygonal environments: http://vdslib.virginia.edu Geometric simplification, also known as "level of detail" or "multiresolution modeling", is a well-known technique for managing scene complexity in interactive rendering. The most common approach creates several discrete levels of detail (LODs) for every object in a preprocess, and selects at run-time which LOD will represent each object based on factors such as the object's distance or size on the screen. View-dependent simplification (VDS) takes a different approach, creating a data structure which can be queried at run time to generate a simplified object spanning multiple levels of detail. Since the simplification is adjusted dynamically, it can exploit the current view parameters. For example, VDS can represent portions of a large object near the viewer with high fidelity but distant portions at low fidelity, or or render silhouette regions of an object at more detail than interior regions. VDSlib provides a software library, written in C, for the construction and rendering of view-dependent simplifications. It is designed to be extremely flexible, with a callback-based API that allows developers or researchers to plug in their own criteria for simplifying, culling, and rendering the model. VDSlib is based on the algorithm presented in the SIGGRAPH 97 paper "View-Dependent Simplification of Arbitrary Polygonal Environments" by David Luebke and Carl Erikson, with a number of improvements and refinements. This algorithm is similar in some ways to other view-dependent simplification schemes introduced independently by researches such as Hughes Hoppe (Progressive Meshes) and Xia & Varshney (Merge Trees). We hope that VDSlib, with its flexible framework, will prove useful both to 3-D developers wishing to experiment with the latest LOD techniques and to researchers interested in exploring algorithms, criteria, and metrics for view-dependent simplification. For more details, including full documentation and a sample application, please see the VDSlib web site at http://vdslib.virginia.edu. Thanks, Dave Luebke -- David Luebke, Assistant Professor University of Virginia http://www.cs.virginia.edu/~luebke Department of Computer Science luebke@cs.virginia.edu Charlottesville, VA 22903-2442 ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From gobbetti at crs4.it Fri Feb 11 16:20:50 2000 From: gobbetti at crs4.it (Enrico Gobbetti) Date: Mon Jan 9 13:40:56 2006 Subject: Job Opening: Research position at CRS4 Message-ID: <38A428D2.B0624CEB@crs4.it> *** *** EXPERT LEVEL RESEARCH POSITIONS IN COMPUTER GRAPHICS *** Ref.: VVR-EXPERT-0100 URL: http://www.crs4.it/vvr/contents/announce/job_01_99 The Visualization and Virtual Reality area at CRS4 invites applications for an expert-level research position in computer graphics. The following specialties are of value to us: multiresolution modeling, geometric simplification, time-critical rendering, object-oriented technology, Eiffel, C++, OpenGL, Windows NT. The successful candidates must possess the following requirements: * University Degree, preferrably MSc or Ph.D., in Computer Science or related fields; * Considerable research and development experience in the field of computer graphics; * Theoretical and practical background in geometric modeling; * A good understanding of component based object-oriented programming technology. Good communication skill, attitude to work in group, and some previous experience in international projects complete the profile of the successful candidate, that will immediatly start working on one of the projects of the group. In particular, the candidate is expected to provide a leading contribution to the development of software components for multiresolution modeling and simplification in the context of a three-year European project. A two year renewable contract will be offered, with salary depending on the demonstrated expertise of the successful candidate. This offer of employment is in accordance with the current Italian "Contratto Collettivo Nazionale di Lavoro per l'industria Metalmeccanica Privata". CRS4 is an interdisciplinary research center established in 1991 and located near Cagliari (Sardinia, Italy). Its activities encompass many areas related to computational science and information technology. The Center currently has a staff of about 90 researchers and has outstanding facilities. CRS4 provides a stimulating work environment for highly motivated individuals. Further information about CRS4's Visualization and Virtual Reality group can be obtained on the Internet at: http://www.crs4.it/vvr. The position is available immediately and applications will be accepted until the position is filled. Applicants should send a resume, including a cover letter quoting Ref. VVR-EXPERT-0100, to: Dr. Fabio Bettio CRS4 VI Strada Ovest, Z.I. Macchiareddu C.P. 94 I-09010 Uta (CA), Italy. E-mail: fabio@crs4.it Fax : +39 070 2796 216 Electronic submissions (in HTML, ASCII, PDF, or PostScript) are strongly encouraged. -- --------------------------------------------------------------------- Enrico Gobbetti Head, Visualization and Virtual Reality Group CRS4, VI Str. Ovest, ZI Macchiareddu, CP 94, I-09010 Uta (CA), Italy E-mail: Enrico.Gobbetti@crs4.it WWW: http://www.crs4.it/~gobbetti Phone: +39 070 2796 318 Fax: +39 070 2796 216 --------------------------------------------------------------------- ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From magillo at disi.unige.it Thu Feb 10 17:57:06 2000 From: magillo at disi.unige.it (Paola Magillo) Date: Mon Jan 9 13:40:56 2006 Subject: Multi-Tesselation (MT) package available Message-ID: <200002101657.RAA23472@disi.unige.it> We are pleased to announce the distribution of the Multi-Tesselation (MT) package. For information and downloading, see: http://www.disi.unige.it/person/MagilloP/MT/index.html The MT package is a dimension-independent package for the representation and manipulation of spatial objects as simplicial complexes at multiple resolutions. It allows the design of interactive applications which exploit the full power of multiresolution on geometric objects represented by meshes in any dimension. The MT Package is fully parametric on: - The dimension of the mesh (e.g., a surface made of triangles, a volume made of tetrahedra, and any higher dimensional complex made of simplexes); - The dimension on the embedding space; - Any attribute that you wish to store at the vertices and at the cells of your mesh; - Any criterion that you wish to adopt in order to extract meshes at variable resolution from the multiresolution model. With the MT package, you can: - Manage multiresolution the way you like: you just have to specify the attributes you wish to include and the condition to test the resolution. - Use your own simplification code to build the multiresolution model: you just have to include commands provided by a class in the library. The MT Package also contains some off-the-shelf programs, which can be either used directly, or adopted as templates to write new applications: - Programs to build multiresolution models of terrains and surfaces; - Demo programs using the MT library to fly over a terrain, and to analyze an object by interactively using a magic lens. - Documentation and guidelines are included in the distribution. The library is written in ANSI C++ and has been tested under Unix on PC (Linux), and Silicon Graphics (Irix). Please send any questions or comments to magillo@disi.unige.it --------------------------------------------- Paola Magillo DISI - University of Genova Via Dodecaneso 35 - 16146 Genova (Italy) Phone: +39-010-353-6705 Fax: +39-010-353-6699 Email: magillo@disi.unige.it --------------------------------------------- ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From george at ada.cs.ucy.ac.cy Fri Feb 11 14:15:38 2000 From: george at ada.cs.ucy.ac.cy (George Angelos Papadopoulos) Date: Mon Jan 9 13:40:56 2006 Subject: Job Announcement -- C.S. Dept. -- Univ. of Cyprus Message-ID: DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF CYPRUS VISITING PROFESSORSHIPS The Department of Computer Science at the University of Cyprus has a number of vacancies for visiting professors at the ranks of Assistant, Associate, and Full Professor. ALL fields of study will be considered, but preference will be given to applicants associated with one or more of the following ones: * Computer Architecture * Parallel and Distributed Processing * Programming Languages * Multimedia Information Systems * Data Communication Networks * Artificial Intelligence * Software Engineering * Database Systems A new M.Sc. course on "Advanced Information Technologies" will commence next September and the successful applicants will therefore have the opportunity to teach at both the undergraduate and graduate levels. A visiting appointment is usually for one semester (Spring semester: Jan-June; Winter semester: Sept-Dec), but it can be renewed for up to four semesters. Applicants should hold a Ph.D. in a relevant subject, have post Ph.D. experience, and BE FLUENT IN GREEK (both these requirements are mandatory). The annual salaries for these positions (including the 13th salary) are: Professor (Scale A15-A16) CYP 25.479 - 33.120 Associate Professor (Scale A14-A15) CYP 22.473 - 30.636 Assistant Professor (Scale A13-A14) CYP 20.966 - 28.288 Lecturer (Scale A12-A13) CYP 17.706 - 25.933 (At present CYP 1 = 1.1 sterling and CYP 1 = 1.80 U.S. dollars). Presently, the Department is seeking applications for the winter and spring semesters of the academic year 2000-2001. The processing of applications will start on the 1st May 2000 and will continue until all the available positions have been filled. Anyone wishing to apply should send a full CV to the following address: The Chairperson Department of Computer Science University of Cyprus 75 Kallipoleos Street P.O. Box 20537, CY-1678 Nicosia, CYPRUS For more details and other information, interested individuals may contact the Chairperson of the Department of Computer Science: Associate Professor Antonis Kakas Tel: +357-2-892238, Fax: +357-2-339062, E-mail: antonis@ucy.ac.cy ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From deflo at umiacs.umd.edu Mon Feb 14 13:20:12 2000 From: deflo at umiacs.umd.edu (Leila De Floriani) Date: Mon Jan 9 13:40:56 2006 Subject: postdoc and Ph.D. positions available Message-ID: Postdoc and PhD positions Several temporary positions, both doctoral and post-doctoral, are now available within a new EU research training network called MINGLE (Multiresolution in Geometric Modelling). These positions will normally be between 6 months and two years in duration and will provide an excellent opportunity to gain research experience abroad. The main objective of the project is to train young European researchers, both in mathematics and computer science, in various aspects of multiresolution in geometric modelling. Relevant research topics include: hierarchical decomposition of triangulations, generation of smooth surfaces from irregular triangle meshes, thinning, decimation, compression of meshes, remeshing, wavelets, application of multiresolution representations to computer graphics, and data structures and algorithms for storage and manipulation. MINGLE will run from 2000 to 2003 and involves research teams from the following nine partners: SINTEF Applied Mathematics, Norway Contact: Michael Floater Tel Aviv University, Israel Contact: Nira Dyn Munich University of Technology, Germany Contact: Armin Iske Technion, Israel Contact: Craig Gotsman Max Planck Institute, Saarbrucken, Germany Contact: Hans-Peter Seidel Joseph Fourier University, Grenoble, France Contact: George-Pierre Bonneau University of Cambridge, UK Contact: Neil Dodgson University of Genova, Italy Contact: Leila De Floriani Systems in Motion AS, Norway Contact: Paal-Robert Engnaes Further details are available on the webpage http://www.oslo.sintef.no/mingle/ (especially concerning the eligibility rules). If you consider making an application, please contact the partner or partners you are interested in. Women are especially encouraged to apply. For general enquiries about MINGLE, please contact the coordinating partner via Michael Floater (mif@math.sintef.no) or Ewald Quak (ewq@math.sintef.no). ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From pankaj at cs.duke.edu Sun Feb 13 15:06:32 2000 From: pankaj at cs.duke.edu (Pankaj Kumar Agarwal) Date: Mon Jan 9 13:40:56 2006 Subject: SCG'00: List of Accepted Papers Message-ID: <200002132006.PAA02413@polya.cs.duke.edu> SCG'00: LIST OF ACCEPTED PAPERS =============================== Theory Track ------------ Point sets with many k-sets Geza Toth Testing the congruence of $d$-dimensional point sets Peter Brass and Christian Knauer Sweep Algorithms for Constructing Higher-Dimensional Constrained Delaunay Triangulations Jonathan Richard Shewchuk An Improved bound for $k$-Sets in Three Dimensions Micha Sharir and Shakhar Smorodinsky and Gabor Tardos Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus Timothy M. Chan Origin-Embracing Distributions or A Continuous Analogue of the Upper Bound Theorem Uli Wagner and Emo Welzl Surface reconstruction simplified Nina Amenta, Sunghee Choi, Tamal K. Dey and Naveen Leekha Random Sampling in Geometric Optimization: New Insights and Applications Bernd Gaertner and Emo Welzl Cutting glass Janos Pach and Gabor Tardos Reachability by paths of bounded curvature in convex polygons Hee-kap Ahn and Otfried Cheong and Jiri Matousek and Antoine Vigneron Linear-Time Polygon Triangulation Made Easy Via Randomization Nancy M. Amato and Michael T. Goodrich and Edgar A. Ramos Kinetic Connectivity for Unit Disks Leonidas Guibas and John Hershberger and Subhash Suri and Li Zhang Exact and Efficient Unions of balls. Nina Amenta and Ravi Kolluri When Crossings Count - Approximating the Minimum Spanning Tree Sariel Har-Peled and Piotr Indyk Multivariate regression depth Marshall Bern and David Eppstein The 2-Center Problem with Obstacles Dan Halperin and Micha Sharir and Ken Goldberg I/O-Efficient Dynamic Planar Point Location Lars Arge and Jan Vahrenhold Kinetic Collision Detection for Simple Polygons David Kirkpatrick and Jack Snoeyink and Bettina Speckmann Point Set Labeling with Specified Positions Srinivas Doddi and Madhav V. Marathe and Bernard M.E. Moret A Helly-type theorem for hyperplane transversals to well-separated convex sets Boris Aronov and Jacob E. Goodman and Richard Pollack and Rephael Wenger On the continuous Weber and k-means problems S.P.Fekete and J.S.B.Mitchell and K.Weinbrecht Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes Edgar A. Ramos Delaunay Triangulations and Voronoi Diagrams for Riemannian Greg Leibon and David Letscher A Trace Bound for the Hereditary Discrepancy Bernard Chazelle and Alexey Lvov Linear Programming Queries Revisited Edgar A. Ramos Applied Track ------------- Smooth shape reconstruction Jean-Daniel Boissonnat and Frederic Cazals An algorithm for searching a polygonal region with a flashlight Steven M. Lavalle and Borislav Simov and Giora Slutzki Fast Software for Box Intersections Afra Zomorodian and Herbert Edelsbrunner Computing with Minkowski sums Ioannis Z Emiris Algebraic methods and arithmetic filtering for exact predicates on circle arcs Olivier Devillers and Alexandra Fronville and Bernard Mourrain and Monique Teillaud Reconstructing curves with sharp corners Tamal K. Dey and Rafe Wenger Densest Translational Lattice Packing of Non-Convex Polygons Victor J. Milenkovic Pitfalls in Computing with Pseudorandom Determinants Bernd Gaertner LOOK - A Lazy Object-Oriented Kernel for Geometric Computation Stefan Funke Computing Approximate Shortest Paths on Convex Polytopes Pankaj K. Agarwal and Sariel Har-Peled and Meetesh Karia Voronoi-based interpolation with higher continuity Hisamoto Hiyoshi and Kokichi Sugihara Mesh Generation for Domains with Small Angles Jonathan Richard Shewchuk Triangulations in CGAL J. D. Boissonnat and O. Devillers and M. Teillaud and M. Yvinec An Efficient, Exact, and Generic Quadratic Programming Solver for Geometric Optimization Bernd Gaertner and Sven Schoenherr Improving the Surface Cycle Structure for Hexahedral Mesh Generation Matthias Mueller-Hannemann The Analysis of a Simple k-Means Clustering Algorithm T. Kanungo and D. M. Mount and N. S. Netanyahu and C. Piatko and R. Silverman and A. Y. Wu ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From sanjiva at cse.iitd.ernet.in Thu Feb 17 09:57:53 2000 From: sanjiva at cse.iitd.ernet.in (Sanjiva Prasad) Date: Mon Jan 9 13:40:56 2006 Subject: FST TCS 2000 --- cfpo ascii version -- Message-ID: <200002170427.JAA00952@cse.iitd.ernet.in> [ apologies for multiple copies. - SP ] *********************************************************************** * * * FST TCS 2000 * * * * Foundations of Software Technology and Theoretical Computer Science * * December 13--15, 2000 * * New Delhi, India * * * *********************************************************************** * Call for Papers * *********************************************************************** IARCS, the Indian Association for Research in Computing Science, announces the 20th Annual FST TCS Conference in New Delhi. Tentatively planned satellite events include include two workshops: on Computational Geometry and on Advances in Programming Languages. Authors are invited to submit papers presenting original and unpublished research on **any** theoretical aspects of Computer Science. Papers in applied areas with a strong foundational emphasis are also welcome. The proceedings of the last six years' conferences (Springer-Verlag Lecture Notes in Computer Science volumes 880, 1026, 1180, 1346, 1530, 1738) give an idea of the kind of papers typically presented at FST TCS. Typical areas include (but are not restricted to): Automata, Languages and Computability Randomized and Approximation Algorithms Computational Geometry Computational Biology Combinatorial Optimization Graph and Network Algorithms Complexity Theory Parallel and Distributed Computing New Models of Computation Concurrent, Real-time and Hybrid Systems Logics of Programs and Modal Logics Database Theory and Information Retrieval Automated Reasoning, Rewrite Systems, and Applications Logic, Proof Theory, Model Theory and Applications Semantics of Programming Languages Static Analysis and Type Systems Theory of Functional and Constraint-based Programming Software Specification and Verification Cryptography and Security Protocols For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. Important Dates --------------- Deadline for Submission 31 May, 2000 Notification to Authors 15 August, 2000 Final Version of Accepted Papers due 15 September, 2000 Deadline for Early Registration 15 November, 2000 Submission Guidelines - --------------------- Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 A4-size pages, with 1.5 inch top margin and other margins 1 inch wide with 11 point or larger font. Authors who feel that more details are necessary may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should contain a short abstract. If available, e-mail addresses and fax numbers of the authors should be included. Electronic Submissions - ---------------------- Electronic submission is strongly encouraged. Self-contained uuencoded gzipped Postscript versions of the paper may be sent by e-mail to fsttcs20@cse.iitd.ernet.in In addition, the following information in ASCII format should be sent to this address in a **separate** e-mail: Title; authors; communicating author's name, address, and e-mail address and fax number if available; abstract of paper. Hard-Copy Submissions - --------------------- If electronic submission is not possible, authors may submit five (5) hard-copies of the paper by post to the following address: FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas New Delhi 110 016 INDIA Invited Speakers ---------------- Invited Speakers who have confirmed participation include: Peter Buneman (U Penn) Bernard Chazelle (Princeton) E. Allen Emerson (U Texas, Austin) Philip Wadler (Bell Labs) Programme Committee ------------------- Pankaj Agarwal (Duke) Manindra Aggarwal (IIT, Kanpur) Tetsuo Asano (JAIST) Vijay Chandru (IISc, Bangalore) Rance Cleaveland (Stony Brook) Anuj Dawar (Cambridge) Madhavan Mukund (CMI, Chennai) Sampath Kannan (AT&T Research) Sanjiv Kapoor (IIT, Delhi) (Co-chair) Kamal Lodaya (IMSc, Chennai) Gopalan Nadathur (U Chicago) Seffi Naor (Bell Labs and Technion) Tobias Nipkow (TU Munich) Luke Ong (Oxford) C. Pandurangan (IIT, Madras) Paritosh Pandya (TIFR) Benjamin Pierce (U Penn) Sanjiva Prasad (IIT, Delhi) (Co-chair) Sridhar Rajgopal (IBM, Almaden) A. Ranade (IIT, Bombay) Dave Sands (Chalmers) A Prasad Sistla (U Illinois, Chicago) Michiel Smid (Magdeburg) Mandayam K. Srivas (SRI) Organized by ------------ Indian Institute of Technology, Delhi Hauz Khas, New Delhi 100 016. Organzing Committee ------------------- Sandeep Sen (chair) Naveen Garg (treasurer) S N Maheshwari Conference Site --------------- The Conference will take place at the India International Centre, 40 Lodhi Estate, Max Mueller Marg, New Delhi 110 003. Correspondence Address ---------------------- All correspondence regarding submissions may be addressed to FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas, New Delhi 110 016, INDIA Email: fsttcs20@cse.iitd.ernet.in Fax: +91 11 686 8765 Phone: +91 11 659 1294 / 659 1286 URL: http://www.cse.iitd.ernet.in/~fsttcs20 -- Sanjiva Prasad Associate Professor Department of Computer Science and Engineering sanjiva@cse.iitd.ernet.in Indian Institute of Technology, Delhi (Off) +91 11 659 1294 Hauz Khas, New Delhi 110016 (Res) +91 11 659 1684 INDIA (Fax) +91 11 686 8765 http://www.cse.iitd.ernet.in/~sanjiva ------------- 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://uiuc.edu/~sariel/CG/compgeom/maillist.html.