From reddyg at Glue.umd.edu Mon Sep 2 08:37:59 2002 From: reddyg at Glue.umd.edu (Prabhakar Reddy Gudla Venkata Siva) Date: Mon Jan 9 13:41:07 2006 Subject: n-cube and symmetry Message-ID: Dear Listers, Before I pose the question, I will attempt to explain the problem (with answer) for 2d and 3d for better understandability. 2D:: Given a square, if one had to splice the 4 edges into 2 equal halves, how many unique configurations would be possible -- including the case when none of it's edges are spliced ? # of edges split(k): 0 1 2 3 4 Total # of ways : 1 4(4c1) 6(4c2) 4(4c3) 1(4c4) 2^4 = 16 # of unique ways : 1 1 2 1 1 6 The first row is the number of edges (k) which are spliced at the middle. The second row gives the number of possible ways in which one can split the square along k-edges. The third row shows the number of unique configurations. The results of the 3rd row for 2D case are shown in the attachment (GIF). 3D: Given a cube, if one had to splice the 6 faces into 4 equal halves, how many unique configurations would be possible -- including the case when none of it's edges are spliced ? # of faces split: 0 1 2 3 4 5 6 Total # of ways : 1 6(6c1) 15(6c2) 20(6c3) 15(6c4) 6(6c5) 1(6c6) 2^6=64 # of unique ways: 1 1 2 2 2 1 1 10 The question for n >= 4: nD: Given a n-cube, if one had to splice the 2*n cells (which are (n-1)D cubes) into 2*(n-1) equal sub-cells, how many unique configurations would be possible (after removing symmetric cases)-- including the case when none of it's edges are spliced ? regards -- *******************************--------------********************************** GVS Prabhakar Reddy Research Assistant Model Analysis Lab (GIS Lab) Dept. of Biological Resources Engineering University of Maryland College Park, MD, 20742. tel: 301-405-0109 (o) : 301-982-7148 (r) fax: 301-314-9023 email: reddyg@glue.umd.edu **************************--------------------********************************* -------------- next part -------------- A non-text attachment was scrubbed... Name: square.gif Type: image/gif Size: 31354 bytes Desc: Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20020902/5decaeeb/square.gif From thao.dang at imag.fr Thu Sep 5 19:00:54 2002 From: thao.dang at imag.fr (Thao Dang) Date: Mon Jan 9 13:41:07 2006 Subject: Intersection detection References: Message-ID: <3D777FB6.560CF33C@imag.fr> Hi, I am looking for algorithms/code to detect whether 2 sets of convex polyhedra (in GENERAL dimension) intersect. I would appreciate any advice. Thanks. Thao. =============================================== Thao Dang Verimag, Office 3 Centre Equation -- 2, avenue de Vignate 38610 GIERES, France Email: Thao.Dang@imag.fr Tel: +33 4 76 63 48 33 -- Fax: +33 4 76 63 40 50 http://www-verimag.imag.fr/~tdang =============================================== ------------- 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 honestcox at excite.com Mon Sep 9 16:29:43 2002 From: honestcox at excite.com (Bradford Cox) Date: Mon Jan 9 13:41:07 2006 Subject: Outer Offset Polygons Message-ID: <20020909192943.08F61B76F@xmxpita.excite.com> Does anyone have any ideas or suggestions for creating an outer offset polygon from a given set of points that might form a simple, convex or non-convex polygon? The points and offset distance will be known. I guess the real problem I face is for non-convex polygons which may have sides that run into each other as the polygon grows. I recently did a posting for inner offsets and have since solved that problem (for the most part) by using straight skeletons. Any suggestions/advice will be appreciated. Thanks! Bradford Cox ------------------------------------------------ Changed your e-mail? Keep your contacts! Use this free e-mail change of address service from Return Path. Register now! -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20020909/d0fc316c/attachment.htm From michas at tau.ac.il Mon Sep 9 17:11:27 2002 From: michas at tau.ac.il (Sharir Micha) Date: Mon Jan 9 13:41:07 2006 Subject: Geometry Semester at MSRI next fall Message-ID: <200209091311.g89DBRw12873@tau.ac.il> MSRI HALF-YEAR PROGRAM IN DISCRETE AND COMPUTATIONAL GEOMETRY August 11 to December 19, 2003 Mathematical Sciences Research Institute Berkeley, California Organizers: Jesus A. De Loera, Herbert Edelsbrunner, Jacob E. Goodman, Janos Pach, Micha Sharir, Emo Welzl, and Guenter M. Ziegler For the Fall, 2003 semester, the Mathematical Sciences Research Institute in Berkeley is planning a half-year program in Discrete and Computational Geometry. This program will bring together mathematicians and computer scientists interested in problems in this area, with two chief goals: (1) To advance research in the field, and (2) To enhance the interaction between the study of purely combinatorial properties of geometric structures and the design and analysis of efficient algorithms that construct and manipulate those structures. Here is a sample of topics we plan to cover in which substantial activity has recently taken place: Extremal and reconstruction problems for polytopes Lattice polytopes and connections to algebraic geometry and to optimization Geometric computing in structural molecular biology Volume estimation of polyhedra Computational questions in topology Oriented matroids and combinatorial convexity Curve and surface reconstruction Geometric graph theory and problems of Erdos type Geometric deformation, rigidity of structures, realization spaces Optimal triangulations and meshes Arrangements of surfaces To achieve our goals, we will have several long-term senior visitors, including most of the proposed organizers, who will coordinate the research activities in ways that will promote the desired interaction and synergy. This will be achieved by their own research agenda, as well as by the organization of weekly series of seminars (e.g., a research colloquium and a postdoc seminar). The research areas of the organizers span most of the topics mentioned above, so that their presence at MSRI will ensure a wide coverage of these research topics. In addition to these ongoing activities, which will involve senior long-term visitors, postdocs, and shorter-term visitors, we will organize the following three workshops: Discrete and Computational Geometry (introductory workshop): August 18--29, 2003 Mathematical Foundations of Geometric Algorithms: October 13--17, 2003 (tentative) Combinatorial and Discrete Geometry: December 15--19, 2003 (tentative) We invite applications for long- and short-term memberships in MSRI for the Fall, 2003 program. Some support is available if needed, but the deadlines are very close for some types of memberships. For detailed information, both about the program and about applying for a membership, visit the MSRI Web site, at http://www.msri.org, and click on `programs' or on `application materials', respectively. ------------- 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 Remco.Veltkamp at cs.uu.nl Mon Sep 9 18:05:41 2002 From: Remco.Veltkamp at cs.uu.nl (Remco Veltkamp) Date: Mon Jan 9 13:41:07 2006 Subject: PhD project: Algorithms for Music Retrieval Message-ID: <5.1.1.6.2.20020909165823.02c3bfb0@imaps.cs.uu.nl> PhD Post in Music Retrieval (vacancy number 62205) The Institute of Information and Computing Science (ICS) at Utrecht University (the Netherlands) offers a 4-year PhD research project for a project in music retrieval: Orpheus (On-line Retrieval from Polyhymnia: the Human-oriented Experimental Utrecht Searcher). The objective of the Orpheus project is to develop algorithms for music retrieval from large collections. Specifically, it addresses the following three issues: * Matching. Given a query theme or melody and one from a collection, determine how similar they are. * Indexing. Given a large collection of music, build a data structure to efficiently search for those pieces similar to the query. * Relevance feedback. Given a selection from the collection, with positive and negative assessments from the user, find music that is more similar to the positively labeled music, and more dissimilar to the negatively labeled music. Requirements: Master Computer Science, Artificial Intelligence, Mathematics, or any other relevant discipline; demonstrable knowledge of, and fondness for music. Job type: "Assistent in Opleiding, AIO" (PhD student) Closing date for application: 1 October 2002 Salary: max. ? 2063 / month The project description is available at http://www.cs.uu.nl/centers/give/imaging/music/orpheus.html. A brief job description is at http://www.cs.uu.nl/vacatures/62205.html For more information and application contact: Frans Wiering (frans.wiering@cs.uu.nl) or Remco Veltkamp (remco.veltkamp@cs.uu.nl) -------------------------------------------------------------------- Remco Veltkamp, Remco.Veltkamp@cs.uu.nl Center for Geometry, Imaging, and Virtual Environments Institute of Information and Computing Sciences, Utrecht University Padualaan 14, 3584 CH Utrecht, The Netherlands phone: +31-30-2534091, fax: +31-30-2513791 -------------------------------------------------------------------- ------------- 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 gert at cs.rug.nl Thu Sep 12 14:32:28 2002 From: gert at cs.rug.nl (Vegter) Date: Mon Jan 9 13:41:07 2006 Subject: postdoc position in groningen Message-ID: <3D807B4C.3080609@cs.rug.nl> POSTDOC COMPUTATIONAL GEOMETRY Institute of Mathematics and Computing Science University of Groningen The Netherlands http://www.cs.rug.nl/~gert/vacancies/postdoc-geometry.html Topics of research Current research in Computational Geometry in Groningen is focused on robust computation with curves and surfaces, surface meshing and visualization. The group participates in the european project Effective Computational Geometry of Curves and Surfaces in collaboration with several other universities and research institutes. Type and level of the position This is a temporary research position for a period of at least one year, which will most likely be extended with an other year. The position is embedded in the research group High-Performance Computing and Imaging . Supervisor will be Gert Vegter . Your qualifications You have a PhD in Computer Science or Mathematics, and you are interested in research in Computational Geometry, Computer Graphics, or Computer Aided Geometric Design, preferably with experience in geometric software libraries like CGAL . In particular your research interests match those of the group in Groningen. You are expected to have an excellent academic record, to be proven by your PhD thesis and publications in scientific journals. You should be fluent in English How to apply Send your application, including a CV and a description of your ideas for research in the specified area to Gert Vegter (gert@cs.rug.nl ). The position will be open until a suitable candidate is found. Applicants are also requested to ask that two letters of recommendation be sent to this address. +++++++++++++++++++++++++++++++++++++++++++++++++ + Gert Vegter + + Dept. of Math. and Comp. Science + + University of Groningen + + P.O. Box 800 + + 9700 AV Groningen + + The Netherlands + + Phone: +31 50 363 3930 (3939) + + Fax: +31 50 363 3800 + + URL: http://www.cs.rug.nl/~gert + +++++++++++++++++++++++++++++++++++++++++++++++++ ------------- 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 lewis at bway.net Wed Sep 11 16:33:25 2002 From: lewis at bway.net (Robert Lewis) Date: Mon Jan 9 13:41:07 2006 Subject: closest point of arbitrary conic to origin in 3D In-Reply-To: <20020909192943.08F61B76F@xmxpita.excite.com> Message-ID: <571520AE-C5BD-11D6-BA49-000393D680DC@bway.net> Is anyone aware of symbolic equations to give the point on a conic in 3D closest to the origin? (Assume the conic doesn't touch 0). The conic could have equation b1*x^2 + b2*y^2 + b3*z^2 + b4*x*y + b5*x*z + b6*y*z + b7*x + b8*y + b9*z + b10 = 0 We want a polynomial equation for say, x, that the x coordinate of the closest point must satisfy in terms of the symbolic parameters bi. Similarly for y and z. Robert H. Lewis Mathematics Department Fordham University New York NY www.bway.net/~lewis ------------- 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 guha at blatz.cs.uwm.edu Sat Sep 14 08:06:41 2002 From: guha at blatz.cs.uwm.edu (Dr. Sumanta Guha) Date: Mon Jan 9 13:41:07 2006 Subject: Ques: Extreme configuration of vectors on a set of planes Message-ID: Greetings, Any light on the following problem will be much appreciated. Let P be a set of n planes in R^3. A configuration C of vectors on P is a set of n vectors, one each lying on a plane of P. Define max(C) to be the maximum of angles between pairs of vectors from C. The question is: determine min {max(C): C is a configuration on P}. Equivalently, what is the largest angle X s.t. given any configuration C on P there will be at least one pair from C making an angle at least X? Eg., if P is the set of 3 co-ordinate planes the answer is 60deg. In other words, if we place 3 vectors, one each on a co-ord. plane, at least two will have an angle of 60 between them. An extreme configuration of vectors in this case is easily seen to be with the vectors at 45 to the axes. A cc of your response to guha@uwm.edu will be appreciated. Thanks in advance, Sumanta Guha EE&CS UW-MIlwaukee ------------- 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 joswig at math.TU-Berlin.DE Tue Sep 17 16:32:44 2002 From: joswig at math.TU-Berlin.DE (Michael Joswig) Date: Mon Jan 9 13:41:07 2006 Subject: polymake version 1.5 Message-ID: <15751.12028.242858.605713@rabbit.math.TU-Berlin.DE> This is to announce that the new version 1.5 of polymake is available at http://www.math.tu-berlin.de/polymake now. * polymake is a framework for analyzing geometric and combinatorial properties of convex polytopes. As a key feature polymake provides interfaces to many other software packages dealing with polytopes. This way very many algorithms and implementations are available through a common user interface. Selection of new features: - polymake 1.5 comes with Komei Fukuda's cddlib (version 0.91) and David Avis' lrslib (version 4.1). Together with polymake's new own beneath_beyond client the current version offers three different convex hull algorithms/codes. - New fast algorithm for producing the Hasse diagram of the face lattice of a polytope. - Numerous new constructions and further improvements to the polymake C++ template library. - Arithmetic uses GMP 4.1 (also shipped with polymake). - Precompiled binaries for Intel/Athlon based RedHat Linux 7.3, and Sun Solaris 7/8. Ewgenij Gawrilow & Michael Joswig {gawrilow,joswig}@math.tu-berlin.de ------------- 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 ebbers at cs.uni-bonn.de Thu Sep 19 14:50:51 2002 From: ebbers at cs.uni-bonn.de (Annette Ebbers-Baumann) Date: Mon Jan 9 13:41:07 2006 Subject: EuroCG2003 - Call for Papers Message-ID: <3D89BA1B.A883CE9F@cs.uni-bonn.de> ----------------------------------------------------------------------- CALL FOR PAPERS 19th EUROPEAN WORKSHOP ON COMPUTATIONAL GEOMETRY (EuroCG2003) http://cg03.cs.uni-bonn.de March 24 -26, 2003, Bonn, Germany ------------------------------------------------------------------------ DESCRIPTION -------------- The annual workshop on Computational Geometry is a well-established, scientific event visited by researchers from both academia and industry since its inception in the early 80s. Established researchers from academia, R&D people from industry, research students and postdocs come here together to discuss their most recent work. The aim of this workshop is to create an informal and productive atmosphere starting international collaborations and bringing young researchers and experienced scientists into contact to further the advance in the area of Computational Geometry. The 19th European Workshop on Computational Geometry will take place at the University of Bonn, Germany, Institute of Computer Science I, March 24 - 26, 2003. TOPICS --------- Topics of interest to this workshop include, but are not limited to: Analysis of geometric algorithms design and data structures referring to - theoretical issues arising from implementations, - combinatorial geometry, - analysis of geometric configurations. Applications of computational geometry to - robotics and virtual worlds, - computer graphics, - simulation and visualization, - image processing, - geometric and solid modeling, - computer aided geometric design, - manufacturing, - geographical information systems, - structural molecular biology. SUBMISSIONS -------------- A title and a brief abstract (2-4 pages) should be submitted before January 7, 2003. The abstracts will be collected and distributed among the participants at the workshop. There will be no other proceedings so that preliminary work can be presented which may later appear in a more complete form at another conference. To outstanding results (fully-reviewed) a special issue of ?Computational Geometry: Theory and Applications? will be dedicated. Details on the submission format and the submission procedure will be presented in time on the workshop Web site. INVITED SPEAKERS ------------------- P. K. Agarwal, Duke University, USA T. Asano, JAIST, Japan J.-R. Sack, Carleton University, Canada IMPORTANT DATES ------------------ Submission deadline: January 7, 2003 Acceptance notification: January 21, 2003 Final version: February 4, 2003 Registration deadline: February 18, 2003 Hotel registration deadline: February 18, 2003 ORGANIZATION --------------- Rolf Klein Annette Ebbers-Baumann Mariele Knepper Institute of Computer Science I University of Bonn - Germany ADDRESS ---------- EuroCG 2003 Universitaet Bonn Institut fuer Informatik I Roemerstrasse 164 D - 53117 Bonn, Germany Email: cg03@cs.uni-bonn.de URL ------ For further information please refer to our Web site http://cg03.cs.uni-bonn.de ------------- 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 jsbm at ams.sunysb.edu Tue Sep 17 11:23:11 2002 From: jsbm at ams.sunysb.edu (jsbm@ams.sunysb.edu) Date: Mon Jan 9 13:41:07 2006 Subject: DIMACS Workshop on Computational Geometry: Second Call for Papers/Participation Message-ID: <200209171421.g8HELkx22700@catbert.ams.sunysb.edu> ** Reminder ** The deadline for submissions of contributions to the annual fall workshop on computational geometry, this year a DIMACS worshop, is coming up! Oct 11 (by midnight, Eastern time) Also, please register early if you are planning to come (even if you qualify for free registration), so we can start to get an accurate estimate of the attendance. Thanks, and see you in November! Joe Mitchell %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% DIMACS Workshop on Computational Geometry November 14 - 15, 2002 DIMACS Center, Rutgers University, Piscataway, NJ Organizer: Joseph S. B. Mitchell, University at Stony Brook, jsbm@ams.sunysb.edu Presented under the auspices of the DIMACS Special Focus on Computational Geometry and Applications. We are pleased to announce the twelfth in a series of annual fall workshops on Computational Geometry. This workshop series, founded initially under the sponsorship of the Mathematical Sciences Institute (MSI) at Stony Brook (with funding from the U. S. Army Research Office), has continued during 1996-1999 under the sponsorship of the Center for Geometric Computing, a collaborative center of Brown, Duke, and Johns Hopkins Universities, also funded by the U.S. Army Research Office. In 2000, the workshop returned to the campus of the University at Stony Brook. In 2001, it was held at Polytechnic University in Brooklyn. This year, as part of the DIMACS Special Focus on Computational Geometry and Applications, the workshop is being hosted and sponsored by DIMACS. Scope and Format: The aim of this workshop is to bring together students and researchers from academia and industry, to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to: Algorithmic methods in geometry Geometric data structures Implementation issues Robustness Computer graphics Solid modeling Geographic information systems Applications to computational biology and chemistry Computational metrology Graph drawing Experimental studies Computer vision Robotics Computer-aided design Mesh generation Manufacturing applications of geometry I/O-scalable geometric algorithms Animation of geometric algorithms Following the tradition of the previous workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. There will also be an Open Problem Session in order to promote a free exchange of questions and research challenges. Invited Speakers: Timothy Chan (Waterloo): Low-Dimensional Linear Programming with Violations Piotr Indyk (MIT): Approximate Algorithms for High-Dimensional Geometric Problems Lydia Kavraki (Rice): TBA Regina Liu (Rutgers): TBA Submissions: Authors are invited to submit abstracts for talks to be given at the workshop. Please send an abstract (up to 2 pages) and a draft of a paper (if you have one). (Since there are no formal proceedings for the workshop, submission of material that is to be submitted to (or to appear in) a refereed conference is allowed and encouraged.) A special volume in the DIMACS series may be compiled from selected papers. Submissions will be due October 11, 2002. Program Committee: Herv\'e Br\"{o}nnimann (Polytechnic University) Erik Demaine (MIT) Steven Fortune (Bell Laboratories) Joseph S. B. Mitchell (University at Stony Brook) Ileana Streinu (Smith College) Suresh Venkatasubramanian (AT\& T) Important Dates: Deadline for submission of abstract/paper: Oct 11, 2002 Notification of acceptance: Oct 18, 2002 Call for Participation: Anyone wishing to contribute a talk abstract should send it via email to Joe Mitchell (jsbm@ams.sunysb.edu) by October 11, 2002. Registration: Regular rate Preregister before deadline $100/day After preregistration deadline $120/day Reduced Rate* Preregister before deadline $60/day After preregistration deadline $70/day Postdocs Preregister before deadline $10/day After preregistration deadline $15/day DIMACS Postdocs $0 Non-Local Graduate & Undergraduate students Preregister before deadline $5/day After preregistration deadline $10/day Local Graduate & Undergraduate students $0 (Rutgers & Princeton) DIMACS partner institution employees** $0 DIMACS long-term visitors*** $0 Registration fee to be collected on site, cash, check, VISA/Mastercard accepted. Our funding agencies require that we charge a registration fee during the course of the workshop. Registration fees include participation in the workshop, all workshop materials, breakfast, lunch, breaks and any scheduled social events (if applicable). * College/University faculty and employees of non-profit organizations will automatically receive the reduced rate. Other participants may apply for a reduction of fees. They should email their request for the reduced fee to the Workshop Coordinator at workshop@dimacs.rutgers.edu. Include your name, the Institution you work for, your job title and a brief explanation of your situtation. All requests for reduced rates must be received before the preregistration deadline. You will promptly be notified as to the decision about it. ** Fees for employees of DIMACS partner institutions are waived. DIMACS partner institutions are: Rutgers University, Princeton University, AT&T Labs - Research, Avaya, Bell Labs, NEC Research Institute and Telcordia Technologies. ***DIMACS long-term visitors who are in residence at DIMACS for two or more weeks inclusive of dates of workshop. Information on participation, registration, accomodations, and travel can be found at: http://dimacs.rutgers.edu/Workshops/CompGeom/ **PLEASE BE SURE TO PRE-REGISTER EARLY** ------------- 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 skala at kiv.zcu.cz Sun Sep 15 15:33:29 2002 From: skala at kiv.zcu.cz (Vaclav Skala) Date: Mon Jan 9 13:41:07 2006 Subject: WSCG - Deadline October 10, 2003 References: <15744.32678.577501.277737@gargle.gargle.HOWL> Message-ID: <006301c25d5c$fc105b60$4e3fe493@fav.zcu.cz> >>>>>SORRY for DUPLICATES<<<< WSCG International Conferences in Central Europe ------------------------------------------------ Call for Papers & Participation =============================== Please, VISIT http://wscg.zcu.cz for detailed information and for on-line papers repository since 1992 - 2002 Access is NOT LIMITED ---------------------------------------------------------------------------- ---- Unique opportunity ------------------ - to visit the Golden City - PRAGUE - taste the best beer all over the world - Pilsner Urquell - to take a part at event, where West and East meet ----------------------------------------- Aceepted papers will be published in The Journal of WSCG Vol. 11. No 1-3, ISSN 1213-6972 W S C G ' 2003 (formerly the Winter School of Computer Graphics) The 11-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2003 in co-operation with EUROGRAPHICS to be held at the University of West Bohemia, Plzen, close to Prague - the Golden European City Czech Republic February 3 - 7, 2003 Honorary Chair Jack E.Bresenham, Winthrop University, USA Programme Co-Chairs Dirk Bartz, University of T?bingen, Germany Vaclav Skala, University of West Bohemia, Czech Republic Keynote speakers: Gabor T. Herman: Blobs for Representing and Visualizing 3D Objects, City University of New York, USA Dirk Bartz: Large Model Visualization: Techniques and Applications, University of Tuebingen, Germany Information for authors Deadline for contributions: October 10, 2002 24:00 GMT (London time) -------------------------------------------------------------------- Format A4 (strictly), max. 8 pages, additional material (video as MPEG, AVI and similar files, color plates etc. can be submitted, please, no video tapes) up to 5 MB For details, please, see http://wscg.zcu.cz select WSCG'2003 Topics included Computer graphics and scientific visualization, computer vision, image processing and pattern recognition, fundamental algorithms and computational geometry, graphical human computer interface and graphical interaction, geometric modeling and computer aided geometric design, rendering and virtual reality, animation and multimedia, medical imaging, object oriented graphics, WWW technologies, parallel and distributed graphics, CAD/CAM, DTP and GIS systems, applications and related fields. The International Program Committee and Reviewing Board members review all papers peer-to-peer carefully and anonymously. Selected papers will be published in the Journal of WSCG, Vol.11. ISSN 1213-6972, all presented papers will be published in the WSCG proceedings with ISBN. Both are indexed/abstracted in: Engineering Index, Inspec Database, CompuMath Citation Index, Information Science Abstracts, Cambridge Scientific Abstracts and others. Organizer and conference secretariat Prof.Vaclav Skala c/o Computer Science Department University of West Bohemia, Univerzitni 8, Box 314, 306 14 Plzen, Czech Republic e-mail: skala@kiv.zcu.cz Subject: INFO WSCG2003 http://wscg.zcu.cz fax: +420-37 7822-578, 799 tel./fax: +420-37-7491-188 ------------- 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 tacas03 at cis.ksu.edu Wed Sep 18 16:37:57 2002 From: tacas03 at cis.ksu.edu (John Hatcliff) Date: Mon Jan 9 13:41:07 2006 Subject: Call for Papers - TACAS 2003 Message-ID: <200209182037.PAA22625@chara.cis.ksu.edu> [%%%% Apologies for multiple copies received %%%%] CALL FOR PAPERS Ninth International Conference on TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS (TACAS 2003) 7-11 April 2003 Warsaw, Poland URL: http://www.mimuw.edu.pl/etaps03 A member conference of the European Joint Conferences on Theory and Practice of Software (ETAPS 2003) 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 have traditionally had little interaction but 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. 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 is a member of the European Joint Conference on Theory and Practice of Software (ETAPS), which is the primary European forum for academic and industrial researchers working on topics related to Software Science. After ETAPS 98 in Lisbon, ETAPS 99 in Amsterdam, ETAPS 2000 in Berlin, ETAPS 2001 in Genova, and ETAPS 2002 in Grenoble, ETAPS 2003 is the sixth joint conference in this series. SUBMISSION GUIDELINES As with other ETAPS conferences, TACAS accepts two types of contributions: - Research papers (up to 16 pages) 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 under the direction of the Conference Co-chairs. See http:///www.cis.ksu.edu/tacas03 for details. - Tool demonstration papers (up to 4 pages) 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. See http://www.inrialpes.fr/vasy/tacas03/tool.html for details. Both types of contributions will appear in the proceedings and be allocated thirty-minute slots during the conference. In brief, submitted papers must - be in English - present original research which is unpublished and not submitted elsewhere - use the Springer-Verlag LNCS style (see http://www.springer.de/comp/lncs/Authors.html) - be submitted electronically in Postscript/PDF format Submissions deviating from these instructions may be rejected without review. Any question regarding this policy should be directed to the Conference Co-chairs prior to submission. IMPORTANT DATES TACAS is a member conference of ETAPS. ETAPS 2003 conferences and other satellite events will be held April 5-13, 2003. As a part of ETAPS, TACAS adheres to ETAPS submission and notification deadlines. October 18, 2002 Submission deadline December 13, 2002 Notification of authors January 17, 2003 Final versions due April 7-11, 2003 Conference dates INVITED SPEAKER Peter Lee School of Computer Science Carnegie Mellon University, USA PROGRAM COMMITTEE Rajeev Alur University of Pennsylvania (USA) Albert Benveniste IRISA Rennes (France) Ahmed Bouajjani Liafa, Paris 7 (France) Rance Cleaveland (TACAS SC) SUNY at Stony Brook (USA) Werner Damm Univ. Oldenburg (Germany) Luca de Alfaro University of California, Santa Cruz (USA) Alessandro Fantechi Univ. of Florence and IEI- CNR Pisa (Italy) Alain Finkel LSV Cachan (France) Hubert Garavel (co-chair) Inria Rh??ne-Alpes (France) Patrice Godefroid Bell Laboratories, Lucent Technologies (USA) Susanne Graf Verimag Grenoble (France) Jan-Friso Groote Techn. Univ Eindhoven (The Netherlands) Orna Grumberg Technion Haifa (Israel) John Hatcliff (co-chair) Kansas State University (USA) Kurt Jensen (tool chair) University of Aarhus (Denmark) Bengt Jonsson Uppsala University (Sweden) Joost-Pieter Katoen Universiteit Twente (The Netherlands) Kim Larsen Aalborg U. (Denmark) Doron Peled University of Texas (USA) Sriram K. Rajamani Microsoft Research (USA) John Rushby SRI (USA) Steve Schneider Royal Holloway, University of London (UK) Gregor Snelting Univ. Passau (Germany) Bernhard Steffen Universit??t Dortmund (Germany) Willem Visser RIACS, NASA Ames Research Center (USA) PROGRAM COMMITTEE CHAIRS: Hubert Garavel John Hatcliff INRIA Rhone-Alpes, France Kansas State University http://www.inrialpes.fr/vasy http://www.cis.ksu.edu/~hatcliff TOOL CHAIR: Kurt Jensen (tool chair) University of Aarhus (Denmark) ------------- 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 arvind at mitacs.math.ca Thu Sep 19 17:03:25 2002 From: arvind at mitacs.math.ca (Arvind Gupta) Date: Mon Jan 9 13:41:07 2006 Subject: [DMANET] Call for Participation: FOCS 2002 Message-ID: <5.1.0.14.0.20020919120751.042f9a30@mail.mitacs.math.ca> CALL FOR PARTICIPATION 43rd IEEE Foundations of Computer Science (FOCS 2002) November 16-19, 2002, Vancouver, BC (in conjunction with ISAAC 2002 and WAW) The 43rd Annual Symposium on Foundations of Computer Science (FOCS 2002), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, will be held in Vancouver, British Columbia on November 16-19, 2002. Registration for FOCS is available on the FOCS home page: http://www.mitacs.ca/focs02 *** Please note that early registration for FOCS ends October 16, 2002 *** This year FOCS is co-located with the 13rd Annual Symposium on Algorithms and Computation (ISAAC 2002) taking place November 20-23. There is a 10% discount for registration in both FOCS and ISAAC. As well, on November 16, there will be a one-day tutorial and, in parallel, the Workshop on Algorithms and Models for the Web-Graph (WAW). The program for FOCS and the one-day tutorial is available at: http://www.mitacs.ca/focs02/focs-schedule.html Information about ISAAC is available at: http://cg.scs.carleton.ca/~isaac02/ Information about WAW is available at: http://www.almaden.ibm.com/cs/people/ravi/waw.html Arvind Gupta FOCS Local Arrangement Chair ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zpr.uni-koeln.de/dmanet * ********************************************************** From arvind at mitacs.math.ca Thu Sep 19 17:03:36 2002 From: arvind at mitacs.math.ca (Arvind Gupta) Date: Mon Jan 9 13:41:07 2006 Subject: [DMANET] Call for Participation: ISAAC 2002 Message-ID: <5.1.0.14.0.20020919155850.04034a70@mail.mitacs.math.ca> CALL FOR PARTICIPATION 13th Annual Symposium on Algorithms and Computation (ISAAC 2002) November 20-23, 2002, Vancouver, BC (in conjunction with FOCS 2002 and WAW) The 13th Annual Symposium on Algorithms and Computation (ISAAC 2002) will be held in Vancouver, British Columbia on November 20-23, 2002. Registration for ISAAC is now available on the ISAAC home page: http://cg.scs.carleton.ca/~isaac02/ *** Please note that early registration for ISAAC ends October 16, 2002 *** This year ISAAC is co-located with the 43rd IEEE Symposium on Foundations of Computer Science (FOCS 2002) taking place November 16-19. There is a 10% discount for registration at both FOCS and ISAAC. As well, the Workshop on Algorithms and Models for the Web-Graph (WAW) will be held on November 16. The program for ISAAC is available at: http://cg.scs.carleton.ca/~isaac02/prog.html Information about FOCS is available at: http://www.mitacs.ca/focs02 Information about WAW is available at: http://www.almaden.ibm.com/cs/people/ravi/waw.html Arvind Gupta ISAAC Local Arrangement Chair ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zpr.uni-koeln.de/dmanet * ********************************************************** From karthik at utdallas.edu Thu Sep 19 15:51:25 2002 From: karthik at utdallas.edu (Karthik Haridoss) Date: Mon Jan 9 13:41:07 2006 Subject: common intersection of circles Message-ID: Hello computational poeople, I have 3 circles, with their centers and radius known. How would I compute the common area of intersection of the three circles. I am not sure if my three circles are intersecting at all. If they are intersection the area formula should give me the value of common area of intersection else it should return 0. Please advise in that manner.I did a brief search on NET and was able to find a sampling based method, which takes a point in random and sees is the point is in the common area and proceed accordingly. But I need a definitive formula based approach. Can you please provide me the formula common area of intersection of three circles. Also provide me links that has the software implementation of this problem. Please use this general equation of the circle (X-a)^2 + (Y-b)^2 = r^2. Where (a,b) is the center of that cicle and r is its radius. Thanks in advance. Happy day, Karthik _____________________________________________ Karthik Haridoss Research Assistant Dept. of Comp. Science Univ. of Texas at Dallas _____________________________________________ ------------- 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 arvind at mitacs.math.ca Thu Sep 19 17:03:25 2002 From: arvind at mitacs.math.ca (Arvind Gupta) Date: Mon Jan 9 13:41:07 2006 Subject: Call for Participation: FOCS 2002 Message-ID: <5.1.0.14.0.20020919120751.042f9a30@mail.mitacs.math.ca> CALL FOR PARTICIPATION 43rd IEEE Foundations of Computer Science (FOCS 2002) November 16-19, 2002, Vancouver, BC (in conjunction with ISAAC 2002 and WAW) The 43rd Annual Symposium on Foundations of Computer Science (FOCS 2002), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, will be held in Vancouver, British Columbia on November 16-19, 2002. Registration for FOCS is available on the FOCS home page: http://www.mitacs.ca/focs02 *** Please note that early registration for FOCS ends October 16, 2002 *** This year FOCS is co-located with the 13rd Annual Symposium on Algorithms and Computation (ISAAC 2002) taking place November 20-23. There is a 10% discount for registration in both FOCS and ISAAC. As well, on November 16, there will be a one-day tutorial and, in parallel, the Workshop on Algorithms and Models for the Web-Graph (WAW). The program for FOCS and the one-day tutorial is available at: http://www.mitacs.ca/focs02/focs-schedule.html Information about ISAAC is available at: http://cg.scs.carleton.ca/~isaac02/ Information about WAW is available at: http://www.almaden.ibm.com/cs/people/ravi/waw.html Arvind Gupta FOCS Local Arrangement Chair ------------- 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 Tue Sep 24 14:37:16 2002 From: marina at cpsc.ucalgary.ca (Marina Gavrilova) Date: Mon Jan 9 13:41:07 2006 Subject: CFP for Technical Session on ALgorithms and Applications in Computer Graphics and Visualization In-Reply-To: <200103072108.QAA19190@cis.ohio-state.edu> Message-ID: Dear Colleagues, Please find the attached CFP for the Technical Session on Algorithms and Applications in Computer Graphics and Visualizations. With regards, Marina Gavrilova ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Marina L. Gavrilova, Ph.D. Dept. of Computer Science University of Calgary Calgary AB Canada T2N1N4 Phone: (403) 220-5105 Fax: (403) 284-4707 E-mail: marina@cpsc.ucalgary.ca Web site: www.cpsc.ucalgary.ca/~marina -------------- next part -------------- Technical Session on Algorithms and Applications in Computer Graphics and Visualization in conjunction with the 11th International Conference on WSCG International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision February 3 - 7, 2003 Prague, Czech Republic http://wscg.zcu.cz/ ============================================================ Overview: --------- The concentration of this Technical Session is in the realms of applied methods and algorithms in visualization and computer graphics, with the special emphasis on scientific visualization and program representation. The sequential counterpart of these topics have long been the interest of researchers. However, many of the algorithmic aspects arising in a variety of applications, abd their implementation, still remain open. 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 developed techniques. Topics of Interest: ------------------- Topics of interest of the Technical Session include, but not limited to: - scientific visualization - image processing - pattern recognition - computational geometry methods - geographical information systems rendering - surface meshing - template matching - filtering techniques - algorithms in computer vision - visualization in computer modeling and simulation - visual program representation - visualization and communication - visualizaiton in education - computational geometry - other related areas Technical Session Co-Chairs: ---------------------------- Marina Gavrilova Department of Computer Scince, University of Calgary, Canada. E-mail: marina@cpsc.ucalgary.ca Brian d'Auriol Department of Computer Science, University of Texas at El Paso, USA E-mail: bdauriol@cs.utep.edu Paper Submission: ----------------- Prospective authors are invited to submit their draft paper (extended abstract) to the following e-mail address: marina@cpsc.ucalgary.ca by the due date, October 10th, 2002. Full version of the paper is due November 10th, 2002. Papers must not have been previously published or currently submitted for publication elsewhere. Electronic submission is required. When submitting via e-mail, the preferred formats are: o Adobe PostScript o Adobe PDF o DVI (please include all graphics files) o 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). Publication: ------------ The Technical Session proceedings will be published in the Journal of WSCG. WSCG Conference Series: ------------------------ The 11th is a prestigious and highly-recognized yearly event in the area of computer graphics, visualization and computational geometry, attracting leading researchers in these areas. Conference is organized by Vaclav Skala, University of West Bohemia, Czech Republic, and Honorary Chair: Jack E.Bresenham, Winthrop University, USA. Conference proceedings will be processed by: INSPEC, ISI with selected papers published in the Journal of WSCG. The conference is co-sponsored by Microsoft Research Ltd.(U.K.) , Microsoft CR, University of West Bohemia together with other research centers, international associations, and international research groups. Due Dates: ---------- October 10th, 2002: Extended abstract(draft papers) is due November 10th, 2002: Full paper version is due December 10th, 2002: Notification of acceptance and Preregistration is due January 5th, 2003: Camera-Ready papers are due Additional information: ---------------------- Additional information abour conference fees, deadlines, paper format etc. can be found at the WSCG web site http://wscg.zcu.cz/. Contact Information: -------------------- Marina Gavrilova E-mail: marina@cpsc.ucalgary.ca 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 From marina at cpsc.ucalgary.ca Tue Sep 24 14:38:25 2002 From: marina at cpsc.ucalgary.ca (Marina Gavrilova) Date: Mon Jan 9 13:41:07 2006 Subject: ICCSA 2003 In-Reply-To: <200103072108.QAA19190@cis.ohio-state.edu> Message-ID: Dear Colleagues, Please find the attached CFP for the ICCSA 2003. With regards, Marina Gavrilova ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Marina L. Gavrilova, Ph.D. Dept. of Computer Science University of Calgary Calgary AB Canada T2N1N4 Phone: (403) 220-5105 Fax: (403) 284-4707 E-mail: marina@cpsc.ucalgary.ca Web site: www.cpsc.ucalgary.ca/~marina -------------- next part -------------- Message-Id: From: C. J. K. Tan To: ICCSA 2003 Organization: Heuchera Technologies URL: http://www.OptimaNumerics.com Subject: Computational Science CFP: ICCSA 2003 THE 2003 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ITS APPLICATIONS ICCSA 2003 Montreal, Canada May 18, 2003 -- May 21, 2003 http://www.ucalgary.ca/iccsa/ http://www.cs.qub.ac.uk/iccsa/ http://www.optimanumerics.com/iccsa/ http://www.sharcnet.ca/iccsa/ Introduction ------------ The 2003 International Conference on Computational Science and Its Applications (ICCSA 2003) will be held at the Delta Centreville Hotel, Montreal, Canada, from May 18, 2003 till May 21, 2003. ICCSA 2003 is subsequent to the International Conference on Computational Science (ICCS) series of events, which were held in San Francisco, USA (2001) and Amsterdam, The Netherlands (2002). Computational Science is increasingly becoming a vital part of many scientific investigations, affecting researchers and practitioners in areas ranging from aerospace and automotive, to chemistry, electronics, geosciences, to mathematics, and physics. Due to the shear size of many challenges in computational science, the use of supercomputing, parallel processing, and sophisticated algorithms, is inevitable. The concentration of this Conference is in the realms of computational science in parallel and distributed environments, encompassing the facilitating theoretical foundations and the applications of such large scale computations. The Conference 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. We invite you to submit a: o full paper of 6 to 10 pages (Letter or A4 paper) for oral presentation, o proposal to organize a technical session. Submitted papers have to be original, containing new results that were not previously published. Full version of accepted papers will appear in the Lecture Notes in Computer Science series (LNCS), Springer-Verlag. Conference Themes ----------------- There are five major conference themes planned: o Computational Methods, Algorithms and Applications o Scientific Visualization and Image Processing o Computational Number Theory, Partial Differential Equations and Optimization o Information Systems and Technologies o Computational Science Education o Open Theme You are invited to submit a paper presenting an original research in one of the following areas: 1. Computational Methods, Algorithms and Applications o Computational Combustion o Computational Chemistry o Computational Physics o Computational Geometry o Computational Medicine o Geographical Information Systems o Computer Modeling and Simulation o Financial and Economical Modeling o Parallel Algorithms o Supercomputing o Parallel and Distributed Computing o Other related topics 2. Scientific Visualization, Graphics and Image Processing o Scientific Visualization o Computer Graphics o Geometric Modeling o Pattern Recognition o Image Processing o Virtual and Augmented Reality o Other related topics 3. Computational Number Theory, Partial Differential Equations and Optimization o Computational Number Theory o Partial Differential Equation o Discretization Methods o Optimization o Randomized Computations o Modern Numerical Algorithms o Hybrid Computational Methods o Computational Grids o Supercomputing o Other related topics 4. Information Systems and Information Technologies o Information Retrieval o Scientific Databases o Security o Risk Analysis o Reliability Engineering o Software Engineering o Biometric technologies o Data mining o Web-based Computing o Knowledge-based Systems o Artificial Intelligence o Other related topics 5. Computational Science Education o Learning Technologies o Computational Science Education o Interactive Education 6. Open Theme o Environmental Modeling o Climate Systems Modeling o Connectionist Modeling o Geophysics o Nuclear Physics o Others Paper Submission ---------------- The submitted paper must be camera-ready and formatted according to the rules of LNCS. See http://www.springer.de/comp/lncs/authors.html for formatting information. For all details with respect to the electronic submission see http://www.ucalgary.ca/iccsa/. The paper must present an original work, not published elsewhere. Each paper will be refereed by at least three independent reviewers. Paper submission indicates the intention of the author to present the paper at ICCSA 2003. Proposal for Organizing Technical Sessions ------------------------------------------ We invite proposals for technical sessions in one of the conference themes. Each technical session will have at least 6 paper presentations. Sessions with a large number of papers may be approved as workshops. The session chairs will be responsible for all aspects of their sessions; including soliciting, reviewing, and selecting the papers. Some financial assistance may be available for the session chairs. After the Conference, some sessions will be considered for publication in appropriate journals as Special Issues with the session proposer as the Guest Editor of the journal. Proposals to organize technical sessions should include the following information: o title of the technical session o name, affiliation, mailing address and e-mail address of the proposer(s) o description of the topic of the session (not exceeding 100 words) o a short description on how the session will be advertised The deadline for proposal submission is January 6, 2003. Please send your proposal to iccsa@sharcnet.ca. Important Dates --------------- January 6, 2003: Deadline for paper submission (full papers) and event proposals. February 13, 2003: Notification of acceptance. February 28, 2003: Camera Ready Papers and Pre-registration. May 18 -- 22, 2003: ICCSA 2003 Conference in Montreal, Canada. Proceedings ----------- The proceedings of the Conference will be published in the Springer-Verlag Lecture Notes in Computer Science (LNCS) series. A selected number of papers will be published as special issues in appropriate journals (such as International Journal of Computational Geometry and Applications, Journal of Supercomputing, International Journal of Mathematical Algorithms). Conference fees ---------------- For all details with respect to the conference fees see http://www.ucalgary.ca/iccsa/. Special discounts for students and participants from some academia/research institutions may be available. Best Student Paper Award ------------------------- The Best Student Paper Award will be provided to the most original and innovative submission. One of the authors should be a full time graduate student at the time of the paper submission. Organization ------------ Honorary Chair: Vipin Kumar (University of Minnesota, USA) Conference Chair: C. J. Kenneth Tan (Heuchera Technologies, Canada and SHARCNET, Canada) Marina L. Gavrilova (University of Calgary, Canada) Local Organizing Chair: Pierre L'Ecuyer (University of Montreal, Canada) International Steering Committee: Michael Bauer (SHARCNET, Canada) J. A. Rod Blais (University of Calgary, Canada) Alexander V. Bogdanov (Institute for High Performance Computing and Data Bases, Russia) Marina L. Gavrilova (University of Calgary, Canada) Andres Iglesias (University de Cantabria, Spain) Benjoe A. Juliano (California State University at Chico, USA) Vipin Kumar (University of Minnesota, USA) Reneé S. Renner (California State University at Chico, USA) C. J. Kenneth Tan (Heuchera Technologies, Canada and SHARCNET, Canada) Jerzy Wasniewski (Danish Computing Center for Research and Education, Denmark) Program Committee (still being formed): Vassil N. Alexandrov (University of Reading, UK) Hamid Arabnia (University of Georgia, USA) Sergei Bespamyatnikh (Duke University, USA) J. A. Rod Blais (University of Calgary, Canada) Alexander V. Bogdanov (Institute for High Performance Computing and Data Bases, Russia) Toni Cortes (Universidad de Catalunya, Barcelona, Spain) Brian J. d'Auriol (University of Texas at El Paso, USA) Ovidiu Daescu (University of Texas at Dallas, USA) Tamal Dey (Ohio State University, USA) Ivan Dimov (Bulgarian Academy of Sciences, Bulgaria) Matthew F. Dixon (Heuchera Technologies, UK) Marina L. Gavrilova (University of Calgary, Canada) James Glimm (SUNY Stony Brook, USA) Christopher Gold (Hong Kong Polytechnic University, Hong Kong) Bob Hertzberger (Universiteit van Amsterdam, The Netherlands) Andres Iglesias (University de Cantabria, Spain) Chris Johnson (University of Utah, USA) Benjoe A. Juliano (California State University at Chico, USA) Deok-Soo Kim (Hanyang University, Korea) Vipin Kumar (University of Minnesota, USA) Antonio Lagana (Università Degli Studi di Perugia, Italy) Michael Mascagni (Florida State University, USA) Cathy McDonald (Department of Defense HPC Modernization Program, USA) Graham Megson (University of Reading, UK) Robert Panoff (Shodor Education Foundation, USA) Renee S. Renner (California State University at Chico, USA) Vaclav Skala (University of West Bohemia, Czech Republic) Kokichi Sugihara (University of Tokyo, Japan) David Taniar (Monash University, Australia) Koichi Wada (University of Tsukuba, Japan) Jerzy Wasniewski (Danish Computing Center for Research and Education, Denmark) Roy Williams (California Institute of Technology, USA) Stephen Wismath (University of Lethbridge, Canada) Osman Yasar (SUNY at Brockport, USA) Zahari Zlatev (Danish Environmental Research Institute, Denmark) Contact Information ------------------- URL: http://www.ucalgary.ca/iccsa/ (N. American mirror) http://www.cs.qub.ac.uk/iccsa/ (European mirror) http://www.optimanumerics.com/iccsa/ (European mirror) http://www.sharcnet.ca/iccsa/ (N. Americam mirror) E-mail address: iccsa@sharcnet.ca Mailing address: ICCSA 2003 C/O Marina Gavrilova Department of Computer Science University of Calgary Calgary, Alberta Canada T2N 1N4 Telephone: 1-519-694-2581 (in Canada) Facsimile: 1-519-850-2500 (in Canada) From skala at kiv.zcu.cz Fri Sep 20 07:15:04 2002 From: skala at kiv.zcu.cz (Vaclav Skala) Date: Mon Jan 9 13:41:07 2006 Subject: WSCG Int.Conf.in Central Europe - Plzen (Prague), Deadline October 10, 2002 References: <3D89BA1B.A883CE9F@cs.uni-bonn.de> Message-ID: <006801c2605d$585e5f40$4e3fe493@fav.zcu.cz> >>>>>SORRY for DUPLICATES<<<< WSCG International Conferences in Central Europe ------------------------------------------------ Call for Papers & Participation =============================== Please, VISIT http://wscg.zcu.cz for detailed information and for on-line papers repository since 1992 - 2002 Access is NOT LIMITED ---------------------------------------------------------------------------- ---- Unique opportunity ------------------ - to visit the Golden City - PRAGUE - taste the best beer all over the world - Pilsner Urquell - to take a part at event, where West and East meet ----------------------------------------- Aceepted papers will be published in The Journal of WSCG Vol. 11. No 1-3, ISSN 1213-6972 W S C G ' 2003 (formerly the Winter School of Computer Graphics) The 11-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2003 in co-operation with EUROGRAPHICS to be held at the University of West Bohemia, Plzen, close to Prague - the Golden European City Czech Republic February 3 - 7, 2003 Honorary Chair Jack E.Bresenham, Winthrop University, USA Programme Co-Chairs Dirk Bartz, University of T?bingen, Germany Vaclav Skala, University of West Bohemia, Czech Republic Keynote speakers: Gabor T. Herman: Blobs for Representing and Visualizing 3D Objects, City University of New York, USA Dirk Bartz: Large Model Visualization: Techniques and Applications, University of Tuebingen, Germany Information for authors Deadline for contributions: October 10, 2002 24:00 GMT (London time) -------------------------------------------------------------------- Format A4 (strictly), max. 8 pages, additional material (video as MPEG, AVI and similar files, color plates etc. can be submitted, please, no video tapes) up to 5 MB For details, please, see http://wscg.zcu.cz select WSCG'2003 Topics included Computer graphics and scientific visualization, computer vision, image processing and pattern recognition, fundamental algorithms and computational geometry, graphical human computer interface and graphical interaction, geometric modeling and computer aided geometric design, rendering and virtual reality, animation and multimedia, medical imaging, object oriented graphics, WWW technologies, parallel and distributed graphics, CAD/CAM, DTP and GIS systems, applications and related fields. The International Program Committee and Reviewing Board members review all papers peer-to-peer carefully and anonymously. Selected papers will be published in the Journal of WSCG, Vol.11. ISSN 1213-6972, all presented papers will be published in the WSCG proceedings with ISBN. Both are indexed/abstracted in: Engineering Index, Inspec Database, CompuMath Citation Index, Information Science Abstracts, Cambridge Scientific Abstracts and others. Organizer and conference secretariat Prof.Vaclav Skala c/o Computer Science Department University of West Bohemia, Univerzitni 8, Box 314, 306 14 Plzen, Czech Republic e-mail: skala@kiv.zcu.cz Subject: INFO WSCG2003 http://wscg.zcu.cz fax: +420-37 7822-578, 799 tel./fax: +420-37-7491-188 ------------- 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 arvind at mitacs.math.ca Thu Sep 19 17:03:36 2002 From: arvind at mitacs.math.ca (Arvind Gupta) Date: Mon Jan 9 13:41:07 2006 Subject: Call for Participation: ISAAC 2002 Message-ID: <5.1.0.14.0.20020919155850.04034a70@mail.mitacs.math.ca> CALL FOR PARTICIPATION 13th Annual Symposium on Algorithms and Computation (ISAAC 2002) November 20-23, 2002, Vancouver, BC (in conjunction with FOCS 2002 and WAW) The 13th Annual Symposium on Algorithms and Computation (ISAAC 2002) will be held in Vancouver, British Columbia on November 20-23, 2002. Registration for ISAAC is now available on the ISAAC home page: http://cg.scs.carleton.ca/~isaac02/ *** Please note that early registration for ISAAC ends October 16, 2002 *** This year ISAAC is co-located with the 43rd IEEE Symposium on Foundations of Computer Science (FOCS 2002) taking place November 16-19. There is a 10% discount for registration at both FOCS and ISAAC. As well, the Workshop on Algorithms and Models for the Web-Graph (WAW) will be held on November 16. The program for ISAAC is available at: http://cg.scs.carleton.ca/~isaac02/prog.html Information about FOCS is available at: http://www.mitacs.ca/focs02 Information about WAW is available at: http://www.almaden.ibm.com/cs/people/ravi/waw.html Arvind Gupta ISAAC Local Arrangement Chair ------------- 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 markdb at cs.uu.nl Wed Sep 25 15:03:45 2002 From: markdb at cs.uu.nl (Mark de Berg) Date: Mon Jan 9 13:41:07 2006 Subject: PhD position "Multi-Functional Geometric Data Structures" Message-ID: %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % OPENING for a PhD POSITION % % % % on the project % % % % Multi-Functional Geometric Data Structures % % % % at the TU EINDHOVEN (THE NETHERLANDS) % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% PROJECT DESCRIPTION ------------------- In computational geometry, efficient data structures have been developed for a variety of geometric searching problems. The theoretical performance of these structures is often close to the theoretical lower bounds. In order to achieve close-to-optimal performance, a tailor-made structure has been developed for each version of a searching problem. It would be preferable, however, to have a single data structure that can deal with many different searching problems. Indeed, this is what is often done in practice. The goal of this project is to study such multi-functional geometric data structures from a theoretical perspective. This should help to bridge the gap between theory and practice of geometric data structures. THE ALGORITHMS GROUP AT THE TU EINDHOVEN ---------------------------------------- The Algorithms group is a new research group at the TU Eindhoven, which will be established fall 2002. One of the focal points of the group is computational geometry. Initially the group will consist of prof.dr. Mark de Berg and dr. Otfried Cheong (permanent staff members) and dr. Joakim Gudmundsson (postdoc). It is expected that the group will grow in the near future with at least one permanent staff member, and with several postdocs and PhD students. THE CANDIDATE ------------- The candidate should have a masters degree in computer science or mathematics, with a firm background in algorithms. BEING A PhD STUDENT IN THE NETHERLANDS -------------------------------------- In the Netherlands, every PhD student gets paid a salary; no additional grants are needed. Moreover, although PhD students sometimes take courses, there is no minimum requirement. Hence, PhD students are more like employees than like students. Indeed, the Dutch word for PhD student translates to "research trainee". The work of a PhD student may include assisting in courses of BSc or MSc programs of the department. This amounts to at most 20% of the time; the remaining time is spent on research and research-related activities. Foreign PhD students need not speak Dutch: it is easy to get by with English, not only at the university but also in everyday life. WE OFFER -------- * A research position in a young, enthousiastic, and internationally oriented research group. * A four-year position with an evaluation after one year. * A salary of 1526 euro/month in the first year, increasing to 2063 euro/month in the final year. * Well organized support for your personal development and career policy. * Excellent fringe benefits: reimbursement of the PhD thesis' costs up to 1800 euro, outstanding sporting facilities, children's day care, company savings. MORE INFORMATION ---------------- If you want to know more about the project or how to apply, please contact: Prof.dr. Mark de Berg (markdb@cs.uu.nl). ------------- 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 Andreas.Fabri at sophia.inria.fr Thu Sep 26 16:59:36 2002 From: Andreas.Fabri at sophia.inria.fr (Andreas Fabri) Date: Mon Jan 9 13:41:07 2006 Subject: Reconstruction Web Service Message-ID: <3D9312C8.1040503@sophia.inria.fr> Hello, At http://cgal.inria.fr/Reconstruction you can find a surface reconstruction service. It allows users to upload files with 3D point clouds. The algorithm on the server computes a polyhedral surface model for the points and serves the result as a VRML or OFF file. Best regards, Andreas Fabri ------------- 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 iwcia at dipmat.math.unipa.it Mon Sep 30 18:10:12 2002 From: iwcia at dipmat.math.unipa.it (IWCIA - The Conference) Date: Mon Jan 9 13:41:07 2006 Subject: CfP - Extended deadline Message-ID: This message is crossposted to several lists, so our sincere apologies if you get multiple copies. Please forward to anyone that might be interested in. * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * International Workshop on Combinatorial Image Analysis 14-16 May 2003, Palermo - Italy Announcement IWCIA2003 is the nineth in a series of workshops on parallel and combinatorial image analysis. Prior meetings took place in Paris (France, 1991), Ube (Japan, 1992), Washington DC (USA, 1994), Lyon (France, 1995), Hiroshima (Japan, 1997), Madras (India, 1999), Caen (France, 2000) and Philadelphia (USA, 2001). This edition will be held in Palermo (Italy, 14-16 May 2003). Topics treated will include, but are not limited to: Digital topology; Discrete tomography; Array, graph and parallel grammars; Cellular automata; Tilings and patterns; Combinatorial methods in image analysis; Combinatorial problems in the discrete plane; Integer-only algorithms for image analysis; Non-conventional computing for image analysis such as genetic algorithms, global optimization... Program chairs / Principal organizers Alberto Del Lungo (University of Siena, Italy) Vito Di Gesu' (University of Palermo, Italy) Attila Kuba (University of Szeged, Hungary) Program committee Alfred M. Bruckstein (Technion Institute of Technology, Israel) Jean-Marc Chassery (TIMC-IMAG, France) Katsushi Inoue (Yamaguchi University, Japan) Ta Yung Kong (City University of New York, USA) Kenichi Morita (Hiroshima University, Japan) Maurice Nivat (LIAFA, France) Mike Reed (Oxford University, UK) Rani Siromoney (Madras Christian College, India) Patrick S.P. Wang (Northeastern University, USA) Gerhard Woeginger (University of Twente, The Netherlands) Invited speakers Gabor Herman (City University of New York, USA) Reinhard Klette (University of Auckland, New Zealand) Peter Gritzmann (Munich Technical University, Germany) Scientific secretariat Andrea Frosini (University of Siena, Italy) Cesare Valenti (University of Palermo, Italy) Call for papers Prospective contributors are invited to submit full papers of no more than 12 pages in English reporting their original work. The proocedings will be published as a volume of Electronic Notes in Discret Mathematics by Elsevier Science. Selected papers will be published as a Special Issue of Discrete Applied Mathematics by Elsevier Science. Deadlines Submission: October 21, 2002 Notification of acceptance: December 15, 2002 Early registration: January 1, 2003 Final versions of accepted papers: February 1, 2003 Notification of the authors of selected papers: June 1, 2003 Submission of selected papers: October 1, 2003 Notification of acceptance of selected papers: January 1, 2004 Final versions of accepted selected papers: March 1, 2004 Info iwcia@math.unipa.it www.math.unipa.it/~iwcia Sponsors Universita' di Palermo, Italia Universita' di Siena, Italia Szegedi Tudomanyegyetem, Magyarorszag Centro Interdipartimentale Tecnologie della Conoscenza ------------- 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 andrzej at cs.lth.se Mon Sep 30 22:17:20 2002 From: andrzej at cs.lth.se (Andrzej Lingas) Date: Mon Jan 9 13:41:07 2006 Subject: FCT'03 Message-ID: <200209301917.g8UJHKe14655@ygg.cs.lth.se> \documentclass[11pt]{article} \usepackage[T1]{fontenc} \topmargin=-1cm \usepackage{t1enc} \usepackage[swedish]{babel} \textheight 9.3in \textwidth 6.50in \oddsidemargin 0.00in \evensidemargin 0.00in \marginparwidth 2.00cm \marginparsep 0.50cm \topmargin 0.00in \headheight 0.00in \headsep 0.00in %\textwidth 16 cm %\textheight 23 cm \renewcommand{\baselinestretch}{1.0} \newcommand{\what}{\sf} \newcommand{\who}{\rm} \newcommand{\where}{\it} \begin{document} \thispagestyle{empty} \parskip=4pt \parindent=0pt \begin{center} {\huge { \bf FCT\ 2003}} \par \vskip 0.5 cm \noindent {\bf 14-th International Symposium on Fundamentals of Computation Theory} \par \vskip 1 cm \noindent{\bf Malm?, Sweden, August 12-15, 2003} \end{center} \par \vskip 1 cm \noindent The symposia on Fundamentals of Computation Theory are held every two years. The proceedings of FCT have always been published as volumes of Lecture Notes in Computer Science by Springer-Verlag. \par \vskip 0.2 cm \noindent The 14-th symposium will be held in Malm?, Sweden, at the Malm? H?gskola. The symposium will have invited lectures by Sanjeev Arora (Princeton), Christos Papadimitriou (Berkeley) and \\ George P\u{a}un (Romanian Academy) and sessions for presenting technical contributions. \par \vskip 0.5 cm \noindent Papers presenting original research in all areas of theoretical computer science are sought. Topics of interest include: \vskip 0.2 cm \parbox{0.3 cm}{\ \ \ } \parbox{15.7 cm}{ design and analysis of algorithms, abstract data types, approximation algorithms, automata and formal languages, categorical and topological approaches, circuits, computational and structural complexity, circuit and proof theory, computational geometry, computer systems theory, concurrency theory, cryptography, domain theory, distributed algorithms and computation, molecular computation, quantum computation and information, granular computation, probabilistic computation, learning theory, rewriting, semantics, logic in computer science, specification, transformation and verification, algebraic aspects of computer science.} \par \vskip 0.3 cm \noindent \subsection*{Submissions} Authors are invited to submit extended abstracts of their papers, presenting original contributions to the theory of computer science. Papers should be submitted electronically (in Postscript) to {\sl Andrzej.Lingas@cs.lth.se} \par \vskip 0.2 cm \noindent Authors from countries where access to Internet is difficult should contact the chair of the programme committee using the address: Andrzej Lingas, Department of Computer Science, Lund University, Box 118, SE-221 00 Lund, Sweden \par \vskip 0.2 cm \noindent Submissions should consist of: a cover page, with the author's full name, address, fax number, e-mail address, a 100-word abstract, keywords and an extended abstract describing original research. Papers should not be exceeding 12 pages in the standard LNCS-style. \parskip=4pt \vspace{0.3 cm} %\Large {\bf Important dates }} \subsection*{Important dates} \begin{itemize} \item Submissions: February 20, 2003 \item Notification: April 1, 2003 \item Camera-ready copy: April 30, 2003 %item Symposium: August 12-15, 2003 \end{itemize} \newpage \parskip=4pt \vspace{0.5 cm} {\Large {\bf Conference chair}} \medskip %\subsection*{Conference chair} \medskip {\who Bengt Nilsson }\\ {\where Malm? H?gskola}\\ {\where Teknik och samh?lle}\\ {\where SE-205 06 Malm?}\\ {\where Sweden}\\ \parskip=4pt \vspace{0.5cm} {\Large {\bf Program Committee}} \medskip {\who Arne Andersson}, {\where Uppsala} \\ {\who Stefan Arnborg}, {\where KTH Stockholm} \\ {\who Stephen Alstrup}, {\where ITU Copenhagen}\\ {\who Zoltan Esik}, {\where Szeged}\\ {\who Rusins Freivalds}, {\where UL Riga} \\ {\who Alan Frieze}, {\where CMU Pittsburgh}\\ {\who Leszek G\c asieniec}, {\where Liverpool}\\ {\who Magnus Halldorsson}, {\where UI Reykjavik}\\ {\who Klaus Jansen}, {\where Kiel}\\ {\who Juhani Karhum?ki}, {\where Turku}\\ {\who Marek Karpinski}, {\where Bonn}\\ {\who Christos Levcopoulos}, {\where Lund}\\ {\who Ming Li}, {\where Waterloo}\\ {\who Andrzej Lingas}, {\where Lund} (Chair)\\ {\who Jan Maluszy\'{n}ski}, {\where Link?ping}\\ {\who Fernando Orejas}, {\where Barcelona}\\ {\who J?rgen Pr?mel}, {\where Berlin}\\ {\who R?diger Reischuk}, {\where Lubeck}\\ {\who Wojciech Rytter}, {\where Warsaw/New Jersey IT}\\ {\who Miklos Santha}, {\where Paris-Sud}\\ {\who Andrzej Skowron}, {\where Warsaw}\\ {\who Paul Spirakis}, {\where Patras}\\ {\who Esko Ukkonen}, {\where Helsinki}\\ {\who Ingo Wegener}, {\where Dortmund}\\ {\who Paul Winter}, {\where Copenhagen}\\ {\who Vladimiro Sassone}, {\where Sussex}\\ \parskip=4pt \vspace{0.5cm} {\Large {\bf Organizing Committee}} %\subsection*{Organizing Committee} \medskip {\who Bengt Nilsson}, {\where Malm?} (Chair)\\ {\who Oscar Garrido}, {\where Malm?}\\ {\who Thore Husfeldt}, {\where Lund}\\ {\who Miros{\l}aw Kowaluk}, {\where Warsaw}\\ \end{document} ------------- 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.