From marc at cs.uu.nl Wed Sep 3 18:36:09 2003 From: marc at cs.uu.nl (Marc van Kreveld) Date: Mon Jan 9 13:41:12 2006 Subject: New Steering Committee CG elected Message-ID: <3F560A69.1030300@cs.uu.nl> Hi, The new Steering Committee has been elected and the five with the most votes all reconfirmed that they still want to be a member. Starting today, the new committee replaces the old one for a term of 3 years. New committee (alphabetical order): Pankaj Agarwal Mark de Berg Ferran Hurtado Joe Mitchell Jack Snoeyink The new committee will organize itself and inform the community at some point what was the result of this. The old committee (Nina Amenta, Jeff Erickson, Danny Halperin, Joe Mitchell, and myself) wish the new committee good luck in their activities. Marc van Kreveld ------------- 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 naragam at imaging.utk.edu Mon Sep 29 10:59:49 2003 From: naragam at imaging.utk.edu (Nash Aragam) Date: Mon Jan 9 13:41:12 2006 Subject: OBB algorithm Message-ID: <03ee01c38691$f2b56560$971f24a0@imaging.utk.edu> Hi, Can somebody send me a link for a quick and easy code sample/algorithm for computing OBB on a cloud of 3D points? Thanks much, Nash Aragam naragam@acm.org -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20030929/e310b5c9/attachment.htm From contact at gd2003.org Wed Sep 10 21:29:57 2003 From: contact at gd2003.org (Graph Drawing 2003) Date: Mon Jan 9 13:41:12 2006 Subject: Graph Drawing 2003: Call For Participation Message-ID: Call For Participation 11th International Symposium on Graph Drawing GD2003 September 21-24, 2003, Perugia, Italy http://www.gd2003.org/ e-mail: contact@gd2003.org CONFERENCE THEMES ----------------- Graph Drawing is concerned with the geometric representation of graphs and networks and is motivated by those applications where it is crucial to visualize structural information as graphs. Bridging the gap between theoretical advances and implemented solutions is an important aspect of the conference. Indeed, advances in graph drawing are a key factor in such technological areas as Web computing, e-commerce, VLSI circuit design, information systems, software engineering, bioinformatics, networking, and cybergeography. GD 2003 aims at bringing together researchers and practitioners from industry and academia to advance the state of the art in graph drawing theory and to encourage wider uptake of graph drawing techniques in industry. The conference will benefit from the contributions of two distinguished invited speakers. 45 high quality papers (selected from 89 submissions) will be presented, drawn from a wide range of subjects including visualization of computer networks and Web maps, graph algorithms, visualization of software engineering diagrams, geometric graph theory and geometric computing, software systems and libraries for graph visualization, topology and planarity, graph combinatorics and optimization, and visualization of chemical structures and molecules. KEYNOTE SPEAKERS ---------------- - Pat Hanrahan (Stanford University, USA) - Giuseppe Italiano (Univ. of Rome Tor Vergata, Italy) PRELIMINARY PROGRAM AND REGISTRATION ------------------------------------ Preliminary Program and Registration information can be found on the conference web pages: http://www.gd2003.org/ GRAPH DRAWING CONTEST --------------------- The tenth annual graph drawing contest "Drawing Graphs within Graphs", organized by Franz J. Brandenburg (University of Passau), will be held in conjunction with the 11th International Symposium on Graph Drawing 2003. The deadline for the graph drawing contest submissions is August 15, 2003. More details can be found on the contest website (please follow the hyperlink from http://www.gd2003.org/). ------------- 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 Sep 17 15:18:20 2003 From: marco.pellegrini at iit.cnr.it (Marco Pellegrini) Date: Mon Jan 9 13:41:12 2006 Subject: Post-doc position in combinatorics in Pisa, Italy. Message-ID: <5.1.0.14.0.20030917122800.02150bf0@mx.iit.cnr.it> Istituto di Informatica e Telematica Consiglio Nazionale delle Ricerche Pisa - Italy. We invite applications for a Postdoc position to be held at the Istituto di Informatica e Telematica of the Consiglio Nazionale delle Ricerche (CNR) of Italy. 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. In case of controversy the Italian version is the authoritative one. The fellowship is 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 data from the call is as follows. Call number 16 of September 15th 2003. level: Post-doc limitations: EU citizen or of Associated States, except Italians or non-Italians resident in Italy for more than 5 years. age: below 35 duration: 12 months gross salary: 29,000 Euro deadline for applications: October 10th, 2003. Theme: “A wide body of research on algorithmic aspects of the World Wide Web (such as information discovery and delivery) makes use of a representation of the web graph structure. Stochastic graph models have been proposed by many authors, which try to capture some of the relevant properties observed in the web, such as the occurrence of many cyber-communities, and that are not accurately modelled by the standard random graph model. In the project we will investigate the adequacy of proposed web models to drive the design and development of more efficient crawling agents. A specific issue addressed will be the analysis of the page overlap phenomenon, which severely limits the performance of current search engines At the moment Associated States of the European Union are: 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 can be found at: http://www.cordis.lu/fp5/enlargement/faq.htm. For more information contact: 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/20030917/1afb19c6/attachment.htm From ag2-ga3 at mpi-sb.mpg.de Sat Sep 13 20:25:46 2003 From: ag2-ga3 at mpi-sb.mpg.de (AG2 Guest Account 3) Date: Mon Jan 9 13:41:12 2006 Subject: TACAS 2004 Call For Papers (deadline: October 17) Message-ID: Call for Papers TACAS'04 [http://www.daimi.au.dk/%7Ecpn/tacas04/] Tenth International Conference on Tools and Algorithms for the Construction and Analysis of Systems A member conference of ETAPS 2004 [http://www.lsi.upc.es/etaps04/] European Joint Conferences on Theory and Practice of Software IMPORTANT DATES * October 17, 2003 Submission deadline * December 12, 2003 Notification of authors * January 9, 2004 Camera ready version due * March 29 - April 2, 2004 TACAS 2004 Conference PROGRAM COMMITTEE Jonathan Billington, University of South Australia, Adelaide (Australia) Bernard Boigelot, Université de Liège (Belgium) Ed Brinksma, University of Twente (The Netherlands) Witold Charatonik, University of Wroclaw (Poland) Rance Cleaveland, SUNY Stony Brook (USA) Giorgio Delzanno, Università di Genova (Italy) David L. Dill, Stanford University (USA) Susanna Donatelli, Università degli Studi di Torino (Italy) Javier Esparza, University of Edinburgh (UK) John Hatcliff, Kansas State University (USA) Kurt Jensen (co-chair), University of Aarhus (Denmark) Orna Kupferman, Hebrew University, Jerusalem (Israel) Yassine Lakhnech, Verimag Grenoble (France) Kim Larsen, Aalborg University (Denmark) Anca Muscholl, Université Paris 7 (France) Anna Philippou, University of Cyprus (Cyprus) Andreas Podelski (co-chair), Max-Planck-Institut Saarbrücken (Germany) Jaco van de Pol, CWI Amsterdam (The Netherlands) Jakob Rehof, Microsoft Redmond (USA) Martin C. Rinard, MIT, Cambridge (USA) Bill Roscoe, Oxford University (UK) Bernard Steffen, Universität Dortmund (Germany) Ofer Strichman, Carnegie Mellon University, Pittsburgh (USA) Antti Valmari, Tampere University of Technology (Finland) Andreas Zeller, Universität des Saarlandes (Germany) CONFERENCE DESCRIPTION TACAS is a forum for researchers, developers and users interested in rigorously based tools for the construction and analysis of systems. The conference serves to bridge the gaps between different communities --- including but not limited to those devoted to formal methods, software and hardware verification, static analysis, programming languages, software engineering, real-time systems, and communications protocols --- that share common interests in, and techniques for, tool development. In particular, by providing a venue for the discussion of common problems, heuristics, algorithms, data structures and methodologies, TACAS aims to support researchers in their quest to improve the utility, reliability, flexibility and efficiency of tools for building systems. TACAS is a member conference of the European Joint Conferences on Theory and Practice of Software (ETAPS), which is the primary European forum for academic and industrial researchers working on topics relating to Software Science. ETAPS 2004 [http://www.lsi.upc.es/etaps04/] is the seventh joint conference in this series. The conference is organized by the Technical University of Catalonia (UPC) [http://www.upc.es]. Tool descriptions and case studies with a conceptual message and theoretical papers with a clear link to tool construction are all encouraged. The specific topics covered by the conference include, but are not limited to, the following: * Specification and verification techniques * Theorem-proving and model-checking * System construction and transformation techniques * Static and run-time analysis * Compositional and refinement-based methodologies * Testing and test-case generation * Analytical techniques for real-time, hybrid and safety-critical systems * Tool environments and tool architectures * Applications and case studies As TACAS addresses a heterogeneous audience, potential authors are strongly encouraged to write about their ideas in general and jargon-independent, rather than application- and domain-specific, terms. Authors reporting on tools or case studies are strongly encouraged to indicate how their experimental results can be reproduced and confirmed independently. TACAS 2003 received a *record number of submissions*: 140 research papers and 20 tool papers were submitted. The Program Committee selected 35 research papers and 6 tool papers, and invited 2 research paper submissions as tool papers. The average acceptance ratio was 27% (25% for research papers and 30% for tool papers). * Conference program 2003 [http://www.inrialpes.fr/vasy/tacas03/program.html] * On-line proceedings 2003 [http://link.springer.de/link/service/series/0558/tocs/t2619.htm] (available via Springer's LINK service) PROGRAM COMMITTEE CHAIRS Kurt Jensen, University of Aarhus (Denmark) [http://www.daimi.au.dk/~kjensen/] Andreas Podelski, Max-Planck-Institut Saarbrücken (Germany) [http://www.mpi-sb.mpg.de/~podelski] TOOL CHAIR Bernhard Steffen, Universität Dortmund (Germany) [http://ls5-www.cs.uni-dortmund.de/staff/steffen.de.html] INVITED SPEAKER Antti Valmari, Tampere University of Technology (Finland) [http://www.cs.tut.fi/~ava/] ------------------------------------------------------------------------ SUBMISSION GUIDELINES As with other ETAPS conferences, TACAS accepts two types of contributions: *research papers* and *tool demonstration papers*. Both types of contributions will appear in the proceedings and have oral presentations during the conference. Please notice that there are *two different conference services* for submission of papers: * The TACAS 2004 Conference Service is used for submission of research papers. * The TACAS 2004 TOOL Conference Service is used for submission of tool demonstration papers. -- Authors who anticipate possible last minute delays in the submission of a full research paper or a full tool demonstration paper are encouraged to submit a title and abstract well in advance of the deadline. -- Research papers Research papers cover one or more of the topics above, including tool development and case studies from a perspective of scientific research. Research papers are evaluated by the TACAS Program Committee. Submitted research papers *must*: * be in English and have a maximum of 15 pages, * present original research which is unpublished and not submitted elsewhere (conferences or journals) -- in particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden, * use the Springer-Verlag LNCS style [http://www.springer.de/comp/lncs/authors.html] * be submitted electronically in Postscript or PDF form via the TACAS 2004 Conference Service no later than October 17. Submissions deviating from these instructions may be rejected without review. Any questions regarding this policy should be directed to the Program Committee Chairs Kurt Jensen [http://daimi.au.dk/~kjensen/] or Andreas Podelski [http://www.mpi-sb.mpg.de/~podelski] prior to submitting. Tool demonstration papers Tool demonstration papers present tools based on aforementioned technologies (e.g., theorem-proving, model-checking, static analysis, or other formal methods) or fall into the above application areas (e.g., system construction and transformation, testing, analysis of real-time and hybrid systems, etc.). Tool demonstration papers are evaluated by the TACAS Tool Chair with the help of the Program Committee. Submitted tool demonstration papers *must*: * be in English and have a maximum of 4 pages, * have an appendix (not included in the 4 page count) that provides a detailed description of: o how the oral presentation will be conducted, e.g. illustrated by a number of snapshots, o the availability of the tool, the number and types of users, other information which may illustrate the maturity and robustness of the tool, o link to a web-page for the tool (if this exists). The appendix will *not* be included in the proceedings, but during the evaluation of the tool demonstration papers it will be *equally important* as the pages for the proceedings * use the Springer-Verlag LNCS style [http://www.springer.de/comp/lncs/authors.html] * be submitted electronically in Postscript or PDF form via the TACAS 2004 TOOL Conference Service no later than October 17. Submissions deviating from these instructions may be rejected without review. Any questions regarding this policy should be directed to the Tool Chair Bernhard Steffen [http://ls5-www.cs.uni-dortmund.de/staff/steffen.de.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 statistics at hicstatistics.org Mon Sep 15 17:22:57 2003 From: statistics at hicstatistics.org (Hawaii International Conference on Statistics) Date: Mon Jan 9 13:41:12 2006 Subject: Call for Papers - 2004 Hawaii International Conference on Statistics, Mathematics and Related Fields Message-ID: Call for Papers/Abstracts/Submissions Hawaii International Conference on Statistics, Mathematics and Related Fields June 9 - 12, 2004 Sheraton Waikiki Hotel, Honolulu Hawaii, USA Submission Deadline: January 21, 2004 Sponsored by: East West Council for Education Center of Asian Pacific Studies of Peking University Web address: http://www.hicstatistics.org Email address: statistics@hicstatistics.org The 2004 Hawaii International Conference on Statistics, Mathematics and Related Fields will be held from June 9 (Wednesday) to June 12 (Saturday), 2004 at the Sheraton Waikiki Hotel in Honolulu, Hawaii. The conference will provide many opportunities for academicians and professionals from statistics and/or mathematics related fields to interact with members inside and outside their own particular disciplines. Cross-disciplinary submissions with other fields are welcome. Topic Areas (All Areas of Statistics and/or Mathematics are Invited): Statistics Topics: Agricultural Statistics, Applied Statistics, Bayesian Statistics, Biostatistics, Business Statistics, Computational Statistics, Computer Simulations, Econometrics, Educational Statistics, Environmental Statistics, Epidemiology, Industrial Statistics, Management Science, Mathematical Statistics, Medical Statistics, Non-Parametric Statistics, Operations Research, Probability, Psychological Measurement, Quantitative Methods, Statistical Modeling, Statistics Education, Cross-disciplinary areas of Statistics, Other Areas of Statistics. Mathematics Topics: Algebra, Applied Mathematics, Calculus, Computational Mathematics, Discrete Mathematics, Foundations of Mathematics, Financial Mathematics, Finite Mathematics, Fractals, Geometry, History of Mathematics, Logic, Mathematics Education, Number Analysis, Number Theory, Pre-Algebra, Pre-Calculus, Probability, Topology, Cross-disciplinary areas of Mathematics, Other Areas of Mathematics. The Hawaii International Conference on Statistics, Mathematics and Related Fields encourages the following types of papers/abstracts/submissions for any of the listed areas: Research Papers - Completed papers. Abstracts - Abstracts of completed or proposed research. Student Papers - Research by students. Work-in-Progress Reports or Proposals for future projects. Reports on issues related to teaching. For more information about submissions see: http://www.hicstatistics.org/cfp_stats.htm Format of Presentations: -Paper sessions will have three to four papers presented in each 90 minute session, giving each presenter 20 ? 30 minutes. -Workshop presentations will be given a full 90 minute session. -Panel sessions will provide an opportunity for three or more presenters to speak in a more open and conversational setting with conference attendees. Submissions for these 90 minute sessions should include the name, department, affiliation, and email address of each panelist in addition to a description of the presentation and the title page. -Poster sessions will last 90 minutes and consist of a large number of presenters. Poster sessions allow attendees to speak with the presenters on a one-to-one basis. Submitting a Proposal: 1. Create a title page for your submission. The title page should include: a. title of the submission b. topic area of the submission (chooses from above list) c. presentation format (choose from above list) d. name(s) of the author(s) e. department(s) and affiliation(s) f. mailing address(es) g. e-mail address(es) h. phone number(s) i. fax number(s) j. corresponding author if different than lead author 2. Email your abstract and/or paper, along with a title page, to statistics@hicstatistics.org Receipt of submissions will be acknowledged via email within 48 hours. If you do not wish to email your submission, you may send it via regular mail or fax to: Hawaii International Conference on Statistics, Mathematics and Related Fields P.O. Box 75023 Honolulu, HI, 96836, USA 808-947-2420 (Fax) ***If submitting via regular mail or fax, please supply two copies of your submission*** There is a limit of two contributed submissions per lead author. 3. Submissions will only be published in the conference proceedings if at least one of the authors registers and attends the conference. More information will be provided upon acceptance. 4. If you wish to be a session chair, please e-mail your request to statistics@hicstatistics.org and indicate the topic area in which you are interested. Registration for the conference is required to be a session chair. To be removed from this list, please reply to this e-mail with the word "Remove" in the subject heading. Hawaii International Conference on Statistics, Mathematics and Related Fields P.O. Box 75023 Honolulu, HI 96836 USA Telephone: (808) 946-9927 Fax: (808) 947-2420 E-mail: statistics@hicstatistics.org Website: www.hicstatistics.org ------------- 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 Mon Sep 22 11:28:42 2003 From: tamaldey at cis.ohio-state.edu (tamal dey) Date: Mon Jan 9 13:41:12 2006 Subject: Software for segmenting and matching shapes Message-ID: <3F6F071A.2080303@cis.ohio-state.edu> Dear all, It is our pleasure to release the first version of our SegMatch software that we developed at the Ohio State University for segmenting a shape into its salient features and matching two shapes based on this segmentation. The details and the download instructions can be found at http://www.cis.ohio-state.edu/~tamaldey/segmatch.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 t-asano at jaist.ac.jp Mon Sep 29 18:23:21 2003 From: t-asano at jaist.ac.jp (Tetsuo ASANO) Date: Mon Jan 9 13:41:12 2006 Subject: Associate Professor Message-ID: <200309290823.AA01251@TigersFather.jaist.ac.jp> Associate Professor Position Available in Computer Science Japan Advanced Institute for Science and Technology (JAIST) School of Information Science Ishikawa, Japan JAIST (Japan Advanced Institute of Science and Technology), School of Information Science, is seeking applications for the following position in the area of algorithms including computational geometry and combinatorial optimization. * Associate Professor We seek to appoint an associate professor who is expected to lead a research project and to supervise PhD research. This post is offered for a period of up to 10 years. A successful candidate must have a PhD in computer science (or closely related fields), and have a strong research record. We seek candidates with research interests in all areas of algorithms including computational geometry and combinatorial optimization. To apply, please send the following documents: 1. a detailed curriculum vitae, 2. names of three references with their email addresses, 3. a statement outlining the candidate's past research contribution and future research plan, and 4. copies of selected publications (up to 5) to: Prof. Tetsuo Asano School of Information Science Japan Advanced Institute for Science and Technology 1-1, Asahidai, Tatsunokuchi, Nomi, Ishikawa, Japan 923-1292 TEL : +81 761-51-1205, FAX : +81 761-51-1149 (admin. office) In order to be considered fully, all the documents should be arrived by December 12, 2003. JAIST is a graduate institute, founded in 1990, dedicated to research and graduate education in Knowledge Science, Information Science, and Materials Science. It is located in the suburbs of Kanazawa, a beautiful old city. School of Information Science at JAIST is one of largest and most active research centers in computer science in Japan, consisting of over 50 research staffs, about 300 master students and 70 PhD students. For more information on the posts or JAIST, please contact: Tetsuo Asano School of Information Science JAIST, Ishikawa 923-1292, Japan t-asano@jaist.ac.jp TEL : +81 761-51-1205, FAX : +81 761-51-1149 See also JAIST home page at http://www.jaist.ac.jp/ ------------- 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 pankaj at cs.duke.edu Wed Sep 24 23:52:48 2003 From: pankaj at cs.duke.edu (Pankaj Kumar Agarwal) Date: Mon Jan 9 13:41:12 2006 Subject: MSRI Workshop on Computational Geometry Message-ID: <200309250252.h8P2qmu8027736@kant.cs.duke.edu> Workshop on the Mathematical Foundations of Geometric Algorithms MSRI, October 13--17, 2003 TENTATIVE PROGRAM ----------------- Monday, October 13 ------------------ 9:00 - 10:00 David Mount, University of Maryland, Approximate Voronoi diagrams 10:00- 10:30 Tea 10:30- 11:00 TBA 11:00- 11:30 Jonathan Shewchuk, UC Berkeley, Anisotropic Voronoi diagrams and guaranteed-quality anisotropic mesh generation 11:30- 12:00 Jack Snoeyink, University of North Carolina, Pragmatic point ordering for Delaunay tessellation in 3D and 4D 12:00- 2:00 Lunch 2:00 - 2:30 Nina Amenta, UC Davis, Smooth surfaces from point clouds 2:30 - 3:15 Subhash Suri, UC Santa Barbara, Problems on the interface of geometry and economics 3:15 - 3:45 Tea 4:15 - 5:15 Herbert Edelsbrunner, Duke University, PL implementations of differential topology concepts and their applications (MSRI-Evans Talk, at Evans Hall) Tuesday, October 14 ------------------- 9:00 - 10:00 Pankaj Agarwal, Duke University, Geometric approximation using core sets 10:00- 10:30 Tea 10:30- 11:00 Sariel Har-Peled, UIUC, On core sets and shape fitting in high dimensions 11:00- 11:30 Joseph S.B. Mitchell, SUNY at Stony Brook, On some geometric optimal path and network problems 11:30- 12:00 Leonidas J. Guibas, Stanford University, What is new with kinetic data structures? 12:00- 2:00 Lunch 2:00 - 3:00 Dan Halperin, Tel Aviv University, Exact, rounded, or perturbed: How would you like your arrangements? 3:00 - 3:30 Tea 3:30 - 4:30 Vladlen Koltun, MSRI, Arrangements of surfaces: A state of the art report Wednesday, October 15 --------------------- 9:00 - 10:00 Bernd G\"artner, ETH Z\"urich, Linear algebra and LP-type problems 10:00- 10:30 Tea 10:30- 11:00 Marie-Francoise Roy, Universit\'e de Rennes, Bernstein basis and real rool isolation. 11:00- 11:30 Thorsten Theobald, TU Muenchen, Computational complexity of stabbing, visibility and radii computations 11:30- 12:00 Boris Aronov, Polytechnic University, Efficient algorithms for bichromatic separability 1:00 - Outing Thursday, October 16 -------------------- 9:00 - 10:00 Santosh Vempala, MIT, How to compute the volume? 10:00- 10:30 Tea 10:30- 12:00 Open Problem Session 12:00- 2:00 Lunch 2:00 - 2:30 Kasturi Varadarajan, University of Iowa, Bipartite perfect matching in the plane 2:30 - 3:00 Yusu Wang, Duke University, Capturing topological and geometric features of molecular surfaces for protein docking 3:00 - 3:30 Tea 3:30 - 4:30 Patrice Koehl, Stanford University, Protein shape descriptors Friday, October 17 ------------------ 9:00 - 10:00 Timothy Chan, University of Waterloo, Approximation algorithms for diameter, width, and related problems 10:00- 10:30 Tea 10:30- 11:00 Shakhar Smorodinsky, MSRI, On conflict-free colorings 11:00 -11:30 Uli Wagner, MSRI, Learning about manifolds from samples 11:30- 2:00 Lunch 2:00 - 3:00 Bernard Chazelle, Princeton University, Geometric computing with uncertain, missing, or overabundant data 3:00 - 3:30 Tea 3:30 - 4:00 Eti Ezra, Tel Aviv University, Output-sensitive construction of the union of triangles 4:00 - 4:30 Yi-Jen Chiang, Polytechnic University, Progressive simplification of tetrahedral meshes preserving all isosurface topologies ------------- 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 jeffe at cs.uiuc.edu Tue Sep 30 11:18:51 2003 From: jeffe at cs.uiuc.edu (Jeff Erickson) Date: Mon Jan 9 13:41:12 2006 Subject: OBB algorithm In-Reply-To: <03ee01c38691$f2b56560$971f24a0@imaging.utk.edu> Message-ID: <65B1B826-F359-11D7-ABEA-000393D612E0@cs.uiuc.edu> Nash Aragam wrote: > Can somebody send me a link for a quick and easy code sample/algorithm > for computing OBB on a cloud of 3D points? Thanks much, I assume by "OBB" you mean "oriented bounding box", ie, the minimum-volume box, in any orientation, that contains all the points. For the fastest known exact algorithm, which runs in O(n^3) time, see Joe O'Rourke's paper "Finding Minimal Enclosing Boxes" (International Journal of Computer and Information Sciences 14:183-199, 1985). Sorry, it's not online, but it's worth the trip to the library. Here's code to quickly compute a provably-good approximation: http://valis.cs.uiuc.edu/~sariel/research/papers/00/diameter/ diam_prog.html For a description of the algorithm, see http://valis.cs.uiuc.edu/~sariel/research/papers/98/bbox.html Sariel and Gill's paper also includes a description of several commonly-used heuristics, none of which is guaranteed to be very good, although most of them are decent in practice. -- Jeff ------------- 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 pagh at it-c.dk Thu Sep 4 15:33:27 2003 From: pagh at it-c.dk (Rasmus Pagh) Date: Mon Jan 9 13:41:13 2006 Subject: =?ISO-8859-1?Q?SWAT_2004:_Call_for_papers_=28=E6ndret_af_Rasmus_?= =?ISO-8859-1?Q?Pagh=29?= Message-ID: <91EEC3D7-478C-11D8-8D78-000A95BCB2D4@it-c.dk> SWAT 2004 9th Scandinavian Workshop on Algorithm Theory July 8-10, 2004 Louisiana Museum of Modern Art, Humleb?k, Denmark http://swat.diku.dk/ Call for papers The Scandinavian Workshop on Algorithm Theory (SWAT) is a biennial international conference, held since 1988 in the five Nordic countries and intended to serve as a forum for researchers working on algorithms. We invite submissions of papers presenting original research in all areas of the algorithms field including, but not limited to, the following: - approximation algorithms, - computational biology, - computational geometry, - data structures, - distributed algorithms, - external-memory algorithms, - graph algorithms, - information retrieval, - online algorithms, - optimization algorithms, - parallel algorithms, - randomized algorithms, and - string algorithms. Submissions must be of at most 12 pages (plus, optionally, a clearly marked appendix to be read at the discretion of the program committee). Simultaneous submission to other conferences with published proceedings is not allowed. Contributors should preferably use an electronic submission procedure that will be set up and described at the conference web site http://swat.diku.dk/. Authors who do not have internet access are advised to contact the organizers (swat@diku.dk or telephone +45 35321416) at an early time to obtain information concerning alternative submission procedures. Every submission should list a corresponding author's e-mail address and fax number, if available. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science (LNCS, http://www.springer.de/comp/lncs/index.html). The final version of each accepted paper must be submitted in electronic form conforming to the LNCS style (see http://www.springer.de/comp/lncs/authors.html) and not exceeding 12 pages. SWAT alternates with the Workshop on Algorithms and Data Structures (WADS, http://www.wads.org), held in odd-numbered years. Important dates: Deadline for submission: February 10, 2004 at noon (GMT) Notification of authors: March 23, 2004 Final version due: April 20, 2004 End of early registration: May 4, 2004 Conference: July 8-10, 2004 For further information, please consult the conference web pages or send e-mail to swat@diku.dk. Conference chair: Jyrki Katajainen, University of Copenhagen Program committee: Arne Andersson, Uppsala University Therese Biedl, University of Waterloo Otfried Cheong, TU Eindhoven Artur Czumaj, New Jersey Institute of Technology Camil Demetrescu, University of Rome "La Sapienza" Amos Fiat, Tel Aviv University Gudmund Skovbjerg Frandsen, University of Aarhus Torben Hagerup, University of Augsburg (chair) Magn?s M. Halld?rsson, University of Iceland Jyrki Katajainen, University of Copenhagen Kim Skak Larsen, University of Southern Denmark Rolf Niedermeier, University of T?bingen Marina Papatriantafilou, Chalmers University of Technology Cynthia A. Phillips, Sandia National Laboratories Jan Arne Telle, University of Bergen Jukka Teuhola, University of Turku Steering committee: Svante Carlsson, Blekinge Institute of Technology Magn?s M. Halld?rsson, University of Iceland Rolf Karlsson, Lund University Andrzej Lingas, Lund University Erik Meineche Schmidt, University of Aarhus Jan Arne Telle, University of Bergen Esko Ukkonen, University of Helsinki Organizing committee: Joan Boyar, University of Southern Denmark Christopher Derek Curry, University of Copenhagen Lene Monrad Favrholdt, University of Southern Denmark Karin Outzen, University of Copenhagen Rasmus Pagh, IT University of Copenhagen Anna ?stlin, IT University of Copenhagen Related events: Workshop on On-Line Algorithms (OLA 2004), July 5-7, 2004, Kursuscentret Rungstedgaard, Rungsted Kyst, Denmark. For further information, see http://ola.imada.sdu.dk/. Summer School on Experimental Algorithmics, July 5-7, 2004. For further information, contact Jyrki Katajainen (jyrki@diku.dk). 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), July 12-16, 2004, Turku, Finland. For further information, see http://www.math.utu.fi/ICALP04/. ------------- 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.