From Sylvain.Petitjean at loria.fr Wed Mar 5 19:05:10 2003 From: Sylvain.Petitjean at loria.fr (Sylvain Petitjean) Date: Mon Jan 9 13:41:09 2006 Subject: Postdoc position at INRIA (France) Message-ID: <20030305180510.GC28844@brahms.loria.fr> In 2003, INRIA, the French national institute for research in computer science and control, will be recruiting approximately 70 post-doctorates, 23 of whom will be part of a recruitment program which deadline is April 15, 2003. The other 50 will be recruited over the course of time. For more information and a list of proposed postdoctoral topics, please consult: http://www.inria.fr/travailler/opportunites/postdoc.en.html You can also contact a research team whose work is of interest to you and propose a research program. We, the geometric computing group at INRIA Lorraine (Nancy), one of the research units of the institute, proposed a postdoctoral subject on the efficient and robust computation of arrangements of quadrics (see below). If you recently obtained your PhD and are interested in working as a postdoc on this topic, please contact Sylvain Lazard (lazard@loria.fr) and Sylvain Petitjean (petitjea@loria.fr) (Please distribute to interested parties.) ------- Efficient and Robust Computation of Arrangements of Quadrics ------------------------------------------------------------ The two most widely used types of object representation in solid modeling are constructive solid geometry (CSG) and boundary representation (BRep). Both representations having their own respective advantages, solid modeling kernels often need an efficient and reliable way to convert one type of representation into the other. CSG-to-BRep conversion is a well understood problem, but past approaches have often put more emphasis on efficiency than on robustness and accuracy. If only finite-precision arithmetic is assumed, the topological consistency of the compute BRep can easily be jeopardized by small amounts of error introduced in the data. For many applications in design and automated manufacturing, this may be unacceptable. Designing reliable and robust algorithms is currently a major interest of the computational geometry and geometric computing research communities. A number of successful approaches have been proposed for the robust and accurate CSG-to-BRep conversion of polyhedral models. Computing the topological structure of a BRep involves accurately evaluating signs of arithmetic expressions, which can be achieved for piecewise-linear models assuming the necessary bit length is allowed for number representation. By contrast, there has been much less work on robust CSG-to-BRep conversion algorithms for curved primitives (with the notable exception of [1]). A major reason is that outside the linear realm exact arithmetic computations require algebraic numbers which cannot in general be representated explicitly with a finite number of bits. In addition, computation with algebraic numbers is extremely slow. In the algebraic domain, the most simple surfaces, outside piecewise-linear meshes, are degree 2 surfaces, i.e. quadrics. Quadrics represent a fairly good compromise between complexity, flexibility and modeling power. With respect to the CSG-to-BRep conversion problem, and more generally to the computation of arrangements of quadrics, they also have undeniable advantages. Indeed, the quadratic nature of their defining equations permits an explicit representation of intersection curves. Thus, it is theoretically possible to compute a fully parametric representation of the boundary of second-order CSG solids. The goal of this postdoc is to make strides towards this goal. Recently, we have proposed and implemented a robust algorithm for the near-optimal parameterization of the intersection of two quadrics [2]. The complexity of the output is minimal in terms of the number and depth of the radicals involved. Using this algorithm (and the accompanying theoretical results) as a building block, the postdoctoral candidate will propose solutions for the robust and efficient computation of arrangements of quadrics. Depending on his/her background, he/she will focus more specifically on one or several of the many different aspects of the problem: handling degenerate cases, mixing finite-precision and exact arithmetic, ensuring the geometrical-topological consistency, using filters, designing proper geometric predicates, managing complexity, solving polynomial equations with algebraic coefficients, sorting algebraic points along a curve, ... [1] J. Keyser, S. Krishnan and D. Manocha, Efficient and Accurate BRep Generation of Low Degree Sculptured Solids Using Exact Arithmetic, Computer Aided Geometric Design, 16 (9), 1999. [2] L. Dupont, D. Lazard, S. Lazard and S. Petitjean, Near-Optimal Parameterization of the Intersection of Quadrics, Proc. of the ACM Symposium on Computational Geometry (SoCG), 2003, to appear. -- - Sylvain ------------- 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 efowler at seanet.com Sat Mar 8 14:57:30 2003 From: efowler at seanet.com (Eric Fowler) Date: Mon Jan 9 13:41:09 2006 Subject: How to turn complex polygon into simple polygon? Message-ID: I need a simple algo for creating a simple polygon from a complex one, i.e., a list of segments with adjoining endpoints, some of the segments being colinear or crossing each other. I don't care about finding a given unique or optimal way to get to a simple poly, any old simple polygon will do, but it has to have all the points from the parent complex polygon. It is easy enough to find intersecting segments, but here is the rub - how to flip the segments without breaking up your polygon into 2 subpolygons? Each intersection offers 2 ways to flip the lines, but only one will NOT cut the polygon Visualize a figure - 8 polygon. You need the intersecting segments to swap endpoints. There are two ways to do it. One way gets you a simple large polygon, the other way gets you two little ones. How do I distinguish them? I could test for closure of either proposed new polygons, but I want to avoid that because it might be costly. So, is there a cheap test for whether an edge flip cuts up a polygon? Oh, and I assume for any given set of n >= 3 points there exists a simple polygon connecting them ... Eric ------------- 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 ian at cs.wits.ac.za Tue Mar 4 14:57:07 2003 From: ian at cs.wits.ac.za (Ian Sanders) Date: Mon Jan 9 13:41:09 2006 Subject: Vacant posts at The University of the Witwatersrand Message-ID: <> University of the Witwatersrand, Johannesburg School of Computer Science Vacant Posts Professor / Associate Professor / Senior Lecturer / Lecturer The School of Computer Science is one of the premier computer science departments in South Africa, with a strong local research base as well as international research links. Particularly in the Southern African context, computer science has an important role in a transforming society. The mission of the School is to address dynamic African needs: both in developing highly educated students and in pursuing research of an international standard in computer science. The University has recognised this by granting additional posts to grow this important discipline. Wits Computer Science has an expanding postgraduate programme with a large intake of students from Africa. With this comes the need to further develop research capacity. Staff are being sought to consolidate existing research thrusts within the School. A new research area in Computational Molecular Biology is currently being established. Other research areas include: Algorithms, Computer Science Education, Formal Languages, Networks and Computational Geometry. The School is actively exploring interdisciplinary research and there is also the possibility of a joint linguistics post to carry out research into Computational Linguistics. Applications at the levels of professor / associate professor / senior lecturer / lecturer will be considered. For posts at lecturer and senior lecturer level, the minimum qualification required is a PhD. Candidates close to completion of a PhD will be considered for lectureships. We would like to see evidence of research and teaching potential. Candidates for senior lecturer posts would have to show evidence of post-doctoral research and teaching. An associate professor would have to demonstrate competence at teaching and have established an independent and ongoing research record. Evidence of academic citzenship would also be required. For posts at professorial level, competence in teaching; experience in undertaking and managing research projects; and a proven ability to attract external funding, as well as experience in academic administration is required. Duties An important aspect of these posts is to undertake and lead research. In addition, appointees will be expected to teach in undergraduate, higher diploma and postgraduate programmes. Salary Range These are fixed by the University based on the level of appointment and the applicant's experience. The salary scales include a "market related adjustment" for targeted disciplines and currently include a salary subvention (in the region of 10% of normal salary). Salary scales are comparable with other South African universities. Benefits The University offers a salary package including annual bonus, generous leave, retirement fund, and medical aid. A relocation allowance will be offered. The package can be arranged to cover housing subsidy. The University offers a fee remission towards dependents' University studies. For more information on the posts and the School see http://www.cs.wits.ac.za/staff/vacant.html Enquiries: Professor C Mueller, e-mail:conrad@cs.wits.ac.za To apply: Submit a covering letter, a detailed CV with names, addresses and contact details of three referees to: The Faculty of Science Human Resources Office, University of the Witwatersrand, Private Bag 3, WITS, 2050 South Africa by 31 March 2003. E-mail: patelk@science.wits.ac.za ---------------------------------------------------------------- Ian Sanders (Associate Professor) Telephone: (2711) 717-6187 School of Computer Science Fax: (2711) 717-6199 University of the Witwatersrand Private Bag 3 email: ian@cs.wits.ac.za 2050 WITS SOUTH AFRICA http://www.cs.wits.ac.za/~ian ------------- 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 sca03 at cs.unc.edu Thu Mar 6 01:02:58 2003 From: sca03 at cs.unc.edu (Symposium on Computer Animation) Date: Mon Jan 9 13:41:09 2006 Subject: Call For Participation Message-ID: <200303060602.h2662wgt015651@swift.cs.unc.edu> ----------------------------------------------------------------------- CALL FOR PAPERS ----------------------------------------------------------------------- ACM SIGGRAPH/Eurographics Symposium on COMPUTER ANIMATION (SCA'03) July 26-27, 2003 San Diego, California (co-located with SIGGRAPH) http://gamma.cs.unc.edu/SCA03 SCA is an emerging eminent forum for dissemination of the latest research results in computer animation. The goal of SCA'03 is to provide an opportunity for researchers in computer animation to interact with one another, share new results, and discuss emerging directions for the field. The symposium will be co-located with SIGGRAPH, held on the Saturday and Sunday before the main conference to encourage a broad range of participants. A full proceedings will be published at the time of the Symposium. Topics include, but are not limited to: - autonomous characters - physically based animation - facial animation - real-time animation, animation for games - group and crowd behavior - expressive motion / communication - nonphotorealistic animation - physical realism / measuring the real world for animation - nature in motion (natural phenomena, plants, clouds...) - planning / learning / optimization for animation - intuitive interfaces for creating and editing animations - sound and speech for animation - perceptual metrics for animation - mathematical foundations of animation - new time-based art forms on the computer ---------------------------------------------------------------------- Important Dates: Deadline for Abstract Submissions -- April 1, 2003 Firm Deadline for Paper Submissions -- April 7, 2003 Notification to Authors -- May 10, 2003 Deadline for Camera Ready Copy -- May 17, 2003 Symposium Dates -- July 26-27, 2003 ---------------------------------------------------------------------- Abstract are used to facilitate the review process and should be 150-300 words in length. Original unpublished papers of (in PDF format) up to 12 pages in English, including figures, tables and references, are invited. All papers must be submitted electronically through the SCA web site to be considered for review. (For instructions, see http://gamma.cs.unc.edu/SCA03.) Supplementary material such as videos may also be submitted electronically and will be made available to reviewers. All papers will be reviewed carefully by the International Program Committee members and by external reviewers. Format guidelines are the same as those for SIGGRAPH technical papers: http://www.siggraph.org/publications/prep/ Please prepare your papers for anonymous review. Papers should be submitted to SCA exclusively. Proceedings will be published by ACM Press. Authors of accepted papers will be required to sign the ACM copyright form, which will be made accessible from the SCA web site. ---------------------------------------------------------------------- CONFERENCE CHAIRS: Rick Parent Ohio State University parent@cis.ohio-state.edu Karan Singh University of Toronto karan@cs.toronto.edu PROGRAM CHAIRS: David Breen California Institute of Technology david@cacr.caltech.edu Ming C. Lin University of North Carolina at Chapel Hill lin@cs.unc.edu ---------------------------------------------------------------------- International Program Committee: Norm Badler (University of Pennsylvania) David Baraff (Pixar animation Studios) Ronen Barzel (Pixar Animation Studios) Bruce Blumberg (MIT) Bobby Bodenheimer (Vanderbilt University) Ronan Boulic (EPFL) Chris Bregler (New York University) David Brogan (University of Virginia) Pere Brunet (Universitat Politechnica de Catalunya) Marie-Paule Cani (iMAGIS/Institut National Polytechnique de Grenoble) Justine Cassell (MIT) Stephen Chenney (University of Wisconsin) Jonathan Cohen (Johns Hopkins University) Michael Cohen (Microsoft Research) James Cremer (University of Iowa) Cassidy Curtis (PDI/Dreamworks) Doug DeCarlo (Rutgers University) Mathieu Desbrun (University of Southern California) Julie Dorsey (Yale University) Stephane Donikian (IRISA) Irfan Essa (Georgia Tech) Petros Faloutsos (UCLA) Ron Fedkiw (Stanford University) Kurt Fleischer (Pixar Animation Studios) Nick Foster (PDI/Dreamworks) Eugene Fiume (University of Toronto) Michael Gleicher (University of Wisconsin) Joerg Haber (Max-Plank Institut) James Hahn (George Washington University) Jessica Hodgins (Carnegie Mellon University) Donald House (Texas A&M University) Takeo Igarashi (University of Tokyo) Doug L. James (University of British Columbia) Michael Kass (Pixar Animation Studios) Hyeong-Seok Ko (Seoul National University) James Kuffner (Carnegie Mellon University) Joe Laszlo (University of Toronto) Jehee Lee (Seoul National University) J. P. Lewis (University of Southern California) Zicheng Liu (Microsoft Research) Nadia Magnenat-Thalmann (University of Geneva) Joe Marks (MERL) Dinesh Manocha (University of North Carolina at Chapel Hill) Leonard McMillan (University of North Carolina at Chapel Hill) Dimitris Metaxas (Rutgers University) Matthias Mueller (ETH Zurich) Ulrich Neumann (University of Southern California) Victor Ng-Thow-Hing (Honda R&D Americas) James F. O'Brien (University of California Berkeley) Carol O'Sullivan (Trinity College Dublin) Nancy Pollard (Brown University) Catherine Pelachaud (Universita di Roma) Dinesh Pai (University of British Columbia) Frederic Parke (Texas A&M University) Jovan Popovic (MIT) Zoran Popovic (University of Washington) Lionel Reveret (iMAGIS/INRIA) Craig Reynolds (Sony Computer Entertainment America) Doug Roble (Digital Domain) Seth Rosenthal (ILM) Peter Schroder (California Institute of Technology) Hans-Peter Seidel (Max-Planck-Institut Informatik) Sung Yong Shin (KAIST) Harry Shum (Microsoft Research) Peter-Pike Sloan (Microsoft Research) Vibeke Sorensen (University of Southern California) Jos Stam (Alias|wavefront) Demetri Terzopoulos (New York University) Daniel Thalmann (EPFL) Greg Turk (Georgia Tech) Michiel van de Panne (University of British Columbia) Markus Wacker (University of Tuebingen) Ross Whitaker (University of Utah) Jane Wilhelms (University of California at Santa Cruz) Andrew Witkin (Pixar Animation Studios) Michael Zyda (Naval Postgraduate School) Ken Anjyo (OLM Digital, Inc.) Norm Badler (University of Pennsylvania) Ronen Barzel (Pixar Animation Studios) Bruce Blumberg (MIT) Bobby Bodenheimer (Vanderbilt University) Ronan Boulic (EPFL) Chris Bregler (New York University) David Brogan (University of Virginia) Pere Brunet (Universitat Politechnica de Catalunya) Marie-Paule Cani (INP Grenoble) Stephen Chenney (University of Wisconsin) Jonathan Cohen (Johns Hopkins University) Michael Cohen (Microsoft Research) James Cremer (University of Iowa) Doug DeCarlo (Rutgers University) Mathieu Desbrun (University of Southern California) Julie Dorsey (Yale University) Stephane Donikian (IRISA) Irfan Essa (Georgia Tech) Petros Faloutsos (UCLA) Ron Fedkiw (Stanford University) Nick Foster (PDI/Dreamworks) Eugene Fiume (University of Toronto) Michael Gleicher (University of Wisconsin) Joerg Haber (Max-Plank Institut) James Hahn (George Washington University) Jessica Hodgins (Carnegie Mellon University) Donald House (Texas A&M University) Takeo Igarashi (University of Tokyo) Doug L. James (University of British Columbia) Hyeong-Seok Ko (Seoul National University) James Kuffner (Carnegie Mellon University) Joe Laszlo (University of Toronto) Jehee Lee (Seoul National University) J. P. Lewis (University of Southern California) Zicheng Liu (Microsoft Research) Nadia Magnenat-Thalmann (University of Geneva) Dinesh Manocha (University of North Carolina at Chapel Hill) Dimitris Metaxas (Rutgers University) Matthias Mueller (ETH Zurich) Ulrich Neumann (University of Southern California) Victor Ng-Thow-Hing (Honda R&D Americas) James F. O'Brien (University of California Berkeley) Carol O'Sullivan (Trinity College Dublin) Fred Pighin (Institute of Creative Technology, USC) Nancy Pollard (Brown University) Catherine Pelachaud (Universita di Roma) Dinesh Pai (University of British Columbia) Frederic Parke (Texas A&M University) Jovan Popovic (MIT) Lionel Reveret (iMAGIS/INRIA) Craig Reynolds (Sony Computer Entertainment America) Doug Roble (Digital Domain) Peter Schroder (California Institute of Technology) Hans-Peter Seidel (Max-Planck-Institut Informatik) Sung Yong Shin (KAIST) Harry Shum (Microsoft Research) Vibeke Sorensen (University of Southern California) Demetri Terzopoulos (New York University) Daniel Thalmann (EPFL) Michiel van de Panne (University of British Columbia) Markus Wacker (University of Tuebingen) Ross Whitaker (University of Utah) Jane Wilhelms (University of California at Santa Cruz) Michael Zyda (Naval Postgraduate School) ------------- 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 tsimos at mail.ariadne-t.gr Thu Mar 6 20:38:00 2003 From: tsimos at mail.ariadne-t.gr (=?iso-8859-7?Q?=C4=F1=2E=20=C8=E5=FC=E4=F9=F1=EF=F2=20=D3=DF=EC=EF=F2?= - Dr. Theodore Simos) Date: Mon Jan 9 13:41:09 2006 Subject: Final Call for Papers - ICCMSE 2003 Message-ID: <3E679588.B8B0EDE5@mail.ariadne-t.gr> Dear Colleagues Please find below the FINAL call for papers for ICCMSE 2003. Please circulated to all of your colleagues. If you want to receive Poster(s) or Brochure(s) for ICCMSE, please send a message to iccmse@uop.gr With my best wishes and regards Dr. T.E. Simos Invited Chair ICCMSE 2003 ===================================================================================== FINAL CALL FOR PAPERS INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING (ICCMSE 2003) Kastoria, Greece September 12-16, 2003 http://www.uop.gr/~iccmse/ or http://kastoria.teikoz.gr/~iccmse/ In the past decades many significant insights have been made in several areas of Computational Methods in Sciences and Engineering. New problems and methologies have appeared. There is permantly a need in these fields for the advancement of information exchange. This undoubtedly beneficial practice of interdisciplinary and multidisciplinary interactions should be expressed by an interdisciplinary and multidisciplinary conference on Computational Methods in Sciences and Engineering. ICCMSE 2003 aims at playing the above role and for this reason the aim of the conference is to bring together computational scientists and engineers from several disciplines in order to share methods, methologies and ideas. The topics to be covered include (but are not limited to): Computational mathematics, Computational physics, Computational chemistry, Computational engineering, Computational mechanics, Computational finance, Computational medicine, Computational biology, Computational economics, High performance computing, Mathematical Methods in Sciences and Engineering, Industrial Mathematics, etc. General Chair: Dr. Z.Kalogiratou, Technological Educational Institution of W. Macedonia, Kastoria, Greece. Invited Chair: Dr. T.E. Simos, University of Peloponnese, Tripolis, Greece. Scientific Committee: Prof. H. Agren (Royal Institute of Technology, Sweden), Prof. H. Arabnia (The University of Georgia, USA), Prof. J. Vigo-Aguiar (University of Salamanca, Salamanca, Spain), Prof. D. Belkic (Karolinska Institute, Stockholm, Sweden), Prof. K. Belkic (University of Southern California, USA), Prof. E. Brandas (University of Uppsala, Uppsala, Sweden), Prof. J.C. Butcher (The University of Auckland, New Zealand), Prof. A.Q.M. Khaliq (Western Illinois University, USA), Prof. G. Maroulis (University of Patras, Patras, Greece), Prof. S. Wilson (Rutherford Appleton Laboratory, UK), Prof. J. Xu (Pennsylvania State University, USA) Proceedings: Extended abstracts will be published in a special volume of World Scientific Publishing Company. The journals which until now have accepted to publish selected Proceedings of ICCMSE 2003 are: 1. Computational Materials Science (Elsevier Science Publishers) 2. The Journal of Supercomputing (Kluwer Publications) 3. MATCH - Communications in Mathematical and Computer Chemistry 4. Journal of Computational Methods in Sciences and Engineering (JCMSE) (Cambridge International Science Publishing) 5. Journal of Mathematical Chemistry (Kluwer Publications) 6. Mathematical and Computer Modelling (Elsevier Science Publishers) 7. Communications in Nonlinear Science and Numerical Simulation (Elsevier Science Publishers) 8. Journal of Computational and Applied Mathematics (Elsevier Science Publishers) IMPORTANT DATES Submission of Extended Abstract: April 30, 2003 - This is the final date Early Registration ends (i.e. fees paid and a Bank Slip is arrived in the fax (++ 30210 94 20 091) of Secretary of ICCMSE): May 15, 2003 Notification of acceptance: May 25, 2003 Submission of the source files of the camera ready extended abstracts to World Scientific Publishing Company: June 1, 2003 - This is the final date Submission of the full paper for consideration for publication in one of the eight journals: September 30, 2003 - This is the final date Contact information: Secretary ICCMSE, E-mail: iccmse@uop.gr, Postal Address: 26 Menelaou Street, Amfithea Paleon Faliron, GR-175 64, Athens, Greece, Fax: +30210 94 20 091 -- Dr. T.E. Simos Active Member of the European Academy of Sciences and Arts URL: http://www.uop.gr/~simos Editor-in-Chief and Founder Journal of Computational Methods in Sciences and Engineering (JCMSE) ISSN 1472-7978 http://www.demon.co.uk/cambsci/jcmse.html Editor-in-Chief and Founder Computing Letters (COMPULETT) ISSN 1475-5513 Cambridge International Science Publishing Ltd. Registered in England under Registration No 214933767 Official Address: Department of Computer Science and Technology, Faculty of Sciences and Technology, University of Peloponnese, GR-221 00 Tripolis, GREECE. Postal Address: 26 Menelaou Street, Amfithea - Paleon Faliron, GR-175 64 Athens, GREECE. E-mail: tsimos@mail.ariadne-t.gr ========================================================================== Conferences ----------- International Conference of Computational Methods in Sciences and Engineering (ICCMSE 2003), Kastoria, September 12-16, 2003 Information: iccmse@uop.gr URL: http://www.uop.gr/~iccmse/ URL: http://kastoria.teikoz.gr/~iccmse/ Numerical Analysis and Computational Mathematics 2003 (NaCoM 2003) Cambridge 23-26 May 2003, Information: g.y.psihoyios@apu.ac.uk URL: http://www.apu.ac.uk/appsci/maths/NACoM-2003/ -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20030306/224c3752/attachment.htm From eppstein at ics.uci.edu Mon Mar 10 07:39:41 2003 From: eppstein at ics.uci.edu (David Eppstein) Date: Mon Jan 9 13:41:09 2006 Subject: How to turn complex polygon into simple polygon? In-Reply-To: References: Message-ID: <22909259.1047281981@[10.0.1.2]> On 3/8/03 2:57 PM -0800 Eric Fowler wrote: > I need a simple algo for creating a simple polygon from a complex one, > i.e., a list of segments with adjoining endpoints, some of the segments > being colinear or crossing each other. I don't care about finding a given > unique or optimal way to get to a simple poly, any old simple polygon > will do, but it has to have all the points from the parent complex > polygon. The usual way to do this is to ignore the input segments, find the bottommost point, sort the other points radially around the bottommost points, connect them in the sorted order, and attach the bottommost point to both ends of the sorted chain. Unless there is some structure from the original polygon that is not sufficiently preserved by this? -- David Eppstein http://www.ics.uci.edu/~eppstein/ Univ. of California, Irvine, School of Information & Computer Science ------------- 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 Mon Mar 10 09:01:05 2003 From: jsbm at ams.sunysb.edu (jsbm@ams.sunysb.edu) Date: Mon Jan 9 13:41:09 2006 Subject: How to turn complex polygon into simple polygon? In-Reply-To: Message-ID: <200303101357.h2ADvHX29178@catbert.ams.sunysb.edu> Eric, If I understand your question correctly, you can just do this: sort the points by angle about any one of the points (actually, do this using the "left" test, without arc-tangents, etc). Join the points in this order, giving you a star-shaped simple polygon. (This also gives you a proof that a simple polygonalization always exists for any set of points, as you suspect.) See ``On the Reflexivity of Point Sets'', Esther M. Arkin, Sandor Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristan, and Saurabh Sethia, http://arXiv.org/abs/cs.CG/0210003 for related discussions about polygonalizations and some references to earlier work. Best, Joe Mitchell On 8 Mar, Eric Fowler wrote: > I need a simple algo for creating a simple polygon from a complex one, i.e., > a list of segments with adjoining endpoints, some of the segments being > colinear or crossing each other. I don't care about finding a given unique > or optimal way to get to a simple poly, any old simple polygon will do, but > it has to have all the points from the parent complex polygon. > > It is easy enough to find intersecting segments, but here is the rub - how > to flip the segments without breaking up your polygon into 2 subpolygons? > Each intersection offers 2 ways to flip the lines, but only one will NOT cut > the polygon Visualize a figure - 8 polygon. You need the intersecting > segments to swap endpoints. There are two ways to do it. One way gets you a > simple large polygon, the other way gets you two little ones. How do I > distinguish them? > > I could test for closure of either proposed new polygons, but I want to > avoid that because it might be costly. > > So, is there a cheap test for whether an edge flip cuts up a polygon? > > Oh, and I assume for any given set of n >= 3 points there exists a simple > polygon connecting them ... > > Eric ------------- 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 jie.lin at yale.edu Tue Mar 11 22:21:46 2003 From: jie.lin at yale.edu (Jie Lin) Date: Mon Jan 9 13:41:09 2006 Subject: Sorry about a typo in my previous question on: common intersection of circles Message-ID: <007101c2e846$83bf1cd0$6401a8c0@jl364> I am reall sorry for sending this msg again. But I discovered a typo in my previous msg. The set of point should be "Within" radius R from the origin, not "With". Best Regards, Jie ----- Original Message ----- From: "Jie Lin" To: Sent: Tuesday, March 11, 2003 9:21 PM Subject: common intersection of circles > Hello computational geometry people, > > I have n points {z_1, z_2, ... z_n} in the plane, located with radius R from > the origin. Denote H the convex hull of these n points plus the origin. > Denote C_i the circle with radius R centered at each point z_i. Denote S the > intersection of C_i. > > Now, it can be shown that if the origin 0 is a corner of the convex hull H, > then S has non-empty interior (contains more than point 0). > > My question is that whether or not the centroid (center of mass) of S ---the > common intersection of circles, is located in the convex hull H. If not, > does the line segment from 0 to the centroid of S has a positive > intersection with H? > > My feeling is yes, but I had trouble showing it. I hope someone in this > group can help me out here. Thanks in advance. > > Sincerely, > > Jie > ------------- 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 jie.lin at yale.edu Tue Mar 11 21:21:02 2003 From: jie.lin at yale.edu (Jie Lin) Date: Mon Jan 9 13:41:09 2006 Subject: common intersection of circles Message-ID: <004801c2e83e$07bf5030$6401a8c0@jl364> Hello computational geometry people, I have n points {z_1, z_2, ... z_n} in the plane, located with radius R from the origin. Denote H the convex hull of these n points plus the origin. Denote C_i the circle with radius R centered at each point z_i. Denote S the intersection of C_i. Now, it can be shown that if the origin 0 is a corner of the convex hull H, then S has non-empty interior (contains more than point 0). My question is that whether or not the centroid (center of mass) of S ---the common intersection of circles, is located in the convex hull H. If not, does the line segment from 0 to the centroid of S has a positive intersection with H? My feeling is yes, but I had trouble showing it. I hope someone in this group can help me out here. Thanks in advance. Sincerely, Jie ------------- 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 youngkim at cs.unc.edu Thu Mar 13 16:26:45 2003 From: youngkim at cs.unc.edu (Young J. Kim) Date: Mon Jan 9 13:41:09 2006 Subject: an algorithm to compute L_infty distance between Message-ID: Hi all, I am looking for an algorithm to compute L_infty (maximum) distance between convex polytopes. I would appreciate it if anyone can give me an pointer to any previous algorithms. Thanks in advance, Young. __________________________________________________________________ Young J. Kim http://www.cs.unc.edu/~youngkim GAMMA group, Computer Science TEL: +1-919-962-1761 UNC-Chapel Hill FAX: +1-919-962-1799 __________________________________________________________________ ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From pankaj at cs.duke.edu Tue Mar 11 11:56:06 2003 From: pankaj at cs.duke.edu (Pankaj Kumar Agarwal) Date: Mon Jan 9 13:41:09 2006 Subject: DIMACS Workshop on Geometric Optimization Message-ID: <200303111656.h2BGu6Z7002874@kant.cs.duke.edu> ******************************************************************** * DIMACS * * Center for Discrete Mathematics and Theoretical Computer Science * * Founded as a National Science and Technology Center * ******************************************************************** DIMACS Workshop on Geometric Optimization Dates: May 19 - 21, 2003 Location: DIMACS Center, Rutgers University, Piscataway NJ, 08854-8018 Organizers: Pankaj K. Agarwal, Duke University, pankaj@cs.duke.edu Joseph S. B. Mitchell, Stony Brook University, jsbm@ams.sunysb.edu Presented under the auspices of the DIMACS Special Focus on Computational Geometry and Applications. Rationale: Combinatorial optimization typically deals with problems of maximizing or minimizing a function of one or more variables subject to a large number of constraints. In many applications, the underlying optimization problem involves a constant number of variables and a large number of constraints that are induced by a given collection of geometric objects; these problems are referred to as geometric-optimization problems. Typical examples include facility location, low-dimensional clustering, network-design, optimal path-planning, shape-matching, proximity, and statistical-measure problems. In such cases one expects that faster and simpler algorithms can be developed by exploiting the geometric nature of the problem. Much work has been done on geometric-optimization problems during the last twenty-five years. Many elegant and sophisticated techniques have been proposed and successfully applied to a wide range of geometric-optimization problems. Several randomization and approximation techniques have been proposed. In parallel with the effort in the geometric algorithms community, the mathematical programming and combinatorial optimization communities have made numerous fundamental advances in optimization, both in computation and in theory, during the last quarter century. Interior-point methods, polyhedral combinatorics, and semidefinite programming have been developed as powerful mathematical and computational tools for optimization, and some of them have been used for geometric problems. Scope and Format: This workshop aims to bring together people from different research communities interested in geometric-optimization problems. The goal is to discuss various techniques developed for geometric optimization and their applications, to identify key research issues that need to be addressed, and to help establish relationships which can be used to strengthen and foster collaboration across the different areas. Call for Participation: Authors are invited to submit abstracts for talks to be given at the workshop. Please send the organizers 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.) Submissions will be due March 31, 2003. Notification of acceptance: April 15, 2003. Invited Speakers: Sanjeev Arora, Princeton University Daniel Bienstock, Columbia University David Eppstein, UC Irvine Micha Sharir, Tel Aviv University Santosh Vempala, MIT Emo Welzl, ETH Zurich Contributed Talks: The program will be announced April 15, 2003. Registration: (Pre-registration date: May 04, 2003) Regular rate Preregister before deadline $120/day After preregistration deadline $140/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 for the workshop. Registration fees cover 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 situation. 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, accommodations, and travel can be found at: http://dimacs.rutgers.edu/Workshops/GeomOpt/index.html ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From tmm at cs.ubc.ca Tue Mar 18 18:15:16 2003 From: tmm at cs.ubc.ca (Tamara Munzner) Date: Mon Jan 9 13:41:09 2006 Subject: InfoVis papers deadline March 31 In-Reply-To: References: Message-ID: <15991.53940.246494.249959@pangolin.cs.ubc.ca> The paper deadline is approaching! ** March 31 ** Call for Participation IEEE InfoVis 2003 October 19-21, 2003 Seattle, WA http://www.infovis.org/infovis2003 Computer-based information visualization, or "infovis", centers around helping people explore or explain data by designing interactive software that exploits the capabilities of the human perceptual system. The central design challenge in infovis is designing a cognitively useful spatial mapping of a dataset that is not inherently spatial. There are many possible visual encodings, only a fraction of which are helpful for a given task. We draw on the intellectual history of several traditions, including computer graphics, human-computer interaction, cognitive psychology, semiotics, graphic design, statistical graphics, cartography, and art. The synthesis of relevant ideas from these fields with new methodologies and techniques made possible by interactive computation are critical for helping people keep pace with the torrents of data confronting them. One of the few resources increasing faster than the speed of computer hardware is the amount of data to be processed. InfoVis is the primary meeting in the field of information visualization, and is held in conjunction with the IEEE Visualization 2003 (Vis03) conference. This year we have introduced new paper categories (due March 31, using electronic submission) and an InfoVis contest. Further, the symposium is starting a half day earlier, on Sunday afternoon. Please see the conference website for more details. ------------- 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 icalp2003 at TUE.nl Wed Mar 19 14:36:56 2003 From: icalp2003 at TUE.nl (icalp2003@TUE.nl) Date: Mon Jan 9 13:41:09 2006 Subject: list accepted papers for ICALP 2003 Message-ID: ------------------------------------------------------------------------- We apologize for the reception of multiple copies of this message. ---------------------------------------------------------------------------- ---------------------------- ============================================================================ ========== List of papers accepted for ICALP'2003, Track A and Track B Eindhoven, The Netherlands, June 30 - July 4, 2003 http://www.win.tue.nl/icalp2003/ ============================================================================ ========== Vincent Blondel, Paul Van Dooren Similarity matrices for pairs of graphs Arnold Schoenhage Adaptive raising strategies optimizing relative efficiency Sergei Bespamyatnikh, Michael Segal Dynamic algorithms for approximating interdistances Amos Korman, David Peleg Labeling schemes for dynamic tree networks Geraud Senizergues The equivalence problem for t-turn DPDA is co-NP John Hitchcock, Jack Lutz, Elvira Mayordomo Scaled dimension and nonuniform complexity Yossi Matias, Ely Porat Efficient pebbling for list traversal synopses Alexander Ageev, Yinyu Ye, Jiawei Zhang Improved combinatorial approximation algorithms for the k-level facility location problem Markus Blaeser An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality Susanne Albers, Rob van Stee A study of integrated document and connection caching Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat Function matching: algorithms, applications, and a lower bound Eyal Even-Dar, Alex Kesselman, Yishay Mansour Convergence time to Nash equilibria Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani MAX k-CUT and approximating the chromatic number of random graphs Jiri Fiala, Daniel Paulusma The computational complexity of the role assignment problem Vipul Bansal, Aseem Agrawal, Varun Malhotra Stable marriages with multiple partners: efficient search for an optimal solution Juraj Hromkovic, Georg Schnitger Pushdown automata and multicounter machines, a comparison of computation mode Jens Jaegerskuepper Analysis of a simple evolutionary algorithm for minimization in Euclidean spaces Noam Berger, Bela Bollobas, Christian Borgs, Jennifer Chayes, Oliver Riordan Degree distribution of the FKP network model Luisa Gargano, Mikael Hammar There are spanning spiders in dense graphs (and we know how to find them) Annalisa De Bonis, Leszek Gasieniec, Ugo Vaccaro Generalized framework for selectors with applications in optimal group testing Michael Elkin, Guy Kortsarz Approximation algorithm for the directed telephone multicast problem Sanjeev Arora, Kevin Chang Approximation schemes for degree-restricted MST and red-blue separation problem Surender Baswana, Sandeep Sen A simple linear time algorithm for computing a (2k-1)-Spanner of O(n^{1+1/k}) size in weighted graphs Chandra Chekuri, Marcelo Mydlarz, Bruce Shepherd Multicommodity demand flow in a tree Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor Algorithmic aspects of bandwidth trading Chandra Chekuri, Sudipto Guha, Joseph Naor Approximating Steiner k-cuts Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan, Kazuhisa Makino An intersection inequality for discrete distributions and related generation problems Erik Demaine, Fedor Fomin, MohammadTaghi Hajiaghayi, Dimitrios Thilikos Fixed-parameter algorithms for the (k,r)-center in planar graphs and map graphs Gianni Franceschini, Roberto Grossi Optimal cache-oblivious implicit dictionaries Anna Gal, Peter Bro Miltersen The cell probe complexity of succinct data structures, Alex Hall, Steffen Hippler, Martin Skutella Multicommodity flows over time: efficient algorithms and complexity Rene Sitters, Leen Stougie, Willem Paepe A competitive algorithm for the general 2-server problem Luis Antunes, Lance Fortnow Sophistication revisited Peter Hoyer, Michele Mosca, Ronald de Wolf Quantum search on bounded-error inputs Dimitris Fotakis On the competitive ratio for online facility location Satoshi Ikeda, Izumi Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita Impact of local topological information on random walks on finite graphs Pilu Crescenzi, Giorgio Gambosi, Gaia Nicosia, Paolo Penna, Walter Unger On-line load balancing made simple: greedy strikes back Seffi Naor, Hadas Shachnai, Tami Tamir Real-time scheduling with a budget Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro Solving the robots gathering problem Rainer Feldmann, Martin Gairing, Thomas Luecking, Burkhard Monien, Manuel Rode Nashification and the coordination ratio for a selfish routing game Brian Dean, Michel Goemans Improved approximation algorithms for minimum-space advertisement scheduling Baruch Awerbuch, Andre Brinkmann, Christian Scheideler Anycasting in adversarial systems: routing and admission control Jianer Chen, Iyad Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia Genus characterizes the complexity of graph problems: some tight results Markus Holzer, Martin Kutrib Flip-pushdown automata: k+1 pushdown reversals are better than k Manuel Bodirsky, Clemens Gr?pl, Mihyun Kang Generating labeled planar graphs uniformly at random Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan An improved approximation algorithm for vertex cover with hard capacities Dominique Poulalhon, Gilles Schaeffer Optimal coding and sampling of triangulations Ian Munro, Rajeev Raman, Venkatesh Raman, Srinivasa Rao Satti Succinct representations of permutations Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen A direct sum theorem in communication complexity via message compression Rajeev Raman, Srinivasa Rao Succinct dynamic dictionaries and trees Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung Decoding of interleaved Reed Solomon codes over noisy data, Juha K?rkk?inen, Peter Sanders Simple linear work suffix array construction Manfred Droste, Dietrich Kuske Skew and infinitary formal power series Ernst-Erich Doberkat Semi-pullbacks and bisimulations in categories of stochastic relations Stefan Blom, Wan Fokkink, Sumit Nain On the axiomatizability of ready traces, ready simulation and failure traces Juraj Hromkovic, Georg Schnitger Nondeterminisn versus determinism for two-way finite automata: generalizations of Sipser's separation Daniele Gorla, Rosario Pugliese Resource access and mobility control with dynamic privileges acquisition Jan Johannsen, Martin Lange CTL+ is complete for double exponential time Davide Ancona, Sonia Fagorzi, Eugenio Moggi, Elena Zucca Mixin modules and computational effects Thierry Cachat Higher order pushdown automata, the Caucal hierarchy of graphs and parity games Gaoyan Xie, Zhe Dang, Oscar Ibarra A solvable class of quadratic Diophantine equations with applications to verification of infinite state systems Alexander Okhotin Decision problems for language equations with Boolean operations Roberto Bruni, Jose Meseguer Generalized rewrite theories Salvatore La Torre, Margherita Napoli, Mimmo Parente, Gennaro Parlato Hierarchical and recursive state machines with context-dependent properties Cindy Eisner, Dana Fisman, John Havlicek, Anthony McIsaac, David Van Campenhout The definition of a temporal clock operator Nadia Busi, Maurizio Gabbrielli, Gianluigi Zavattaro Replication vs. recursive definitions in channel based calculi Richard Mayr Undecidability of weak bisimulation equivalence for 1-counter processes Felix Klaedtke, Harald Ruess Monadic second-order logics with cardinalities Orna Kupferman, Moshe Vardi Pi_2 intersected Sigma_2 equals AFMC Alexander Rabinovich Quantitative analysis of probabilistic lossy channel systems Massimo Merro, Francesco Zappa Nardelli Bisimulation proof methods for mobile ambients Tatiana Rybina, Andrei Voronkov Upper bounds for a theory of queues Zena Ariola, Hugo Herbelin Minimal classical logic and control operators Arnaud Carayol, Thomas Colcombet On equivalent representations of infinite structures Philippe Schnoebelen Oracle circuits for branching-time model checking Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar Discounting the future in systems theory Thomas Henzinger, Ranjit Jhala, Rupak Majumdar Counterexample guided control Jo Hannay Axiomatic criteria for quotients and subobjects for higher-order data types Francois Denis, Yann Esposito Residual languages and probabilistic automata Francisco Gutierrez, Blas Ruiz Expansion postponement via cut elimination in sequent calculi for pure type systems Michele Bugliesi, Silvia Crafa, Amela Prelic, Vladimiro Sassone Secrecy in untrusted networks Luca de Alfaro, Marco Faella Information flow in concurrent games Marielle Stoelinga , Frits Vaandrager A testing scenario for probabilistic automata Arkadev Chattopadhyay, Denis Therien Locally commutative categories ============================================================================ ========== ------------- 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 master_ukong at yahoo.com Sun Mar 23 22:27:00 2003 From: master_ukong at yahoo.com (ukong kasep) Date: Mon Jan 9 13:41:09 2006 Subject: Need Help Message-ID: <20030324062700.13555.qmail@web20707.mail.yahoo.com> I need help about shortest path solution with genetic algorithm and its source code in pascal or delphi...please --------------------------------- Do you Yahoo!? Yahoo! Platinum - Watch CBS' NCAA March Madness, live on your desktop! -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20030323/7111a620/attachment.htm From o.cheong at tue.nl Fri Mar 28 15:00:42 2003 From: o.cheong at tue.nl (Otfried Cheong) Date: Mon Jan 9 13:41:09 2006 Subject: Preview of Ipe 6.0 availabe Message-ID: <16004.21898.169000.211094@gargle.gargle.HOWL> Dear computational geometers, some of you may still remember the drawing program Ipe that I wrote in 1993-1994, and in fact some of you are still using it until today. Well, finally I've rewritten Ipe from scratch, and a preview of the new version Ipe 6 is available at http://ipe.compgeom.org (Thanks to Herve Bronnimann for hosting this page!) For those of you too young to remember, or who for some other reason have never heard about Ipe, below is a list of the main features. To say it even more concisely: Ipe is a drawing program for computational geometers, written by a computational geometer. Best wishes, Otfried Cheong -------------------------------------------------------------------- Ipe is a drawing editor for creating figures in PDF or (encapsulated) Postscript format. It supports making small figures for inclusion into LaTeX-documents as well as making multi-page PDF presentations that can be shown on-line with Acrobat Reader. Ipe's main features are: * Entry of text as LaTeX source code. This makes it easy to enter mathematical expressions, and to reuse the LaTeX-macros of the main document. In the display text is displayed as it will appear in the figure. * Produces pure Postscript/PDF, including the text. Ipe converts the LaTeX-source to PDF or Postscript when the file is saved. * It is easy to align objects with respect to each other (for instance, to place a point on the intersection of two lines, or to draw a circle through three given points) using various snapping modes. * Users can provide ipelets (Ipe plug-ins) to add functionality to Ipe. This way, Ipe can be extended for each task at hand. * The text model is based on Unicode, and has been tested with Korean, Chinese, and Japanese. * Ipe is available for Unix, Windows, and Mac OS X. * Ipe is written in standard C++ using the STL, and released under the Gnu Public License. -------------------------------------------------------------------- ------------- 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 sjf at research.bell-labs.com Fri Mar 28 16:35:28 2003 From: sjf at research.bell-labs.com (Steve Fortune) Date: Mon Jan 9 13:41:09 2006 Subject: SOCG/FCRC student activities Message-ID: <3E84C020.52891BE9@research.bell-labs.com> The 2003 Symposium on Computational Geometry (SOCG) will be part of FCRC (http://www.acm.org/fcrc/) in San Diego, June 8 - 10, 2003. FCRC has two activities directed towards student participants. One activity is a series of breakfasts with senior researchers. The purpose is to allow students to meet with senior researchers informally. If you would like to participate in the research breakfasts, there is an online registration form accessible through the FCRC website. The second activity is a series of two sessions where students can present posters about research results. The sessions are currently scheduled for monday June 9 and thursday Jun 12, from 5:30 to 7:00pm. (Unfortunately the SOCG business meeting is also scheduled for monday evening.) A flyer about the poster sessions is included below. The sessions are open to any student. However, students need to register planned participation so we can get a count (and if there are many registrants, it's possible participation may be limited). If you are a student attending SOCG with research results, please feel welcome to participate in the poster session; similarly, if you know a student with research results who is attending, please encourage them to participate. To register for the poster session or for more information, please contact Steven Fortune sjf@bell-labs.com ------------------------------------------------------------------------------------------------------ FCRC Student Attendees: Interested in displaying your work to the greater Computer Science community? Interested in a chance to make connections? Then apply to participate in the FCRC Student Poster Session. Tentatively scheduled from 5:30 to 7:00 on Monday and Thursday nights, the poster session will be a chance for you to display your research on one of these nights, and to interact with conferences attendees from a wide range of areas. Applicants will be selected by their conferences, and will be given space for a poster display. Held in conjunction with an FCRC social event for all conference attendees, researchers will have ample opportunity to view your poster and discuss your research with you. Interested students should apply though their own conference; each conference will select students for participation under the conference-specific criteria. Students will be assigned to the night corresponding to the conference that has selected them. For more information see the Student Activities link on the FCRC web page (http://www.acm.org/fcrc/). John Karro Student Activities 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 ursyn at unco.edu Tue Mar 25 22:27:35 2003 From: ursyn at unco.edu (Anna) Date: Mon Jan 9 13:41:09 2006 Subject: SIGGRAPH Call For Participation Message-ID: <200303260327.h2Q3RZ3b006828@grimy.research.bell-labs.com> History of Computer Graphics & Art; Call for Participation Your email address was collected by a program using the keywords: advanced, computer, graphics, arts, research. Apologies for multiple listings, and for those to whom this email does not apply. Please use the following e-mail for questions: ursyn@unco.edu History of Computer Graphics and Art -- Call for Participation The aim that guides this call is an intention to assemble a data bank of computer graphics and art. The goal is to document the evolvement of computer graphics, art, and the thought about art in relation to the progress of technology, thus creating a collection of images and essays created by artists, scientists, and people who influenced these disciplines, which reflects the unfolding of computer art due to technical achievements (hardware, software, languages, etc). With this approach, computer art and graphics are related to the history of inventions in concurrent periods of time. This treasury will be augmented by the artists' web sites along with the existing materials cumulated in various collections and will become a part of the ACM/ SIGGRAPH resources. There is no sole comprehensive resource describing the influences and inventions in computer graphics and computer art from a historical perspective. The "Birds of a Feather" gathering at the ACM/ SIGGRAPH 2002, San Antonio, Texas (organized by Anna Ursyn and Anne Morgan Spalter) generated a helpful feedback to this project. Those who feel their work contributed to the field of computer graphics, art, and the thought about art are requested to describe their areas of action and accomplishments. Since this approach calls for interaction between people representing various fields in the history of inventions, we ask to participate anybody involved in the progress of these fields, from software/hardware programmers to scientists and artists. Being a part of this project may be interesting both on a personal level and because it involves a great potential for new approaches in teaching and provides materials for visual learning. It would be greatly appreciated if you could forward this URL to anyone you feel could contribute to this project. This call and the release form is posted on the ACM/SIGGRAPH website: http://www.siggraph.org/education/cgHistory/history.html or simply on www.siggraph.org -- Please send 3 images of your artistic/scientific creations, with permissions and short statements (no more than 150 words). Both the low resolution (72 dpi) and higher resolution (200, 300 dpi) images would be appreciated for a data bank of computer graphics and art and possibly for a publication. -- Please contribute to this project by filling out our questionnaire. Answer as fully as you feel you have time for. Many various viewpoints are valuable. Also, questions may be used as a guide for the essay describing your contribution to the field, with visual thoughts which may be considered "milestones" in various decades (no more then 400 words). Send only what you own copyrights for and send it along with a signed release form. Your paper-signed permission is essential because researchers, educators, students and all interested parties might use the resources for teaching, reference, general reading, etc. Please send your materials on a CD Rom or a DVD, along with your contact address (URL address cannot be accepted as a valid entry), and signed on paper, dated permission forms at the address: Anna Ursyn, Department of Visual Arts, University of Northern Colorado, Greeley, CO 80639, USA. Questionnaire Please answer the following questions. The goal is to create a resource that conveys the interrelated histories of computer graphics and computer art. 1. Describe your field. Why are you interested in Computer Art/ Computer Graphics and what (event, need, idea, hope, obstacle) caused your involvement? Summarize your line of development (the essence of your input to the field) in relation to concurrent technology -- 100 words maximum. 2. Does the computer allow you to think visually about some topic or process in new ways? How has this influenced your work? Describe your ultimate accomplishment. 3. Has the field of computer art and graphics progressed in the ways that you expected? What has surprised you? What do you like about its progress and what do you wish had happened differently? What do you think the future holds for visual computing in science/art? Please make some predictions or wish lists for the near- and long-term future. 4. Describe your dream environment for enhancing your project ideas. What are your preferred tools for creating and how do they work? What tools (hardware/software) you have used initially had the strongest impact on your work? 5. Describe how you think specific advancements in technology, such as wireframe, hidden line removal, scanner, laser, HTML, Java applets, or any other advancement determined the way the approaches to creating art/graphics evolved? 6. How would you characterize the milestones (every ten years) in the development of computer technology? Which ones were most influential in art/graphics? 7. Which persons would you indicate as the pioneers in the particular areas/stages in which decade? Please type the following: Creator's Name: ____________________________________________________________ Company Name (optional): _________________________________________________ Address: _______________________________________________________________ City, State/Province Zip Code, and Country or Postal Code, City, and Country: ______________________________________________________________________ E-mail address: _________________________________________________________ Web site: _____________________________________________________________ Phone: _______________________________________________________________ Fax: _________________________________________________________________ Titles of your works: 1. 2. 3. ========================================================= Permission Form Name and contact information _____________________________________________________________________________ _____________________________________________________________________________ _____________________________________________________________________________ I, ____________________________________ grant permission to Anna Ursyn to publish my statements and images/artwork (200-300 and 72 dpi) for a web site display , a CD-Rom,, immersive display and its library, and a publication (please feel free to cross out whatever you do not grant permission for). I understand that the creators will be duly credited for their work. Signature _____________________ Date __________________________ Special thanks to Anne Morgan Spalter, Mike McGrath, Judy Brown, Bob Krawczyk, Tom Linehan, Werner Hansmann, the SIGRAPH Executive Committee, Rhonda Schauer, Bryan Phelphs and, of course, all the participants of the Birds of a Feather at the SIGGRAPH 2002 conference for all the feedback, helpful comments and suggestions. From contact at gd2003.org Fri Mar 28 15:28:57 2003 From: contact at gd2003.org (GD2003 Contact) Date: Mon Jan 9 13:41:09 2006 Subject: Graph Drawing 2003--Second Call for Papers Message-ID: Second Call for Papers 11th International Symposium on Graph Drawing GD2003 September 21-24, 2003, Perugia, Italy http://www.gd2003.org/ e-mail: contact@gd2003.org Graph Drawing is concerned with the geometric representation of graphs and networks and is motivated by those applications where it is crucial to visualize structural information as graphs. Bridging the gap between theoretical advances and implemented solutions is an important aspect of the conference. Indeed, advances in graph drawing are a key factor in such technological areas as Web computing, e-commerce, VLSI circuit design, information systems, software engineering, bioinformatics, networking, and cybergeography. Researchers and practitioners working on theoretical and practical aspects of graph drawing are welcome to participate. * Scope. ------ The range of topics that are within the scope of the International Symposium on Graph Drawing includes (but is not limited to): - Visualization of computer networks and Web maps - Graph algorithms - Visualization of software engineering diagrams - Geometric graph theory and geometric computing - Software systems and libraries for graph visualization - Topology and planarity - Visualization of database schemas - Graph combinatorics and optimization - Visualization of chemical structures and molecules * Call for Papers, Demos, and Posters. ------------------------------------ Authors are invited to submit papers describing original research and surveys of theoretical or practical significance to graph drawing. Demonstrations of systems incorporating original and innovative research ideas are also solicited. A system demonstration should include illustrative screen dumps and a description of the system's functionalities. Regular papers and demos must be labeled as either long or short; long papers will be assigned 12 pages in the conference proceedings, and short papers 6 pages. Submissions of posters in graph drawing and related areas are also solicited. The purpose is to provide a forum for the communication of results (which may appear elsewhere) to the graph drawing community. A poster will be given 2 pages in the conference proceedings. Submission of substantially similar papers or demos to GD 2003 and to other conferences with published proceedings is not allowed. * Graph Drawing Contest. ---------------------- Following the tradition of previous conferences, a graph drawing contest will be held. The best contribution will be awarded with a prize money of EURO 1000. More details can be found on the contest website (please follow the hyperlink from http://www.gd2003.org). * Instructions for Authors. ------------------------- Each submission must include an indication of its type (paper, demo description, or poster) and contact information for the primary author. For a paper or a demo, an indication about whether it is a regular or a short submission must also be given. Electronic submissions are strongly encouraged. Detailed submission instructions will be provided on the conference web site. * Important Dates. ---------------- - Submissions of papers, demos, and posters: May 31, 2003 - Notification of acceptance: July 15, 2003 - Graph Drawing Contest Submissions: August 15, 2003 * Proceedings. ------------ Accepted submissions will be published in the conference proceedings, which will be included in the Springer-Verlag series Lecture Notes in Computer Science (http://www.springer.de/comp/lncs/index.html). The LNCS proceedings will be published, in parallel to the printed books, also electronically by Springer-Verlag. Instructions for Authors will be available after the paper notification deadline. * Location. --------- The Symposium on Graph Drawing will be held in Perugia, Italy. Perugia is one of the most ancient Italian cities, located in the center of the Country at the heart of the "Green Umbria" region. Because of its several historical and artistic amenities, the city of Perugia and its neighborhood attract many tourists every year. See also http://www.perugiaonline.it/ for further information. Perugia is also the location of one of European's oldest universities, the State University (founded in 1308), as well as the University for Foreigners (founded in 1925). With over 35,000 students from all over the world, both Universities play an important role in the city life. Details about hotels and registration instructions will be provided on the conference web site. * Program Committee. ------------------ Ashim Garg (SUNY Buffalo, USA) Michael T. Goodrich (University of California, Irvine, USA) Ferran Hurtado (Universitat Politcnica de Catalunya, Spain) Giuseppe Liotta (University of Perugia, Italy), chair Joe Marks (MERL, USA) Henk Meijer (Queens University, Canada) Stephen C. North (AT&T Research Labs, USA) Patrice Ossona de Mendez (EHESS, CNRS, France) Md. Saidur Rahman (Tohoku University, Japan) Farhad Shahrokhi (University of North Texas, USA) Roberto Tamassia (Brown University, USA) Ioannis G. Tollis (University of Texas, Dallas, USA) Dorothea Wagner (University of Konstanz, Germany) Sue H. Whitesides (McGill University, Canada) Stephen K. Wismath (University of Lethbridge, Canada) David R. Wood (Carleton University, Canada) * Contest Committee. ------------------ Franz J. Brandenburg (University of Passau, Germany), chair Ulrik Brandes (University of Passau, Germany) Peter Eades (University of Sydney, Australia) Joe Marks (MERL, USA) * Invited Speakers. ----------------- Pat Hanrahan (Stanford University, USA) Giuseppe F. Italiano (University of Roma Tor Vergata, Italy) * Conference Organization. ------------------------ C. Binucci (University of Perugia, Italy) E. Di Giacomo (University of Perugia, Italy) W. Didimo (University of Perugia, Italy), local arrangements co-chair G. Liotta (University of Perugia, Italy), conference chair M. Patrignani (University of Roma Tre, Italy), publicity chair M. Pizzonia (University of Roma Tre, Italy) * More Info. ---------- For more information and questions about GD2003 please send email to contact@gd2003.org * Sponsors. --------- - The "Gold Sponsor" of GD 2003 is TOM SAWYER Software (http://www.tomsawyer.com/) - The "Silver Sponsors" are: DIGILAB 2000 - Digital Systems Engineering INTEGRA Sistemi Srl MERL - Mitsubishi Electric Research Laboratories OREAS - Optimization Research and Software - The "Contributor" is: KELYAN SMC - The organization is supported by: DIA - Dip. di Informatica e Automazione - Univ. Roma Tre DIEI - Dip. di Ing. Elettronica e dell'Informazione - Univ. di Perugia ------------- 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.