From sjowen at sandia.gov Wed Jan 3 19:07:32 2001 From: sjowen at sandia.gov (Owen, Steven James) Date: Mon Jan 9 13:40:59 2006 Subject: 3rd Symposium on Trends in Unstructured Mesh Generation Message-ID: <77349FC5DC1CD211BAD900805FA7241A0C1E8138@es01snlnt.sandia.gov> Call for Abstracts ==================================================================== Sixth US National Congress on Computational Mechanics 3rd Symposium on Unstructured Mesh Generation Hyatt Regency Dearborn, Dearborn Michigan August 1-4, 2001 ==================================================================== Abstracts are invited dealing with all aspects of unstructured mesh generation, including, but not limited to the following: * Surface and volume meshing algorithms * Mesh improvements criteria and algorithms * Mesh adaptation algorithms * Anisotropic mesh generation and adaptation * Dealing with geometry issues including integration with CAD and high order elements * Mesh evolution in evolving geometry problems * Automatic geometric simplification techniques * Interesting applications of automated and adaptive analysis * Novel new domain discretization schemes * Parallel implementations and control of very large meshes Abstracts are required for the conference and will be included in the conference proceedings. Abstracts should be plain text and should be less than 500 words. Submit a one page electronic version of your abstract by January 31, 2001 to Professor Mark S. Shephard, shephard@scorec.rpi.edu. Authors will be notified of acceptance by March 15, 2001. For inclusion in this symposium, full-length papers (in addition to the abstract) are requested, but not required. While the conference proceedings will only contain abstracts, a collection of the final papers are planned to be combined into a special edition of the journal, Engineering With Computers All papers must be submitted by July 15, 2001. For further information on the symposium and conference, visit the Symposium Web Page at http://www.andrew.cmu.edu/user/sowen/usnccm01 For questions, please contact one of the symposium organizers: Mark Shephard (shephard@scorec.rpi.com) Steven Owen (sjowen@sandia.gov) Sunil Saigal (saigal@cmu.edu) Kenji Shimada (shimada@cmu.edu) ------------- 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 emo at inf.ethz.ch Thu Jan 4 13:49:50 2001 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:40:59 2006 Subject: Ph.D. and Post-Doc Scholarships, CGC Berlin-Zurich Message-ID: <200101041249.NAA04042@shadow.inf.ethz.ch> Ph.D. and Post-Doc Scholarships Call for Applications The Berlin-Zurich CGC Graduate Program Combinatorics, Geometry, and Computation http://www.cgc.ethz.ch offers scholarships for Ph.D. students and Post-Docs for 2 1/2 years and 2 years, resp., starting in 2001. The program is a joint initiative of ETH Zurich, the three universities of Berlin - Free University, Technical University, Humboldt-University - and the Konrad-Zuse-Research Center. Scholarships are up to DM 2870 (tax-free) per month in Berlin, and roughly CHF 36000 (pre-tax) per year in Zurich. The scientific program ranges from theoretical foundations to applications. The areas of research are combinatorics, geometry, optimization, algorithms and computation, computer graphics, and vision. Supervisors in Berlin are Aigner, Alt, Rote, Schulz (FU), Moehring, Ziegler (TU), Proemel (HU) and Groetschel (ZIB), and at ETH Zurich Erlebach, Fukuda, Van Gool, M. Gross, Luethi, Nievergelt, Richter-Gebert, Schiele, Welzl and Widmayer. Applications with curriculum vitae, copies of certificates, thesis, a letter of recommendation of the last advisor, and a brief description of the proposed research should be sent in until January 26, 2001 (Post-Doc applications to Zurich, only): Prof. Helmut Alt Prof. Emo Welzl Institut Informatik Institut Theoretische Informatik Freie Univ. Berlin ETH Zentrum Takustr. 9 CH-8092 Zurich D-14195 Berlin Switzerland Germany Contact: bfelsner@inf.fu-berlin.de cgc.graduate@inf.ethz.ch www.inf.fu-berlin.de/gk-cgc www.cgc.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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From biedl at math.uwaterloo.ca Wed Jan 3 15:43:27 2001 From: biedl at math.uwaterloo.ca (Therese Biedl) Date: Mon Jan 9 13:40:59 2006 Subject: CCCG '01: First Call for Papers Message-ID: -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- First Call for Papers 13th Canadian Conference on Computational Geometry August 13-15, 2001 University of Waterloo http://compgeo.math.uwaterloo.ca/~cccg01 -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- 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 geometry problems that underly important applications of computing (such as geographic information systems, computer-aided design, simulation, robotics, solid modeling, databases, and graphics) leads not only to new mathematical results, but also to improvements in these applications. 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 research of theoretical and practical significance to computational geometry. Electronic submissions, in standard PostScript and not exceeding 4 pages length, should be made from the conference web page. A special issue of Computational Geometry: Theory and Applications will be devoted to invited papers from the conference. Program Committee Therese Biedl (Univ. of Waterloo) Timothy Chan (Univ. of Waterloo) Erik Demaine (Univ. of Waterloo) David Kirkpatrick (UBC) Anna Lubiw (Univ. of Waterloo) Joseph O'Rourke (Smith College) Godfried Toussaint (McGill University) Organizing Committee Therese Biedl (Univ. of Waterloo) Erik Demaine (Univ. of Waterloo) Martin Demaine (Univ. of Waterloo) Anna Lubiw (Univ. of Waterloo) Important dates Submission of papers: April 16, 2001 Notification of acceptance: May 15, 2001 Submission of final paper: June 15, 2001 Conference: August 13-15, 2001 Contact Information Therese Biedl Dept. of Computer Science University of Waterloo Waterloo, ON N2L 3G1 Phone: (519) 888-4567x4721 Fax: (519) 885-1208 Email: biedl@uwaterloo.ca Sponsors CCCG '01 is supported by CRM, The Fields Institute, PIMS and the University of Waterloo. ------------- 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 mitchell at cs.sfu.ca Mon Jan 8 16:27:38 2001 From: mitchell at cs.sfu.ca (David G Mitchell) Date: Mon Jan 9 13:40:59 2006 Subject: Posd-docs at Simon Fraser & PIMS Message-ID: <200101090027.QAA13907@naos.cs.sfu.ca> Post-Doctoral Fellowships, Simon Fraser University Applications are solicited for several postdoctoral positions in the School of Computing Science, Simon Fraser University. These positions are being offered in conjunction with the Pacific Institute for the Mathematical Sciences (PIMS) and the MITACS Networks of Centres of Excellence. PIMS postdoc applicants are solicited in the areas of computational logic, graph theory, combinatorics and computational geometry. Successful candidates will be expected to participate in appropriate research activities of both the School and PIMS. The annual stipend is $50,000 (inclusive of benefits). MITACS postdocs/research associates are solicited in the areas of discrete optimization, computational geometry, graph theory, operations research, algorithms, and industrial mathematics. Successful candidates will be expected to work on a combination of theoretical and industrial research relevant to ongoing MITACS projects within the school. The school currently boasts two such projects in the areas of scheduling (Project Leaders: Pavol Hell and Lou Hafer) and facility location problems (Project Leader: Binay Bhattacharya). The annual stipend for MITACS postdocs is $50,000 (inclusive of benefits). Successful candidates for all postdoc positions must hold a PhD in the relevant area at the time they take up the position and have a strong research record. Positions are for one year with a strong possibility for renewal for a second year subject to funding. The School of Computing Science has 33 faculty members, and offers an expanding graduate program with over 130 M.Sc. and Ph.D. students. The School has state-of-the art computer equipment with excellent network support. There are well-equipped research laboratories in areas including algorithms, artificial intelligence, graphics and multimedia, and database systems. As well the School has strong links with the university's Centre for Systems Science, the B.C. Advanced Systems Institute, the Pacific Institute for the Mathematical Sciences and is the head office for MITACS. Further information can be obtained at the department web page: www.cs.sfu.ca. Simon Fraser University is situated on top of Burnaby Mountain just east of Vancouver and commands magnificent views of Burrard Inlet, the North Shore Mountains, the Fraser River, and Vancouver Harbour. The Lower Mainland area of British Columbia is unique in Canada for its mild climate and varied recreational opportunities. Please forward an application package consisting of a resume and 2 letters of reference to: Arvind Gupta MITACS Program Leader East Academic Annex, Room 120 Simon Fraser University 8888 University Avenue Burnaby, BC, V5A 1S6 Applicants can also send this information electronically via text or unix readable postscript files to: postdoc-applications@pims.math.ca Note: Application packages must be received by January 29, 2001 to be considered. ------------- 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 John.Dickinson at nrc.ca Wed Jan 10 09:04:15 2001 From: John.Dickinson at nrc.ca (Dickinson, John) Date: Mon Jan 9 13:40:59 2006 Subject: triangle triangle intesection line segment Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFFA2A@nrclonex1.imti.nrc.ca> Given two triangles in 3D space known to intersect (or at least touch), I need to find the line segment (or the point) that they touch at in space. Anyone have an algorithm or reference for that? If not, how about for a triangle and a plane, the same deal, I know they touch and want to determine the line segment that represents where they touch in 3-D space. John -- -((Insert standard disclaimer here))-|--- Ray's Rule for Precision ---- John Kenneth Dickinson, Ph.D. | "Measure with micrometer; Research Council Officer IMTI-NRC | Mark with chalk; email: john.dickinson@nrc.ca | Cut with axe." ------------- 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 yjc at photon.poly.edu Wed Jan 10 13:11:31 2001 From: yjc at photon.poly.edu (Yi-Jen Chiang) Date: Mon Jan 9 13:40:59 2006 Subject: WADS 2001 Call for Papers Message-ID: CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions are posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: submission of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) M. Yannakakis (Bell Laboratories) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) Program Committee: Co-Chairs: F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown) PC-Members: A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer ------------- 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 yjc at photon.poly.edu Wed Jan 10 13:11:31 2001 From: yjc at photon.poly.edu (Yi-Jen Chiang) Date: Mon Jan 9 13:40:59 2006 Subject: [DMANET] WADS 2001 Call for Papers Message-ID: CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions are posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: submission of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) M. Yannakakis (Bell Laboratories) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) Program Committee: Co-Chairs: F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown) PC-Members: A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zpr.uni-koeln.de/dmanet * ********************************************************** From John.Dickinson at nrc.ca Thu Jan 11 09:27:27 2001 From: John.Dickinson at nrc.ca (Dickinson, John) Date: Mon Jan 9 13:40:59 2006 Subject: Triangle intersection Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFFA33@nrclonex1.imti.nrc.ca> I have recieved a couple of answers directly and I thought other might want some of the references I got. Note that the trick is to do this efficiently, something I forgot to say as I have to do it for many such pairs of triangles. John -- -((Insert standard disclaimer here))-|--- Ray's Rule for Precision ---- John Kenneth Dickinson, Ph.D. | "Measure with micrometer; Research Council Officer IMTI-NRC | Mark with chalk; email: john.dickinson@nrc.ca | Cut with axe." Please have a look at M. Held (1997): ``ERIT: A Collection of Efficient and Reliable Intersection Tests''. Journal of Graphics Tools 2(4):25-44, 1997. Good luck with your project. Regards, --martin held if they are known to intersect, just walk around triangle A until it pierces the plane of B inside B, call that point pA. same for B wrt A, call that pB; then the segment you want is just pApB. seth. Tomas M?ller. A fast triangle-triangle intersection test. Journal of Graphics Tools, 2(2):25-30, 1997 A Fast Triangle-Triangle Intersection Test Tomas M?ller Prosolvia Clarus AB Sweden tompa@clarus.se Abstract: This paper presents a method, along with some optimizations, for computing whether or not two triangles intersect. The code, which is shown to be fast, can be used, for example, in collision detection algorithms. ------------- 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 aronov at ziggy.poly.edu Mon Jan 22 15:47:58 2001 From: aronov at ziggy.poly.edu (Boris Aronov) Date: Mon Jan 9 13:40:59 2006 Subject: The Goodman--Pollack two-thirds-of-a-century fest Message-ID: <200101222047.PAA06902@ziggy.poly.edu> New York University Courant Institute of Mathematical Sciences THE GOODMAN--POLLACK TWO-THIRDS-OF-A-CENTURY FEST A special Computational Geometry Day celebrating the 2/3 x 100 birthdays of Eli Goodman and Ricky Pollack Friday, February 16, 2001 Room 109, Warren Weaver Hall 251 Mercer St., New York, NY 10012 9:45--10:15 Coffee (Warren Weaver Hall Lobby) 10:15--10:30 Opening Addresses 10:30--11:15 Marie-Francoise Roy, University of Rennes Three Problems in Real Algebraic Geometry and Their Descendants 11:30--12:15 Rephael Wenger, Ohio State University Geometric Transversal Theory in the New Millennium 12:30--2:00 Lunch 2:00--2:45 Laszlo Lovasz, Microsoft, Inc. Steinitz Representations 3:00--3:45 Pankaj K. Agarwal, Duke University Arrangements: Combinatorial and Algorithmic Applications 4:00--5:00 Wine and Cheese Reception (13th floor lounge) For more information contact: Janos Pach (212) 998-3184 pach@cims.nyu.edu Micha Sharir sharir@math.tau.ac.il ------------- 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 tamaldey at cis.ohio-state.edu Wed Jan 24 12:21:29 2001 From: tamaldey at cis.ohio-state.edu (tamal dey) Date: Mon Jan 9 13:40:59 2006 Subject: Special Issue on Triangulation Message-ID: <200101241721.MAA22893@cis.ohio-state.edu> CALL FOR PAPERS Special Issue of INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE on Volume and Surface Triangulations Triangulation has been used as an important data structure and methodology for many problems in different applications such as finite element methods, computer graphics, geometric modeling, and geographical information systems. The classical Delaunay triangulation and its dual, the Voronoi diagram, has been extensively studied and many beautiful theorems are known. Recently, research in surface reconstruction, simplification, and mesh generation have spurred new combinatorial and algorithmic advances for triangulations. We can expect that the trend will continue, novel methodologies for triangulations will be developed, and further applications will be discovered. Accordingly, we are planning a special issue of IJFCS on new results on volume and surface triangulations in topics of interest that include, but are not limited to: [o] Data structures and algorithms for triangulations [o] Geometric modeling [o] Mesh generation [o] Surface reconstruction and simplification [o] Applications of triangulations A timely publication with a fast refereeing process is planned. Submit five copies of your manuscript by February 15, 2001, to one of the guest editors: Tamal K. Dey Department of Computer and Information Science The Ohio State University 2015 Neil Av., Columbus, OH 43210-1277 U.S.A Email: tamaldey@cis.ohio-state.edu Siu-Wing Cheng Department of Computer Science Hong Kong University of Science Technology Clear Water Bay Hong Kong Email: scheng@cs.ust.hk Instructions for submitting papers: Papers should not exceed 30 pages including figures, tables, etc. Papers should not have been previously published, nor currently submitted elsewhere for publication. Papers should include a title page containing title, authors' names and affiliations, as well as the contact author's name, email and postal addresses, and phone and fax numbers. All submissions should include an abstract of no more than 500 words. All submitted papers will be refereed under the usual criteria of IJFCS. ------------- 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 yjc at photon.poly.edu Fri Jan 26 17:34:42 2001 From: yjc at photon.poly.edu (Yi-Jen Chiang) Date: Mon Jan 9 13:40:59 2006 Subject: Reminder: WADS 2001 Call for Papers Message-ID: This is a reminder that the paper submission deadline for WADS 2001 is February 19. --------------- CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions are posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: submission of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) M. Yannakakis (Bell Laboratories) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) Program Committee: Co-Chairs: F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown) PC-Members: A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer ------------- 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 george at cs.ucy.ac.cy Mon Jan 29 18:26:40 2001 From: george at cs.ucy.ac.cy (George Angelos Papadopoulos) Date: Mon Jan 9 13:40:59 2006 Subject: ACM SAC'02 -- Call for Track Proposals Message-ID: 2002 ACM SYMPOSIUM ON APPLIED COMPUTING (SAC'02) Madrid, Spain, 10-13 March 2002 *** Call for Track Proposals *** For the past sixteen years the Symposium on Applied Computing has been a primary forum for applied computer scientists, computer engineers and application developers to gather, interact and present their work. SAC is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP); its proceedings are published by ACM in both printed form and CD-ROM; they are also available on the web through ACM's Digital Library. More information on SAC can be found at http://www.acm.org/conferences/sac . SAC is based on a flexible structure of mostly self-contained and self-managed tracks. Over the past years it has hosted tracks on a variety of topics such as Artificial Intelligence, Distributed Systems, Internet Technologies, Software Engineering, etc. For SAC'02, to be held in Spain in March of 2002, the SAC organizers solicit proposals for hosting tracks. Perspective track chairs should submit a less than one page description for organizing a track, which should include at least the following items: 1) The proposed title for the track with a description of its aims, topics it will cover and rationale for having such a track in SAC. This rationale should refer to any related conference events that are held regularly and why the proposed track differs from them or complements them. The proposed track should not be over general but also not overly specialized, thus being able to attract a wide audience of people sharing similar interests. Proposals from industry are also welcomed. Despite its name, SAC also welcomes papers of mostly theoretical nature, provided there is clear practical potential in applying the results of such work. 2) A short description of the activities the track chair will undertake upon acceptance of the proposal, to disseminate the call-for-papers for his/her track, manage the review process and collect final materials from authors of accepted papers. (Specific guidelines to track chairs regarding these issues will also be provided.) 3) A short CV of the perspective track chair(s) with reference to research interests and publication record directly related to the themes of the proposed track, and any previous experience of involvement in the organization of similar events (in the interest of brevity, reference to a personal web page where such information can be found will be welcomed). All proposals will be reviewed by the Conference and Program Chairs with respect to the above criteria. The Chairs reserve the right to: (1) accept a proposal as is, (2) recommend merging of similar proposals with a considerable overlap in the topics addressed (in this case the track chairs of the different proposals will be asked to form a single chair), (3) reject a proposal. Upon acceptance of a proposal, the track chairs will be notified of their responsibilities in managing the affairs of their tracks, as these are defined by SAC itself but also ACM. The Chairs reserve the right to cancel at any time a track, if these responsibilities are not addressed adequately by its track chair(s). Please submit your proposal electronically and in any acceptable readable form to: George A. Papadopoulos Department of Computer Science University of Cyprus E-Mail: george@cs.ucy.ac.cy IMPORTANT DATES 20 March 2001: Submission of track proposals 15 April 2001: Notification of acceptance/rejection 15 May 2001: Call-For-Papers for accepted tracks 1 Sept 2001: Submission of papers and tutorial proposals 15 Oct 2001: Notification of Acceptance/Rejection 1 Nov 2001: Camera-Ready copies of accepted papers 11-13 March 2002: SAC'02 takes place ------------- 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 yjc at photon.poly.edu Fri Jan 26 17:34:42 2001 From: yjc at photon.poly.edu (Yi-Jen Chiang) Date: Mon Jan 9 13:40:59 2006 Subject: [DMANET] Reminder: WADS 2001 Call for Papers Message-ID: This is a reminder that the paper submission deadline for WADS 2001 is February 19. --------------- CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions are posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: submission of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) M. Yannakakis (Bell Laboratories) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) Program Committee: Co-Chairs: F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown) PC-Members: A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zpr.uni-koeln.de/dmanet * ********************************************************** From szoraster at zycor.lgc.com Tue Jan 30 09:21:10 2001 From: szoraster at zycor.lgc.com (Steve Zoraster) Date: Mon Jan 9 13:40:59 2006 Subject: Line Simplification Literature Review? Message-ID: <462F323275D6D311BA0200805F356C52AD85BB@lgcadev001.zycor.lgc.com> I have not been paying attention to the state-of-the-art in automated 2D line simplification for some time. Could someone recommend an up-to-date review article on this topic? Thanks for your time and attention. Steven Zoraster Research Manager/Mapping Landmark Graphics www.lgc.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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From ph+ at cs.cmu.edu Tue Jan 30 17:26:24 2001 From: ph+ at cs.cmu.edu (Paul Heckbert) Date: Mon Jan 9 13:40:59 2006 Subject: Line Simplification Literature Review? References: <462F323275D6D311BA0200805F356C52AD85BB@lgcadev001.zycor.lgc.com> Message-ID: <3A773F90.8038B99A@cs.cmu.edu> Steve Zoraster wrote: > > I have not been paying attention to the state-of-the-art in automated 2D > line simplification for some time. Could someone recommend an up-to-date > review article on this topic? If by "line simplification" you mean taking a polyline (piecewise-linear curve) and approximating it with a new polyline with fewer line segments, then my survey is relevant: Survey of Polygonal Surface Simplification Algorithms, Paul S. Heckbert and Michael Garland, tech. report, CS Dept., Carnegie Mellon U., 1997, that is available at ftp://ftp.cs.cmu.edu/afs/cs/project/anim/ph/paper/multi97/release/intro.html#contents Let me know if you have trouble with the above FTP site. The survey covers curve simplification briefly. My high-level conclusions: * many literatures have explored this topic, including cartography, computer graphics, pattern recognition, image processing, computer vision, computational geometry * cartography calls this topic "generalization" * there's been a lot of redundant work in this area * the Douglas-Peucker algorithm is the most widely-used Paul Heckbert Associate Professor 4205 Newell-Simon Hall Computer Science Dept. Carnegie Mellon University 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From popinet at lmm.jussieu.fr Wed Jan 31 23:06:55 2001 From: popinet at lmm.jussieu.fr (Stephane Popinet) Date: Mon Jan 9 13:40:59 2006 Subject: The GNU Triangulated Surface library version 0.4.0 Message-ID: <3A789A8F.19048B75@lmm.jussieu.fr> I am pleased to announce release 0.4.0 of GTS. http://gts.sourceforge.net Much has happened since 0.3.0. A new object structure inspired by GTK allows to use classical inheritance mechanisms and virtual functions. As a consequence the object hierarchy has been restructured and now uses points, vertices, segments, edges, triangles, faces and surfaces. The Delaunay triangulation has been entirely re-written and is now fully-dynamic (insertion or deletion of vertices). The constrained Delaunay triangulation is semi-dynamic (insertion of vertices and constraints). Boolean operations between surfaces have also been re-written and are more robust (and also benefit from a much more robust implementation of the Delaunay triangulation). Surface coarsening routines have been improved both in term of a more generic interface and in order to avoid artefacts such as folds in the simplified surface. An interesting new extension is the implementation of progressive surfaces which allow dynamic real-time continuous level-of-detail representation of a surface. Progressive transmission of surfaces is also possible. The first building blocks for a hierarchical surface extension have been written. This will allow for dynamic view-dependent simplification of surfaces. The floating-point control interface necessary for robust geometric predicates has been cleaned and GTS should now build on any (touch wood) UNIX-based machine. Preliminary support has been added for win32 compilation using Microsoft C. Please note that the html reference manual is now distributed with the sources. You might want to check the updated manual at http://gts.sourceforge.net/reference/book1.html Stephane Popinet ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.