From j.winkler at dcs.shef.ac.uk Tue Mar 6 13:22:17 2001 From: j.winkler at dcs.shef.ac.uk (Joab Winkler) Date: Mon Jan 9 13:41:01 2006 Subject: Workshop on Geometric Uncertainty Message-ID: <200103061322.NAA15398@padley.dcs.shef.ac.uk> Dear Geometers We have pleasure in inviting you to participate in the workshop 'Uncertainty in Geometric Computations', to be held in Sheffield, England, 5-6 July 2001. Full details, including the web page, are below. Joab Winkler Mahesan Niranjan Department of Computer Science, The University of Sheffield, England +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ UNCERTAINTY IN GEOMETRIC COMPUTATIONS, 5-6 July 2001, Sheffield, England Invited Speakers (will be expanded) : Shun-ichi Amari (RIKEN, Japan), Andrew Blake (Microsoft, UK), Adrian Bowyer (Bath, UK), Alan Edelman (MIT, USA), Robin Forrest (East Anglia, UK), Nicholas Higham (Manchester, UK), Dinesh Manocha (North Carolina, USA), Tomaso Poggio (MIT, USA), Si Wu (Sheffield, UK) Organisers: Joab Winkler and Mahesan Niranjan Department of Computer Science The University of Sheffield, UK. The representation and management of uncertainty is an important issue in several different disciplines, such as numerical problems in computer graphics that occur when calculating the intersection curve of two surfaces, high performance pattern classification in a feature space, and the study of families of probability distributions in information geometry. The aim of this two-day workshop is to explore the underlying geometric theme that is common to these diverse disciplines. The workshop will consist of a number of invited contributions of a tutorial nature covering the different topics, contributed papers from participants and discussion sessions that explore the connections. Contributions will be published by Kluwer in an edited volume. The workshop is sponsored by the Engineering and Physical Sciences Research Council (EPSRC) and London Mathematical Society (LMS). Financial support is available to cover costs of UK based graduate students. The total number of participants is limited to 70. One page abstracts are invited from potential participants. Please submit electronically (postscript, PDF or plain text) to Dr Joab Winkler Deadline for Abstracts: 15 April 2001 For further information see: http://www.shef.ac.uk/~geom2001/ +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ------------- 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 balmelli at us.ibm.com Wed Mar 7 10:31:21 2001 From: balmelli at us.ibm.com (Laurent L Balmelli) Date: Mon Jan 9 13:41:01 2006 Subject: Optimal 4-8 Mesh simplification Message-ID: Dear Computational Geometry Lovers, My PhD thesis, RATE-DISTORTION OPTIMAL MESH SIMPLIFICATION FOR COMMUNICATIONS Laboratory for Audio-Visual Communications Ecole Polytechnique Federale (EPFL), Switzerland is available in pdf format at http://www.research.ibm.com/people/b/balmelli/ See the topics covered below. all the best Laurent Balmelli, Research Staff Member IBM Research Division -------------------------- TOPICS COVERED (1) Conceptual system for the transmission of textured meshes, (2) Analysis of a set of approximation algorithms for the polyline in the computation-rate-distortion sense, (3) Analysis in computational geometry of binary subdivided meshes, also known as 4-8 meshes, (4) Efficient quadtree data structure for subdivision surfaces providing O(1) neighbor-finding access methods, (5) Optimal mesh simplification in the Rate-Distortion Sense, (6) Joint Mesh-Texture optimization using Marginal Analysis. ------------- 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 Mar 7 16:08:10 2001 From: tamaldey at cis.ohio-state.edu (tamal dey) Date: Mon Jan 9 13:41:01 2006 Subject: Cocone Software for surface reconstruction Message-ID: <200103072108.QAA19190@cis.ohio-state.edu> For those who asked for the static binary for the Cocone software (for reconstructing surfaces from point clouds): it is now available from http://www.cis.ohio-state.edu/~tamaldey/cocone.html ---Tamal K. Dey http://www.cis.ohio-state.edu/~tamaldey ------------- 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 marina at cpsc.ucalgary.ca Thu Mar 8 17:12:04 2001 From: marina at cpsc.ucalgary.ca (Marina Gavrilova) Date: Mon Jan 9 13:41:01 2006 Subject: PDPTA'01, Session on Applied Parallel Algorithms, CFP In-Reply-To: <0165B8BD4314D31192B500E0292DF78F423E60@sssnt122.rdg.ac.uk> Message-ID: Dear Colleagues, Please, allow me to bring to your attention the Final Call for Papers for Technical Session on Applied Parallel Algorithms, to be held in conjunction with the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'2001, Las Vegas, USA http://www.ashland.edu/~iajwa/conferences). The Conference is a long running well established international event, attracting outstanding researchers in the areas of parallel and distributed processing. It is estimated that around 1500 participants will attend the PDPTA in 2001. The Technical Section on Applied Parallel Algorithms (http://www.cpsc.ucalgary.ca/~marina/Newweb/pdpta01.htm) is focused on recent advances in high performance computing and applications of the parallel algorithms to such natural sciences and engineering, including parallel computational geometry, biology, chemistry and physics. Applied computational methods in parallel and distributed environments, including but not limited to computer graphics, visualization, GIS, databases, matrix computations, equation solvers, Monte Carlo methods are also of interest. The details on paper submission can be found from the attached Final Call for Papers. Please note that the deadline for DRAFT paper submission is March 13th, 2001. CALL FOR PAPERS ================ TECHNICAL SESSION ON APPLIED PARALLEL ALGORITHMS in conjunction with the 2001 International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA'2001 June 25 - 28, 2001, Las Vegas, USA http://www.ashland.edu/~iajwa/conferences http://www.cpsc.ucalgary.ca/~marina/Newweb/pdpta01.htm PLEASE NOTE EXTENDED DEADLINE FOR PAPER SUBMISSION: MARCH 13, 2001 SESSION CHAIRS C.J. Kenneth Tan, The Queen's University of Belfast, UK Marina Gavrilova, University of Calgary, Canada Vassil N. Alexandrov, High Performance Computing Centre, University of Reading, UK OVERVIEW The concentration of this Technical Session is in the realms of applied computational methods in parallel and distributed environments, including but not limited to computer graphics, visualization, GIS, databases, matrix computations, equation solvers, Monte Carlo methods, and others. (See the list below.) The sequential counterpart of these topics have long been the interest of researchers. However, many of the parallel aspects of various algorithms, their implementations and applications, still remain open. Implementation of these algorithms may be on systems ranging from loosely-coupled pile of DSP's to workstation clusters to MPP's. The large scale computations are of the special interest for session organizers. This topic offers the opportunity to discuss problems and solutions in the area, to identify new issues, and to shape future directions for research, as well as to help industrial users apply techniques of large scale parallel and distributed computations. TOPICS OF INTEREST Topics of interest of this Technical Session include, but not limited to: matrix computations equation solvers Monte Carlo methods random number generators sorting algorithms computer vision and computer graphics visualization robotics computer simulation parallel numerical computations/methods parallel computational geometry, biology, chemistry and physics The design and implementation of algorithms in parallel and distributed environments, and applications of such methods to mechanics and physics, are of special interest. PDPTA Conference Series The 2001 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'2001) will be held at the Monte Carlo Resort, Las Vegas, Nevada, USA, from June 25 till June 28, 2000. It is anticipated that this international event will attract about 1500 participants. This MultiConference is composed of eight International conferences that will be held simultaneously. Attendees will have full access to all eight conferences. The conference will be co-sponsored by Computer Science Research, Education, & Applications Press together with research centers, international associations, international research groups, and developers of high-performance machines and systems. PAPER SUBMISSION Prospective authors are invited to submit their draft paper of about 4 pages, to Kenneth Tan or Marina Gavrilova (contact information is given below) by the due date, March 13, 2001. Papers must not have been previously published or currently submitted for publication elsewhere. Electronic submissions via e-mail is preferred, although fax submissions or hard copy submissions are also acceptable. When submitting via e-mail, the preferred formats are: Adobe PostScript Adobe PDF DVI (please include all graphics files) LaTex ((please include any non-standard style files or class files, and all graphics) Papers in Microsoft Word format are also acceptable. Should the submission for a paper contain more than one file, please submit them as a GZIP'ed or 'compress'ed Tar archive (i.e.: either as a .tar.gz or .tar.Z file). If submitting via fax or in hard copy, please make sure 3 copies of the paper arrive before the due date, March 1, 2001. The length of the camera-ready papers (if accepted) will be limited to 7 pages. Please include a cover page which lists the following: Title of the paper Name, affiliation, postal address, E-mail address, telephone number, and fax number for each author Name of the author who will be presenting the paper (if accepted) A maximum of 5 keywords 2 nominated referees and contact information of all nominated referees PROCEEDINGS The conference proceedings will be published by CSREA Press (ISBN) in hardcopy. The proceedings will be available at the conferences site. Some accepted papers will also be considered for journal publication. In addition to the hardcopy, it is also planned to publish the papers on a CD. IMPORTANT DATES March 13, 2001 (Thursday): Draft papers (about 4 to 5 pages) due April 2, 2001 (Monday) : Notification of acceptance May 1, 2001 (Tuesday) : Camera-Ready papers and Preregistration due June 25 - 28, 2001 : PDPTA'2001 CONTACT INFORNATION For all questions related to Technical Session on Applied Parallel Algorithms please contact C. J. Kenneth Tan Address: School of Computer Science The Queen's University of Belfast Belfast BT7 1NN United Kingdom Telephone: 44-289-027-4636 Facsimile: 44-289-068-3890 or M. L. Gavrilova Address: Department of Computer Science University of Calgary 2500 University Drive N.W. Calgary, AB Canada T2N 1N4 Telephone: 1-403-220-5105 Facsimile: 1-403-284-4707 or Vassil Alexandrov Address: High Performance Computing Center University of Reading Reading RG6 6AY United Kingdom Telephone: 44-118-931-6722 Facsimile: 44-118-975-1994 With best wishes, Marina Gavrilova ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Dr. Marina Gavrilova Dept. Of Computer Science University of Calgary Office: MS 269 Phone: (403) 220-5105 Fax: (403) 284-4707 E-mail: marina@cpsc.ucalgary.ca WWW: www.cpsc.ucalgary.ca/~marina ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -------------- next part -------------- A non-text attachment was scrubbed... Name: Parallel Algm Session PDPTA.doc Type: application/msword Size: 58368 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20010308/8773f7b5/ParallelAlgmSessionPDPTA.doc From sheffa at csar.uiuc.edu Sun Mar 11 17:55:56 2001 From: sheffa at csar.uiuc.edu (Alla Sheffer) Date: Mon Jan 9 13:41:01 2006 Subject: 10th IMR-CALL FOR PAPERS/ANNOUNCEMENT Message-ID: <200103112355.f2BNtud16845@dirichlet.csar.uiuc.edu> *************************************************************** ** Announcement and Call for Papers ** ** ** ** 10TH INTERNATIONAL MESHING ROUNDTABLE ** ** ** ** October 7-10, 2001 ** ** Newport Beach, California USA ** ** ** ** http://www.imr.sandia.gov ** ** ** *************************************************************** Join us at the 10th International Meshing Roundtable to be held in warm and sunny Newport Beach, California, on October 7-10, 2001. In 1992, Sandia National Laboratories started the Meshing Roundtable as a small meeting of like-minded companies and organizations striving to establish a common focus for research and development in the field of mesh and grid generation. Now after 10 consecutive years, the International Meshing Roundtable has become recognized as an international focal point annually attended by researchers and developers from dozens of countries around the world. The relaxed atmosphere at each Roundtable provides an open and technically rich environment in which to share new ideas and technical advances. The International Meshing Roundtable continues to focus on bringing together researchers and developers from academia, national labs and industry in a stimulating, open environment to share technical information related to mesh generation and general pre-processing techniques. In 2001, Roundtable attendees will enjoy the balmy weather and breathtaking beaches of Newport Beach, California, located between Los Angeles and San Diego on the Pacific coast. This year's conference will be hosted by UGS, Inc. which maintains its principle development site in Southern California. EVENTS ------ Events at Roundtable 2001 include: * Pre-conference short course on Sunday, October 7 * Technical presentations of contributed papers * Keynote and invited speakers * Poster session with "Best Technical Poster", "Best Student Poster" and "Meshing Maestro" awards. We encourage submission of posters presenting novel research results as well as posters showcasing state-of-the-art technology by industry developers and meshing software vendors. * Birds-of-a-Feather session providing a discussion forum for small groups of researchers working in similar fields. * Panel discussion. * Dinner Banquet More information on the Roundtable, as it becomes available, will be published at the International Meshing Roundtable website: http://www.imr.sandia.gov FINANCIAL SUPPORT FOR STUDENTS ---------------------------- Limited financial support from the National Science Foundation (www.nsf.gov) will be made available to student attendees from US academic institutions to defray travel and conference registration expenses. Awards of funding to students will be based on active research in mesh generation or interest in meshing as a future research topic. Funding awards will be prioritized as follows: * Presentation of a research paper at the conference (accepted through the regular review process) * Presentation of a poster at the poster session accompanied by a brief, written research description * Submission of a one-page, written statement of interest from beginning graduate students, signed by their advisor and/or chairman of their department. All students must provide a copy of their student ID. Please send all proposals to Nikos Chrisochoides. More information regarding travel support for students will be posted on the International Meshing Roundtable website: http://www.imr.sandia.gov IMPORTANT DATES --------------- June 1, 2001 Full paper due August 6, 2001 Acceptance/Rejection notices sent to authors August 27, 2001 Final camera-ready papers due September 7, 2001 Early conference registration due September 14, 2001 Hotel reservation due for special discount rates October 7, 2001 Short Course, Marriott Hotel, Newport Beach October 7-10, 2001 10th International Meshing Roundtable, Marriott Hotel, Newport Beach, California, USA CALL FOR PAPERS --------------- Papers are being sought that present original results on meshing and related topics. We encourage theoretical and novel ideas with practical potential as well as technical applications from industrial researchers. In addition to our core topics in meshing related algorithms, we are also interested in obtaining technical papers that relate analysis and application solutions to the mesh generation process. Potential topics include but are not limited to: * Volume and surface mesh generation * Structured and unstructured grid generation * Hybrid meshing * Anisotropic mesh generation * Mesh quality, smoothing, and optimization * Adaptive meshing * Geometry simplification, decomposition, and cleanup * Industrial applications for complex geometries * Large mesh manipulation * CAD Interface for meshing * Parallel meshing algorithms and software * Meshing of parametric models * Theoretical basis of mesh generation PROCEEDINGS AND JOURNAL SPECIAL ISSUE ------------------------------------- The conference proceedings will be published by Sandia National Laboratories and distributed at the Roundtable. In addition, papers of exceptionally high quality will be published in a special issue of Engineering with Computers. PAPER SUBMISSIONS ----------------- Papers should contain significant technical content to be accepted. No paper will be accepted for publication without an accompanying presentation at the conference. Accepted papers will be published in the proceedings and may also be available on the website pending author approval. Papers should be 8-12 pages in length (9 point, two columns) and received by June 1, 2001. Paper submissions will be accepted in Word and PostScript, electronic submission only. Formatting details including templates for Word and LaTeX will be available on the conference web site. Final camera-ready papers not meeting formatting guidelines will not be accepted for publication in the proceedings.. Papers can be transferred by anonymous ftp to endo.sandia.gov (place in directory pub/incoming/pknupp/10imr) or can be mailed to pknupp@sandia.gov. Files transferred via anonymous ftp should be named as follows, to avoid collisions on the ftp site: names should start with the first author's last name, followed by a hyphen, followed by the last four digits of the author's phone number. Authors should send email to Patrick Knupp, (pknupp@sandia.gov) with the paper title and file name immediately after placing it on the site. Questions regarding paper submission should be addressed to Patrick Knupp or Nikos Chrisochoides, Technical Papers Co-Chairs. CONFERENCE REGISTRATION ----------------------- A detailed registration packet and registration form will be mailed and will be made available on the International Meshing Roundtable WWW page at: http://www.imr.sandia.gov CONFERENCE LOCATION AND HOTEL RESERVATIONS ------------------------------------------ The site of this year's Roundtable is the city of Newport Beach, California (http://www.newportbeach.com). The Roundtable will be held at the Marriott Hotel & Tennis Club in Newport Beach which is centrally located between Los Angeles and San Diego. The Marriott is adjacent to Fashion Island, an extraordinary shopping destination featuring over 200 stores and restaurants overlooking the beautiful Pacific Ocean and Newport Harbor. There are four airports with convenient service to Newport Beach: * Orange County Airport (SNA) also known as John Wayne International, 5 miles from the hotel * Long Beach (LGB, 25 miles away from the hotel.) * Los Angeles International (LAX), 43 miles, will accommodate international flights and boasts cheaper fares. * Ontario International Airport (ONT), 45 miles away from Newport Beach. Super Shuttle service (1-800-258-3826) or (714-517-6600) is available from all of these airports to the Marriott, or reservations can be made online at http://www.supershuttle.com. Newport Beach Marriott Hotel 900 Newport Center Drive Newport Beach, CA 92660 949-640-4000 (Direct) 949-640-4918 (Fax Number) http://marriotthotels.com/LAXNB/ A block of rooms has been reserved at the Newport Beach Marriott Hotel at a special conference rate of $159/day Saturday-Thursday plus state and local taxes. To ensure obtaining this rate, participants should make their own reservations before September 14th, 2001. Please note that October is an extremely busy time of the year in Newport Beach and hotel rooms are at a premium and may be hard to obtain after September 14, 2001. You must mention that you will be attending the "10TH INTERNATIONAL MESHING ROUNDTABLE" sponsored by Sandia National Laboratories to receive our special rate for the nights of October 6-10, 2001 Note: All trademarks are property STEERING COMMITTEE ------------------ The International Meshing Roundtable Steering Committee consists of representatives from national research labs, academia, and industry who serve on a rotating basis. This year's committee is: Alla Sheffer, Chair University of Illinois at Urbana-Champaign Phone: 217-244-0360 Fax: 217-333-1910 E-mail: sheffa@cse.uiuc.edu John Chawner Pointwise, Inc. Phone: 817-377-2807 Fax: 817-377-2799 E-mail: jrc@pointwise.com Nikos Chrisochoides, Technical Papers Co-Chair College of William and Mary, Computer Science Parallel Experimental Systems Lab Williamsburg, VA 23187-8795 Phone: 757-221-3466 Fax: 757-221-1717 E-mail: nikos@cs.wm.edu Tammy Eldred, Conference Coordinator Sandia National Laboratories Phone: 505-844-0180 Fax: 505-844-8251 E-mail: tjeldre@sandia.gov Patrick Knupp, Technical Papers Co-Chair Sandia National Laboratories Phone: 505-284-4565 Fax: 505-844-9297 E-mail: pknupp@sandia.gov FTP: endo.sandia.gov (pub/incoming/pknupp/10imr) Matthew Staten, Conference Host UGS, Inc. Phone: 714-952-5478 Fax: 714-952-6095 E-mail: staten@ugsolutions.com Frank Witzeman Air Force Research Laboratory Phone: 937-255-3876 Fax: 937-656-7867 E-mail: frank.witzeman@wpafb.af.mil Questions regarding registration or other conference details should be sent to: Tammy Eldred, Conference Coordinator. ***************************************************** Alla Sheffer Department of Computer Science University of Illinois (UIUC) tel: (217)-244-0360 e-mail: sheffa@uiuc.edu http://www.csar.uiuc.edu/~sheffa ****************************************************** -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20010311/62b32a88/attachment.htm From darken at gamca.sk Mon Mar 12 22:05:26 2001 From: darken at gamca.sk (Darken) Date: Mon Jan 9 13:41:01 2006 Subject: Search for algorithm... Message-ID: Hi everybody ! I'm just a newbie in this mailing list so I am sorry for my English and sorry if'll be asking questions witch has obvious solutions... I just wanted to ask you for algoritms solving this prob : Given two convex polygons P,Q which have N,M vertexes, find their "intersection" - (give vertexes of the polygon which is their intersection). I am searching for an algorithm which solves this problem in linear time depending on N,M -> O(N+M) Thankx ! Darken (darken@gamca.sk) ------------- 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 Tue Mar 13 11:41:04 2001 From: george at cs.ucy.ac.cy (George Angelos Papadopoulos) Date: Mon Jan 9 13:41:01 2006 Subject: ACM SAC'02 -- Last Call for Track Proposals Message-ID: (Sincere apologies if you receive this call multiple times) 2002 ACM SYMPOSIUM ON APPLIED COMPUTING (SAC'02) Madrid, Spain, 10-13 March 2002 *** Last Call for Track Proposals *** For the past sixteen years the ACM Symposium on Applied Computing (SAC) 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, BioInformatics, Computers in Education, Distributed Systems, Internet Technologies, Software Engineering, etc. For SAC'02, to be held in Spain between 11-13 of March 2002 (the 10th is dedicated for tutorials), the SAC organizers solicit proposals for hosting tracks. Perspective track chairs should submit an up to 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 topics 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 10-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 Mariette.Yvinec at sophia.inria.fr Thu Mar 15 14:51:16 2001 From: Mariette.Yvinec at sophia.inria.fr (Mariette Yvinec) Date: Mon Jan 9 13:41:01 2006 Subject: A position at INRIA Message-ID: <200103151351.f2FDpGe01394@procyon.inria.fr> A twelve month position at INRIA Sophia Antipolis to improve the packaging and porting of CGAL on Windows operating systems The Computational Geometry Algorithms Library (http://www.cgal.org) is a C++ library which aims to make the most important of the solutions and methods developed in computational geometry available to users in industry and academia. CGAL results from a collaborative effort of seven research institute (INRIA Sophia Antipolis, Max Planck Institute, ETH Zurich, Utrecht University, Tel Aviv University, FU Berlin and Halle University). In order to help the diffusion of CGAL, INRIA offers a twelve month position to improve the packaging of CGAL for windows platforms. The work to be done mainly consists in : - setting up an easy installation procedure under Windows, - create demos with a convivial GUI. (This assumes to find out and set up the right combination of viewer/window tool kit) - set up IDE projects for CGAL demos and examples, - check the debugging possibilities under IDE - configure CGAL for the next release of VC++ (cleaning no longer usefull workarounds) - evaluate the Intel plugin compiler - evaluate how CGAL functionalities could be offered through MS component technology. Thus, we are looking with candidate with more or less the following profile : - a good knowledge of VC++ application developpement - a good knowledge of unix for porting and platform question - fluency in english - some knowledge on viewing and windows toolkit If this offer interests you or anybody in your neighboorhood, please react quickly. We have to find a good candidate for this position before the BEGINNING OF MAY otherwise the funding for that position will vanish. --------------------------------------------------------------------- Mariette Yvinec INRIA Sophia-Antipolis email: yvinec@sophia.inria.fr 2004, Route des Lucioles BP 93 phone: 33 (0)4 92.38.77.49 06902 Sophia-Antipolis Cedex (France) fax : 33 (0)4 92.38.76.43 http://www.inria.fr/prisme/personnel/yvinec/yvinec.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 aronov at ziggy.poly.edu Mon Mar 19 10:13:30 2001 From: aronov at ziggy.poly.edu (Boris Aronov) Date: Mon Jan 9 13:41:01 2006 Subject: The Goodman--Pollack two-thirds-of-a-century fest NEW DATE Message-ID: <200103191513.KAA00581@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, May 4, 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 Gil Kalai, Hebrew University, Jerusalem Learnability and Rationality of Choice 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 dls at eecs.tufts.edu Sun Mar 25 23:07:16 2001 From: dls at eecs.tufts.edu (dls@eecs.tufts.edu) Date: Mon Jan 9 13:41:01 2006 Subject: ACM Symposium on Computional Geometry 2001: Conference Program Message-ID: <200103260407.XAA04535@piano.eecs.tufts.edu> ************************************************************* The 15th Annual ACM Symposium on Computational Geometry Tufts University Medford/Somerville, Massachusetts June 3-5, 2001 http://www.eecs.tufts.edu/EECS/scg01 http://www.eecs.tufts.edu/EECS/scg01/prog.ps Sponsored by ACM SIGACT and SIGGRAPH With support from Tufts University and MERL ************************************************************* Saturday, June 2 Optional Cruises of Boston Harbour: 1:00 p.m. & 3:00 p.m. Cocktail Hour and Registration: 6:00 - 8:00 pm Sunday, June 3 Session 1 9:00 On the Number of Congruent Simplices in a Point Set: Pankaj K. Agarwal (Duke); Micha Sharir (Tel Aviv & NYU) 9:20 Enumerating Order Types for Small Point Sets with Applications O. Aichholzer, F. Aurenhammer, H. Krasser (Graz U. of Technology) 9:40 The Union of Congruent Cubes in Three Dimensions: Janos Pach (CUNY, NYU, Hungarian Acad. of Sciences) Ido Safruti (Tel Aviv) Micha Sharir (Tel Aviv & NYU) 10:00 Different Distances of Planar Point Sets: Jozsef Solymosi, Csaba David Toth (ETH Z) Refreshment break Session 2 10:40 Schematization of Road Networks: Sergio Cabello, Mark de Berg, Steven van Dijk, Marc van Kreveld, Tycho Strijk (Utrecht) 11:00 Simplifying a Polygonal Subdivision While Keeping it Simple: Regina Estkowski (HRL Labs) Joseph S. B. Mitchell (SUNY Stony Brook) 11:20 Hardware-Assisted View-Dependent Map Simplification Nabil Mustafa (Duke) Eleftheris Koutsofios, Shankar Krishnan, Suresh Venkatasubraminian (AT&T Research) 11:40 Efficient Perspective-Accurate Silhouette Computation and Applications: Mihai Pop (TIGR) Gill Barequet (Technion) Christian A. Duncan (U. Miami) Michael T. Goodrich, Wenjing Huang, Subodh Kumar (Johns Hopkins) Lunch: 12:00 pm Invited Talk 1:30 Sphere Packings and Generative Programming: Thomas Hales (U. Michigan) Session 3 2:45 Hierarchical Morse Complexes for Piecewise Linear 2-Manifolds: Herbert Edelsbrunner (Duke & Raindrop Geomagic) John Harer (Duke) Afra Zomorodian (UI Urbana-Champaign) 3:05 Computing a Canonical Polygonal Schema of an Orientable Triang- ulated Surface: Francis Lazarus (CNRS & U. Poitiers) Michel Pocchiola (Ecole Normale Superieure) Gert Vegter (Groningen) Anne Verroust (INRIA, Rocquencourt) 3:25 Area-Preserving Piecewise-Affine Transformations: Alan Saalfeld (Ohio-State) Refreshment Break Session 4 4:15 Nice Point Sets Can Have Nasty Delaunay Triangulations: Jeff Erickson (UI Urbana-Champaign) 4:35 Walking in a Triangulation: Olivier Devillers, Sylvain Pion, Monique Teillaud (INRIA, Sophia Antipolis) 4:55 Sink-insertion for Mesh Improvement: Herbert Edelsbrunner (Duke) Damrong Guoy (UI Urbana-Champaign) Business Meeting: 5:30 pm, Cabot Auditorium Monday, June 4 Session 5 9:00 Box-Trees and R-Trees with Near-Optimal Query Time: Pankaj K. Agarwal (Duke) Mark de Berg (Utrecht) Joachim Gudmundsson, Mikael Hammar (Lund U.) Herman J. Havekort (Utrecht) 9:20 A Segment-Tree Based Kinetic BSP: Mark de Berg (Utrecht) Joao Comba, Leonidas J. Guibas (Stanford) 9:40 Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles: Adrian Dumitrescu, Joseph S. B. Mitchell (SUNY Stony Brook) Micha Sharir (Tel Aviv & NYU ) 10:00 A Note on Binary Plane Partitions: Csaba David Toth (ETH Z) Refreshment Break Session 6 10:40 Exact Nearest Neighbor Search in High Dimensions: Helmut Alt, Laura Heinrich-Litan (Freie U. Berlin) 11:00 Farthest Neighbors and Center Points in the Presence of Rectangular Obstacles: Boaz Ben-Moshe, Matthew J. Katz (Ben-Gurion) Joseph S. B. Mitchell (SUNY Stony Brook) 11:20 A Fully Dynamic Algorithm for Planar Width: Timothy M. Chan (U. Waterloo) 11:40 A Practical Approach for Computing the Diameter of a Point-Set Sariel Har-Peled (UI Urbana-Champaign) Lunch: 12:00 pm Invited Talk 1:30 Protein Geometry as a Function of Time: Fred Richards (Yale) Session 7 2:45 Discrete Mobile Centers: Jie Gao, Leonidas J. Guibas (Stanford) John Hershberger (Mentor Graphics) Li Zhang (Compaq Systems Research) An Zhu (Stanford) 3:05 Segment Intersection Searching Problems in General Settings: Vladlen Koltun (Tel Aviv) 3:25 On the Complexity of Halfspace Area Queries: Stefan Langerman (Rutgers) Refreshment Break Session 8 4:15 Algorithms for Congruent Sphere Packing and Applications Danny Z. Chen, Xiaobo {Sharon} Hu, Yingping Huang, Yifan Li (Notre Dame) Jinhui Xu (SUNY Buffalo) 4:35 polymake: an Approach to Modular Software Design in Computational Geometry: Ewgenij Gawrilow, Michael Joswig (TU-Berlin) 4:55 A Randomized Art-Gallery Algorithm for Sensor Placement Hector Gonzalez-Banos, Jean-Claude Latombe (Stanford Barbecue 6:00 pm: Gather on the lawn between Lewis and Tilton Halls for an outdoor cookout with blankets, frisbees, and volleyball (weather permitting) followed by music by blues band DEEP FREYED , featuring Bill Frey, Matt Dickerson, Daniel Scharstein, and special guest. Tuesday, June 5 Session 9 9:00 Notes on Computing Peaks in k-Levels and Parametric Spanning Trees: Naoki Katoh ( Kyoto U.) Takeshi Tokuyama (Tohoku U.) 9:20 Geometric Permutations of Fat Objects: Matthew Katz (Ben-Gurion) Kasturi Varadarajan (U. Iowa) 9:40 The Clarkson-Shor Technique Revisited and Extended: Micha Sharir (Tel Aviv & NYU) 10:00 Detecting Undersampling in Surface Reconstruction: Tamal K. Dey, Joachim Giesen (Ohio State) Refreshment Break Session 10 10:40 Computing the Intersection of Quadrics: Exactly and Actually! Nicola Geismann (Saarlandes) Michael Hemmer, Elmar Schoemer (Max Planck Saarbruecken) 11:00 PRECISE: Efficient Multiprecision Evaluation of Algebraic Roots and Predicates for Reliable Geometric Computation: S. Krishnan (AT&T Research) M. Foskey (UNC) T. Culver (Think3) J. Keyser (Texas A ) D. Manocha (UNC) Invited Talk 11:30 Computational Geometry for Sculpture: George W. Hart http://www.georgehart.com/ Lunch: 12:30 pm Session 11 2:00 New Bounds on the Betti Numbers of Semi-Algebraic Sets and Arrangements of Real Algebraic Hypersurfaces: Saugata Basu (Georgia Tech) 2:20 Efficient and Small Representation of Line Arrangements with Applications: David P. Dobkin (Princeton) Ayellet Tal (Technion) 2:40 A Sum of Squares Theorem for Visibility Complexes Pierre Angelier, Michel Pocchiola (Ecole Normale Sup Short Break 3:15 Monotone Paths in Line Arrangements: Rados Radoicic (MIT) Geza Toth (MIT & Hungarian Acad. of Sciences) 3:35 Balanced Lines, Halving Triangles, and the Generalized Lower Bound Theorem: Micha Sharir (Tel Aviv & NYU) Emo Welzl (ETH Z) Refreshment Break: 4:00 - 4:30 pm Optional: Boston Red Sox vs Detroit Tigers, 7:30 p.m. at Fenway Park ****************************************************************** 10th Annual Video Review of Computational Geometry The video review showcases advances in the use of algorithm animation, visualization, and interactive computing in the study of computational geometry. The video review tape is distributed to all registrants at the conference and will subsequently be available from ACM. * Small Representation of Line Arrangements: Ayellet Tal (Technion), David Dobkin (Princeton) * The convex hull of ellipsoids: Nicola Geismann (Saarlandes) Michael Hemmer, Elmar Schomer (Max Planck Saarbruecken) * 2-point site Voronoi Diagram: Gill Barequet (Technion), Matthew Dickerson (Middlebury) Robert Drysdale (Dartmouth) * The Connectivity Shapes Video: Martin Isenburg (UNC), Stefan Gumhold (Tubingen), Craig Gotsman (Technion) * A prototype system for Visualizing Time-Dependent Data: Lutz Kettner, Jack Snoeyink (UNC) ************************************************************************ Theoretical Track Program Committee: Applied Track Program Committee: Boris Aronov (Polytechnic U, Brooklyn) Nancy Amato (Texas A&M) Otfried Cheong (Utrecht U) Karl Bo"hringer (U Washington, Seattle) Jesu's De Loera (UC Davis) Franca Gianini (IMA, Genova) David Eppstein, Chair (UC Irvine) Lutz Kettner (UNC Chapel Hill) Sariel Har-Peled (UI Urbana Champaign) Dan Halperin, Chair (Tel Aviv U) Piotr Indyk (MIT) Kurt Mehlhorn (MPII, Saarbru"cken) Edgar A. Ramos (MPII Saarbru"cken) Mark Overmars (Utrecht U) Ileana Streinu (Smith College) Seth Teller (MIT) Peter Widmayer (ETH Zurich) Video Review Committee Mariette Yvinec (INRIA Sophia-Antipolis) Jonathan Cohen (Johns Hopkins) Herbert Edelsbrunner (Duke) Subodh Kumar (Johns Hopkins) Conference Chair Ming C. Lin (UNC Chapel Hill) Dinesh Manocha, Chair (UNC Chapel Hill) Diane L. Souvaine (Tufts U) Amitabh Varshney (U of Maryland) ******************************************************************************* ------------- 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 bradb at shore.net Sat Mar 24 10:48:29 2001 From: bradb at shore.net (Brad Barber) Date: Mon Jan 9 13:41:01 2006 Subject: Announce: Qhull 3.0 for convex hull, Delaunay, Voronoi, Halfspace Message-ID: <4.3.2.7.2.20010324103316.00b1c750@shell.shore.net> I am pleased to announce Qhull 3.0 for computing convex hulls, Delaunay triangulations, Voronoi diagrams, and halfspace intersection about a point. It includes programs for each of these structures. Qhull uses floating point arithmetic to compute an approximation to the convex hull. Each facet is defined by an outer plane that is clearly above all points and an inner plane that is clearly below the vertices. It provides two methods to handle precision errors: facet merging -- If a ridge is not clearly convex, Qhull merges a facet into a neighboring facet. joggled input -- Qhull randomly perturbs the input. If a precision error occurs, Qhull restarts with a larger joggle. For example, rbox 1000 W0 | qconvex QR0 R1e-3 computes the convex hull of 1000 points on the surface of a rotated unit cube. To test Qhull, each computation is randomly perturbed by up to 0.001. Qhull merged 92 facets to handle precision errors. Convex hull of 1000 points in 3-d: Number of vertices: 52 Number of facets: 39 Number of non-simplicial facets: 12 Statistics for: RBOX 1000 W0 | QCONVEX QR0 R1e-3 QR985448492 Number of points processed: 62 Number of hyperplanes created: 178 Number of distance tests for qhull: 18629 Number of merged facets: 92 Number of distance tests for merging: 2801 CPU seconds to compute hull (after input): 0.11 Maximum distance of point above facet: 0.0038 (0.6x) Maximum distance of vertex below facet: -0.0074 (1.2x) Home page: http://www.geom.umn.edu/locate/qhull Convex hull: http://www.geom.umn.edu/software/qhull/html/qconvex.htm Delaunay triangulation: http://www.geom.umn.edu/software/qhull/html/qdelaun.htm Voronoi diagram: http://www.geom.umn.edu/software/qhull/html/qvoronoi.htm Halfspace intersection about a point: http://www.geom.umn.edu/software/qhull/html/qhalf.htm N-dimensional point distributions: http://www.geom.umn.edu/software/qhull/html/rbox.htm --Brad ------------- 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.