From emo at inf.ethz.ch Fri Oct 1 11:38:26 1999 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:40:55 2006 Subject: European Graduate Program, Berlin & Zurich Message-ID: <199910010838.KAA17570@shadow.inf.ethz.ch> ---------------------------------------------------------------------------- European Graduate Program Berlin ------------------------------------------ Zurich Combinatorics, Geometry, and Computation ---------------------------------------------------------------------------- In the newly established graduate program two-year scholarships for Ph.d.students are available in Berlin and Zurich starting January 1st, 2000. Applicants should have a degree in mathematics, computer science, or a related area equivalent to the German or Swiss university diploma (e.g. M.S.) with grades significantly above average. Furthermore at each location a postdoctoral position is available for at most two years. The program is a joint initiative of the ETH Zurich, the three universities of Berlin - Free University, Technical University, Humboldt-University - and the Konrad-Zuse-Research Center. The German partners are financially suppor- ted by the German Research association (Deutsche Forschungsgemeinschaft, DFG). The amount of the scholarships in Berlin is calculated according to the guidelines of the DFG and is up to DM 2690 per month, tax free (family supplement DM 400). The scientific program ranges from theoretical fundamentals to applications. The areas of research are combinatorics, geometry, optimization, algorithms and computation, computer graphics, and vision. In Berlin the students are supervised by the professors Aigner, Alt, Rote, Schulz (FU), Moehring, Zieg- ler (TU), Proemel (HU) and Groetschel (ZIB). The participating professors at ETH Zurich are Fukuda, Van Gool, M. Gross, Luethi, Nievergelt, Richter-Ge- bert, Schiele, Welzl and Widmayer. Applications with curriculum vitae, copies of certificates, theses, a letter of recommendation of the last advisor, a brief description of the proposed research and, especially for applicants for the postdoctoral position, re- prints of publications should be sent in until October 23, 1999 to one of the speakers of the program: in Berlin in Zurich Prof. Dr. Helmut Alt Prof. Dr. Emo Welzl Institut fuer Informatik Institut fuer Theoretische Informatik Freie Universitaet Berlin ETH Zentrum Takustrasse 9 CH-8092 Zurich D-14195 Berlin Further Information can be obtained from Bettina Felsner Emo Welzl Tel. ++49-30-838 75 104 Tel. ++41-1-63 273 92 bfelsner@inf.fu-berlin.de emo@inf.ethz.ch --------------------------------------------------------------------------- ------------- 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/threads.html. From cg2000 at CS.bgu.ac.il Mon Oct 11 19:43:33 1999 From: cg2000 at CS.bgu.ac.il (Computational Geometry workshop) Date: Mon Jan 9 13:40:55 2006 Subject: Euro-CG-2000 new web page Message-ID: <199910111643.SAA12372@cyan.cs.bgu.ac.il> +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ C A L L F O R P A P E R S 16TH EUROPEAN WORKSHOP ON COMPUTATIONAL GEOMETRY March 13-14-15 2000 Eilat Club Hotel, Eilat, Israel +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ For more details please check our new web page http://www.cs.bgu.ac.il/~cg2000 or its mirror site http://www.cs.cornell.edu/kedem/Euro_CG_2000/euro.htm +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ------------- 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/threads.html. From John.Dickinson at nrc.ca Mon Oct 4 16:03:09 1999 From: John.Dickinson at nrc.ca (Dickinson, John) Date: Mon Jan 9 13:40:55 2006 Subject: Looking for 3D of ND alpha-hull code. Message-ID: <35C5DD9F60FED21192B00004ACA6E6C70A47EF@NRCLONEX1> Dear All, Anyone know of a good open code implementation of weighted alpha-hulls for 3D point clouds? Or even just an alpha-hull generating algorithm for 3D point clouds? I would like to avoid rebuilding the wheel. I have located the work on alpha shapes at: http://fiaker.ncsa.uiuc.edu/alpha but the web site is inaccessible There is also one algorithm implementation at http://www.netlib.org/voronoi/index.html but this code doesn't do weight alpha-hulls and I always try to find out if other code samples exist before settling on one previos implementation. John -- -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859)- John Kenneth Dickinson | "A sharp tongue is the only Research Council Officer IMTI-NRC | edge tool that grows keener email: john.dickinson@nrc.ca | with constant use." ------------- 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/threads.html. From snoeyink at cs.unc.edu Sat Oct 9 07:58:49 1999 From: snoeyink at cs.unc.edu (Jack Snoeyink) Date: Mon Jan 9 13:40:55 2006 Subject: Funding opportunity in the US (international collaboration is also encouraged) Message-ID: <199910091120.HAA12113@austin.cs.unc.edu> I was speaking with Kamal Abdali at NSF yesterday, and he wanted to make sure that the US computational geometry community knows about the following funding opportunity > Title: Information Technology Research (ITR) > Type: Program Announcements & Information > Subtype: NSF-wide > http://www.nsf.gov/cgi-bin/getpub?nsf99167 Apparently the funding approval for $100M has just gone through congress, which essentially increases the total computer science budget by 50% this year. The increase is to meet the goals of the PITAC report. Letters of intent for $3M centers and proposals over $500K are due Nov 15. (The ITR program document also says that international collaboration is encouraged. Since NSF funds are spent in the US, what this usually means that coordinated submissions to two or more different national granting agencies will increase the chances of both.) On behalf of the CG steering committee, Jack Snoeyink@cs.unc.edu UNC Chapel Hill, Computer Science CB 3175, Sitterson Hall, Chapel Hill, NC 27599-3175 USA http://www.cs.unc.edu/~snoeyink ph+1(919)962-1969 fax+1(919)962-1799 ------------- 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/threads.html. From esbandr at esavionics.se Mon Oct 4 07:52:38 1999 From: esbandr at esavionics.se (Andreas Ogren) Date: Mon Jan 9 13:40:55 2006 Subject: Help References: <001a01bf08ea$6aef4b60$5f0da8c0@aku.ac.ir> Message-ID: <37F83296.7F7CFE77@esavionics.se> Try the homepage of "Computational Geometry: Algoriths and Applications". http://www.cs.uu.nl/geobook/ It links to a database containing 10,000 papers written on computational geometry. /Andreas > Ali Mohades wrote: > > hi everybody, > > I would be very thankful to anyone who could provide me with e-mail > address or any Webster which can help me to find the papers about a > given subject in computational geometry. > > Best wishes > --------------------------- > Ali Mohades > Amir kabir University of Technology > Tehran, Iran > mohades@cic.aku.ac.ir > Tel: 98-21-640-6322 > Fax: 1-603-925-7150 > --------------------------- ------------- 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/threads.html. From info at golfuniverse.com Sat Oct 9 01:37:43 1999 From: info at golfuniverse.com (info@golfuniverse.com) Date: Mon Jan 9 13:40:55 2006 Subject: Turnstile's Golf & Travel Online Newsletter Message-ID: <438.144102.330233@golfuniverse.com> An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/19991009/71e7e136/attachment.htm From skala at kiv.zcu.cz Mon Oct 11 08:23:52 1999 From: skala at kiv.zcu.cz (Vaclav Skala) Date: Mon Jan 9 13:40:55 2006 Subject: WSCG'2000 - deadline changed to October 21,1999/L1 Message-ID: <00c701bf13a9$670a6b00$373fe493@uk426p02-kiv.fav.zcu.cz> Dear friend, due to the low number of correct submissions (not filled Copyright transfer form, problems with FTP, network etc.) I extended the deadine for paper submission for WSCG'2000 exceptionally to: October 21, 1999 - files must be uploaded (exceptionally can be send as attached binary files if copressed and if they do not exceed 700KB together) and the copyright trasfer form must obtained (fax is O.K. if originl included to the original. Paper version must be obtained by October 27. Please, register your paper via WEB if you haven't done it yet. Please, remind the deadline colleagues of yours. Sorry for duplicates and inconveniences I caused. Yours vaclav ~~~~~~~~~~~~~~~~~~~~~ Prof.Ing.Vaclav Skala, CSc. University of West Bohemia Univerzitni 8, Box 314 306 14 Plzen Czech Republic http://herakles.zcu.cz/~skala Tel./record: +420-19-78 22 188 direct Secretariat: tel: +420-19-78 22 212, fax +420-19-78 22 213 ------------- 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/threads.html. From rhoads at paul.rutgers.edu Thu Oct 7 00:27:38 1999 From: rhoads at paul.rutgers.edu (Glenn C. Rhoads) Date: Mon Jan 9 13:40:55 2006 Subject: Problem: Polygon Representation Message-ID: <199910070327.XAA09538@paul.rutgers.edu> Hi everybody, I've written a program where polygons are represented as a sequence of edges and I need to generalize my representation to handle polygons where both the angles and edge lengths could be *irrational*. At the moment, I'm stuck on how to do this. I would really appreciate it if somebody would give me an idea, suggestion, or a useful reference on representing polygons with irrational angles and edge lengths. Regards, Glenn --- Glenn C. Rhoads email: rhoads@paul.rutgers.edu Comp. Science Dept. web: http://remus.rutgers.edu/~rhoads/ Rutgers University phone: (732) 445-4869 ------------- 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/threads.html. From vlad at cs.newcastle.edu.au Wed Oct 13 10:21:27 1999 From: vlad at cs.newcastle.edu.au (Vladimir Estivill-Castro) Date: Mon Jan 9 13:40:55 2006 Subject: COCOON 2000 CFP Message-ID: <199910122321.JAA27018@olive.newcastle.edu.au> COCOON'2OOO --- Preliminary Call for Papers --- Sixth Annual International Computing and Combinatorics Conference July 26-28, 2000, Bondi Beach , Sydney , Australia The Sixth Annual International Computing and Combinatorics Conference, COCOON'2000, will be held in Bondi Beach , Sydney , Australia July 26--28, 2000 (a few weeks before the XXVII Olympics, September 15 -- October 1 ). The conference aims to provide a forum for researchers in theoretical computer science. Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In additional to theoretical results, submissions that report substantial results in experimental and applied research are encouraged. Typical, but not exclusive, topics of interest include: -- algorithms and data structures -- automata, languages and logic -- combinatorics related to algorithms and complexity -- complexity theory -- computational algebra, biology, geometry, and number theory -- computational learning theory and knowledge discovery -- cryptography and database theory -- graph drawing and information visualization -- graph theory, communication networks, and optimization -- parallel and distributed computing Submissions to the conference this year will again be conducted electronically. Authors should send a PostScript file of a paper (in English) to cocoon2000@cse.unsw.edu.au by February 8, 2000. A submission guideline will be given on our home page: http://www.cs.newcastle.edu.au/~cocoon2000 Alternatively, authors unable to access e-mail may send 6 hard copies of their papers to: Xuemin Lin - COCOON'2000 School of Computer Science and Engineering University of New South Wales Sydney, NSW 2052, Australia. e-mail: lxue@cse.unsw.edu.au A paper should start with the title of the paper, each author's name, affiliation, e-mail address, and a short summary of the main results. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance to the conference. The length of the paper should not exceed 10 pages (using 11 point or larger font, with ample margins all around). If necessary, authors may include a clearly marked appendix that will be read at the discretion of the Program Committee. An abstract of the paper must be submitted electronically by February 1, 2000. Authors will be notified of acceptance or rejection by March 30, 2000. A camera-ready copy of each accepted paper will be required by April 26, 2000. The proceedings of the conference will be published by Springer-Verlag in the Lecture Notes in Computer Science series, and will be available for distribution at the conference. The Hao Wang award will be given to the best paper (details will be given on our home page). We also introduce an award for the best paper from a young researcher (at most 3 years since PhD). Program Committee Co-Chairs =========================== Ding-Zhu Du (U. of Minnesota, USA) Peter Eades (Newcastle, Australia) Xuemin Lin (New South Wales, Australia) Conference Co-Chairs ==================== Vladimir Estivill-Castro (Newcastle, Australia) Arun Sharma (New South Wales, Australia) Program Committee ================= David Avis (McGill, Canada), Jianer Chen (Texas A&M, USA), Francis Chin (Hong Kong U, Hong Kong), Vladimir Estivill-Castro (Newcastle, Australia), George Havas (UQ, Australia), Hiroshi Imai (Tokyo, Japan), Tao Jiang (UC Riverside, USA), Richard Karp (UC Berkeley, USA), Michael Juenger (Cologne, Germany), D. T. Lee (Academia Sinica, Taiwan), Bernard Mans (Macquarie U., Australia), Brendan McKay (ANU, Australia), Maurice Nivat (Universitie de Paris VII, France), Takeshi Tokuyama (Tohoku, Japan), Roberto Tamassia (Brown, USA), Jie Wang (UNC Greensboro, USA), Shmuel Zaks (Technion, Israel), Louxin Zhang (NUS, Singapore), Shuzhong Zhang (CUHK, Hong Kong), Binhai Zhu (City U Hong Kong, Hong Kong) Invited Speakers ================ - Christos H. Papadimitriou (University of California, Berkeley) - Richard Brent (Oxford University Computing Laboratory) Important Dates ============== -- Submission of Abstracts: February 1, 2000 -- Submission of Papers: February 8, 2000. -- Notification of Acceptance: March 30, 2000. -- Final Version: April 26, 2000. -- Conference: July 26-28, 2000 . Location ======== The conference will be held at the Swiss-Grand Hotel in Bondi Beach , Sydney , Australia . Further Information =================== Please contact cocoon2000@cse.unsw.edu.au for further information. Sponsors ======== - University of New South Wales - University of Newcastle - Computer Science Association of Australasia ------------- 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/threads.html. From raamtin at ce.sharif.ac.ir Mon Oct 18 14:41:32 1999 From: raamtin at ce.sharif.ac.ir (Ramtin Khosravi) Date: Mon Jan 9 13:40:55 2006 Subject: Visibility map Message-ID: <009DFCF6.F378AF20.23@ce.sharif.ac.ir> Dear all, Where can I find an algorithm for constructing the visibility map of a point lying on the surface of a 3D polyhedron (not a terrain)? I would be thankful if someone tell me the running time of the best algorithm known for the problem. Please reply to raamtin@ce.sharif.ac.ir Thanks --Ramtin ------------- 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/threads.html. From kabdali at nsf.gov Mon Oct 18 10:42:50 1999 From: kabdali at nsf.gov (Kamal Abdali) Date: Mon Jan 9 13:40:55 2006 Subject: Funding opportunity in the US (international collaboration is also encouraged) In-Reply-To: <199910091120.HAA12113@austin.cs.unc.edu> Message-ID: <4.1.19991018094100.00999940@popsrvr.nsf.gov> For more information and a FAQ, please also visit http://www.itr.nsf.gov Kamal Abdali At 10/9/99 06:58 AM -0400, Jack Snoeyink wrote: >I was speaking with Kamal Abdali at NSF yesterday, and he wanted to make >sure that the US computational geometry community knows about the following >funding opportunity >> Title: Information Technology Research (ITR) >> Type: Program Announcements & Information >> Subtype: NSF-wide >> http://www.nsf.gov/cgi-bin/getpub?nsf99167 > >Apparently the funding approval for $100M has just gone through congress, >which essentially increases the total computer science budget by 50% this >year. The increase is to meet the goals of the PITAC report. >Letters of intent for $3M centers and proposals over $500K are due Nov 15. > >(The ITR program document also says that international collaboration is >encouraged. Since NSF funds are spent in the US, what this usually means >that coordinated submissions to two or more different national granting >agencies will increase the chances of both.) > >On behalf of the CG steering committee, > >Jack Snoeyink@cs.unc.edu UNC Chapel Hill, Computer Science > CB 3175, Sitterson Hall, Chapel Hill, NC 27599-3175 USA >http://www.cs.unc.edu/~snoeyink ph+1(919)962-1969 fax+1(919)962-1799 > >------------- >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/threads.html. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From John.Dickinson at nrc.ca Mon Oct 18 10:04:52 1999 From: John.Dickinson at nrc.ca (Dickinson, John) Date: Mon Jan 9 13:40:55 2006 Subject: FW: Looking for 3D of ND alpha-hull code. Message-ID: <35C5DD9F60FED21192B00004ACA6E6C70A4809@nrclonex1.imti.nrc.ca> Thanks to all who provided links for me to explore. I would have thnaked you all earlier but I only just now received (Mon 18th) three responses with different starting dates so I think me email has been partially crippled for a while. To answer requests for me to forward the responses I got here is the only response I got directly that did not appear on the mailing list (so far). I would have sent John -----Original Message----- From: Steve Fortune [mailto:sjf@research.bell-labs.com] Sent: October 17, 1999 10:46 PM To: Dickinson, John Subject: Re: Looking for 3D of ND alpha-hull code. Browse through http://www.geom.umn.edu/software/cglist/welcome.html most available cg software is listed there. --Steve Fortune ------------- 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/threads.html. From yap at cs.nyu.edu Mon Oct 18 17:15:33 1999 From: yap at cs.nyu.edu (Chee Yap) Date: Mon Jan 9 13:40:55 2006 Subject: Problem: Polygon Representation Message-ID: <199910182015.QAA11830@jinai.cs.nyu.edu> Glenn, Irrationalities that are only algebraic can be handled. If the irrationalities are non-algebraic, this is impossible (in the sense of being undecidable) in general. Mixing (algebraic) angles and, say, (algebraic) lengths in the same setting is also generally impossible. The best way out of this is to assume angles as computed values and they are implicitly represented. Two current libraries can handle nested square-roots, which is the kind of irrationality that suffices for many basic applications: (1) LEDA Library: I think what you want is their underlying arithmetic called leda_reals. Leda offers many other useful algorithms and data structures besides leda_reals. http://www.mpi-sb.mpg.de/LEDA/ (2) The Core Library http://cs.nyu.edu/exact/core/ Speed may be an issue if your application has high algebraic degree, but at least in principle, these systems can do it. These are current topics of research. Both systems are described in papers in the proceedings of the 15th ACM Symp.on Computational Geometry (June 1999) (and can be found in the respective sites). --Chee Yap > From compgeom-owner@research.bell-labs.com Sun Oct 17 22:01 EDT 1999 > Date: Wed, 6 Oct 1999 23:27:38 -0400 (EDT) > X-Authentication-Warning: paul.rutgers.edu: rhoads set sender to rhoads@paul.rutgers.edu using -f > To: compgeom-discuss@research.bell-labs.com > From: "Glenn C. Rhoads" > Subject: Problem: Polygon Representation > > > Hi everybody, > > I've written a program where polygons are represented as a sequence > of edges and I need to generalize my representation to handle polygons > where both the angles and edge lengths could be *irrational*. At the > moment, I'm stuck on how to do this. I would really appreciate it if > somebody would give me an idea, suggestion, or a useful reference on > representing polygons with irrational angles and edge lengths. > > Regards, > > Glenn > > --- > Glenn C. Rhoads email: rhoads@paul.rutgers.edu > Comp. Science Dept. web: http://remus.rutgers.edu/~rhoads/ > Rutgers University phone: (732) 445-4869 > > ------------- > 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/threads.html. > ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From emo at inf.ethz.ch Thu Oct 21 12:28:47 1999 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:40:55 2006 Subject: ICALP 2000, Call for Papers Message-ID: <199910210928.LAA25243@shadow.inf.ethz.ch> Call for Papers ICALP'00 27-th International Colloquium on Automata, Languages and Programming July 9-15, 2000, Geneva, Switzerland The 27-th annual meeting of the European Association of Theoretical Computer Science will be held in Geneva, Switzerland. As is the case with the two tracks of the journal Theoretical Computer Science, the scientific program of the colloquium is split into two parts: Track A of the meeting will correspond to Algorithms, Automata, Complexity, and Games, while Track B to Logic, Semantics, and Theory of Programming. Original contributions to theory of computer science, to be presented either in Track A or in Track B, are being sought. Authors are invited to submit extended abstracts of their papers, not exceeding 12 pages in the standard Springer Verlag LNCS style. Instructions for paper submissions can be found at the conference webpage. Authors from countries where access to Internet is difficult may mail a single copy of their paper directly to the address of the conference chairman. Submissions should consist of: a cover page, with the author's full name, address, fax number, e-mail address, a 100-word abstract, keywords and to which track (A or B) the paper is being submitted and an extended abstract describing original research in no more than 12 pages. It is expected that accepted papers will be presented at the conference. Simultaneous submission to other conferences with published proceedings is not allowed. In addition, one page proposals for workshops, to be sent to the conference chair until November 10, 1999, are welcome. Conference Chair: Jose D. P. Rolim Centre Universitaire d'Informatique University of Geneva 24 rue du General Dufour 1211 Geneva 4 Switzerland e-mail: icalp@cui.unige.ch ICALP'00 Program Committee Track A: Emo Welzl, Chair, ETH Zuerich Harry Buhrman, CWI Amsterdam Peter Bro Miltersen, Univ. Aarhus Martin Dietzfelbinger, Techn Univ. Ilmenau Afonso Ferreira, CNRS-I3S-INRIA Sophia Antipolis Marcos Kiwi, Univ. de Chile Jens Lagergren, KTH Stockholm Gheorghe Paun, Romanian Acad. Guenter Rote, Techn. Univ. Graz & FU Berlin Ronitt Rubinfeld, Cornell Univ. Amin Shokrollahi, Bell Labs Luca Trevisan, Columbia Univ. Serge Vaudenay, ENS Paris & EPF Lausanne Uri Zwick, Tel Aviv Univ. Track B: Ugo Montanari, Chair, Univ. of Pisa Rajeev Alur, Univ. Pennsylvania, Philadelphia Rance Cleaveland, SUNY at Stony Brook Pierpaolo Degano, Univ. of Pisa Jose Fiadeiro, Univ. of Lisbon Andy Gordon, Microsoft Research, Cambridge, Orna Grumberg, Technion, Haifa Claude Kirchner, Inria, Nancy Mogens Nielsen, Univ. of Aarhus Catuscia Palamidessi, Penn. State Univ, Univ. Park Joachim Parrow, KTH, Stockholm Edmund Robinson, QMW, London Jan Rutten, CWI, Amsterdam Jan Vitek, Univ. of Geneva Martin Wirsing, Ludwig-Maximilians-University, Munich Pierre Wolper, Univ. of Liege. Invited Speakers Track A: Andrei Broder, Altavista and Compaq Oded Goldreich, MIT and Weizman Inst. Johan Hastad, KTH Stockholm Kurt Mehlhorn, Max Plank Institute Track B: Samsom Abramsky, Edinburgh Univ. Gregor Engels, Paderborn Univ. Roberto Gorrieri, Univ. Bologna Zohar Manna, Stanford Univ. General Information Geneva is situated along the banks of Lac Leman and Le Rhone. The lake showcases the plumed fountain Jet d'Eau, and various districts of Geneva are connected by bridges across the waterways. The University of Geneva where ICALP '00 will convene is located on the `Left Bank' off Place Neuve and along the Promenade des Bastions near the Old Town section of Geneva. Geneva is a city of water parks and gardens and welcoming walkways which encourage exploration of the historical sites, museums, and international business and shopping districts. The University of Geneva is located near `Old Town' an area dotted with sidewalk cafes, student life, and building antiquities dating back to the 5th century. Geneva is a crossroads situated in the heart of Europe and linked to the world by a vast network of motorways, airlines and railways. For those planning to attend ICALP '00 in Geneva, it is an excellent opportunity to organize short trips into the countryside of charming villages and vineyards. Tours to please all ages and interests are available including afternoon train excursions, shopping cruises on Lake Geneva and The Rhone, and bus and cablecar trips in the Alps. For some, the most inviting attraction will be mouintain climbing. Mont Blanc, one of the highest points in Europe and the city of Chamonix are less than an hour away. Accomodations at a very special ICALP rate have been reserved in a couple of hotels and very inexpensive rooms will be available at the Student Housing. Lunch will be served daily on campus and there will be morning and afternoon refreshment breaks. Note that the specially priced hotel accommodations reserved for ICALP participants are located only a 5-10 minute walk to the campus. Important Dates Workshop Proposals: November 10,1999 Submissions: January 17, 2000 Notification: March 21, 2000 Final Copies: April 18, 2000 Further Information Further information related to ICALP'00, with instructions for paper submissions and conference registration, as well as with details on conference site, registration fee, accommodation, social program, and payments, will appear at the conference webpage at http://cuiwww.unige.ch/~icalp and in forthcoming issues of EATCS Bulletin. The conference is organized by the Centre Universitaire d'Informatique of the University of Geneva. ------------- 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/threads.html. From szz at zycor.lgc.com Fri Oct 22 10:34:35 1999 From: szz at zycor.lgc.com (Steve Zoraster) Date: Mon Jan 9 13:40:55 2006 Subject: Intersections of triangulated surfaces? Message-ID: <199910221434.JAA00912@dusty> I am looking for papers or algorithms which provide efficient solutions to the problem of cutting one triangulated surface model by another triangulated surface model. The desired output would be the two separated sections of the original surface, re-triangulated along the cut line.... Thanks. Responses I get through direct e-mail will be posted back to this list. Steven Zoraster szz@zycor.lgc.com www.lgc.com www.szoraster.com ------------- 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/threads.html. From vlad at cs.newcastle.edu.au Mon Oct 25 23:56:04 1999 From: vlad at cs.newcastle.edu.au (Vladimir Estivill-Castro) Date: Mon Jan 9 13:40:55 2006 Subject: COCOON-2000 Message-ID: <199910251256.WAA25112@olive.newcastle.edu.au> Apologies if you receive multiple copies of this message. COCOON'2OOO --- Preliminary Call for Papers --- Sixth Annual International Computing and Combinatorics Conference July 26-28, 2000, Bondi Beach , Sydney , Australia The Sixth Annual International Computing and Combinatorics Conference, COCOON'2000, will be held in Bondi Beach , Sydney , Australia July 26--28, 2000 (a few weeks before the XXVII Olympics, September 15 -- October 1 ). The conference aims to provide a forum for researchers in theoretical computer science. Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In additional to theoretical results, submissions that report substantial results in experimental and applied research are encouraged. Typical, but not exclusive, topics of interest include: -- algorithms and data structures -- automata, languages and logic -- combinatorics related to algorithms and complexity -- complexity theory -- computational algebra, biology, geometry, and number theory -- computational learning theory and knowledge discovery -- cryptography and database theory -- graph drawing and information visualization -- graph theory, communication networks, and optimization -- parallel and distributed computing Submissions to the conference this year will again be conducted electronically. Authors should send a PostScript file of a paper (in English) to cocoon2000@cse.unsw.edu.au by February 8, 2000. A submission guideline will be given on our home page: http://www.cs.newcastle.edu.au/~cocoon2000 Alternatively, authors unable to access e-mail may send 6(six) hard copies of their papers to: Xuemin Lin - COCOON'2000 School of Computer Science and Engineering University of New South Wales Sydney, NSW 2052, Australia. e-mail: lxue@cse.unsw.edu.au A paper should start with the title of the paper, each author's name, affiliation, e-mail address, and a short summary of the main results. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance to the conference. The length of the paper should not exceed 10 pages (using 11 point or larger font, with ample margins all around). If necessary, authors may include a clearly marked appendix that will be read at the discretion of the Program Committee. An abstract of the paper must be submitted electronically by February 1, 2000. Authors will be notified of acceptance or rejection by March 30, 2000. A camera-ready copy of each accepted paper will be required by April 26, 2000. The proceedings of the conference will be published by Springer-Verlag in the Lecture Notes in Computer Science series, and will be available for distribution at the conference. The Hao Wang award will be given to the best paper (details will be given on our home page). We also introduce an award for the best paper from a young researcher (at most 3 years since PhD). Program Committee Co-Chairs =========================== Ding-Zhu Du (U. of Minnesota, USA) Peter Eades (Newcastle, Australia) Xuemin Lin (New South Wales, Australia) Conference Co-Chairs ==================== Vladimir Estivill-Castro (Newcastle, Australia) Arun Sharma (New South Wales, Australia) Program Committee ================= David Avis (McGill, Canada), Jianer Chen (Texas A&M, USA), Francis Chin (Hong Kong U, Hong Kong), Vladimir Estivill-Castro (Newcastle, Australia), George Havas (UQ, Australia), Hiroshi Imai (Tokyo, Japan), Tao Jiang (UC Riverside, USA), Richard Karp (UC Berkeley, USA), Michael Juenger (Cologne, Germany), D. T. Lee (Academia Sinica, Taiwan), Bernard Mans (Macquarie U., Australia), Brendan McKay (ANU, Australia), Maurice Nivat (Universitie de Paris VII, France), Takeshi Tokuyama (Tohoku, Japan), Roberto Tamassia (Brown, USA), Jie Wang (UNC Greensboro, USA), Shmuel Zaks (Technion, Israel), Louxin Zhang (NUS, Singapore), Shuzhong Zhang (CUHK, Hong Kong), Binhai Zhu (City U Hong Kong, Hong Kong) Invited Speakers ================ - Christos H. Papadimitriou (University of California, Berkeley) - Richard Brent (Oxford University Computing Laboratory) Important Dates ============== -- Submission of Abstracts: February 1, 2000 -- Submission of Papers: February 8, 2000. -- Notification of Acceptance: March 30, 2000. -- Final Version: April 26, 2000. -- Conference: July 26-28, 2000 . Location ======== The conference will be held at the Swiss-Grand Hotel in Bondi Beach, Sydney, Australia. Further Information =================== Please contact cocoon2000@cse.unsw.edu.au for further information. Sponsors ======== - University of New South Wales - University of Newcastle - Computer Science Association of Australasia ------------- 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/threads.html. From aftosmis at nas.nasa.gov Mon Oct 25 16:00:48 1999 From: aftosmis at nas.nasa.gov (Michael Aftosmis) Date: Mon Jan 9 13:40:56 2006 Subject: Intersections of triangulated surfaces? References: <199910221434.JAA00912@dusty> Message-ID: <3814D310.6CCD0E5B@nas.nasa.gov> Steve, take a look at http://george.arc.nasa.gov/~aftosmis/cart3d/#intersect See if its close to what you want. If the inputs are simplicial polyhedra, I think that "intersect" will do what you want. You can get this package from NASA Ames. The algorithm is written up in: http://george.arc.nasa.gov/~aftosmis/publications/publications.html (click "AIAA 97-0196") or in more detail at: http://george.arc.nasa.gov/~aftosmis/vki/vki97.html Take a look at http://george.arc.nasa.gov/~aftosmis/cart3d/recentInfo.html to see about getting a copy of the software. -Michael Steve Zoraster wrote: > > I am looking for papers or algorithms which provide > efficient solutions to the problem of cutting one > triangulated surface model by another triangulated > surface model. The desired output would be the two > separated sections of the original surface, > re-triangulated along the cut line.... > > Thanks. Responses I get through direct e-mail will > be posted back to this list. > > Steven Zoraster > szz@zycor.lgc.com > www.lgc.com > www.szoraster.com > > ------------- > 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/threads.html. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From csi at dcs.kcl.ac.uk Wed Oct 27 10:33:44 1999 From: csi at dcs.kcl.ac.uk (Costas S. Iliopoulos) Date: Mon Jan 9 13:40:56 2006 Subject: Journal Of Discrete Algorithms: Call For Papers Message-ID: <199910270834.JAA18865@helium.dcs.kcl.ac.uk> Hermes Science Publications Paris and Oxford JOURNAL OF DISCRETE ALGORITHMS JDA aims to facilitate communication between researchers in theoretical computer science who are concerned with the design and analysis of discrete algorithms. JDA welcomes original papers in all areas of discrete algorithm design and analysis. The purpose of this journal is to feature new algorithms and data structures, new analyses or comparisons of known algorithms, complexity studies and well-focussed review articles of currently-active subject areas. Articles in other areas of theoretical computer science will also be considered when there is a clear connection to computational issues. The JOURNAL OF DISCRETE ALGORITHMS is pledged to maintain an openness to all approaches to the subject, a transparent reviewing policy, and a minimal delay between submission and publication. Editors-in-chief D. Gabbay (King's College), C .S. Iliopoulos (King's College), G. F. Italiano (Universita di Roma), M.Smid (Universitat Magdeburg), E. Upfal (Brown University), D. Wagner (Universitat Konstanz) Editorial Board J. Abello, S. Albers, A. Andersson, A. Broder, M. de Berg, P. Dunne, M. Dyer, A. Frieze, R. Giancarlo, G. Gottlob, M. Grohe, R.Hariharan, R. Janardan, M. Kaufmann, T. Lecroq, B. Levcopoulos, S. Naeher, H. Nagamochi, G. Narasimhan, K. Park, M-F. Sagot, S. Schirra, I. Stewart, M. Szegedy, M. Thorup, S. Vorobyov, G . Woeginger, M. Yvinec. Submissions Submissions should be made to one of the editors-in-chief depending on the subject area. Further information about submission arrangements including instructions for authors is available on: www.dcs.kcl.ac.uk/journals/jda jda@dcs.kcl.ac.uk Special Issues Special issues are a feature of the journal and the following are planned for the first volume: * Matching patterns Editors: M. Crochemore and L. Gasieniec * Advances in Data Structures Editors: R. Hariharan and R. Raman * Combinatorial Algorithms Editors: C.S.Iliopoulos and T. Radzik Subscriptions The subscription rates including postage, packaging and online access for Volume 1, Issues 1-3 2000, ISSN 1468-0904 are: Individual rate: Euro 195 (Europe) Euro 215 (rest of world) Institutional rate: Euro 300 (Europe) Euro 330 (rest of world) Hermes Science Publications, 8 quai du March?-Neuf, 75004 Paris, France. Fax: +33 1 53 10 15 21. Tel: +33 1 53 10 15 20 E-Mail: hermes@iway.fr ______________________________________________________________________ Costas S. Iliopoulos Algorithm Design Group Tel: +44 20 7848 2809 Dept of Computer Science Fax: +44 20 7848 2851 King's College London Sec: +44 20 7848 2588 Strand London WC2R 2LS England http://www.dcs.kcl.ac.uk/staff/csi ______________________________________________________________________ ------------- 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/threads.html. From sanders at mpi-sb.mpg.de Wed Oct 27 11:09:52 1999 From: sanders at mpi-sb.mpg.de (Peter Sanders) Date: Mon Jan 9 13:40:56 2006 Subject: Postdoc at MPI for Computer Science - Algorithms Group Message-ID: <14358.45904.444382.9867@gargle.gargle.HOWL> P O S T - D O C T O R A L F E L L O W S H I P S at the M A X - P L A N C K - I N S T I T U T E for C O M P U T E R S C I E N C E The Max-Planck-Institute for Computer Science is located on the campus of the Universit"at des Saarlandes in Saarbr"ucken, Germany. The institute was founded in 1990 and consists, at present, of four research units: Algorithms and Complexity, Logic of Programming, Hybrid Systems and Computer Graphics. The research group ALGORITHMS AND COMPLEXITY offers a number of postdoctoral fellowships for the year 2000/2001. Fellowships are available for one or two years and amount to DM 3,600 per month tax free (approximately 1840 Euro or 2000 US$). There is generous travel support available and the group collaborates with several of the major research institutions in Europe and USA. The interests of the research group members includes data structures, graph and network algorithms, computational geometry, parallel and external algorithms, computational complexity, combinatorial optimization, graph drawing, on-line algorithms, randomized algorithms, computational biology and implementation of algorithms and program libraries. The group consists mainly of young researchers of several nationalities. The working language is English. The postdoctoral fellows are expected to interact with group members and are encouraged to initiate research in their individual areas of specialization. More information is available on WWW at http://www.mpi-sb.mpg.de Applications (including curriculum vitae, list of publications, research plan, names of references with their e-mail addresses, and intended period of stay) should be sent by January 31, 2000 to Peter Sanders. Further information can also be obtained from Peter Sanders (sanders@mpi-sb.mpg.de). Max-Planck-Institut f"ur Informatik Im Stadtwald D-66123 Saarbr"ucken Germany ------------- 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/threads.html. From yong at cae.wisc.edu Fri Oct 29 18:05:17 1999 From: yong at cae.wisc.edu (Yong Lu) Date: Mon Jan 9 13:40:56 2006 Subject: generate patches to cover a chain of arbitrary bounding edges Message-ID: <199910292205.RAA05131@sun-6.cae.wisc.edu> Dear sirs: I am looking for references on covering a chain of arbitrary edges with patches (preferable not to be NURBS). I wonder if I could get some help for you if you know some work related. Thanks. Yong Mechanical Engineering, University of Wisconsin-Madison ------------- 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/threads.html.