From sanjiva at cse.iitd.ernet.in Fri Apr 7 04:43:19 2000 From: sanjiva at cse.iitd.ernet.in (Sanjiva Prasad) Date: Mon Jan 9 13:40:57 2006 Subject: No subject Message-ID: <200004062213.DAA00773@cse.iitd.ernet.in> Subject: Second Call for Papers *********************************************************************** * * * 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. Two satellite workshops are planned: 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) Jose Meseguer (SRI) Philip Wadler (Bell Labs) Organized by ------------ Indian Institute of Technology, Delhi Hauz Khas, New Delhi 100 016. Organizing 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 ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zpr.uni-koeln.de/dmanet * ********************************************************** From intuit at renyi.hu Fri Apr 7 18:28:29 2000 From: intuit at renyi.hu (Conference on Intuitive Geometry) Date: Mon Jan 9 13:40:57 2006 Subject: Conference on Intuitive Geometry Message-ID: Dear Colleague, The fifth Intuitive Geometry Conference organized by J\'anos Bolyai Mathematical Society, together with the Alfr\'ed R\'enyi Institute of Mathematics will take place June 5-9, 2000. We have already tried to send the first announcement to you. We are not sure whether you have received it, as some of the addresses turned out to be wrong; therefore we attempt to reach you again. With best regards, The Organizers ************************************************************************* %\nopagenumbers \magnification =\magstep 1 \font\kicsi=cmr8 \font\ss=cmssdc10 %\voffset -13 true mm %\vsize 26truecm \parindent 0pt {\ss J\'ANOS BOLYAI MATHEMATICAL SOCIETY} Budapest, F\H{o} utca 68., 1027 {\kicsi phone: (361) 201 - 7656}, {\kicsi phone/fax: (361) 201 - 6974} {\kicsi e-mail address of the Conference:} {\tt intuit\@renyi.hu} \medskip\hrule\vskip 1.7truecm \centerline {\bf INTUITIVE GEOMETRY} \bigskip \centerline{Balatonf\"oldv\'ar, Hungary, June 5 -- 9, 2000} \bigskip\bigskip \centerline{\ss Announcement} \vskip 1 truecm Dear Colleague, \medskip\medskip The J\'anos Bolyai Mathematical Society, together with the Alfr\'ed R\'enyi Institute of Mathematics is organizing a Conference on Intuitive Geometry from June 5 to 9, 2000 at Balatonf\"oldv\'ar, Hungary. \medskip The subject ``Intuitive Geometry'' does not occur in the AMS classification. The word was coined by L\'aszl\'o Fejes T\'oth to denote the area of geometry dealing with problems, which were described by Hilbert as being explainable to the man in the street. It includes great parts of combinatorial geometry, the theory of packing, covering and tiling, convexity, computational geometry, rigidity theory, the geometry of numbers, crystallography and classical differential geometry. The meeting next year will be the fifth on this topic organized by the Bolyai Society. With it, we would like to celebrate the year of mathematics as well as the fiftieth anniversary of the foundation of the R\'enyi Institute (earlier Mathematical Institute of the Hungarian Academy of Sciences). The organizing committee of the conference is: Imre B\'ar\'any, K\'aroly B\"or\"oczky, K\'aroly B\"or\"oczky Jr. (Secretary), G\'abor Fejes T\'oth, and J\'anos Pach. We are pleased to report that Franck Barthe, Nikolai Dolbilin, Zolt\'an F\"uredi, Gil Kalai, Nati Linial, L\'aszl\'o Lov\'asz, Ji\v{r}\'{\i} Matou\v{s}ek, G\'eza T\'oth and Emo Welzl have accepted our invitation to give plenary talks at the conference. \medskip Balatonf\"oldv\'ar is a resort area at lake Balaton, about 130 km (80 miles) from Budapest. The conference is held at Hotel JOGAR, where many successful international conferences have been organized the last decade. \medskip Arrival: Sunday, June 4, Departure: Saturday, June 10. \medskip Registration will take place at the Hotel on Sunday from 4.00 p.m. to 10.00 p.m., and Monday morning before the opening. An excursion will be organized for Wednesday afternoon. More details on how to get to Hotel JOGAR, on the excursion and on the scientific program will be given in the Third Announcement around May 8. If you plan to give a 20 minute {\it contributed talk}, please send the title and abstract (not longer than one page) in \TeX format to "intuit\@renyi.hu" by April 28, 2000. \bigskip Do not hesitate to forward this announcement to your colleagues and students, if you think they are interested in ``Intuitive Geometry.'' \noindent Please visit our home page \centerline{ http://www.renyi.hu/~intuit} for the latest information on the conference. \bigskip We are looking forward to seeing you at the meeting. \vskip1truecm \hskip10truecm{The Organizing Committee} \bigskip April 6, 2000 \vfill\eject \voffset 22truemm {\bf Registration:} \smallskip\noindent Please complete the attached form and return it along with a certified check - bank draft - money order (but not a personal check) covering the registration fee, payable to "J\'anos Bolyai Mathematical Society". ({\kicsi{Paying by bank transfer our bank's data: ABN AMRO Bank Rt., \ \ Budapest, Gerl\'oczy utca 11., H - 1052 \ \ Account number: 10200830 - 32310243 - 00000000 -- "Intuitive Geometry" Please note that we will not accept bank charges, those are at the sender's expense.}}) \vskip 1mm \noindent\settabs 3\columns {\it \+ & Registration fee & Late fee (after April 28) \cr \+ Regular: & USD 120 & USD 140 \cr \+ Accompanying person: & USD \ 40 & USD \ 40 \cr} \medskip \noindent The rates at the Hotel (with full board and for the whole period) are the following: \smallskip \item{} Single room: \ \ \ \ USD 260/person \item{} Double room: \ \ \ USD 180/person \smallskip\noindent The registration fee covers the conference materials and a reception. The registration fee for non academic accompanying persons includes a reception ticket. \noindent Accommodation and meals are to be paid upon arrival at the conference registration desk. \vskip 1.8truecm \centerline{\hbox to 150truemm{\hrulefill}} \vskip 1.8truecm \centerline{\bf REGISTRATION FORM} \medskip \centerline {\bf INTUITIVE GEOMETRY V.} \bigskip You may register by returning this form by e-mail to {\bf intuit\@renyi.hu}, by mail or fax to \bigskip J\'ANOS BOLYAI MATHEMATICAL SOCIETY Budapest, F\H{o} utca 68., 1027 Phone/fax: (36--1)--201--6974 \bigskip Family name: \bigskip First name: \bigskip The title of the lecture (if you intend to give one): \bigskip Number of accompanying persons: \bigskip Please, indicate if you wish to be accommodated in a single room \end From bremner at unb.ca Fri Apr 14 18:34:42 2000 From: bremner at unb.ca (David Bremner) Date: Mon Jan 9 13:40:57 2006 Subject: CCCG00 Third Call for Papers Message-ID: <14583.32994.504715.465532@convex.cs.unb.ca> Humble apologies to those of you who know already, and are sick of hearing about it. David ------------------------------------------------------------------------ 12th Canadian Conference on Computational Geometry Fredericton, New Brunswick August 16-19, 2000 Third Call for Papers April 14, 2000 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. The technical program will be from August 16-18, with an optional outing on August 19. Invited Speakers * Gil Kalai, Hebrew University of Jerusalem 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 follows: 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 [1]submit a 4 page extended abstract (in English or French) 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; PostScript (TM) or PDF (TM) files will be accepted via the conference web site [2]conference web site. 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/05/01 Extended abstracts due. Note: Deadline extended. 2000/06/01 Notification of acceptance or rejection 2000/07/03 Proceedings version (10 pages) 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. Personnel 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 _________________________________________________________________ References 1. http://www.cs.unb.ca:8086/submit.html 2. http://www.cs.unb.ca/conf/cccg ------------- 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 otfried at cs.ust.hk Mon Apr 17 19:17:59 2000 From: otfried at cs.ust.hk (Otfried Cheong) Date: Mon Jan 9 13:40:58 2006 Subject: SoCG 2000 Program & Registration Information Message-ID: <200004171017.e3HAHxF12176@cssvr17.cs.ust.hk> The conference website for the 16th ACM Symposium on Computational Geometry in Hong Kong is open, with the preliminary program (an ASCII version is attached below), general information about the conference and the conference site, and the registration form. The early registration deadline is May 14. We would encourage you not to wait that long, since our supply of hotel-quality housing on campus is limited, and accomodation is reserved on a first-come-first-serve basis. (To be to the point, there are not enough hotel-quality rooms for all participants. Once they are gone you'll have to stay in a dormitory room or off-campus.) You can find the conference website at the following URL: http://www.cs.ust.hk/tcsc/scg00.html The organizing team Siu-Wing Cheng, Otfried Cheong Hong Kong University of Science and Technology PRELIMINARY PROGRAM ------------------- Sunday, June 11 6:00 Reception Monday, June 12 Session 1, Applied Track Session Chair: 9:00 Mesh Generation for Domains with Small Angles Jonathan Richard Shewchuk, UC Berkeley 9:20 Triangulations in CGAL J. D. Boissonnat, INRIA, O. Devillers, INRIA, M. Teillaud, INRIA, and M. Yvinec, INRIA 9:40 Improving the Surface Cycle Structure for Hexahedral Mesh Generation Matthias Mueller-Hannemann, Technische U. Berlin 10:00 Computing with Minkowski sums Ioannis Z Emiris, INRIA 10:20 Break 10:50 Invited Talk Fred Richards, Yale U. 11:50 Lunch Session 2, Theory Track Session Chair: Pankaj Agarwal 1:30 Point sets with many k-sets Geza Toth, MIT 1:50 An Improved bound for $k$-Sets in Three Dimensions Micha Sharir, Tel Aviv U., Shakhar Smorodinsky, Tel Aviv U., and Gabor Tardos, Hungarian Academy 2:10 Origin-Embracing Distributions or A Continuous Analogue of the Upper Bound Theorem Uli Wagner, ETH Zurich and Emo Welzl, ETH Zurich 2:30 A Helly-type theorem for hyperplane transversals to well-separated convex sets Boris Aronov, Poly U., Jacob E. Goodman, CUNY, Richard Pollack, Courant Inst., and Rephael Wenger, Ohio State 2:50 A Trace Bound for the Hereditary Discrepancy Bernard Chazelle, Princeton and Alexey Lvov, Princeton 3:10 Break Session 3, Theory/Applied Track Session Chair: Herbert Edelsbrunner 3:40 On the continuous Weber and k-means problems S.P. Fekete, Tech. U., J.S.B. Mitchell, SUNY Stony Brook, and K. Weinbrecht, U. K\"oln, 4:00 The 2-Center Problem with Obstacles Dan Halperin, Tel Aviv U., Micha Sharir, Tel Aviv U., and Ken Goldberg, UC Berkeley 4:20 Random Sampling in Geometric Optimization: New Insights and Applications Bernd Gaertner, ETH Zurich and Emo Welzl, ETH Zurich 4:40 The Analysis of a Simple k-Means Clustering Algorithm T. Kanungo, U. Maryland, D. M. Mount, U. Maryland, N. S. Netanyahu, U. Maryland, C. Piatko, Johns Hopkins, R. Silverman, U. of the District of Columbia, and A. Y. Wu, American U. 5:00 An Efficient, Exact, and Generic Quadratic Programming Solver for Geometric Optimization Bernd Gaertner, ETH Zurich and Sven Schoenherr, Freie U. 5:20 Exact and Efficient Unions of balls. Nina Amenta, UT Austin and Ravi Kolluri, UT Austin 8:00 Business meeting ----------------------------- Tuesday, June 13 Session 4, Applied Track Session Chair: 9:00 Fast Software for Box Intersections Afra Zomorodian, UI Urbana Champaign and Herbert Edelsbrunner, Duke U. and Raindrop Geomagic 9:20 Algebraic methods and arithmetic filtering for exact predicates on circle arcs Olivier Devillers, INRIA, Alexandra Fronville, INRIA, Bernard Mourrain, INRIA, and Monique Teillaud, INRIA 9:40 Pitfalls in Computing with Pseudorandom Determinants Bernd Gaertner, ETH Zurich 10:00 LOOK - A Lazy Object-Oriented Kernel for Geometric Computation Stefan Funke, MPI 10:20 Break 10:50 Invited Talk Andrew Frank, Technical U. 11:50 Lunch Session 5, Theory Track Session Chair: Mark de Berg 1:30 When Crossings Count - Approximating the Minimum Spanning Tree Sariel Har-Peled, Duke U. and Piotr Indyk, Stanford U. 1:50 Linear Programming Queries Revisited Edgar A. Ramos, MPI 2:10 Point Set Labeling with Specified Positions Srinivas Doddi, U. New Mexico, Madhav V. Marathe, Los Alamos, and Bernard M.E. Moret, U. New Mexico 2:30 I/O-Efficient Dynamic Planar Point Location Lars Arge, Duke U. and Jan Vahrenhold U. M\"unster 2:50 Linear-Time Polygon Triangulation Made Easier Via Randomization Nancy M. Amato, Texas A&M, Michael T. Goodrich, JHU, and Edgar A. Ramos, MPI 3:10 Break Session 6, Applied/Theory Track Session Chair: 3:40 A simple algorithm for homeomorphic surface reconstruction Nina Amenta, UT Austin, Sunghee Choi, UT Austin, Tamal K. Dey, Ohio State, and Naveen Leekha, Ohio State 4:00 Smooth shape reconstruction Jean-Daniel Boissonnat, INRIA, and Frederic Cazals, INRIA 4:20 Reconstructing curves with sharp corners Tamal K. Dey, Ohio State and Rafe Wenger, Ohio State 4:40 Voronoi-based interpolation with higher continuity Hisamoto Hiyoshi, U. Tokyo, and Kokichi Sugihara, U. Tokyo 7:00 Conference Banquet ---------------------------- Wednesday, June 14 Session 7, Applied/Theory Track Session Chair: 9:00 Reachability by paths of bounded curvature in convex polygons Hee-kap Ahn, HKUST, Otfried Cheong, HKUST, Jiri Matousek, Charles U., and Antoine Vigneron, HKUST 9:20 An algorithm for searching a polygonal region with a flashlight Steven M. Lavalle, Iowa State, Borislav Simov, Iowa State, and Giora Slutzki, Iowa State 9:40 Computing Approximate Shortest Paths on Convex Polytopes Pankaj K. Agarwal, Duke U., Sariel Har-Peled, Duke U., and Meetesh Karia, Trilogy 10:00 Densest Translational Lattice Packing of Non-Convex Polygons Victor J. Milenkovic, U. Miami 10:20 Break Session 8, Theory Track Session Chair: Franz Aurenhammer 10:50 Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes Edgar A. Ramos, MPI 11:10 Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus Timothy M. Chan, U. Waterloo 11:30 Testing the congruence of $d$-dimensional point sets Peter Brass, Freie U. and Christian Knauer, Freie U. 11:50 Lunch 1:30 Invited Talk Jean-Clause Latombe, Stanford U. 2:30 Break Session 9, Theory Track Session Chair: Hazel Everett 3:00 Multivariate regression depth Marshall Bern, Xerox and David Eppstein, UC Irvine 3:20 Kinetic Collision Detection for Simple Polygons David Kirkpatrick, UBC, Jack Snoeyink, UNC Chapel Hill, and Bettina Speckmann, UBC 3:40 Kinetic Connectivity for Unit Disks Leonidas Guibas, Stanford U., John Hershberger, Mentor Graphics, Subhash Suri, Washington U., and Li Zhang, Stanford U. 4:00 Break Session 10, Theory Track Session Chair: Jeff Erickson 4:20 Delaunay Triangulations and Voronoi Diagrams for Riemannian Greg Leibon, Dartmouth and David Letscher, Oklahoma State 4:40 Sweep Algorithms for Constructing Higher-Dimensional Constrained Delaunay Triangulations Jonathan R. Shewchuk, UC ------------- 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 jsbm at ams.sunysb.edu Sun Apr 16 22:16:10 2000 From: jsbm at ams.sunysb.edu (Joseph Mitchell) Date: Mon Jan 9 13:40:58 2006 Subject: postdoc/visiting positions at Stony Brook Message-ID: <200004170116.VAA29516@amirani.ams.sunysb.edu> Postdoctoral/Visiting Positions starting Fall, 2000 University at Stony Brook We anticipate having at least one postdoctoral or visiting position available at the University at Stony Brook, in the Department of Applied Mathematics and Statistics, starting in the fall of 2000. We expect to have a one-year visiting position available for strong candidates in the areas of operations research, algorithms, computational geometry, optimization, etc. The visiting position would include some modest teaching. We also expect to appoint one Postdoctoral Fellow under a Vertical Integration of Research and Education in the Mathematical Sciences (http://www.nsf.gov/cgi-bin/getpub?nsf9916) grant from the National Science Foundation. Applicants must be U.S. citizens or permanent residents. VIGRE Fellows are expected to have and demonstrate a strong commitment to the integration of mathematics with the outside world or to the educational mission of the university and to participate in the university's outreach effort to either industry, financial institutions, or other educational establishments. The postdoc and visitor are expected to conduct research, both independently and in collaboration with Stony Brook faculty and students, in support of various projects, which include the areas of computational geometry and algorithms, with applications in computer graphics, optimization, visualization, manufacturing, and GIS. Many of the applications projects require facility with software and algorithm development. Faculty in the algorithms/geometry area include Estie Arkin, Joe Mitchell, Michael Bender, Steve Skiena, and adjuncts Martin Held, Claudio Silva, Karel Zikan. In addition, there are opportunities to collaborate with the Center for Visual Computing (Ari Kaufman, director) at Stony Brook. Faculty in the operations research area include Eugene Feinberg, Jadranka Skorin-Kapov, Michael Taksar, and Alan Tucker. To be considered for the position, send a notice of intent, and a vita (in ascii, latex, or ps) to Joe Mitchell (jsbm@ams.sunysb.edu), at your earliest convenience. The University at Stony Brook is an Equal Opportunity employer. ------------- 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 santos at matesco.unican.es Mon Apr 17 10:32:18 2000 From: santos at matesco.unican.es (Francisco Santos) Date: Mon Jan 9 13:40:58 2006 Subject: triangulations in Santander Message-ID: Announcing a summer course: TRIANGULATIONS OF POLYHEDRA AND POINT SETS Santander (SPAIN), July 3-7, 2000 Course length: 20 hours Lecturers: Jesus A. de Loera, assistant professor, U. of California at Davis. Joerg Rambau, scientific assistant, Konrad-Zuse-Zentrum fuer Informationstechnik, Berlin. Francisco Santos, associate professor, U. de Cantabria, Santander. A short description of the course and tentative program is included below. For more information, including travel hints, registration, accomodation, etc. see: http://matsun1.matesco.unican.es/~santos/triancourse SHORT DESCRIPTION OF THE COURSE: ------------------------------- The topic are optimization and enumeration problems in the set of all triangulations of a polytope or point configuration. The course is addressed to graduate students and researchers in mathematics (specially algebra, geometry and applied mathematics), computer science (complexity theory, algorithmics) and some parts of engineering (those related to GIS, CAD, etc). On the theoretical side, the core of the course is the theory of secondary and universal polytopes, and the notion of geometric bistellar flip. The pre-requisites from the student are, basically, linear algebra and affine geometry. Some familiarity with projective geometry, theoretical combinatorics and complexity of algorithms would be desirable, but not strictly necessary. For the applications in algebraic geometry and topology mentioned in the last day (see the program below) some knowledge of these areas is needed, but the rest of the course can be followed without them. TENTATIVE PROGRAM: ----------------- Monday, July 3: 09:00 h. - 09:30 h. WELCOME. 09:30 h. - 11:30 h. FUNDAMENTAL NOTIONS AND MOTIVATION. JESUS DE LOERA 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. LIFE IN TWO DIMENSIONS. FLIPS. FRANCISCO SANTOS Tuesday, July 4 09:30 h. - 11:30 h. COMBINATORICS OF POLYHEDRAL SUBDIVISIONS. GALE DIAGRAMS AND CHAMBERS. JORG RAMBAU 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. SECONDARY POLYTOPES. BISTELLAR FLIPS. JORG RAMBAU Wednesday, July 5 09:30 h. - 11:30 h. THE UNIVERSAL POLYTOPE: A TOOL FOR OPTIMIZATION. JESUS DE LOERA 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. OPTIMIZATION. MINIMAL AND MAXIMAL TRIANGULATIONS. JESUS DE LOERA Thursday, July 6 09:30 h. - 11:30 h. THE BEST OF WORLDS: CYCLIC POLYTOPES. JORG RAMBAU 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. A CRUCIAL EXAMPLE: PRODUCTS OF SIMPLICES. TRIANGULATIONS WITHOUT FLIPS. FRANCISCO SANTOS Friday, July 7 09:30 h. - 11:30 h. FIBER POLYTOPES AND BEYOND. JORG RAMBAU 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. APPLICATIONS IN ALGEBRAIC GEOMETRY. JESUS DE LOERA 14:00 h. - 14:15 h. DELIVER OF DIPLOMAS +--------------------------------------------------------+ | Francisco Santos santos@matesco.unican.es | | Departamento de Matematicas, Estadistica y Computacion | | Universidad de Cantabria, Tel: +34-942-201522 | | E-39005 Santander, SPAIN Fax: +34-942-201402 | | http://www.matesco.unican.es/~santos | +--------------------------------------------------------+ ------------- 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 Mon Apr 17 14:56:10 2000 From: pankaj at cs.duke.edu (Pankaj Kumar Agarwal) Date: Mon Jan 9 13:40:58 2006 Subject: Workshop announcement Message-ID: <200004171756.NAA13562@polya.cs.duke.edu> Computational Geometry Workshop: Sharir Fest (in honor of Micha Sharir's 50th birthday) June 11, 2000 Hong Kong University of Technology, Hong Kong A workshop to celebrate Micha Sharir's 50th birthday is being held on June 11, immediately before the 16th Annual Symposium on Computational Geometry. More details will be available at http://www.cs.ust.hk/tcsc/sharirfest.html. Organizers: Pankaj K. Agarwal, Duke University (pankaj@cs.duke.edu) Otfried Cheong, HKUST (otfried@cs.ust.hk) Dan Halperin, Tel Aviv University (halperin@math.tau.ac.il) TENTATIVE PROGRAM ----------------- 10:45 Opening Remarks 11:00 Historical Perspective of Arrghs Herbert Edelsbrunner, Duke University 12:00 Lunch 1:30 TBA Boris Aronov, Polytechnic University 2:30 The various incarnations of Inverse-Ackermann Bernard Chazelle, Princeton University 3:30 Coffee break 4:00 Geometry and motion Leonidas J. Guibas, Stanford University 5:00 Micha Sharir, Tel Aviv University ------------- 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 emo at inf.ethz.ch Thu Apr 20 18:24:02 2000 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:40:58 2006 Subject: Pre-Doc Program, Combinatorics, Geometry, and Computation, ETH Zurich Message-ID: <200004201524.RAA14946@shadow.inf.ethz.ch> First Call for Applications Pre-Doc Program Combinatorics, Geometry, and Computation October 2000 -- March 2001 (At ETH Zurich; part of Berlin/Zurich European Graduate Program "Combinatorics, Geometry, and Computation") ETH Zurich offers a one-semester study program that focusses on the preparation of a Ph.D. in areas like: Discrete and Computational Geometry; Computer Graphics and Vision; Algorithms Design, Analysis and Implementation; Optimization and Mathematical Programming. Building blocks of the program are four 5-weeks research oriented courses, a project and the preparation of a proposal for a Ph.D. (see schedule and topics below). ETH offers a limited number of scholarships of Sfr 2'200 per month (for a six months period) for students with a Diploma or master in a field related to the topics of the program (including computer science, mathematics, electrical engineering, and physics). There is a possibility of continuing a Ph.D. in the Berlin/Z"urich Graduate Program (although it is not automatically implied by acceptance to the Pre-Doc program). Students who plan to continue their Ph.D. at some other university are also welcome. Advanced Diploma or masters students can be considered for a one-semester exchange program as well, if a feasible arrangement with their home universities can be made. The language of the program is English. The program is open to applicants of all nationalities. Students who receive a scholarship are expected to provide teaching assistance. Applications with curriculum vitae, copies of certificates, theses, areas of interest, a letter of recommendation of the last advisor, should be sent to: Emo Welzl Institut Theoretische Informatik ETH Zentrum CH-8092 Zurich Switzerland (Applications that arrive before before May 19 will be notified of acceptance by June 5. There is a second round with deadline June 16 with notification July 3.) For further information use tel: ++41-1-63 273 92, email , or (starting May 4). SCHEDULE (Courses, lecturers, and abstracts below) --------------------------------------- Oct 1 Reading assignments --------------------------------------- Oct 23 Courses -Nov 24 Mo&Tu RandAlgs Th&Fr CombGeom Nov 27 Exams --------------------------------------- Nov 30 Projects, reading assignments -Dec 20 and presentations --------------------------------------- Jan 8 Courses -Feb 9 Mo&Tu GraphVis Th&Fr ApproxAlgs Feb 12 Exams --------------------------------------- Feb 15 Preparation of Ph.D. proposal -Mar 31 and presentations --------------------------------------- COURSES Courses will be held two days a week, for a five-weeks period. As a rough framework, every day includes 3 hours of lectures, exercises in groups, and a discussion of exercises. RandAlgs Randomized Algorithms (Emo Welzl) Randomized algorithms have by now emerged in many fields, and have lead to several improvements compared to determinisitic methods. We will discuss several basic methods in several areas, including graph algorithms and geometry, approximate counting and solving of hard problems (e.g. SAT). The emphasis will be on understanding of the basic methods, so that they can be applied in several situations. CombGeom Combinatorial Geometry (Komei Fukuda, Juergen Richter-Gebert) Geometric objects (like polytopes or arrangements of hyperplanes) carry two layers of information. First of all they are described by the coordinates of the parts involved. On the other hand there is also a combinatorial description that cares only about the relative position of the elements. This course is about the subtle interplay of coordinates and combinatorics. We introduce the "theory of oriented matroids" as the primary framework for the study. This theory allows us to get deep structural insight in topics like "polytope theory", "linear optimization", "automatic geometric theorem proving", "quasicrystals" and many more. GraphVis Advanced Topics in Vision and Graphics (Luc van Gool, Markus Gross, Bernt Schiele, Gabor Szekeley) Although being two separate disciplines we observe that Graphics and Vision are increasingly converging. Methods and algorithms developed independently are more and more getting combined or merged to sophisticated frameworks covering a wide range of applications. In this course we will present a selection of advanced topics in Vision and Graphics illustrating the tight relationship between the two disciplines. We will discuss recent research results and developments in both areas with a special emphasis on modeling and geometry. Topics include the notion of invariance, methods for 3D reconstruction, learning and statistical modeling, mesh signal processing, image based rendering, deformable templates and FEM. The course will be organized into separate modules each of which consisting of lectures and practical or theoretical exercises. ApproxAlgs Approximation: Theory and Algorithms (Johannes Bloemer, Maurice Cochand, Bernd Gaertner, Peter Widmayer) This course is concerned with approximation algorithms for NP-hard optimization problems. The topics covered include: basic and advanced approximation algorithms for selected problems; more general techniques such as linear programming relaxation, derandomization, and semidefinite programming; inapproximability and the PCP concept. ------------- 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 Apr 26 18:42:50 2000 From: Andrzej.Lingas at cs.lth.se (Andrzej Lingas) Date: Mon Jan 9 13:40:58 2006 Subject: Vacant position for female PhD Student in Computer Science Message-ID: <200004261542.RAA25140@hannar.cs.lth.se> Vacant position for female PhD Student in Computer Science Reference no: 2082 Vacant from: Immediately Information: Please contact Christos Levcopoulos, 46 46-222 80 36, Christos.Levcopoulos@cs.lth.se, or Eric Astor, 46 46-222 96 43, Eric.Astor@cs.lth.se Applications, quoting the reference number, and including a curriculum vitae, copies of certificates and other documents considered pertinent by the applicant, should be addressed to Lund University Faculty of Science the Registrar Lund University PO Box 117 SE-221 00 Lund Sweden and must be received not later than May 10 2000. All copies must be attested. ------------- 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 gperkins at paul.rutgers.edu Thu Apr 27 17:12:22 2000 From: gperkins at paul.rutgers.edu (Greg Perkins) Date: Mon Jan 9 13:40:58 2006 Subject: a question Message-ID: <200004272012.QAA09818@paul.rutgers.edu> Let T be a triangulation and define x \subset T as simple if the union of all triangles in x forms a simple polygon with no holes. Let X be the set of all simple subsets of T. What is the size of X? Has an upper-bound been proven for this? Thanks, Greg Perkins ------------- 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.