From John.Dickinson at nrc.ca Wed Dec 1 14:19:54 1999 From: John.Dickinson at nrc.ca (Dickinson, John) Date: Mon Jan 9 13:40:56 2006 Subject: Detecting Intersections of orientated boxes Message-ID: <35C5DD9F60FED21192B00004ACA6E6C70A487E@nrclonex1.imti.nrc.ca> I am looking for any references on intersection detection algorithms for orientated boxes in 3D space, especially optimised algorithms for time critical simmulation applications. I have puzzled out some of the basics: Given two boxes of differing dimensions (length1, height1, width1) and (length2, height2, width2) positioned and orientated arbitrarily in space we want to quickly/cheaply determine if they intersect or not. Current best thought: Projects the edges of one box on three planar surfaces defined by three prependicular faces of the second box and look for overlaps of the projected lines with the rectanglar 2-D profile of the second box. Assuming I do this I would like any references to the fastest public domain line intersection checks. I believe there is one in a volume of Graphics Gems but I am not sure. Any suggestions? John -- -((Insert standard disclaimer here))-|- Washington Irving (1783-1859) - John Kenneth Dickinson | "A sharp tongue is the only Research Council Officer IMTI-NRC | edge tool that grows keener email: john.dickinson@nrc.ca | with constant use." ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From pankaj at cs.duke.edu Wed Dec 1 18:44:34 1999 From: pankaj at cs.duke.edu (Pankaj Kumar Agarwal) Date: Mon Jan 9 13:40:56 2006 Subject: Cal lfor Papers: SCG '00 Message-ID: <199912012344.SAA18817@polya.cs.duke.edu> FINAL CALL FOR PAPERS Sixteenth Annual Symposium on COMPUTATIONAL GEOMETRY SUBMISSION DEADLINE: Dec. 6, 1999 See the conference web page for e-submission instructions June 12-14, 2000 Hong Kong University of Science and Technology http://www.cs.ust.hk/tcsc/scg00.html Sponsored by ACM SIGACT and SIGGRAPH The Sixteenth Annual Symposium on Computational Geometry, featuring an applied track, a theoretical track, and a video review, will be held at Hong Kong University of Science and Technology, Hong Kong. We invite high-quality submissions in the following areas: * geometric algorithms or combinatorial geometry, for the theoretical track, or * implementation issues or applications of computational geometry, for the applied track. The proceedings, with the papers of both tracks, will be distributed at the symposium and will subsequently be available for purchase from ACM. A selection of papers will be invited to special issues of journals. During the conference, sessions of presentations will alternate between the two tracks, rather than being in parallel. Topics for the theoretical track include, but are not limited to design and theoretical analysis of geometric algorithms and data structures; lower bounds for geometric problems; and discrete and combinatorial geometry. Topics for the applied track include, but are not limited to experimental analysis of algorithms and data structures; mathematical and numerical issues arising from implementations; and novel uses of computational geometry in other disciplines, such as robotics, computer graphics, geometric and solid modeling, manufacturing, and geographical information systems. See below for additional information on the two tracks. Theoretical Track Submission Electronic submissions are preferred for the theoretical track (see web page above for instructions), but authors may instead mail 8 copies of an extended abstract to arrive by December 6, 1999 to Pankaj K. Agarwal Department of Computer Science LSRC Building, Rm D207 Duke University Durham, NC 27706 Phone: (919) 660-6540 pankaj@cs.duke.edu Applied Track Submission Electronic submissions are preferred for the applied track (see web page above for instructions), but authors may instead mail 11 copies of an extended abstract to arrive by December 6, 1999 to Steven Fortune Room 2c459 Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 Phone: (908) 582-7042 sjf@research.bell-labs.com Important Dates December 6, 1999: Papers due, both tracks February 13, 2000: Video submissions due February 15, 2000: Notification of acceptance or rejection of papers March 1, 2000: Notification of acceptance or rejection of videos March 15, 2000: Camera-ready papers due April 15, 2000: Final versions of videos due June 12-14, 2000: Symposium Papers that primarily address practical issues and implementation experience, even if not tied to a particular application domain, should be submitted to the applied track. Papers that primarily prove theorems should be submitted to the theoretical track. Most experimental work should be submitted to the applied track; an exception would be experiments in support of mathematical investigations. Submissions to one track may be forwarded to the other for consideration, unless the authors have explicitly stated interest in one track only. Papers should be submitted in the form of an extended abstract. Papers should begin with the title of the paper, each author's name, affiliation, and e-mail address, followed by a succinct statement of the problems and goals that are considered in the paper, the main results achieved, the significance of the work in the context of previous research, and a comparison to past research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages, using 11 point or larger font and with at least one-inch margins all around. For cases in which the authors consider it absolutely essential to include additional technical details that do not fit into 10 pages, these details may be added in a clearly marked appendix that should appear after the body of the paper and the references; this appendix will not be regarded as a part of the submission and will be considered only at the program committee's discretion. Abstracts in hard copy must be received by December 6, 1999, or postmarked by November 29 and sent airmail. Abstracts in electronic form are due by December 6, 5:00 PM EST. These are firm deadlines: late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 2000. A full version of each contribution in final form will be due by March 15, 2000 for inclusion in the proceedings. Conference Chairs Siu-Wing Cheng Otfried Cheong scheng@cs.ust.hk otfried@cs.ust.hk Theoretical Track Program Committee Pankaj K. Agarwal, Chair (Duke) Franz Aurenhammer (Graz) Mark de Berg (Utrecht) Herbert Edelsbrunner (Duke) Jeff Erickson (UIUC) Hazel Everett (Montreal) Klara Kedem (Ben Gurion) Applied Track Program Committee Gill Barequet (Technion) Steven Fortune, Chair (Bell Labs) Chris Gold (Laval U.) Ken Goldberg (Berkeley) Scott Mitchell (Sandia Labs) Tom Peters (U. Conn.) Jean Ponce (UIUC) Stefan Schirra (MPI) Subhash Suri (Wash. U.) ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From ziegler at math.TU-Berlin.DE Tue Dec 7 08:32:06 1999 From: ziegler at math.TU-Berlin.DE (Guenter M. Ziegler) Date: Mon Jan 9 13:40:56 2006 Subject: Oriented Matroids (Second edition) Message-ID: <199912070732.IAA17070@zaphod.math.TU-Berlin.DE> .... we are pleased to announce .... .... new in Paperback ..... .... now available ..... ORIENTED MATROIDS Second edition Anders Björner -- KTH Stockholm Michel Las Vergnas --- Paris 6/CNRS Bernd Sturmfels --- UC Berkeley Neil White --- U Florida & Günter M. Ziegler -- TU Berlin ``Oriented matroids are a very natural mathematical concept which presents itself in many different guises and which has connections and applications to many different areas. These include discrete and computational geometry, combinatorics, convexity, topology, algebraic geometry, operations research, computer science and theoretical chemistry. This is the second edition of the first comprehensive, accessible account of the subject. It is intended for a diverse audience: graduate students who wish to learn the subject from scratch; researchers in the various fields of application who want to concentrate on certain aspects of the theory; specialists who need a thorough reference work; and others at academic points in between. A list of exercises and open problems ends each chapter. For the second edition, the authors have expanded the bibliography greatly to ensure that it remains comprehensive and up-to-date, and they have also added an appendix surveying research since the book was first published.'' !From reviews of the first edition: ``Overall this is a book which is a classic of its type; it is a mine of information, which will be the authoritative source for many years to come.'' Bulletin of the London Mathematical Society Contents: Preface, Notation 1. A first orientation session 2. A second orientation session 3. Axiomatics 4. From face lattices to topology 5. Topological models for oriented matroids 6. Arrangements of pseudolines 7. Constructions 8. Realizability 9. Convex polytopes 10. Linear programming Appendix: Some current frontiers of research (NEW) Bibliography (EXTENDED) Index Encyclopedia of Mathematics and its Applications, Vol. 46 Cambridge University Press 1999 560 pages / 299 exercises / 138 figures ISBN 0 521 77750 X Paperback For further information see http://www.cup.cam.ac.uk or http://www.cup.org and/or my homepage http://www.math.tu-berlin.de (which also has the detailed table of contents and preface). ====================================================================== Prof. Dr. G\"unter M. Ziegler Fachbereich Mathematik, MA 7-1 Technische Universit\"at Berlin Strasse des 17. Juni 136 10623 Berlin Germany email: ziegler@math.tu-berlin.de http://www.math.tu-berlin.de/~ziegler Tel.: 49 - 30 - 314-25730 office Tel.: 49 - 30 - 314-23354 Secr. FAX: 49 - 30 - 314-24413 ====================================================================== ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From vlad at cs.newcastle.edu.au Mon Dec 13 22:41:02 1999 From: vlad at cs.newcastle.edu.au (Vladimir Estivill-Castro) Date: Mon Jan 9 13:40:56 2006 Subject: COCOON-2000 Message-ID: <199912131141.WAA03278@olive.newcastle.edu.au> We apologize if you have received this before. COCOON'2OOO --- Call for Papers --- Sixth Annual International Computing and Combinatorics Conference July 26-28, 2000, Bondi Beach , Sydney , Australia The Sixth Annual International Computing and Combinatorics Conference, COCOON'2000, will be held in Bondi Beach , Sydney , Australia July 26--28, 2000 (a few weeks before the XXVII Olympics, September 15 -- October 1). The conference aims to provide a forum for researchers in theoretical computer science. The conference will be followed by the 11th Australasian Workshop on Combinatorial Algorithms (AWAOCA). Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In additional to theoretical results, submissions that report substantial results in experimental and applied research are encouraged. Typical, but not exclusive, topics of interest include: * algorithms and data structures * automata, languages and logic * combinatorics related to algorithms and complexity * complexity theory * computational algebra, biology, geometry, and number theory * computational learning theory and knowledge discovery * cryptography and database theory * graph drawing and information visualization * graph theory, communication networks, and optimization * parallel and distributed computing Submissions to the conference this year will again be conducted electronically. Authors should follow the submission guidelines and send a PostScript file of a paper (in English) by February 8, 2000. The submission guidelines are in http://www.cs.newcastle.edu.au/~cocoon2000/submission.html Our home page is: http://www.cs.newcastle.edu.au/~cocoon2000 Alternatively, authors unable to access e-mail may send 6 hard copies of their papers to: Xuemin Lin - COCOON'2000 School of Computer Science and Engineering University of New South Wales Sydney, NSW 2052, Australia. e-mail: lxue@cse.unsw.edu.au A paper should start with the title of the paper, each author's name, affiliation, e-mail address, and a short summary of the main results. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance to the conference. The length of the paper should not exceed 10 pages (using 11 point or larger font, with ample margins all around). If necessary, authors may include a clearly marked appendix that will be read at the discretion of the Program Committee. An abstract of the paper must be submitted electronically by February 1, 2000. Authors will be notified of acceptance or rejection by March 30, 2000. A camera-ready copy of each accepted paper will be required by April 26, 2000. The proceedings of the conference will be published by Springer-Verlag in the Lecture Notes in Computer Science series, and will be available for distribution at the conference. The Hao Wang award will be given to the best paper (details given on our home page). We also introduce an award for the best paper from a young researcher (at most 3 years since PhD). Program Committee Co-Chairs =========================== Ding-Zhu Du (U. of Minnesota, USA) Peter Eades (Newcastle, Australia) Xuemin Lin (New South Wales, Australia) Conference Co-Chairs ==================== Vladimir Estivill-Castro (Newcastle, Australia) Arun Sharma (New South Wales, Australia) Program Committee ================= David Avis (McGill, Canada), Jianer Chen (Texas A&M, USA), Francis Chin (Hong Kong U, Hong Kong), Vladimir Estivill-Castro (Newcastle, Australia), George Havas (UQ, Australia), Hiroshi Imai (Tokyo, Japan), Tao Jiang (UC Riverside, USA), Richard Karp (UC Berkeley, USA), Michael Juenger (Cologne, Germany), D. T. Lee (Academia Sinica, Taiwan), Bernard Mans (Macquarie U., Australia), Brendan McKay (ANU, Australia), Maurice Nivat (Universitie de Paris VII, France), Takeshi Tokuyama (Tohoku, Japan), Roberto Tamassia (Brown, USA), Jie Wang (UNC Greensboro, USA), Shmuel Zaks (Technion, Israel), Louxin Zhang (NUS, Singapore), Shuzhong Zhang (CUHK, Hong Kong), Binhai Zhu (City U Hong Kong, Hong Kong) Invited Speakers ================ * Christos H. Papadimitriou (University of California, Berkeley) * Richard Brent (Oxford University Computing Laboratory) Important Dates =============== * Submission of Abstracts: February 1, 2000 * Submission of Papers: February 8, 2000. * Notification of Acceptance: March 30, 2000. * Final Version: April 26, 2000. * Conference: July 26-28, 2000 . Location ======== The conference will be held at the Swiss-Grand Hotel in Bondi Beach , Sydney , Australia. Further Information =================== Please contact cocoon2000@cse.unsw.edu.au for further information. Sponsors ======== * University of New South Wales * University of Newcastle * Computer Science Association of Australasia ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From autoform at autoform.ch Thu Dec 16 08:08:59 1999 From: autoform at autoform.ch (autoform) Date: Mon Jan 9 13:40:56 2006 Subject: planar embedding (Katrin Dobrindt) Message-ID: <3.0.6.32.19991216080859.008aca40@pop.eunet.ch> Hi, Perhaps somebody can help me with the following problem or give me a pointer to relevant literature. Given: an arbitrary triangulated mesh in 3-space (with boundaries and holes) Searched : its embedding in the plane. with - an easy-to-implement algorithm; its theoretical complexity is not very important, since these meshes usually have less than 10,000 triangles. by preference - ideally, the planar triangles would have a 'similar' shape as their corresponding triangles in space, - or at least, they should not be too 'bad' for the following FE-calculations, i.e. obtuse angles should be avoided etc. If you have any idea, please answer to my 'personal' mail account. Thanks, Katrin Dobrindt. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From pchin at wlu.ca Tue Dec 14 12:24:13 1999 From: pchin at wlu.ca (Paulina Chin) Date: Mon Jan 9 13:40:56 2006 Subject: ISSAC 2000: Update to Call for Papers Message-ID: <000201bf4658$2fc0bcd0$50f0dbc0@pchin.wlu.ca> Please note that the submission deadline for papers has been changed to Jan. 17, 2000. The original anouncement is included below. If you are receiving duplicate mailings or wish to be removed from the ISSAC 2000 mailing list, please send e-mail to pchin@wlu.ca. --------------------------------------------------------------------------- ANNOUNCEMENT AND CALL FOR PAPERS ISSAC 2000 International Symposium on Symbolic and Algebraic Computation St Andrews University, Scotland, August 6-9, 2000 http://www-gap.dcs.st-and.ac.uk/issac2000 ACM sponsorship pending ISSAC provides an opportunity to learn of new developments and to present original research in all areas of symbolic and algebraic computation. ISSAC 2000 will be held at St Andrews University, Scotland's oldest university. Planned activities include invited presentations, research and survey papers, poster sessions, tutorial courses, vendor exhibits and software demonstrations. CONFERENCE TOPICS Topics of the meeting include, but are not limited to: Algorithmic mathematics: Algebraic, symbolic, and symbolic-numeric algorithms including: simplification, polynomial and rational function manipulations, algebraic equations, summation and recurrence equations, integration and differential equations, linear algebra, number theory, group computations, and geometric computing; Computer sciences: Theoretical and practical problems in symbolic mathematical manipulation including: computer algebra systems, data structures, computational complexity, problem solving environments, programming languages and libraries for symbolic-numeric-geometric computation, user interfaces, visualization, software architectures, parallel or distributed computing, mapping algorithms to architectures, analysis and benchmarking, automatic differentiation and code generation, automatic theorem proving, mathematical data exchange protocols; Applications: Problem treatments incorporating algebraic, symbolic, symbolic-numeric and geometric computation in an essential or novel way, including engineering, economics and finance, architecture, physical and biological sciences, computer sciences, logic, mathematics, statistics, and uses in education. CALL FOR PAPERS Research results and insightful analyses of current concerns are the primary focus. Papers will be reviewed by the Program Committee and additional referees. Survey articles may be suitable for submission, if clearly identified as such, and will be considered in a separate category from the research papers. Simultaneous submission for publication elsewhere is not allowed. Authors are invited to submit papers to the Program Committee Chair before January 17, 2000. Submission instructions can be obtained from the conference Web page or by sending e-mail to bajaj@cs.utexas.edu. A poster session will be organized separately. Information is available on the conference Web site. FURTHER INFORMATION For more information, please refer to the conference Web page, http://www-gap.dcs.st-and.ac.uk/issac2000. E-mail inquiries may be sent to issac2000@dcs.st-and.ac.uk or to one of the conference committee members listed below: General Chair: Tomas Recio, recio@matesco.unican.es Local Arrangements Chair: Steve Linton, sal@dcs.st-and.ac.uk Program Committee Chair: Chandrajit Bajaj, bajaj@cs.utexas.edu Tutorial Chair: Josef Schicho, josef.schicho@risc.uni-linz.ac.at Exhibitor Chair: Marc Moreno Maza, Numerical Algorithms Group, marc@nag.co.uk Poster Session Chair: Arjeh Cohen, amc@win.tue.nl Editor: Carlo Traverso, traverso@posso.dm.unipi.it Treasurer: Colin Campbell, cmc@st-andrews.ac.uk Publicity Chair: Paulina Chin, pchin@wlu.ca ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From klara at CS.bgu.ac.il Tue Dec 21 17:02:34 1999 From: klara at CS.bgu.ac.il (klara kedem) Date: Mon Jan 9 13:40:56 2006 Subject: EuroCG 2000 - upcoming deadline + travel information Message-ID: <199912211502.RAA22335@cyan.cs.bgu.ac.il> +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 16TH EUROPEAN WORKSHOP ON COMPUTATIONAL GEOMETRY March 13-14-15 2000 Eilat Club Hotel, Eilat, Israel +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Deadline for submissions is January 7th, 2000 For further information (including NEW travel information) please see our web site http://www.cs.bgu.ac.il/~cg2000 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From jjh3710 at cs.rit.edu Tue Dec 21 03:53:58 1999 From: jjh3710 at cs.rit.edu (Javid Huseynov) Date: Mon Jan 9 13:40:56 2006 Subject: planar embedding (Katrin Dobrindt) In-Reply-To: <3.0.6.32.19991216080859.008aca40@pop.eunet.ch> Message-ID: This problem can be attempted by finding an embeddable (or realizable) configuration that is topologically equivalent to the mesh in 3 space. Namely, you can build a planar configuration that has the same triangle orientations, or counterclockwise predicates as the one in question. If you imagine this mesh as a point system and extract consecutive convex hulls, you may attempt placing those hulls on a Euclidean plane while checking that all counterclockwise predicates satisfy. I did this for some systems on up to 30 points. Perhaps, "Axioms and Hulls" by Donald Knuth would help. Also, there is a signficant research done by Goodman and Pollack, Ringel, etc. In general, Peter Shor has proved that problem of deciding whether or not an arbitrary point system is embeddable or not is NP-hard. But you may test the embeddability in polynomial time. Good luck. ---------------------------------------------------------- Javid Huseynov * Information and Computer Science PhD Student * University of California Irvine javid@baku.ics.uci.edu * http://www.ics.uci.edu/~javid ---------------------------------------------------------- On Thu, 16 Dec 1999, autoform wrote: > > Hi, > > Perhaps somebody can help me with the following problem or give me a > pointer to relevant literature. > > Given: an arbitrary triangulated mesh in 3-space (with boundaries and > holes) > Searched : its embedding in the plane. > > with > - an easy-to-implement algorithm; its theoretical complexity is not very > important, since these meshes usually have less than 10,000 triangles. > > by preference > - ideally, the planar triangles would have a 'similar' shape as their > corresponding triangles in space, > - or at least, they should not be too 'bad' for the following > FE-calculations, i.e. obtuse angles should be avoided etc. > > If you have any idea, please answer to my 'personal' mail account. > > Thanks, > > Katrin Dobrindt. > > > ------------- > The compgeom mailing lists: see > http://netlib.bell-labs.com/netlib/compgeom/readme.html > or send mail to compgeom-request@research.bell-labs.com with the line: > send readme > Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. > ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From alt at inf.fu-berlin.de Mon Dec 20 20:29:09 1999 From: alt at inf.fu-berlin.de (Helmut Alt) Date: Mon Jan 9 13:40:56 2006 Subject: Ph.D. and Postdoc scholarships Message-ID: <199912281639.LAA07092@duke.cs.duke.edu> ---------------------------------------------------------------------------- European Graduate Program Berlin ------------------------------------------ Zurich Combinatorics, Geometry, and Computation ---------------------------------------------------------------------------- In the newly established graduate program two-year scholarships for Ph.D.students are available in Berlin and Zurich starting April 1st, 2000. Applicants should have a degree in mathematics, computer science, or a related area equivalent to the German or Swiss university diploma (e.g. M.S.) with grades significantly above average. Furthermore at each location a postdoctoral position is available for at most two years. The program is a joint initiative of the ETH Zurich, the three universities of Berlin - Free University, Technical University, Humboldt-University - and the Konrad-Zuse-Research Center. The German partners are financially suppor- ted by the German Research association (Deutsche Forschungsgemeinschaft, DFG). The amount of the scholarships in Berlin is calculated according to the guidelines of the DFG and is up to DM 2690 per month, tax free (family supplement DM 400). The scientific program ranges from theoretical fundamentals to applications. The areas of research are combinatorics, geometry, optimization, algorithms and computation, computer graphics, and vision. In Berlin the students are supervised by the professors Aigner, Alt, Rote, Schulz (FU), Moehring, Zieg- ler (TU), Proemel (HU) and Groetschel (ZIB). The participating professors at ETH Zurich are Fukuda, Van Gool, M. Gross, Luethi, Nievergelt, Richter-Ge- bert, Schiele, Welzl und Widmayer. Applications with curriculum vitae, copies of certificates, theses, a letter of recommendation of the last advisor, a brief description of the proposed research and, especially for applicants for the postdoctoral position, re- prints of publications should be sent in until Februar 2, 2000 to one of the speakers of the program: in Berlin in Zurich Prof. Dr. Helmut Alt Prof. Dr. Emo Welzl Institut fuer Informatik Institut fuer Theoretische Informatik Freie Universitaet Berlin ETH Zentrum Takustrasse 9 CH-8092 Zurich D-14195 Berlin Further Information can be obtained from Bettina Felsner Emo Welzl Tel. ++49-30-838 75 104 Tel. ++41-1-63 273 92 bfelsner@inf.fu-berlin.de emo@inf.ethz.ch Internet: http://www.inf.fu-berlin.de/gk-cgc --------------------------------------------------------------------------- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From mehlhorn at mpi-sb.mpg.de Wed Dec 29 09:44:26 1999 From: mehlhorn at mpi-sb.mpg.de (mehlhorn@mpi-sb.mpg.de) Date: Mon Jan 9 13:40:56 2006 Subject: LEDA: A Platform for Combinatorial and Geometric Computing Message-ID: <199912290844.JAA04813@mpii-km.ag1.mpi-sb.mpg.de> Stefan N"aher and Kurt Mehlhorn are proud to announce the LEDAbook. The LEDAbook is now available from Cambridge University Press. We quote from the announcement by Cambridge University Press. ``The book provides a comprehensive treatment of the LEDA system and its use. Written by the main authors of the system, it treats the architecture of the system, discusses the functionality of the data types and algorithms available in the system, gives the implementation of many modules of the system, and illustrates the use of LEDA in many examples. The book is essential for all workers in combinatorial and geometric computing, for casual or intensive users of LEDA, for library designers and software engineers, and for students taking an algorithms course.'' The book has about 1000 pages and is divided into 14 chapters. Chapter 1, Introduction page 1 Chapter 2, Foundations 16 Chapter 3, Basic Data Types 58 Chapter 4, Numbers and Matrices 99 Chapter 5, Advanced Data Types 121 Chapter 6, Graphs and their Data Structures 240 Chapter 7, Graph Algorithms 283 Chapter 8, Embedded Graphs 498 Chapter 9, The Geometry Kernels 581 Chapter 10, Geometry Algorithms 637 Chapter 11, Windows and Panels 813 Chapter 12, GraphWin 857 Chapter 13, On the Implementation of LEDA 904 Chapter 14, Manual Pages and Documentation 963 You may download some of the chapters from the LEDA book home page http://www.mpi-sb.mpg.de/~mehlhorn/LEDAbook.html and you may order the book from Cambridge University Press. http://www.cup.cam.ac.uk/Scripts/webbook.asp?isbn=0521563291 Enjoy, Stefan and Kurt ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html.