From emo at inf.ethz.ch Wed Feb 2 13:32:47 2005 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:41:18 2006 Subject: Positions for doctoral studies in Algorithms and Discrete Mathematics at ETH Zurich Message-ID: <4200C86F.8060206@inf.ethz.ch> ETH Zurich offers positions for doctoral studies in the "Theory of Combinatorial Algorithms"-group under the supervision of Bernd Gaertner, Joachim Giesen, Tibor Szabo, or Emo Welzl, see http://www.ti.inf.ethz.ch/ew/ . Possible research areas include - computational geometry and topology, - approximate methods for high-dimensional geometric problems, - geometric optimization and its combinatorial models, - extremal problems in combinatorics and discrete geometry, and - satisfiability of boolean formulas. A Master or "Diplom" degree are required by the start of the employment. Applicants are expected to have a solid background in Theoretical Computer Science and/or Discrete Mathematics. Some of the topics, however, require experimental and implementation work or have emphasis on applications and practical issues. Qualified applicants of all nationalities are welcome. The working language of the group is English, knowledge of German is not required. The employment is full-time and comes with a competitive salary. Teaching one exercise class per semester and participation in general matters of the group are expected. Earliest starting date is April 1, 2005. Applications with a detailed CV, a record of attended courses (with grades), a copy of Master Thesis/Diplomarbeit (or of some other scientific writing), and at least one reference are to be sent as soon as possible to Emo Welzl Institute of Theoretical Computer Science ETH Zurich (Zentrum) CH-8092 Zurich Applications in electronic form, pdf or ps, can be sent to Floris Tschurr . ------------- 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From vsr at ccad.uiowa.edu Tue Feb 1 08:49:59 2005 From: vsr at ccad.uiowa.edu (Virtual Soldier Research) Date: Mon Jan 9 13:41:18 2006 Subject: The University of Iowa VSR program publishes a report on human modeling and simulation. Message-ID: <6.0.0.22.2.20050201084916.023f1e10@renoir.ccad.uiowa.edu> We are proud to present the results of our work for the past year in this complete technical report on human modeling and simulation. The VSR Team has worked extremely hard in the past year to push the envelope in an area of research that will have a significant impact on the improvement of product design, the reduction of physical prototypes, and the shortening the time to market. From 3D analysis of biomechanics, to the study of clothing, to the prediction of natural dynamic motions, this field is filled with challenging problems. We invite everyone to browse through our report at the following web site: http://www.digital-humans.org/Report2004/ You will find about 150MB of data presented in an easy to read html format. Despite their significance, our contributions to date have only scratched the surface of an enormous and substantial field. Nevertheless, we are confident that through a truly multi-disciplinary approach, our goals can be met. The material in these reports are copyrighted by the University of Iowa rules and regulations, however, we encourage anyone interested in this area of research to contact us to explore collaborations in this new and exciting field. The VSR Team US Army Virtual Soldier Research (VSR) Program The University of Iowa -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050201/e5b2eced/attachment.htm From asishm at cs.uwindsor.ca Tue Feb 1 09:21:42 2005 From: asishm at cs.uwindsor.ca (Mukhopadhyay Asish) Date: Mon Jan 9 13:41:18 2006 Subject: CCCG 2005 - First call for papers Message-ID: <200502011421.j11ELgaG015505@sol.cs.uwindsor.ca> -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- Call for Papers 17th Canadian Conference on Computational Geometry August 10-12, 2004 University of Windsor, Windsor http://cccg.cs.uwindsor.ca -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- Objectives The Canadian Conference on Computational Geometry (CCCG) focuses on the mathematics of discrete geometry from a computational point of view. Abstracting and studying the geometric problems that underly important applications areas (such as geographic information systems, computer-aided design, simulation, robotics, solid modeling, databases, and graphics) leads not only to new mathematical results, but also provide stimulus to these areas. Despite its international following, CCCG maintains the informality of a smaller workshop and attracts a large number of students. Call for Papers Authors are invited to submit papers describing original research of theoretical and practical significance to computational geometry. Electronic submissions, in standard PostScript and not exceeding 4 pages in length, should be made from the conference web page. Invited Speakers Joseph O'Rourke, Smith College, USA Sudipto Guha, Univerisity of Pennsylvannia, USA Jeff Erickson, University of Illinois at Urbana-Champaign, USA Special Issue The program committee will invite the authors of a selection 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. Important Dates Submission May 2, 2005 Notification May 31, 2005 Final version June 30, 2005 Conference August 10-12, 2005 Program Committee Binay Bhattacharya Simon Fraser University Jit Bose Carleton University Timothy Chan University of Waterloo William Evans University of British Columbia Thomas Fevens Concordia University Mark Keil University of Saskatchewan Anil Maheswari Carleton University Asish Mukhopadhyay University of Windsor Godfried Toussaint McGill University Peter Tsin University of Windsor Stephen Wismath University of Lethbridge Local Contact Asish Mukhopadhyay School of Computer Science Faculty of Science University of Windsor 401 Sunset Avenue Windsor, Ontario N9B 3P4 Phone: 519-253-3000x3778 Fax: 514-973-7093 Email: cccg@cs.uwindsor.ca ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From marco.pellegrini at iit.cnr.it Wed Feb 2 16:53:39 2005 From: marco.pellegrini at iit.cnr.it (Marco Pellegrini) Date: Mon Jan 9 13:41:18 2006 Subject: Pre-doc positions in algorithms at IIT-CNR Message-ID: <6.1.2.0.0.20050202165243.0366bb70@mx.iit.cnr.it> Dear compgeom, Could you please post this announcement? Thanks a lot, Marco Pellegrini ********************************************************************************************************* Istituto di Informatica e Telematica Consiglio Nazionale delle Ricerche Pisa - Italy. We invite applications for a Pre-doc positions to be held at the Istituto di Informatica e Telematica of the Consiglio Nazionale delle Ricerche (CNR) of Italy in the year 2005 for research in "Surface reconstruction and simplicial complexes". The fellowship will be funded within the European Research and Training Network COMBSTRU. Details about the Network and about the Network's partners can be found at http://dimatia.mff.cuni.cz/combstru/. A brief sketch of the relevant conditions is as follows. Level: Pre-doc (with at least thee years of PhD studies). Limitations: EU citizen or of Associated States, except Italians or non-Italians resident in Italy for more than 5 years. Age: below 35. Duration: 6 months. Deadline for application: February 21st 2005 Commencement: April 1st 2005. Gross salary: 10,000 Euro General Skills needed in : Discrete Mathematics and Computer Science. Graph Theory, Design and Analysis of Algorithms, Computational Geometry The full call with instructions for applicants and forms can be found at the following site: http://www.iit.cnr.it/lavoro/assegni_contratti/assegni_contratti.php in English and Italian. Under the item "Bando n. 02/2005 del 1 febbraio 2005". In case of controversy the Italian version is the authoritative one. Associated States of the European Union at the start of 5th Framework Programme (2002) were: Cyprus (which requested EU membership in 1990), eleven countries of Central and Eastern Europe (Bulgaria, Czech Republic, Estonia, Hungary, Latvia, Lithuania, Malta, Poland, Romania, Slovakia and Slovenia, all of which submitted their requests for EU membership in the period 1994-1996), and, since the 1 of March 2001, Malta Moreover: Norway, Iceland, Liechtenstein and Israel (whose association is already in force). An up to date list of Associated Countries might be found at: http://www.cordis.lu/fp5/enlargement/faq.htm. Contact person: Marco Pellegrini marco.pellegrini@iit.cnr.it Marco Pellegrini IIT - CNR Area della Ricerca. Via Moruzzi 1 56124 Pisa ITALY tel: (+39) 050 315 2410 fax: (+39) 050 315 2333 e-mail: marco.pellegrini@iit.cnr.it web: http://www.imc.pi.cnr.it/~pellegrini -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050202/ee586a8c/attachment.htm From tb at sm.luth.se Sat Feb 5 11:55:18 2005 From: tb at sm.luth.se (Tomas Berglund) Date: Mon Jan 9 13:41:18 2006 Subject: Polygon inside polygon Message-ID: <4204A616.4090902@sm.luth.se> Dear all, I am touching the problem of deciding whether a polygon is inscribed in another polygon or not. Is there anyone who knows an effective algorithm that solves this problem? In case, what is the complexity of the algorithm? Thanks for your time, respectfully, /Tomas -- Tomas Berglund |Office: A3412|Cell.Ph. :+46 (0)706-770205 Div. Computer Science|URL:www.sm.luth.se/~tb|Home Ph. : +46 (0)920-68830 Lulea Univ. of Tech. |Ph.: +46 (0)920-492047|Home Adr.: Bruksvagen 1A S-97187 LULEA/SWEDEN |Fax: +46 (0)920-492831| S-97594 LULEA/SWEDEN ------------- 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From jan at math.uni-muenster.de Fri Feb 4 11:17:11 2005 From: jan at math.uni-muenster.de (Jan Vahrenhold) Date: Mon Jan 9 13:41:18 2006 Subject: MASSIVE2005: Workshop Announcement Message-ID: <1666db20d3a4f21e80178513b38b400b@math.uni-muenster.de> Workshop on Massive Geometric Data Sets in connection with SoCG 05 June 9, 2005, National Research Council Campus, Pisa, Italy. Supported by: BRICS, IIT-CNR, Netherlands Organization for Scientific Research, University of Muenster. Aims and Scope: --------------- The aim of this informal workshop is to provide an opportunity for established researchers from academia, R&D peoplefrom industry, research students, and postdocs to meet and present their current work in order to further scientific interaction and international collaboration. Topics of interest include, but are not restricted to: * I/O-efficient algorithms and data structures. * Cache-oblivious algorithms and data structures. * Data Stream algorithms. * Geometric problems in spatial databases. * Geometric visualization problems. We also invite contributions that discuss work-in-progress and open problems and/or that address methodologicalissues and standards in the context of empirical research on algorithms and data structures for massive geometric data sets. The workshop is co-located with SoCG 05 (http://www.socg05.org), the 21th ACM Symposium on Computational Geometry, and will take place on the day following the conference. Participation: -------------- If you are interested in participating please send email to "massive2005 at math uni-muenster de" or use the on-line registration form (http://wwwmath.uni-muenster.de/cs/u/jan/IOWorkshop/registration.html). If you are interested in giving a talk, please also provide a short abstract (at most one page) of your talk by April 15, 2005. (Note that since this is a one-day event, it may not be possible for everyone to give a presentation.) There will be no formal proceedings, a booklet of abstracts, however, will be handed out to the participants. The workshop program will be put together by April 29, 2005, and presenters who wish to contribute extended abstracts of up to five pages for the booklet of abstracts are encouraged to do so by May 15, 2005. There will be a separate registration fee of 25 EUR for the workshop. The payment of this fee will handled (in cash) on-site. Organizing Committee: --------------------- Lars Arge, University of Aarhus / Duke University (workshop organization) Mark de Berg, TU Eindhoven (workshop organization) Adriana Lazzaroni, IIT-CNR (local arrangements) Guiseppe Liotta, University of Perugia (local arrangements) Marco Pellegrini, IIT-CNR (local arrangements) Jan Vahrenhold, University of Muenster (workshop organization) Important dates: ---------------- Submission of Abstracts: April 15, 2005 Program available: April 29, 2005 (Optional:) Extended abstracts due: May 15, 2005 For more information: --------------------- See the webpage for the workshop (http://wwwmath.uni-muenster.de/cs/u/jan/IOWorkshop) or email the organizers at "massive2005 at math uni-muenster de". ------------------------------------------------------------------------ ---- PD Dr. Jan Vahrenhold Westfaelische Wilhelms-Universitaet Institut fuer Informatik Einsteinstr. 62, 48149 Muenster, Germany "jan.vahrenhold at math uni-muenster de" Tel.: +49-251/83-38444 http://www.uni-muenster.de/informatik/users/jan/ FAX : +49-251/83-33755 ------------- 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From tb at sm.luth.se Sun Feb 6 11:23:37 2005 From: tb at sm.luth.se (Tomas Berglund) Date: Mon Jan 9 13:41:18 2006 Subject: Polygon inside polygon References: <4204A616.4090902@sm.luth.se> Message-ID: <4205F029.1050006@sm.luth.se> Dear all, Thank you for your quick response. I will come back to you all soon. My next question is; can the complexity of the problem described in below be lowered if we know that both polygons are streets? How does an algorithm look like if this is the case? Respectfully, /Tomas Tomas Berglund wrote: > Dear all, > > I am touching the problem of deciding whether a polygon is inscribed in > another polygon or not. Is there anyone who knows an effective algorithm > that solves this problem? In case, what is the complexity of the > algorithm? > > Thanks for your time, respectfully, > > /Tomas > -- Tomas Berglund |Office: A3412|Cell.Ph. :+46 (0)706-770205 Div. Computer Science|URL:www.sm.luth.se/~tb|Home Ph. : +46 (0)920-68830 Lulea Univ. of Tech. |Ph.: +46 (0)920-492047|Home Adr.: Bruksvagen 1A S-97187 LULEA/SWEDEN |Fax: +46 (0)920-492831| S-97594 LULEA/SWEDEN ------------- 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From tb at sm.luth.se Mon Feb 7 21:38:04 2005 From: tb at sm.luth.se (Tomas Berglund) Date: Mon Jan 9 13:41:18 2006 Subject: Polygon inside polygon Message-ID: <4207D1AC.4080906@sm.luth.se> Dear all, Excuse me for not explaining what I mean with a "street". A street is a simple polygon with two distinguished points s and g, which are located on the polygon boundary and the part of the polygon boundary from s to g is weakly visible to the part from g to s and vice versa. Thus, a street is a polygon for which the two boundary chains from start to target are mutually weakly visible. Another version of the definition; On the edge of a simple polygon P we select two points s (start) and t (target). These two points devide the polygon P into two disjoint polygonal chains L (left) and R (right). L is the polygonal chain starting at s following the edge of P clockwise to t. R is the polygonal chain starting at s and following the edge of P counterclockwise. P together with s and t is a street if and only if each point on R can see at least one point on L and each point on L can see at least one point on R. In this case L and R are said to be weakly visible. Streets have some interesting properties. When walking along any path contained in P that starts at s and ends at t, one will have seen the complete edge of P, thus mapping all of P. Due to the definition of streets, you can not have a part of the polygon -a cave- that is not able to see the other side of the polygon. Hence, the problem I am especially interested in is to decide whether a street is inscribed in another street. Is there anyone who knows an effective algorithm that solves this particular problem? What is the complexity of the algorithm? Can we achieve faster algorithms when we go from the more general problem of deciding whether a simple polygon is inscribed in simple polygon to the problem of deciding whether a street is inscribed in a street? Thanks once again for your time, respectfully, /Tomas -- Tomas Berglund |Office: A3412|Cell.Ph. :+46 (0)706-770205 Div. Computer Science|URL:www.sm.luth.se/~tb|Home Ph. : +46 (0)920-68830 Lulea Univ. of Tech. |Ph.: +46 (0)920-492047|Home Adr.: Bruksvagen 1A S-97187 LULEA/SWEDEN |Fax: +46 (0)920-492831| S-97594 LULEA/SWEDEN ------------- 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner at research.bell-labs.com Wed Feb 9 18:57:43 2005 From: compgeom-owner at research.bell-labs.com (compgeom-owner@research.bell-labs.com) Date: Mon Jan 9 13:41:18 2006 Subject: No subject Message-ID: <200502100000.j1A00T7d026342@scummy.research.bell-labs.com> From thill at tomotherapy.com Wed Feb 9 08:31:24 2005 From: thill at tomotherapy.com (Ted Hill) Date: Mon Jan 9 13:41:18 2006 Subject: Auto-contouring algorithms Message-ID: <1E2E66102E75104D8C740340EBCD986701E06C71@tomoex.tomotherapy.com> Hello, Is anyone aware of a source that discusses algorithms for "automated contour location." This is related to medical imaging: for example 1. On a 2D image (e.g. a digital x-ray image) draw a contour line that separates bone from less dense tissue. 2. In a 3D image (e.g. a CAT-scan) find the surface that encloses bone and separates it from less dense tissue. I am assume that there are some published algorithms and am interested in how then compare vis-a-vis order of complexity. Thank you, Ted Hill -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050209/570da7eb/attachment.htm From ph+ at cs.cmu.edu Wed Feb 9 20:53:22 2005 From: ph+ at cs.cmu.edu (Paul Heckbert) Date: Mon Jan 9 13:41:18 2006 Subject: Auto-contouring algorithms References: <1E2E66102E75104D8C740340EBCD986701E06C71@tomoex.tomotherapy.com> Message-ID: <000c01c50f13$4e2d3cf0$ba10020a@nvidia.com> MessageThere is code for computing a 3D contour surface in a grid in the article @INCOLLECTION{Bloomenthal94, AUTHOR={Jules Bloomenthal}, TITLE={An Implicit Surface Polygonizer}, BOOKTITLE={Graphics Gems IV}, EDITOR={Paul Heckbert}, PAGES={324-349}, PUBLISHER={Academic Press}, YEAR={1994}, ADDRESS={Boston}, KEYWORDS={iso-surface, marching cubes, polygonization}, SUMMARY={ Gives code to polygonize an arbitrary implicit surface. Polygonization is a common approach to implicit surface rendering and volume rendering. When combined with code for trilinear interpolation code, a program for polygonizing volume data can easily be constructed. The resulting polygonizations will be superior to those generated by the ``Marching Cubes'' algorithm, in many cases. Contains C code. }, FTP={code in princeton.edu pub/Graphics/GraphicsGems/GemsIV/GGemsIV.tar.Z}, } ----- Original Message ----- From: Ted Hill To: compgeom-discuss@research.bell-labs.com Sent: Wednesday, February 09, 2005 9:31 AM Subject: Auto-contouring algorithms Hello, Is anyone aware of a source that discusses algorithms for "automated contour location." This is related to medical imaging: for example 1. On a 2D image (e.g. a digital x-ray image) draw a contour line that separates bone from less dense tissue. 2. In a 3D image (e.g. a CAT-scan) find the surface that encloses bone and separates it from less dense tissue. I am assume that there are some published algorithms and am interested in how then compare vis-a-vis order of complexity. Thank you, Ted Hill -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050209/ea19e522/attachment.htm From m.t.d.berg at TUE.nl Mon Feb 14 11:51:12 2005 From: m.t.d.berg at TUE.nl (Berg, M.T. de) Date: Mon Jan 9 13:41:18 2006 Subject: opening: faculty position at TU Eindhoven Message-ID: <9F38CF35D80CAE409B979F3EB5242B4A024BC6BF@winex2.campus.tue.nl> OPENING for a FACULTY POSITION (ASSISTANT or ASSOCIATE PROFESSOR) in the ALGORITHMS GROUP at the TU EINDHOVEN (THE NETHERLANDS) THE TU EINDHOVEN ----------------- The Technische Universiteit Eindhoven (TU/e) was established in 1956 as a polytechnic. It has grown into a technical university with nine faculties. The TU/e now has approximately 3000 employees and 6000 students. The campus is in the center of Eindhoven. Eindhoven is located in the south of the Netherlands, and is the fifth largest city with about 200,000 inhabitants. THE FACULTY OF MATHEMATICS AND COMPUTER SCIENCE AT THE TU EINDHOVEN ------------------------------------------------------------------- The faculty offers bachelors and master programs in computer science and mathematics. Currently the faculty has more than 600 students, and about 200 employees. The department of computer science has a scientific staff of about 40 people, plus a large number of postdocs and PhD students. THE ALGORITHMS GROUP AT THE TU EINDHOVEN ---------------------------------------- The design and analysis of efficient algorithms and data structures forms an important part of computer science. Fall 2002, a new research group working in this area has been established at the department of computer science at the TU Eindhoven. Computational geometry is one of the focal points of the group, but other areas of algorithms---graph algorithms, I/O-efficient algorithms, or randomized algorithms for instance---fall within its area of interest as well. The group currently consists of three faculty, namely prof.dr. Mark de Berg, dr. Bettina Speckmann and dr. Herman Haverkort (per 1/9/05), as well as several postdocs and PhD students. For more information on the group, see: http://www.win.tue.nl/algo/ THE POSITION ------------ There is an opening for a faculty position in the Algorithms group. The position can either be filled at the level of associate professor or at the level of assistent professor, depending on the experience and qualifications of the candidate. Ideally, the candidate should work at the interface of computational geometry and some other area. This can either be an application area such as robotics, graphics, CAD/CAM or GIS, or another algorithms area such as I/O-efficient algorithms or graph algorithms. As a faculty member you are expected to perform research in one of the indicated areas, to supervise master students and PhD students, and apply for research grants to fund students. You are also expected to teach courses, both in the master programs and in the bachelor program offered by the department, and to participate in the general management tasks of the department. WE ASK ------ Candidates should have a PhD in computer science. They should have experience in performing algorithms research, and have published in international conferences and journals in the area. Candidates should also have teaching experience and/or be willing to follow didactic courses. Candidates for an associate-professor position are expected to be recognized as an authority in their field, and be experienced in attracting funds and supervising PhD students and in managing research programs. WE OFFER -------- We offer a position in a strong and international research group. You will first be appointed for a two-year period, in order to be evaluated for a permanent position afterwards. Salary will be according to the standard regulations of the Dutch universities (the "CAO Nederlandse Universiteiten"). The TU/e also has an extensive package of fringe benefits. MORE INFORMATION ---------------- For more information about the position, please contact prof.dr. Mark de Berg, (mdberg@win.tue.nl). HOW TO APPLY ------------ Please send your application letter, together with a CV and a list of publications, by email to prof.dr. Mark de Berg (mdberg@win.tue.nl). The deadline for applications is March 14, 2005. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050214/0f36544f/attachment.htm From jsbm at ams.sunysb.edu Mon Feb 14 20:11:23 2005 From: jsbm at ams.sunysb.edu (jsbm@ams.sunysb.edu) Date: Mon Jan 9 13:41:18 2006 Subject: Papers accepted to 21st Annual Symposium on Computational Geometry Message-ID: <200502150044.j1F0iiM18844@catbert.ams.sunysb.edu> Dear Colleagues, We are pleased to announce the list of papers accepted to the 21st Annual Symposium on Computational Geometry, which will be held this year in Pisa, Italy, on June 6-8, 2005. See http://www.socg05.org/ for conference details. This year, the program committee selected 41 papers for presentation from among 140 submissions. The competition was stiff, due to the overall high quality of the research papers submitted. We thank the members of the Program Committee and the numerous referees who assisted in the review process! We hope to see you all in Pisa in June. Best, Joe Mitchell and Guenter Rote, co-chairs, PC Program Committee: Tetsuo Asano, Therese Biedl, Paul Chew, Alon Efrat, Sandor Fekete, Craig Gotsman, Ferran Hurtado, Vladlen Koltun, Joe Mitchell, Guenter Rote, Micha Sharir, Bettina Speckmann, Monique Teillaud *** Accepted Papers **** A Time-Optimal Delaunay Refinement Algorithm in Two Dimensions Har-Peled, Ungor Abstract Order Type Extension and New Results on the Rectilinear Crossing Number Aichholzer, Krasser Almost Tight Bound for a Single Cell in an Arrangement of Convex Polyhedra in R^3 Ezra An Exact, Complete and Efficient Implementation for Computing Planar Maps of Quadric Intersection Curves Berberich, Hemmer, Kettner, Schoemer, Wolpert Cache-Oblivious Planar Orthogonal Range Searching and Counting Arge, Brodal, Fagerberg, Laustsen Cache-Oblivious R-Trees Arge, de Berg, Haverkort Certifying and Constructing Minimally Rigid Graphs in the Plane Bereg Critical Points of the Distance to an epsilon-Sampling on a Surface and Flow Complex Reconstruction Dey, Giesen, Ramos, Sadri Curvature-bounded traversals of narrow corridors Bereg, Kirkpatrick Dynamic Maintenance of Molecular Surfaces under Conformational Changes Eyal, Halperin Efficient Computation of Query Point Visibility in Polygons with Holes Zarei, Ghodsi Energy-Aware Stage Illumination Eisenbrand, Funke, Karrenbauer, Matijevic Fast Construction of Nets in Low Dimensional Metrics, and Their Applications Har-Peled, Mendel Finding the best shortcut in a geometric network Farshi, Giannopoulos, Gudmundsson Forbidden Patterns and Unit Distances Pach, Tardos Guarding a Terrain by Two Watchtowers Agarwal, Bereg, Daescu, Kaplan, Ntafos, Zhu Hadwiger and Helly-Type Theorems for Disjoint Unit Spheres in R^3 Cheong, Goaoc, Holmsen Improved Approximation Algorithms for Geometric Set Cover Clarkson, Varadarajan Incidences of not too degenerate hyperplanes Elekes, Toth Inclusion-Exclusion Formulas for Independent Complexes Attali, Edelsbrunner Inequalities for the Curvature of Curves and Surfaces Cohen-Steiner, Edelsbrunner Kinetic Sorting and Kinetic Convex Hull Abam, de Berg Learning Surfaces by Probing Boissonnat, Guibas, Oudot Maximizing the Overlap of Two Planar Convex Sets under Rigid Motions Ahn, Cheong, Park, Shin, Vigneron Minimum Dilation Stars Eppstein, Wortman Mountain Reduction, Block Matching, and Medical Applications Chen, Hu, Luan, Wang Multi-Pass Geometric Algorithms Chan, Chen On the Exact Computation of the Topology of Real Algebraic Curves Seidel, Wolpert Pointed and Colored Binary Encompassing Trees Hoffmann, Toth Provable Dimension Detection using Principal Component Analysis Cheng, Wang, Wu Sampling in Dynamic Data Streams and Applications Frahling, Indyk, Sohler Shortest Path amidst Disc Obstacles is Computable Chang, Choi, Kwon, Park, Yap Smaller Coresets for k-Median and k-Means Clustering Har-Peled, Akash Kushal Space Efficient Dynamic Orthogonal Range Reporting Nekrich Stability of Persistence Diagrams Cohen-Steiner, Edelsbrunner, Harer Star Splaying: An Algorithm for Repairing Delaunay Triangulations and Convex Hulls Shewchuk The Skip Quadtree: A Simple Dynamic Data Structure for Multidimensional Data Eppstein, Goodrich, Sun The Visibility-Voronoi Complex and Its Applications Wein, van den Berg, Halperin The lifting model for reconfiguration Bereg, Dumitrescu Vertical Ray Shooting for Fat Objects de Berg Weak feature size and persistent homology: computing homology of solids in R^n from noisy data samples Chazal, Lieutier ------------- 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From ahamel at wlu.ca Thu Feb 10 11:25:51 2005 From: ahamel at wlu.ca (Angele Hamel) Date: Mon Jan 9 13:41:18 2006 Subject: CAAN05: Call for Papers Message-ID: 2005 Workshop on Combinatorial and Algorithmic Aspects of Networking CALL FOR PAPERS August 13rd - 14th, 2005 Waterloo, Ontario, Canada Following the success of the first Combinatorial and Algorithmic Aspects of Networking (CAAN04) conference that was held August 5-7, 2004 at the Banff International Research Station (BIRS), CAAN05 will be held in Waterloo, Ontario, Canada, August 13-14, 2005 as a satellite conference of the Workshop on Algorithms and Data Structures (WADS 05), Waterloo, On, Canada, August 15-17, 2005. The Internet because of its size, decentralized nature, and loosely controlled architecture provides a hotbed of challenges that are amenable to mathematical analysis and algorithmic techniques. This conference brings together mathematicians, theoretical computer scientists and network specialists. This fast growing area is an intriguing intersection of Computer Science/Graph Theory/Game Theory/Networks. Original research papers are solicited. The list of topics for the conference includes, but is not limited to: Economics, Game Theory and the Internet, Geometric Routing, Web Caching, Combinatorics, Tomography, Peer-to-peer systems, Graph Theory/Web Graph, Data Stream analysis, Statistical Distributions, Optimization, and QoS, as they relate to Networks in general and the Internet in particular. The conference will be organized as a series of talks with time for focused discussions. We solicit general participation and invite presentations on all aspects of networking challenges that can be addressed using techniques from theoretical computer science and mathematics. The goal of of the conference is to foster interdisciplinary collaborations among researchers in this field. Submissions Authors should send an extended abstract in postscript or PDF format by May 2nd, 2005. The paper should not exceed 12 pages in length on letter-size paper using 11 point or larger font. Submission instructions will be made available at http://db.uwaterloo.ca/~alopez-o/caan2005.html. Program Committee Dimitris Achlioptas, Microsoft Research, USA Claus Bauer, Dolby Labs, USA Anthony Bonato, Wilfrid Laurier University, Canada Andrei Broder, IBM Research, USA Erik Demaine, MIT, USA Thomas Erlebach, University of Leicester, UK Jean-Charles Gregoire, IIT and INRS-EMT, Canada Angele Hamel, Wilfrid Laurier University, Canada Jochen Konemann, University of Waterloo, Canada Matthieu Latapy, LIAFA - Universite Paris 7, France Alex Lopez-Ortiz, University of Waterloo, Canada Rajeev Motwani, Stanford University, USA Ian Munro, University of Waterloo, Canada Tim Roughgarden, Stanford University, USA Rahul Sami, MIT, USA Shubho Sen, AT&T, USA D. Sivakumar, IBM, USA Jan ven den Heuvel, London School of Economics, UK Gordon Wilfong, Bell Labs, USA ------------- 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From santosf at unican.es Tue Feb 15 17:18:06 2005 From: santosf at unican.es (Francisco Santos) Date: Mon Jan 9 13:41:18 2006 Subject: XI Spanish Meeting on Computational Geometry In-Reply-To: <200502150044.j1F0iiM18844@catbert.ams.sunysb.edu> References: <200502150044.j1F0iiM18844@catbert.ams.sunysb.edu> Message-ID: <3cb98f701f876d3fccd6c4aeeccc945c@unican.es> XI Encuentros de Geometria Computacional Santander, 27-29 June 2005 www.matesco.unican.es/egc05 The "XI Spanish meeting on Computational Geometry" will take place next June at the University of Cantabria, Santander. Although its main goal is to serve as a forum for spanish researchers in this and related areas, people from other places are welcome. Deadline for submission of communications is March 31st, 2005. Details on the format of submission are on the web page, www.matesco.unican.es/egc05/trabajos.htm In addition to short (15-20 minutes) communications, there will be four 1 hour invited talks by Prosenjit K. Bose, School of Computer Science, Carleton University, Canada. Jes?s A. de Loera, Dept. of Mathematics, University of California at Davis, USA. Alberto M?rquez, Dpto. de Matem?tica Aplicada I, Universidad de Sevilla. Emo Welzl, Department of Computer Science, ETH Z?rich. Organizing committee: Francisco Santos, Dpto. de Matem?ticas, Estad?stica y Computaci?n, Universidad de Cantabria. ?Fernando Etayo, Dpto. de Matem?ticas, Estad?stica y Computaci?n, Universidad de Cantabria. ?Pilar Sabariego, Dpto. de Matem?ticas, Estad?stica y Computaci?n, Universidad de Cantabria. ?David Orden, Dpto. de Matem?ticas, Universidad de Alcal? de Henares. Important dates: Submission of communications for the proceedings: 31 March, 2005. Student registration: May 6, 2005. Reduced-fee registration: May 13, 2005. On behalf of the organizing committee, F. Santos. Francisco Santos, santosf@unican.es Departamento de Matematicas, Estadistica y Computacion Universidad de Cantabria, E-39005 Santander, SPAIN. Phone: +34-942-201522 - Fax: +34-942-201402 http://personales.unican.es/santosf ** Please observe that my web page address has changed, January 15, 2004 ** ------------- 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From dolzmann at dormouse.fmi.uni-passau.de Thu Feb 17 17:59:20 2005 From: dolzmann at dormouse.fmi.uni-passau.de (Dr. Andreas Dolzmann) Date: Mon Jan 9 13:41:18 2006 Subject: A3L Early Registration Now Open Message-ID: <200502171659.j1HGxKDx007414@dormouse.fmi.uni-passau.de> Dear friends and colleagues The early registration for A3L 2005 is now open. Please, find all relevant information at www.A3L.org/registration.html As you have certainly observed, there was some delay. This allowed us, however, to now offer you a very traditional top hotel right in the center of Passau at terrificly reduced rates. Based on our estimations on the number of participants, we have reserved a number of rooms at these reduced rates. These rooms are scheduled first-come-first-served until March 14, 2005, which is also the end of the early registration period. We are looking forward to meeting you in Passau soon. Andreas Dolzmann Andreas Seidl Thomas Sturm ------------- 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From kettner at mpi-sb.mpg.de Thu Feb 17 15:00:31 2005 From: kettner at mpi-sb.mpg.de (Lutz Kettner) Date: Mon Jan 9 13:41:18 2006 Subject: CFP: 14th Annual Multimedia Review of Comput. Geometry (SoCG'05) In-Reply-To: Message-ID: less than two weeks left: FINAL CALL FOR VIDEO AND MULTIMEDIA PRESENTATIONS 14th Annual Multimedia Review of Computational Geometry part of the 20th ACM Symposium on Computational Geometry June 6 - 8, 2005 National Research Council of Italy (CNR) Area della Ricerca di Pisa, Italy Sponsored by ACM SIGACT and SIGGRAPH http://www.socg05.org/ Video and multimedia presentations are sought for a video review of computational geometry. This review showcases the use of visualization in computational geometry for exposition and education, for the visual exploration of geometry in research, and as an interface and a debugging tool in software development. Algorithm animations, visual explanations of structural theorems, descriptions of applications of computational geometry, and demonstrations of software systems are all appropriate. Videos that accompany papers submitted to the technical program committee are encouraged. Three to five minutes is ideal for most animations and presentations of applications; eight minutes is the upper limit. Standard VHS videotape is allowed, but electronic formats are encouraged (QuickTime, MPEG, .avi, .mov, or RealPlayer). We allow submission of Macromedia Flash, MS PowerPoint animations, Java applets, and limited forms of other multimedia. These formats must have a 'demo mode' that requires no interaction after e.g. pressing a 'demo' button. In case of doubt, please email the Video and Multimedia Program chair. Accepted video and multimedia presentations will be collected and made available online in various formats in a web proceedings. VIDEO/MULTIMEDIA SUBMISSION For electronic submission of a video or multimedia presentation, to arrive by March 1, 2005, the author(s) should submit a one or two-page description of the material shown in the presentation, and where applicable, the techniques used in the implementation, to the Video Review section of the electronic submission server (linked from http://www.socg05.org/). An email address of the correspondence author and a URL or ftp address where the presentation can be retrieved must be included. Additional material describing the contents of the presentations, such as the full text of accompanying papers, may also be included. The final descriptions must be formatted according to the guidelines for ACM proceedings. As an alternative, descriptions and videos on VHS videotape, in either NTSC or PAL format, can be sent to the video and multimedia presentations program chair, to arrive by March 1, 2005: Lutz Kettner Max Planck Institute fuer Informatik Stuhlsatzenhausweg 85 66123 Saarbruecken, Germany Phone: +49-681-9325 106 kettner@mpi-sb.mpg.de For more information, please visit the web page http://www.mpi-sb.mpg.de/~kettner/SoCG05multimedia/ Authors will be notified of acceptance or rejection, and given reviewers' comments by March 22, 2005. For each accepted presentation, the final version of the 2-page textual description will be due by March 29, 2005 (electronically) for inclusion in the proceedings. Final versions of accepted video/MM presentations will be due April 19, 2005 in the best format available. IMPORTANT DATES March 1, 2005: Video and Multimedia submissions due March 22, 2005: Notification for Video/MM submissions March 29, 2005: Camera-ready video/MM abstracts due April 19, 2005: Final versions of video/MM presentations due June 6-8, 2005: Symposium in Pisa VIDEO AND MULTIMEDIA PRESENTATION PROGRAM COMMITTEE Pierre Alliez (INRIA, Sophia-Antipolis) Sariel Har-Peled (UIUC, Urbana) John Iacono (Polytechnic University, Brooklyn) Lutz Kettner (chair; Max-Planck-Institut fuer Informatik, Saarbruecken) Jack Snoeyink (UNC Chapel Hill) ------------- 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From large at daimi.au.dk Thu Feb 17 10:49:16 2005 From: large at daimi.au.dk (Lars Arge) Date: Mon Jan 9 13:41:18 2006 Subject: Post doc position Message-ID: <4214689C.6060308@daimi.au.dk> Algorithms/Database Postdoc Position at University of Aarhus, Denmark A postdoctoral position at the level of Research Assistant Professor of Computer Science is available at the Department of Computer Science, University of Aarhus, Denmark (http://www.daimi.au.dk/). The position, under the supervision of Professor Lars Arge (http://www.daimi.au.dk/~large), is in the project entitled "Algorithms for Processing Massive Datasets: Theory and Practice" funded by the Danish National Science Research Council. The position is for one year, starting September 2005 or later. Applications are welcomed from researchers with clearly demonstrated experience and skills in the design and analysis of algorithms and data structures and/or in spatial databases. Algorithms applicants with experience with external memory, cache-oblivious and spatial database algorithms, as well as with implementation of such algorithms (algorithms engineering experience), will be preferred. The responsibilities of the candidate include work on external memory and cache-oblivious geometric data structures (spatial indexes), as well as on external memory algorithms for various problems on massive terrain models. The candidate is also expected to play a vital role in algorithm engineering work (including interacting with practitioners), as well as in the general development of the TPIE programming environment for external memory computation. Modest teaching responsibilities will also be expected. Please send a letter of interest and your CV, as well as at least two names of referees for recommendations, by mail or email to: Professor Lars Arge BRICS Department of Computer Science University of Aarhus IT-parken, Aabogade 34 DK-8200 Aarhus N Denmark large@daimi.au.dk To be assured of full consideration, all material must arrive by March 18, 2005. Applications will be considered until the position is filled. ------------- 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From d.roy at auckland.ac.nz Thu Feb 24 19:12:27 2005 From: d.roy at auckland.ac.nz (Debasish Roy) Date: Mon Jan 9 13:41:18 2006 Subject: statistical testing Message-ID: <421D704B.C3AFA070@math.auckland.ac.nz> (Apologies for cross posting) Dear Colleagues: There are 2 bunches of samples and they have density functions (or, distribution functions) say, F and G. But the samples are DEPENDENT and they originated from MCMC simulation. Now I want to test H_0 : F(.) = G(.) One imporatnt thing to note that we know F(.) is normal. But we have not good idea of the true density function of G(.). And also it's not possible to find the joint parametric density of that 2 datasets. I can't see any hope to find the suitable test as the samples are dependent. So standard non-para tests fail. Could you advise me the best test here ? How about Kalman Filtering ? Though I don't know much about it. I look forward to hearing your kind suggestion at your earliest opportunity. Regards Debasish. ------------- 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From mcarim at dpi.ufv.br Wed Feb 23 10:52:56 2005 From: mcarim at dpi.ufv.br (Marco Carim) Date: Mon Jan 9 13:41:18 2006 Subject: Compute the Closest Segment for a given point? Message-ID: <20050223134737.M30620@dpi.ufv.br> I am a student of Master Degree in Computer Science and I studing de following problem: ?Let S be a set of?n segments and given a query point, compute the closest segment in S.? ? Somebody would have references about methods to resolve this problem? Thanks. -----------------------------------
WebMail DPI
Departamento de Inform?tica
Universidade Federal de Vi?osa
-----------------------------------
-------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050223/a5c8f5d8/attachment.htm From Monique.Teillaud at sophia.inria.fr Tue Feb 22 12:31:40 2005 From: Monique.Teillaud at sophia.inria.fr (Monique Teillaud) Date: Mon Jan 9 13:41:18 2006 Subject: INRIA post-doctoral positions Message-ID: <421B181C.4010309@sophia.inria.fr> The INRIA campaign for post-doctoral positions will start soon http://www.inria.fr/travailler/opportunites/postdoc.en.html The topics proposed at INRIA Sophia Antipolis are already accessible: http://www-sop.inria.fr/act_recherche/formation/offres_de_post-doc_sur_sophia_en.shtml Sylvain Pion and myself have proposed a topic "Complex objects handling in Computational Geometry" Potential candidates are invited to contact us by e-mail Monique.Teillaud@sophia.inria.fr Sylvain.Pion@sophia.inria.fr --------------------------------------------------------------- There is a recent trend in Computational Geometry aiming at extending algorithms, which are designed mostly for simple objects (points, linear objects), to more complex objects, e.g. algebraic curves and surfaces. This requires some research to be done in several directions. One of the questions is the representation of the objects, in particular unbounded objects. Projective geometry could help solving this issue, and one aspect of the research could be the development of algorithms well suited to the projective space, followed by the design and implementation of a kernel of projective geometry primitives to the CGAL library. Let us also mention the potential impact of such a work in the field of computer vision. On the algorithmic side, we are planning to focus on 3D sweeping algorithms, for instance for computing arrangements of surfaces. In particular we are interested in studying the way the general Kinetic Data Structures framework allows to unify sweeping algorithms. This research direction will involve the axiomatization of the algorithms and algebraic tools for the detection and manipulation of events. One of the other aspects of the research will be related to arithmetic and filtering techniques to ensure both robustness and efficiency. On the practical side, our final goal is to get both efficient and robust implementations in the Computational Geometry Algorithms Library CGAL (Open Source Project www.cgal.org), to ensure an important dissemination of this research. --------------------------------------------------------------- See also another topic proposed by Pierre Alliez "Mesh correspondence and compatible remeshing for simulation and animation" Pierre.Alliez@sophia.inria.fr --------------------------------------------------------------- One research topic of the project-team GEOMETRICA is approximation and remeshing of 3D shapes. Efficient representations for animated or deformed shapes has however been little explored until now, although they are of undeniable importance both for simulation and multimedia. The research topic to be investigated during this post-doc is dealing with research of mesh correspondences (partial or global) between several shapes in order to generate compatible meshes, i.e. a new set of meshes which are remeshes of the input set, such that they have a common connectivity structure, well-shaped polygons, approximate well the input, and respect the correspondence. We will also investigate dynamic meshing techniques, where the connectivity can evolve across time. The goal is to invent new meshing algorithms for simulation as well as new tools for interactive generation and processing of animations for multimedia content creation. The computational geometry algorithms library CGAL will be used for experiments and validation. --------------------------------------------------------------- Monique Teillaud ------------- 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From asishm at cs.uwindsor.ca Mon Feb 28 12:40:32 2005 From: asishm at cs.uwindsor.ca (Mukhopadhyay Asish) Date: Mon Jan 9 13:41:18 2006 Subject: CCCG 2005 - Second CFP Message-ID: <200502281740.j1SHeWZp001968@sol.cs.uwindsor.ca> -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- Call for Papers 17th Canadian Conference on Computational Geometry August 10-12, 2005 University of Windsor, Windsor http://cccg.cs.uwindsor.ca -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- Objectives The Canadian Conference on Computational Geometry (CCCG) focuses on the mathematics of discrete geometry from a computational point of view. Abstracting and studying the geometric problems that underly important applications areas (such as geographic information systems, computer-aided design, simulation, robotics, solid modeling, databases, and graphics) leads not only to new mathematical results, but also provide stimulus to these areas. Despite its international following, CCCG maintains the informality of a smaller workshop and attracts a large number of students. Call for Papers Authors are invited to submit papers describing original research of theoretical and practical significance to computational geometry. Electronic submissions, in standard PostScript and not exceeding 4 pages in length, should be made from the conference web page. Invited Speakers Joseph O'Rourke, Smith College, USA Sudipto Guha, Univerisity of Pennsylvannia, USA Jeff Erickson, University of Illinois at Urbana-Champaign, USA Special Issue The program committee will invite the authors of a selection 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. Important Dates Submission May 2, 2005 Notification May 31, 2005 Final version June 30, 2005 Conference August 10-12, 2005 Program Committee Binay Bhattacharya Simon Fraser University Prosenjit Bose Carleton University Timothy Chan University of Waterloo William Evans University of British Columbia Thomas Fevens Concordia University Mark Keil University of Saskatchewan Anil Maheswari Carleton University Asish Mukhopadhyay University of Windsor Godfried Toussaint McGill University Peter Tsin University of Windsor Stephen Wismath University of Lethbridge Local Contact Asish Mukhopadhyay School of Computer Science Faculty of Science University of Windsor 401 Sunset Avenue Windsor, Ontario N9B 3P4 Canada Phone: 519-253-3000x3778 Fax: 514-973-7093 Email: cccg@cs.uwindsor.ca, asishm@cs.uwindsor.ca ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.