From subodh at cs.jhu.edu Wed Jun 14 01:49:07 2000 From: subodh at cs.jhu.edu (Subodh Kumar) Date: Mon Jan 9 13:40:58 2006 Subject: Incremental CDT Message-ID: <200006140449.AAA03887@peregrine.cs.yp> Do you know of incremental constrained Delaunay triangulation code that allows both addition and deletion of points and edges? Thanks. ------------- 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 Thu Jun 22 22:40:29 2000 From: bremner at unb.ca (David Bremner) Date: Mon Jan 9 13:40:58 2006 Subject: 12th Canadian Conference on Computational Geometry Message-ID: <14674.45565.330920.729139@convex.cs.unb.ca> 12th Canadian Conference on Computational Geometry Fredericton, New Brunswick August 16-19, 2000 First Call for Participation June 22, 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 * Colin Ware, University of New Hampshire. The Structure of Visual Space: Implications for Information Display. Registration Registration for CCCG '00 includes one copy of the proceedings and admission for one person to the banquet/social at Old Government House on the evening of August 17th. Additional proceedings and banquet tickets can be ordered as part of the online registration process. Registration rates are as follows: Regular Students and Postdocs Up to July 24 $120 $60 After July 24 $140 $80 Online registration is available on the web site http://www.cs.unb.ca/conf/cccg. Contacts web Abstracts of accepted papers, information about accomodation, and online registration is available at http://www.cs.unb.ca/conf/cccg email cccg@unb.ca Postal 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 ---------------------------------------------------------------------- Thanks The organizers would like to thank PIMS, CRM, the Fields Institute, and the University of New Brunswick for financial support for CCCG'00 ------------- 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 alt at inf.fu-berlin.de Thu Jun 22 20:24:15 2000 From: alt at inf.fu-berlin.de (Helmut Alt) Date: Mon Jan 9 13:40:58 2006 Subject: Free Positions in the European Graduate Program "Combinatorics, Geometry, and Computation" Message-ID: <200006232040.QAA07071@duke.cs.duke.edu> ---------------------------------------------------------------------------- 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 starting October 1st, 2000. Applicants should have a degree in mathematics, computer science, or a related area equivalent to the German university diploma (e.g. M.S.) with grades significantly above average. Furthermore 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. In Berlin the students are supervised by the professors Aigner, Alt, Rote, Schulz (FU), Moehring, Ziegler (TU), Proemel (HU) and Groetschel (ZIB). 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 July 14, 2000 to the speaker of the program in Berlin: Prof. Dr. Helmut Alt Institut fuer Informatik Freie Universitaet Berlin Takustrasse 9 D-14195 Berlin Further information can be obtained from Bettina Felsner Tel. ++49-30-838 75 104 bfelsner@inf.fu-berlin.de Internet: http://www.inf.fu-berlin.de/gk-cgc --------------------------------------------------------------------------- ------------- 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 seth at graphics.lcs.mit.edu Thu Jun 15 15:58:47 2000 From: seth at graphics.lcs.mit.edu (Seth Teller) Date: Mon Jan 9 13:40:58 2006 Subject: Incremental CDT References: <200006140449.AAA03887@peregrine.cs.yp> Message-ID: <39492767.92BDEDF@graphics.lcs.mit.edu> dani lischinski (now at hebrew U) wrote a nice (i.e., fast, robust) library to do this: http://www.cs.huji.ac.il/~danix/code/cdt.tar.gz Subodh Kumar wrote: > > Do you know of incremental constrained Delaunay triangulation code that > allows both addition and deletion of points and edges? > Thanks. > > ------------- > 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. ------------- 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 Mariette.Yvinec at sophia.inria.fr Thu Jun 15 10:19:14 2000 From: Mariette.Yvinec at sophia.inria.fr (Mariette Yvinec) Date: Mon Jan 9 13:40:58 2006 Subject: Incremental CDT (fwd) Message-ID: <200006150719.e5F7JEp30289@procyon.inria.fr> The constrained Delaunay triangulation in the library CGAL (see http://www.cs.uu.nl/CGAL/) allows addition and deletion of points and edges - --------------------------------------------------------------------- Mariette Yvinec INRIA Sophia-Antipolis email: yvinec@sophia.inria.fr 2004, Route des Lucioles BP 93 phone: +33 4 92.38.77.49 06902 Sophia-Antipolis Cedex (France) fax : +33 4 92.38.76.43 http://www.inria.fr/prisme/personnel/yvinec/yvinec.html ------- End of Forwarded Message ------------- 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 Michael.Aupetit at site-eerie.ema.fr Thu Jun 15 11:24:19 2000 From: Michael.Aupetit at site-eerie.ema.fr (aupetit) Date: Mon Jan 9 13:40:58 2006 Subject: Catmull-Rom cubic spline... Message-ID: <394892B3.FA1549B0@site-eerie.ema.fr> Hi, I would like a (hyper-)surface to pass through some given points. I am looking for a simple way to compute the gradient (tangente hyperplane) at a point knowing the "height" of its neighbors. The Catmull-Rom approach works for curves (intrinsic 1D) but does it exist some similar methods for surface (intrinsic 2D) and even hyper-surface (more than intrinsic 2D)? Thank you Micha?l Aupetit ------------- 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 ph+ at cs.cmu.edu Sun Jun 25 20:28:35 2000 From: ph+ at cs.cmu.edu (Paul Heckbert) Date: Mon Jan 9 13:40:58 2006 Subject: Catmull-Rom cubic spline... References: <394892B3.FA1549B0@site-eerie.ema.fr> Message-ID: <395695A3.A18BB8A6@cs.cmu.edu> aupetit wrote: > > I would like a (hyper-)surface to pass through some given points. > I am looking for a simple way to compute the gradient (tangente > hyperplane) > at a point knowing the "height" of its neighbors. > The Catmull-Rom approach works for curves (intrinsic 1D) but does > it exist some similar methods for surface (intrinsic 2D) ... If you want a function z(x,y) that interpolates a set of (x,y,z) points, this is called "scattered data interpolation". Try radial basis functions for this. See the paper http://www.gvu.gatech.edu/people/faculty/greg.turk/morph/morph.html and specifically see the paper by Jean Duchon that they cite. Paul Heckbert, Associate Professor Computer Science Dept., Carnegie Mellon University 5000 Forbes Ave, Pittsburgh PA 15213-3891, USA ph@cs.cmu.edu http://www.cs.cmu.edu/~ph ------------- 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 roman at swarm.cs.wustl.edu Thu Jun 29 13:46:22 2000 From: roman at swarm.cs.wustl.edu (Catalin Roman) Date: Mon Jan 9 13:40:58 2006 Subject: COORDINATION 2000 (Call for PartciParticipation) Message-ID: <200006291746.MAA20224@swarm.cs.wustl.edu> ||||||| CALL FOR PARTICIPATION ||||||||||||||||||||||||||||| COORDINATION 2000 Fourth International Conference on Coordination Models and Languages Limassol, Cyprus 11-13 September 2000 http://www-gloc.di.fct.unl.pt/coord00/ Early registration deadline: 15 July 2000 ||||||| CALL FOR PARTICIPATION ||||||||||||||||||||||||||||| On behalf of the organizing committee we would like to extend to you a warm invitation to join us this September for an exciting program and wonderful intellectual debates in the unique setting provided by Cyprus, a beautiful mythical island whose wonders are best revealed in the early days of fall. Because Cyprus is a popular vacation spot, early registration is advised. As in the past, this year's program brings together a broad range of themes associated with the development of coordination models and languages, their theoretical underpinning, and pragmatic implications. Topics receiving extended coverage include tuple space languages and their application, coordination styles and policies, migration and reconfiguration, agent systems, software architectures, dependability, etc. The single track program punctuated by ample opportunities for socializing and critical evaluation of the field allows the participants to evaluate trends, to examine a broad range of issues, and to engage each other in spirited discussions that, as previous conferences have shown, actually reshaped research agendas and led to novel developments. Antonio Porto and Catalin Roman ------------- 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.