From michael.aupetit at cea.fr Thu Jul 3 10:50:06 2003 From: michael.aupetit at cea.fr (aupetit) Date: Mon Jan 9 13:41:11 2006 Subject: segment interpolation... Message-ID: <200307030750.JAA19294@tupai.bruyeres.cea.fr> Hello, I need to interpolate segments instead of points in 2D. These segments are the edges of the Delaunay triangulation of a set P of points p_i in the plane. To each of these segments ]p_i,p_j[, is associated a value f_ij (constant all along the segment) A would like a fonction F(x,y) such that F(x,y)=f_ij if M(x,y) is a point of the segment ]p_i,p_j[ (F is not defined at the points p_i because f_ik may be different from f_ih whatever p_k and p_h linked to p_i in the triangulation) For F, I would like a smooth function (either piecewise linear (0th order continuity evrywhere except on P), or 1st derivative continuity everywhere except on P). I tryed to google "segment-interpolation" but it fails to find something close to what I expect. Do you know some work about the kind of interpolation I seek? Thank you Michael -------------- next part -------------- A non-text attachment was scrubbed... Name: aupetit.vcf Type: text/x-vcard Size: 273 bytes Desc: Card for aupetit Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20030703/d4c40e67/aupetit.vcf From ias8 at science.uva.nl Tue Jul 1 14:58:53 2003 From: ias8 at science.uva.nl (ias8 Conference) Date: Mon Jan 9 13:41:11 2006 Subject: IAS-8: Call for Papers Message-ID: <1537.146.50.4.72.1056974333.squirrel@webmail.science.uva.nl> --------------------------------------------------------------------- -- APOLOGIES FOR DUPLICATE POSTINGS -- CALL FOR PAPERS ********************************************************************* IAS-8: 8th Conference on Intelligent Autonomous Systems March 10-13, 2004, Amsterdam, NL www.ias8.org ********************************************************************* IAS-8 brings the Intelligent Autonomous Systems Conference back to Amsterdam, the city which also hosted the first two IAS conferences. The focus of these conferences is on intelligent systems that can directly sense and act in their own environment without demanding detailed supervision from humans. These systems are beginning to enter our daily life in ambient intelligence applications. Many new challenges are emerging to create systems that can operate and interact in human inhabited environments. SUBMISSION INFORMATION Prospective authors are invited to submit full papers in PDF or Postscript formats through the conference website www.ias8.org. Accepted papers must be presented at the conference by one of the authors in order to appear in the conference proceedings and CD. The proceedings will be published by IOS press and will be available as book and CD-ROM. IMPORTANT DATES Submission of full papers: Sept 8, 2003 Acceptance notification: Nov 17 , 2003 Final paper due: Dec 15, 2003 Early registration: Dec 15, 2003 EURON MEETING The annual meeting of the European Robotics Research Network is co-located with, and immediately follows the IAS-8 conference. TOPICS include but are not limited to: Autonomous robots, Robot vision, Domestic robots, Multi-agent systems, Sociable systems, Distributed decision making, Cooperative multi-robots, Human and robot skills Humanoids, Service robotics, Health care and medical robots, Biologically inspired systems, Sensing and data fusion, Planning and control architectures, Learning and adaptive systems, Robot societies, Robots in space and underwater, Human-robot interaction, Cognitive robotics GENERAL CHAIR: Frans Groen, University of Amsterdam, The Netherlands STEERING COMMITTEE: Tamio Arai, University of Tokyo, Japan, Ruediger Dillmann, University of Karlsruhe, Germany, Maria Gini, University of Minnesota, USA, Enrico Pagello, University of Padua and Ladseb-CNR, Italy, Anthony Stentz, Carnegie Mellon University, USA PROGRAM COMMITTEE CO-CHAIRS In America: Nancy Amato, Texas A&M University, USA In Europe/Africa: Andrea Bonarini , Politechnico di Milano, Italy In Asia/Oceania: Dr. Eiichi Yoshida, AIST, Japan LOCAL ORGANIZATION: Ben Kr?se, University of Amsterdam, The Netherlands PROGRAM COMMITTEE MEMBERS: Peter Allen, Marcelo H. Ang, Ron Arkin, Minoru Asada, Osman Burchan Bayazit, Alicia Casals, Riccardo Cassinis, Enric Celaya, Raja Chatila, Hyung Suck Cho, Henrik Christensen, Jim Crowley, Antonio D'Angelo, Kerstin Dautenhahn, Ernst Dickmanns, Dario Floreano, Dariu Gavrila, John Hallam, Koji Ito, Ray Jarvis, Gal Kaminka, Alonzo Kelly, Hiroaki Kitano, Sven Koenig, Kurt Konolige, Gerhard K. Kraetzschmar, Ben Krose, Jean-Claude Latombe, Christian Laugier, Steve Lavalle, Paul Levi, Pedro U. Lima, James J. Little, Ramon Lopez de Manteras, Vladimir Lumelsky, Zhi-Wei Luo, Rezia Molfino, Satoshi Murata, Ulrich Nehmzow, Anibal Ollero, Jun Ota, Isabel Ribeiro. Alan Schultz, Wei-Min Shen, Roland Siegwart, Carmen Torras, R.Lai.Tummala, Peter Will, Mark Yim, Hiroshi Yokoi ------------- 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 large at cs.duke.edu Mon Jul 7 12:53:21 2003 From: large at cs.duke.edu (Lars A. Arge) Date: Mon Jan 9 13:41:11 2006 Subject: ALENEX'04 CFP Message-ID: <200307071553.h67FrLmq009208@krone.cs.duke.edu> Call For Papers 6th Workshop on Algorithm Engineering and Experiments ALENEX 04 January 10, 2004, Astor Crown Plaza Hotel, New Orleans, Louisiana The aim of the annual ALENEX workshops is to provide a forum for presentation of original research in the implementation and experimental evaluation of algorithms and data structures. We invite submissions that present significant case studies in experimental analysis (such studies may tighten, extend, or otherwise improve current theoretical results) or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios, including specific applied areas (including databases, networks, operations research, computational biology and physics, computational geometry, and the world wide web) that present unique challenges in their underlying algorithmic problems. We also invite submissions that address methodological issues and standards in the context of empirical research on algorithms and data structures. The scientific program will include an invited talk, contributed research papers, and time for discussion and debate of topics in this rapidly evolving research area. The workshop is co-located with SODA 04, the 15th ACM-SIAM Symposium on Discrete Algorithms, and will take place on the day preceding the conference. The workshop is also co-located with the 1st Workshop on Analytic Algorithmics and Combinatorics (ANALCO 04) and will take place on the same day as that conference. The proceedings of ALENEX and ANALCO will be published as a single volume. A paper that has been reviewed and accepted for presentation at SODA is not eligible for submission to ALENEX. We recognize, however, that some research projects spawn multiple papers that elaborate on different aspects of the work and are willing to respond to inquiries about SODA, ANALCO, and ALENEX papers that may overlap. The workshop is supported by SIAM, the Society for Industrial and Applied Mathematics; and SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory. Authors are invited to submit 10-page extended abstracts by 5:00 PM EDT, SEPTEMBER 19, 2003 (strict deadline) and must use the SIGACT electronic submissions server. Detailed instructions for submitting to the workshop can be found at http://www.siam.org/meetings/alenex04. Notification of acceptance or rejection will be sent by the end of November 2003. The deadline for receipt of papers in final version is January 5, 2004. Presenters must have submitted the final versions of their papers in order to be able to present them at the workshop. Program Committee: ------------------- Lars Arge, Duke University (co-chair) Jon Bentley, Avaya Labs Research Mark de Berg, TU Eindhoven Monika Henzinger, Google Inc Giuseppe F. Italiano, University of Rome (co-chair) David Karger, MIT Ulrich Meyer, Max-Planck-Institut fur Informatik Jan Vahrenhold, University of Munster Important dates: ---------------- Submission of Papers September 19, 2003 Notification of Accept End of November, 2003 Final Version due January 5, 2004 For more information: --------------------- http://www.siam.org/meetings/alenex04 or email large@cs.duke.edu or italiano@disp.uniroma2.it ------------- 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 michiel at scs.carleton.ca Mon Jul 7 10:33:45 2003 From: michiel at scs.carleton.ca (Michiel Smid) Date: Mon Jan 9 13:41:11 2006 Subject: DIMACS Workshop: CG/CAD Message-ID: <3F0976B9.B3EAE0EE@scs.carleton.ca> DIMACS Workshop: Computer-Aided Design and Manufacturing http://dimacs.rutgers.edu/Workshops/CompAided/ Oct. 7-9, 2003 DIMACS Center, CoRE Building, Rutgers University (part of the DIMACS Special Focus on Computational Geometry and Applications) Organizers: Deba Dutta, Dept. of Mechanical Engineering, Univ. of Michigan, Ann Arbor, MI dutta@engin.umich.edu http://cadcam.engin.umich.edu/ Ravi Janardan, Dept. of Computer Science & Engineering, Univ. of Minnesota, Minneapolis, MN janardan@cs.umn.edu http://www.cs.umn.edu/~janardan Michiel Smid, School of Computer Science, Carleton Univ., Ottawa, Canada michiel@scs.carleton.ca http://www.scs.carleton.ca/~michiel Computer-Aided Design and Manufacturing (CAD/CAM) is concerned with all aspects of the process of designing, prototyping, manufacturing, inspecting, and maintaining complex geometric objects under computer control. As such, there is a natural synergy between this field and Computational Geometry (CG), which involves the design, analysis, implementation, and testing of efficient algorithms and data representation techniques for geometric entities such as points, polygons, polyhedra, curves, and surfaces. On the one hand, CG can bring about significant performance improvements in CAD/CAM, while, on the other hand, CAD/CAM can be a rich source of interesting new problems that provide new impetus to research in CG. Indeed, such two-way interaction has already been witnessed in recent years in areas such as numerically-controlled machining, casting and injection molding, rapid prototyping and layered manufacturing, metrology, and mechanism/linkage design, to name just a few. The purpose of this workshop is to further promote this interaction by bringing together researchers from both sides of the aisle to assess the current state of work at the interface of the two fields, to identify research needs, and to establish directions for collaborative future work. A combination of invited talks, contributed papers, and a panel discussion is envisioned. Topics to be addressed include, but are not limited to, geometric aspects of manufacturing processes (from traditional machining to layered manufacturing to nanoscale manufacturing), process planning and control, rapid prototyping technologies, computational metrology and tolerancing, geometric problems in mechanism design, geometric constraint systems, geometric modeling related to manufacturing, computer vision and robotics related to manufacturing, and geometric issues in standards development. HOW TO PARTICIPATE: Authors are invited to submit abstracts for talks to be given at the workshop. Please e-mail to michiel@scs.carleton.ca an abstract (of up to 2 pages) and a draft of a paper (if available), preferably in PDF format. Submission of material that will also be submitted to (or is to appear in) a refereed conference or journal is allowed and encouraged. After the workshop, the organizers plan to invite high-quality papers, previously unpublished, for inclusion in the AMS-DIMACS Volume Series (http://dimacs.rutgers.edu/Volumes/) Submissions due: July 25, 2003. Acceptance notification: By August 15, 2003. ------------- 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 mcallist at cs.dal.ca Tue Jul 1 15:34:43 2003 From: mcallist at cs.dal.ca (Michael McAllister) Date: Mon Jan 9 13:41:11 2006 Subject: CCCG'03 Call for Participation Message-ID: <20030701143443.D15413@cs.dal.ca> -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= Call for Participation 15th Canadian Conference on Computational Geometry August 11-13, 2003 Dalhousie University http://www.cs.dal.ca/~cccg -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-= Scope CCCG'03 will be held at Dalhousie University in Halifax, Nova Scotia on August 11-13 with a welcome reception in the evening of August 10. 40 papers will be presented at CCCG'00; a complete list of the papers is available from the conference web page. Invited presentations will be given by Ferran Hurtado, Tetsuo Asano, and Mark de Berg. Registration The early registration fee is CAD140 (CAD40 for students). Early registration deadline is July 18, 2003. To register, please visit the conference web page. Accommodation Blocks of rooms have been reserved at the Lord Nelson hotel and at the Dalhousie University residences. Please reserve before July 11, 2003. Various other hotels are available nearby, see the conference web page for details. Further Information Travel directions and local information are also available from the conference web page. Important dates Accommodation: July 11, 2003 Early registration: July 18, 2003 Conference: August 11-13, 2003 Contact Information Mike McAllister Faculty of Computer Science Dalhousie University Halifax, NS B3H 1W5 Phone: (902) 494-3151 Fax: (902) 492-1517 Email: mcallist@cs.dal.ca Sponsors CCCG '03 is supported by CRM, The Fields Institute, PIMS, GINI, Sun Microsystems, and Dalhousie University. ------------- 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 awolff at ira.uka.de Wed Jul 9 16:38:10 2003 From: awolff at ira.uka.de (Alexander Wolff) Date: Mon Jan 9 13:41:11 2006 Subject: Ph.D. position at Karlsruhe University Message-ID: <16140.6850.444867.546184@i11pc19.ilkd.uni-karlsruhe.de> oooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo o o o OPENING for a Ph.D. POSITION o o o o in the project o o o o GeoNet -- Geometric Networks and Their Visualization o o o o at Karlsruhe University o o o oooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooo THE PROJECT consists of two parts: (a) analysis and construction of geometric networks, and (b) visualization of geometric networks. In part (a) the focus is on networks where the distance of two geometric objects (like points or rectangles) within the network is bounded by a constant multiple of their bee-line (i.e. Euclidean) distance. Such networks are called Euclidean spanners. They have many applications in distributed systems, communication network design, robotics, pattern recognition, data compression, and in biology. Part (b) deals with the question how networks with an underlying geometry (like subway networks) have to be distorted in the visualization process in order to improve their readability. The project is funded by the German Research Foundation (DFG) for up to five years. The project team so far consists of Dr. Alexander Wolff (project leader) and Marc Benkert (Ph.D. student). THE FACULTY OF COMPUTER SCIENCE AT KARLSRUHE UNIVERSITY is one of the oldest and largest computer science departments in Germany. About 10% of all computer scientists in Germany have graduated from Karlsruhe University. THE ALGORITHMS GROUP is a new research group at Karlsruhe University that has been established by Prof. Dorothea Wagner in April 2003. The group works in combinatorial optimization, clustering, computational geometry and graph theory. The group currently consists of Prof. Dorothea Wagner, Dr. Alexander Wolff, and six Ph.D. students. THE CANDIDATE should have a master's degree in computer science or mathematics, with a firm background in algorithms. The candidate will mainly work in part (b) of the project, modeling network visualization problems and implementing algorithms. Programming experience is therefore appreciated. BEING A Ph.D. STUDENT IN GERMANY In Germany, Ph.D. students are paid a salary; no additional grants are needed. Moreover, although Ph.D. students sometimes attend courses, there is no minimum requirement. The Ph.D. student hired for this position is expected to do 90 minutes of teaching per week (during terms). The remaining time is spent on research and research-related activities. Foreign Ph.D. students initially do not need to speak German, since English is spoken in the group and on campus. For everyday life however, it is necessary to acquire some basic knowledge of German. THE ENVIRONMENT Karlsruhe is a middle-sized city (270,000 inhabitants) in the southwest of Germany, about 20 km from the French border and one hour by train from the large international airport in Frankfurt. It has an excellent public transportation and ample recreation opportunities. The region around Karlsruhe, Baden, is known for its warm and sunny climate, its good white wine and its savoir-vivre. WE OFFER * A research position in a young and enthusiastic research group. * A two-plus-two-year position, i.e. the DFG has guaranteed funds for two years, plus another two years provided that their funding resources do not change drastically. * A salary of approximately 1500 euro per month after taxes. * Good facilities for sports and language training. MORE INFORMATION If you want to know more about the project or how to apply, please contact Alexander Wolff (awolff@ira.uka.de, use subject: application) or visit the following web pages. group: http://i11www.ira.uka.de/algo/ faculty: http://www.ira.uka.de/I3V_HOME/ueberblick.en.html university: http://www.uni-karlsruhe.de/Uni/index_en.html Applications (with CV and letter of recommendation) are expected until August 25, 2003. Ideally the candidate's contract will start on October 1, 2003. ------------- 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 Wed Jul 9 15:13:44 2003 From: joswig at math.TU-Berlin.DE (Michael Joswig) Date: Mon Jan 9 13:41:11 2006 Subject: release of polymake 2.0 Message-ID: <16140.1784.944377.141603@rabbit.math.TU-Berlin.DE> This is to announce the release of polymake's version 2.0. For almost six years now polymake is known as a software tool which deals with convex polytopes only. Starting with this version 2.0, additionally polymake's new application "topaz" (which may be read as TOPology Application Zoo) deals with finite simplicial complexes. Features of topaz include the computation of simplicial (co-)homology (with or without bases), Stiefel-Whitney characteristic classes, and intersection forms of 4-manifolds. The application "polytope" (which now comprises the "classical" functionality) features several bug fixes and minor improvements. On the technical side: We now support the most recent gcc 3.3 as well as Intel's icc 7 C++ compilers (and a few other compilers/versions). Source and binary distributions for various variations of UNIX (and much more detailed information of all sorts) are available from http://www.math.tu-berlin.de/polymake We are open for questions and suggestions, Ewgenij Gawrilow & Michael Joswig --- Sorry in case you receive this announcement multiply. ------------- 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 barequet at cs.jhu.edu Thu Jul 10 16:27:44 2003 From: barequet at cs.jhu.edu (Gill Barequet) Date: Mon Jan 9 13:41:11 2006 Subject: Fw: Preliminary CFP - Solid Modeling and Applications 2004 Message-ID: Attached please find text and a .pdf file---CFP of SMA '04---which I was asked to post here. Sorry for duplicate messages. Gill -- > Shalom to all the SM fans > > Attached please find a preliminary version of the CFP for SM04. The meeting > is expected to take place in the Palazzo Ducale, situated in the historical > part of Genova, Italy. SM04 will be held as part of the International > Convention on Shapes & Solids 2004 (abbreviated SMI&SM04), and will > immediately follow the Shape Modeling International (SMI) conference, with > a one-day overlap. > > Please circulate to the world > > Sincerely > > Gershon Elber, Technion, Israel > Gabriel Taubin, Brown, USA > Program Co-Chairs, ACM Solid Modeling 2004 -------------- next part -------------- A non-text attachment was scrubbed... Name: SM04CFP.pdf Type: application/pdf Size: 12688 bytes Desc: Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20030710/8825d499/SM04CFP.pdf From lin at cs.unc.edu Mon Jul 14 03:24:16 2003 From: lin at cs.unc.edu (Ming Lin) Date: Mon Jan 9 13:41:11 2006 Subject: CFP for Special Issue on Haptic Rendering Message-ID: <200307140624.h6E6OG2v000691@swift.cs.unc.edu> CALL FOR PAPERS HAPTIC RENDERING: BEYOND VISUAL COMPUTING Special Issue of IEEE CG&A, March/April 2004 Guest Editors Ming Lin and Kenneth Salisbury Submissions due: July 23, 2003 Author notification: October 1, 2003 Final versions due: November 1, 2003 See http://www.computer.org/cga/CFPMar04.htm Extending the frontier of visual computing, haptic interfaces, or force feedback devices, have the potential to increase the quality of human-computer interaction by accommodating the sense of touch. They provide an attractive augmentation to visual display and enhance the level of understanding of complex data sets. They have been effectively used for a number of applications including molecular docking, manipulation of nano-materials, surgical training, virtual prototyping and digital sculpting. Compared with visual and auditory display, haptic rendering has extremely demanding computational requirements. In order to maintain a stable system while displaying smooth and realistic forces and torques, haptic update rates of 1 KHz or more are typically used. Haptics presents new challenges to the development of novel data structures to encode shape, material properties, as well as new techniques for data processing, analysis, physical modeling, and visualization. This special issue will examine some latest advances on haptic rendering and applications, while looking forward to exciting future research in this area. We solicit papers presenting novel research results and innovative applications of that take advantage of the haptic interaction sensory modality. We also welcome survey papers on the state of art. Potential topic of interests include, but are not limited to: * Haptic Rendering - Fast force and torque display techniques - Interactive haptic visualization of volumetric data - Realistic modeling of deformable bodies - Real-time constraint scheduling - Rendering Fidelity and Stability - Psychophysical and Congnitive Issues - Hardware and Software Architectures * Novel Applications of Haptics - Real-time interaction for virtual prototyping - Scientific exploration of complex datasets - Control and manipulation of digital representations - Six or higher degree-of-freedom interaction - Microsurgery and medical procedure training - Information presentation of abstract concepts Papers should be approximately eight to ten magazine pages with roughly 5 figures or images, where a page is approximately 800 words. Please try to limit the number of citations to the ten most relevant references. Authors should consider providing background materials on haptics in sidebars for non-expert readers. Color images may be interspersed through the body of the paper. Detailed CG&A style and length guidelines are available at http://www.computer.org/cga/author.htm. Beginning 23 July, please submit your paper using our new online manuscript submission service at http://cs-ieee.manuscriptcentral.com/ (this system is not available until 23 July). When uploading your paper, please select the appropriate special issue title under the category "Manuscript Type." If you have any questions about submitting your paper, please contact Alkenia Winston at cga-ma@computer.org. Please direct any correspondence prior to submission to both guest editors at: Ming C. Lin Department of Computer Science Sitterson Hall, CB#3175 University of North Carolina Chapel Hill, NC 27599-3175 Email: lin@cs.unc.edu Phone: (919) 962-1974 Fax: (919) 962-1799 and Kenneth Salisbury Depts. of Computer Science and Surgery Gates 150, 353 Serra Mall Stanford University Stanford CA 94305-9010 Email: jks@robotics.stanford.edu Phone: (650) 723-3994 Fax: (650) 725-1449 ------------------------------------------------------------------------------ About IEEE Computer Graphics and Applications: IEEE Computer Graphics and Applications (CG&A) bridges the theory and practice of computer graphics. From specific algorithms to full system implementations, CG&A offers a unique combination of peer-reviewed feature articles and informal departments, including news and product announcements. Special applications sidebars relate research stories to commercial development. A cover story focuses on creative applications of the technology by an artist or designer. And graphics all-stars Jim Blinn and Andrew Glassner offer insight and wit in their popular columns. Published six times a year, CG&A is indispensable reading for people working at the leading edge of computer graphics technology and its applications in everything from business to the arts. ------------- 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 rwheeler-attg at msn.com Fri Jul 11 20:11:42 2003 From: rwheeler-attg at msn.com (bob wheeler) Date: Mon Jan 9 13:41:11 2006 Subject: Opportunity Engineer / Mathematician Message-ID: <004c01c34823$5960fed0$bd818644@fiberstreet.com> TO: Computational Geometry Job Searchers: I am a Sr. Technical Recruiter conducting an exclusive search for an Engineer / Mathematician for a Bay Area market leader in 3D laser scanning technology and data modeling. The company is a wholly owned subsidiary of a publicly traded European company. This is a high energy, creative environment and a super facility. Attached is the job description. If you feel this is a good fit and you would like to explore this opportunity, please attach a word copy of your resume and I will give you a call. Thank you, and I look forward to hearing from you. Bob Wheeler Executive / Technical Recruiter (510)547-7646 office (510)908-1492 cell (510)547-7725 fax rwheeler-attg@msn.com -------------- next part -------------- A non-text attachment was scrubbed... Name: Job Description - Engineer - Mathematician.doc Type: application/msword Size: 20992 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20030711/d494465c/JobDescription-Engineer-Mathematician.doc From skala at kiv.zcu.cz Fri Jul 11 13:39:06 2003 From: skala at kiv.zcu.cz (Vaclav Skala) Date: Mon Jan 9 13:41:11 2006 Subject: WSCG'2004 Conference - Call for Papers - Plzen, Prague, Czech Rep. Message-ID: <001101c34792$72d27ba0$4e3fe493@fav.zcu.cz> To: compgeom-announce@research.bell-labs.com Dear friend, please, find the First WSCG 2004 Call for Papers useful for you and colleagues of yours Yours Vaclav Skala, Univ.of West Bohemia, Czech Republic http://herakles.zcu.cz skala@kiv.zcu.cz ---------------- FIRST Call for Papers ---------------- { SORRY for DUPLICATES } W S C G ' 2004 http://wscg.zcu.cz February 2 - 6, 2004 http://wscg.zcu.cz (formerly the Winter School of Computer Graphics) The 12-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2004 at the University of West Bohemia, Plzen, close to Prague - the Golden European City Czech Republic Honorary Chair: Tosiyasu L. Kunii, University of Hosei, Tokyo, Japan Conference Co-Chairs Roberto Scopigno, CNUCE - CNR, Pisa, Italy Vaclav Skala, University of West Bohemia, Czech Republic Keynote speakers: Agreements pending Deadline for uploading files: October 9, 2003 24:00 GMT (London time) Accepted papers and posters will be published in proceedings with ISBN Selected full papers will be published in The Journal of WSCG Vol. 12. No 1-3, ISSN 1213-6972 Post-conference IEEE proceedings with extended papers are expected to be published. Information for authors Deadline for contributions changed: October 9, 2003 24:00 GMT (London time) -------------------------------------------------------------------- Format A4 (strictly), max. 8 pages, additional material up to 5 MB (video as MPEG, AVI and similar files, color plates etc. can be submitted, please, no video tapes) For details, please, see http://wscg.zcu.cz select WSCG'2004 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 systems * GIS systems and Geoinformatics, * applications and related fields. The International Program Committee and Reviewing Board members review all papers peer-to-peer carefully and anonymously. Proceedings are indexed/abstracted in: ISI, Inspec (IEE) and others Unique opportunity ------------------ - to visit the Golden City - PRAGUE - to taste the best beer all over the world - Pilsner Urquell - to take a part at the event, where West and East meet ----------------------------------------- Organizer and conference secretariat Prof.Vaclav Skala http://wscg.zcu.cz 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 WSCG 2004 Tel./fax: +420-37-763-2457 ------------- 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 contact at gd2003.org Thu Jul 17 10:34:12 2003 From: contact at gd2003.org (Graph Drawing 2003) Date: Mon Jan 9 13:41:11 2006 Subject: Graph Drawing 2003: list of accepted papers Message-ID: The following papers have been accepted to the 11th International Symposium on Graph Drawing (GD 2003), to be held September 21-24, 2003, at the University of Perugia, Italy. For more information about the conference, please see the web page: http://www.gd2003.org/ LIST OF ACCEPTED PAPERS ======================= title: Layout of UML diagrams: empirical studies of comprehension author(s): Helen C. Purchase, David Carrington, Linda Colpoys, and Matthew McGill type: short paper title: Degree Navigator$^{TM}$: the Journey of a Visualization Software author(s): Guy-Vincent Jourdan, Ivan Rival, and Nejib Zaguia type: poster title: An Improved Approximation to the One-sided Bilayer Drawing author(s): Hiroshi Nagamochi type: long paper title: Convex Drawing for c-Planar Biconnected Clustered Graphs author(s): Hiroshi Nagamochi and Katsutoshi Kuroya type: long paper title: Nearly Optimal Three Dimensional Layout of Hypercube Networks author(s): Tiziana Calamoneri and Annalisa Massini type: long paper title: Bounds and methods for $k$-planar crossing numbers author(s): Farhad Shahrokhi, Ondrej S{\'y}kora, L{\'a}szl{\'o} Sz{\'e}kely, and Imrich {Vrt'o} type: long paper title: An Integer Programming Approach to Fuzzy Symmetry Detection author(s): Christoph Buchheim and Michael J{\"u}nger type: long paper title: One-Dimensional Graph Drawing: Part II -- Axis-by-Axis Stress Minimization author(s): Yehuda Koren type: short paper title: Optimal Pants Decompositions and Shortest Homotopic Cycles on an Orientable Surface author(s): {\'E}ric Colin de Verdi{\`e}re and Francis Lazarus type: long paper title: Barycentric drawings of periodic graphs author(s): Olaf Delgado-Friedrichs type: long paper title: Characterizing Families of Cuts that can be Represented by Axis-Parallel Rectangles author(s): Ulrik Brandes, Sabine Cornelsen, and Dorothea Wagner type: long paper title: Planar Embeddings of Graphs with Specified Edge Lengths author(s): Sergio Cabello, Erik D. Demaine, and G{\"u}nter Rote type: long paper title: Fixed-Location Circular-Arc Drawing of Planar Graphs author(s): Alon Efrat, Cesim Erten, and Stephen Kobourov type: long paper title: GraphEx: An Improved Graph Translation Service author(s): Stina Bridgeman type: short paper title: HexGraph: Applying Graph Drawing Algorithms to the Game of Hex author(s): Colin Murray, Carsten Friedrich, and Peter Eades type: poster title: How many ways can one draw a graph? author(s): J{\'a}nos Pach and G{\'e}za T{\'o}th type: long paper title: No-Bend Orthogonal Drawings of Subdivisions of Planar Triconnected Cubic Graphs author(s): Md. Saidur Rahman, Noritsugu Egi, and Takao Nishizeki type: short paper title: Confluent Drawings: Visualizing Nonplanar Diagrams in a Planar Way author(s): Matthew Dickerson, David Eppstein, Michael Goodrich, and Jeremy Yu Meng type: long paper title: Fixed parameter algorithms for one-sided crossing minimization author(s): Henning Fernau and Michael Kaufmann type: long paper title: More Efficient Generation of Plane Triangulations author(s): Shin-ichi Nakano and Takeaki Uno type: long paper title: GLuskap: Visualization and Manipulation of Graph Drawings in 3D author(s): Breanne Dyck, Jill Joevenazzo, Elspeth Nickle, Jon Wilsdon, and Stephen Wismath type: poster title: Intersection-Free Morphing of Planar Graphs author(s): Cesim Erten, Stephen Kobourov, and Chandan Pitta type: long paper title: Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes author(s): Cesim Erten, Stephen Kobourov, Vu Le, and Armand Navabi type: long paper title: Web-linkage Viewer: Drawing Links in the Web based on a Site-oriented Framework author(s): Yasuhito Asano and Takao Nishizeki type: poster title: Govisual for case tools Borland Together ControlCenter and Gentleware Poseidon - System Demonstration author(s): Carsten Gutwenger, Joachim Kupke, Karsten Klein, and Sebastian Leipert type: short paper title: Drawing Graphs with Non-Uniform Nodes Using Potential Fields author(s): Jen-Hui Chuang, Chun-Cheng Lin, and Hsu-Chun Yen type: short paper title: Radial Level Planarity Testing and Embedding in Linear Time author(s): Christian Bachmaier, Franz Brandenburg, and Michael Forster type: long paper title: 3D Visibility Representations of Complete Graphs author(s): Jan {\v S}tola type: long paper title: Three-Dimensional Grid Drawings with Sub-Quadratic Volume author(s): Vida Dujmovi{\'c} and David Wood type: long paper title: Graph Embedding with Minimum Depth and Maximum External Face author(s): Carsten Gutwenger and Petra Mutzel type: long paper title: Experiments with the Fixed-Parameter Approach for Two-Layer Planarization author(s): Matthew Suderman and Sue Whitesides type: long paper title: Noncrossing Hamiltonian Paths in Geometric Graphs author(s): Jakub {\v C}ern{\'y}, Zden{\v e}k Dvo{\v r}{\'a}k, V\'{\i}t Jel\'{\i}nek, and Jan K{\'a}ra type: long paper title: Layout of Directed Hypergraphs with Orthogonal Hyperedges author(s): Georg Sander type: short paper title: Two results on intersection graphs of polygons author(s): Jan Kratochv\'{\i}l and Martin Pergel type: long paper title: The Puzzle Layout Problem author(s): Kozo Sugiyama, Seok-Hee Hong, and Atsuhiko Maeda type: poster title: Visualizing Related Metabolic Pathways in Two and a Half Dimensions author(s): Ulrik Brandes, Tim Dwyer, and Falk Schreiber type: long paper title: A Framework for User-Grouped Circular Drawings author(s): Janet Six and Ioannis Tollis type: long paper title: Stretching of Jordan Arc Contact Systems author(s): Hubert de Fraysseix and Patrice Ossona de Mendez type: long paper title: A Constrained, Force-Directed Layout Algorithm for Biological Pathways author(s): Burkay Genc and Ugur Dogrusoz type: short paper title: An Energy Model for Visual Graph Clustering author(s): Andreas Noack type: long paper title: Laying out iterated line digraphs using queues author(s): Toru Hasunuma type: long paper title: A More Practical Algorithm for Drawing Binary Trees in Linear Area with Arbitrary Aspect Ratio author(s): Ashim Garg and Adrian Rusu type: short paper title: GraphAEL: Graph Animations with Evolving Layouts author(s): Cesim Erten, Philip Harding, Stephen Kobourov, Kevin Wampler, and Gary Yee type: long paper title: Area-Efficient Drawings of Outerplanar Graphs author(s): Ashim Garg and Adrian Rusu type: short paper title: Visual Data Mining with ILOG Discovery author(s): Georg Sander, Bruno Haible, and Thomas Baudel type: poster title: An Experimental Study of Crossing Minimization Heuristics author(s): Carsten Gutwenger and Petra Mutzel type: long paper title: Drawing Area-Proportional Venn and Euler Diagrams author(s): Stirling Chow and Frank Ruskey type: long paper title: Straight-line Drawings of 2-Outerplanar Graphs on Two Curves author(s): Emilio Di Giacomo and Walter Didimo type: short paper title: Track Drawings of Graphs with Constant Queue Number author(s): Emilio Di Giacomo and Henk Meijer type: long paper title: Drawing Series-Parallel Graphs on Restricted Integer 3D Grids author(s): Emilio Di Giacomo type: short paper title: Stop Minding Your P's and Q's: Implementing a Fast and Simple DFS-based Planarity Testing and Embedding Algorithm author(s): John M. Boyer, Pier Francesco Cortese, Maurizio Patrignani, and Giuseppe Di Battista type: long paper title: BGPlay: a System for Visualizing the Interdomain Routing Evolution author(s): Giuseppe Di Battista, Federico Mariani, Maurizio Patrignani, and Maurizio Pizzonia type: long paper -- Graph Drawing 2003 Organizing Committee http://www.gd2003.org ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From kameshn at csa.iisc.ernet.in Sun Jul 20 17:44:32 2003 From: kameshn at csa.iisc.ernet.in (k a m e s h) Date: Mon Jan 9 13:41:11 2006 Subject: Verification of Extreme Ray Message-ID: Hello: Given a ray and a polyhedra (by a set of linear inequalities), how can we algebraically verify that the ray is an extreme ray? Thanks in advance. regards Kamesh _____________ s kameshwaran eEL, Dept of CSA, IISc, Bangalore - 560012 Homepage: http://people.csa.iisc.ernet.in/kameshn Phone: +91-80-2932368-111 (Lab), +91-80-2932624 (Hostel: U-95) ___________________________________________________ Suffering is not in the FACT, but in the PERCEPTION ------------- 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 lin at cs.unc.edu Wed Jul 23 05:09:53 2003 From: lin at cs.unc.edu (Ming Lin) Date: Mon Jan 9 13:41:11 2006 Subject: Deadline extended for IEEE CG&A Special Issue on Haptic Rendering Message-ID: <200307230809.h6N89rPZ008497@capefear.cs.unc.edu> Due to numerous requests we have received so far, we decided to extend the submission deadline for the March/April 2004 Special Issue of IEEE CG&A on Haptic Rendering to AUGUST 15, 2003! Please note that this is a FIRM deadline, as we cannot extend the submission deadline for any individual after this date per IEEE CG&A. All papers must be submitted using IEEE online submission system at http://cs-ieee.manuscriptcentral.com/. Ming & Ken ------------------------------------------------------------------ CALL FOR PAPERS HAPTIC RENDERING: BEYOND VISUAL COMPUTING Special Issue of IEEE CG&A, March/April 2004 Guest Editors Ming Lin and Kenneth Salisbury Submissions due: August 15, 2003 Author notification: October 15, 2003 Final versions due: November 15, 2003 Extending the frontier of visual computing, haptic interfaces, or force feedback devices, have the potential to increase the quality of human-computer interaction by accommodating the sense of touch. They provide an attractive augmentation to visual display and enhance the level of understanding of complex data sets. They have been effectively used for a number of applications including molecular docking, manipulation of nano-materials, surgical training, virtual prototyping and digital sculpting. Compared with visual and auditory display, haptic rendering has extremely demanding computational requirements. In order to maintain a stable system while displaying smooth and realistic forces and torques, haptic update rates of 1 KHz or more are typically used. Haptics presents new challenges to the development of novel data structures to encode shape, material properties, as well as new techniques for data processing, analysis, physical modeling, and visualization. This special issue will examine some latest advances on haptic rendering and applications, while looking forward to exciting future research in this area. We solicit papers presenting novel research results and innovative applications of that take advantage of the haptic interaction sensory modality. We also welcome survey papers on the state of art. Potential topic of interests include, but are not limited to: * Haptic Rendering - Fast force and torque display techniques - Interactive haptic visualization of volumetric data - Realistic modeling of deformable bodies - Real-time constraint scheduling - Rendering Fidelity and Stability - Psychophysical and Congnitive Issues - Hardware and Software Architectures * Novel Applications of Haptics - Real-time interaction for virtual prototyping - Scientific exploration of complex datasets - Control and manipulation of digital representations - Six or higher degree-of-freedom interaction - Microsurgery and medical procedure training - Information presentation of abstract concepts Papers should be approximately eight to ten magazine pages with roughly 5 figures or images, where a page is approximately 900 words. Please try to limit the number of citations to the ten most relevant references. Authors should consider providing background materials on haptics in sidebars for non-expert readers. Color images may be interspersed through the body of the paper. Detailed CG&A style and length guidelines are available at http://www.computer.org/cga/author.htm. Authors should submit their papers, with images embeded, to IEEE Computer Society in PDF format as email attachment to cga-ma@computer.org by July 15, 2003. Please include complete contact information for all authors and coauthors in the email submission. Please direct any correspondence prior to submission to both guest editors at: Ming C. Lin Department of Computer Science Sitterson Hall, CB#3175 University of North Carolina Chapel Hill, NC 27599-3175 Email: lin@cs.unc.edu Phone: (919) 962-1974 Fax: (919) 962-1799 and Kenneth Salisbury Depts. of Computer Science and Surgery Gates 150, 353 Serra Mall Stanford University Stanford CA 94305-9010 Email: jks@robotics.stanford.edu Phone: (650) 723-3994 Fax: (650) 725-1449 ------------------------------------------------------------------------------ About IEEE Computer Graphics and Applications: IEEE Computer Graphics and Applications (CG&A) bridges the theory and practice of computer graphics. From specific algorithms to full system implementations, CG&A offers a unique combination of peer-reviewed feature articles and informal departments, including news and product announcements. Special applications sidebars relate research stories to commercial development. A cover story focuses on creative applications of the technology by an artist or designer. And graphics all-stars Jim Blinn and Andrew Glassner offer insight and wit in their popular columns. Published six times a year, CG&A is indispensable reading for people working at the leading edge of computer graphics technology and its applications in everything from business to the arts. ------------- 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 smism04 at ge.imati.cnr.it Fri Jul 18 18:34:03 2003 From: smism04 at ge.imati.cnr.it (SMI&SM'04) Date: Mon Jan 9 13:41:11 2006 Subject: Shape Modeling International - International Convention on Shapes and Solids 2004 - Call for Papers Message-ID: <3F18136B.7050906@ge.imati.cnr.it> *** SORRY FOR DUPLICATION *** Please forward this message to whom it may concern ============================================================= **** First CALL for PAPERS **** SMI'04 Shape Modeling International '2004 INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS Genova, Italy, June 7-9 2004 as part of the first International Convention on SHAPES AND SOLIDS Palazzo Ducale Genova, Italy, June 7-11 2004 (SEE THE ATTACHED PDF FILE) http://smism04.ge.imati.cnr.it ============================================================= As information is moving from textual to visual form, shapes are gaining importance in all fields of the society. Shapes are concerned with geometry, structure, attributes, semantics, and have interaction with time. Shapes populate virtual environments in advanced scientific and engineering simulation fields as in many emerging edutainment applications, where they also interact with virtual human agents. SMI04 addresses all aspects of shape acquisition, modelling, representation, navigation, retrieval and understanding, and welcomes contributions on the perceptually relevant and semantically capable representations of shapes. SMI was launched for the first time in Japan in 1997 with the aim of engaging a rather multi-disciplinary community with common interests about shape modeling, but looking at the problem from a side view with respect to other specialized conferences. From year 2002 the SMI conference became an annual event with the venue changing circularly from Asia to Europe, and to America, it has also included the Eurographics/ACM SIGGRAPH Workshop on Implicit Surfaces as a specific session. Previous events were held in 1997 and 1999 (Aizu-Wakamatsu, Japan), 2001 (Genova, Italy), 2002 (Banff, Canada), 2003 (Seoul, Korea). SMI'04 will be the sixth International Conference on Shape Modeling and Applications, and it will include full paper presentations, tutorials and keynote lectures organized in coordination with SM04 (see the Convention web site for details), and poster sessions. SMI04 will feature for the first time the Best Paper Award. The conference is organized in cooperation with ACM SIGGRAPH (pending), EUROGRAPHICS (pending), and CGS (pending) The Conference Proceedings will be published by IEEE Computer Society Press (pending). SMI04 takes place for the first time within the International Convention on Shapes and Solids 2004 (abbreviated SMI&SM04). SMI&SM04 is organized by the Institute of Applied Mathematics and Information Technology, Dept. of Genova, belonging to the Italian National Research Council (CNR), and it will be held in Genova, European Capital of Culture in year 2004, with the aim of bringing together the two major international conferences in 3D modeling: Shape Modeling International (abbreviated SMI) and the ACM Symposium on Solid Modeling and Applications (abbreviated SM). The Conference Chairing will provide a joint coordination of common aspects of the conference (tutorial and keynotes' speakers), while maintaining the distinctive aspects of both conferences which will be run separately. The SMI&SM04 Convention is chaired by Bianca Falcidieno while Prof. Tosiyasu L. Kunii has been invited to be the Honorary Chair of the event. TOPICS ------------- The conference is devoted to all areas of shape modeling, including but not limited to: Shape Acquisition and reconstruction Shape Modeling and Design Shape Analysis and Reasoning Shape Transformation and Morphing Shape Matching and Retrieval Dynamic Shapes Topological Modeling of Shapes Computational Basis for Shape Modeling Shape Perception and Recognition Interaction with Shapes Implicit Surfaces Polygonization of Surfaces Physically-based Shape Modeling Free-form Feature Extraction and Modeling Volume and Multidimensional Modeling Compression and Simplification of Shapes Interactive and Web-based Shape Modeling Shape Rendering Grammar-Based 3D Modeling Modeling for Games and Entertainment CONFERENCE COMMITTEES ------------------------ Conference Chair: Jarek Rossignac, Michela Spagnuolo Program Chairs: Alexander Pasko, Franca Giannini PROGRAMME COMMITTEE ------------------------ Adzhiev V. Akleman E. Alexa M. Alliez P. Basri R. Belyaev A. Bernardini F. Bowyer A. Cani M.-P. Choi H. Cohen E. Cohen-Or D. Coquillart S. De Floriani L. De Martino M. Dey T. Eakins J. Encarna?ao J. Farin J. Ferri M. Fujishiro I. Funkhouser T. Gotsman C. Gross M. Hart J. Hoppe H. Joy K. Juettler B. Kartasheva E. Kim M.-S. Klein R. Kobbelt L. Leon J.-C. Levy B. Lindstrom P. Magillo P. Martin R. Massabo A. Montani C. Monti M. Nasri A. Okunev O. Peters J. Pottmann H. Puppo E. Qin H. Quak E. Schlick C. Schr?eder P. Scopigno R. Seidel H.-P. Shapiro V. Sheffer A. Shinagawa Y. Silva C. Snoeyink J. Stork A. Suzuki H. Szymczak A. Thalmann D. Thalmann N. Turk G. Varshney A. Velho L. Veltkamp R. Woodwark J. Wyvill B. Wyvill G. Zorin D. IMPORTANT DATES ------------------ October 20, 2003 Abstracts November 15, 2003 Full papers December 15, 2003 Posters January 15, 2004 Notification February 15, 2004 Camera ready June 7 - 9, 2004 SMI04 LOCAL ORGANIZING COMMITTEE AND SECRETARIAT --------------------------- Sandra Burlando, Marinella Pescaglia Caterina Pienovi (IMATI-GE, CNR) CONTACTS AND SUBMISSIONS --------------------------- Contact on organization and submission: Michela Spagnuolo, E-mail: spagnuolo@ge.imati.cnr.it Electronic Submission will be available (from September 2003) at http://smi2004sub.ge.imati.cnr.it ------------------------------------------------------------------------------ -------------- next part -------------- A non-text attachment was scrubbed... Name: SMISM-e-call.pdf Type: application/pdf Size: 569600 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20030718/4c61ebb8/SMISM-e-call.pdf From Frederic.Cazals at sophia.inria.fr Fri Jul 18 10:01:26 2003 From: Frederic.Cazals at sophia.inria.fr (Frederic Cazals) Date: Mon Jan 9 13:41:11 2006 Subject: Postdoc position, INRIA, Geometry / Structural Biology Message-ID: <20030718090126.A10149@baetis.inria.fr> Postdoctoral position in Bio-Geometry. INRIA Sophia-Antipolis (Geometrica), France Two of the most prominent challenges of the the post-genomic era are to understand the molecular machinery of the cell and to develop new drug design strategies. These key challenges require the determination, understanding and exploitation of the three-dimensional structure of several classes of molecules ---nucleic acids, proteins, drugs---, as well as the elucidation of the interaction mechanisms between these molecules. Most importantly, these challenges involve aspects from biology, chemistry, physics, mathematics and computer science. Building upon a long and recognized experience in Computational Geometry and applications, the Geometrica group (formerly Prisme) (http://www-sop.inria.fr/prisme/index.html.en) is launching a research activity in Bio-Geometry ---the geometric component of the afore-mentioned challenges. Along this line, a one year Post-Doc position starting Fall 2003 (October / November / December) is now opened. Its primary focus will be docking ---protein-protein as well as protein-ligand, with potential applications to folding. For these reasons, we encourage the application of: -Bio-(physicists, chemists) with a background in structural biology and an inclination for geometry. -Computer scientists with a background in algorithms design and analysis or computational geometry, and interests in molecular modeling. Applicants with a Ph.D. are encouraged to submit a vitae as well as sample representative publications, and arrange for two letters of recommendation to be sent directly to Frederic Cazals INRIA Sophia-Antipolis, Prisme, 2004 route des Lucioles, BP 93, F-06902 Sophia-Antipolis, France Email: Frederic.Cazals@sophia.inria.fr Note. INRIA is the French Institute for Computer Science and Automation. The Sophia-Antipolis unit is located on the French Riviera. -- ------------------------------------ ---------------- -------- ---- -- - -- Project GEOMETRICA, INRIA Sophia-Antipolis, 2004 route des Lucioles, -- BP 93, F-06902 Sophia-Antipolis, -- Tel: 33 (0)4 92 38 71 88, Fax: 33 (0)4 92 38 76 43 -- Frederic.Cazals@sophia.inria.fr, http://www.inria.fr/prisme ------------- 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 grima at us.es Wed Jul 23 14:13:20 2003 From: grima at us.es ( Clara Isabel Grima) Date: Mon Jan 9 13:41:11 2006 Subject: [Ewcg04] EWCG'04: FIRST ANNOUNCEMENT Message-ID: ************************************************************ Sorry for duplicates! ************************************************************ First Announcement 20th European Workshop on Computational Geometry March 24-26, 2004 Seville University(SPAIN) http://www.us.es/ewcg04 As in past editions, the goal of this annual workshop is to bring together the researchers and students from academia and industry interested in Computational Geometry and related fields and to promote - in a relaxed and informal atmosphere- discussion and diffusion of the most recent work, leading to the establishment of new collaborations and research projects. Topics Analysis of Geometric Algorithms Design and Data Structures referring to theoretical issues arising from implementations, geometric optimization, 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. And related topics. Submissions Authors are invited to submit extended abstracts (2-4 pages) for talks to be given at the workshop no later than January 8, 2004, describing current theoretical results or applications of Computational Geometry. Details will be available from the workshop web page. Contact Clara I. Grima E. U. Ingenier?a T?cnica Agr?cola Carretera de Utrera Km. 1 41013, Seville, Spain Phone: +34-954-486483/ +34-954-486423 Fax: +34-954-557878 e-mail: ewcg04@us.es Please, bookmark the link http://www.us.es/ewcg04 and follow the next announcements. Looking forward to see you in Seville. Sincerely, Organizing Committee _______________________________________________ Ewcg04 mailing list Ewcg04@listas.us.es http://listas.us.es/mailman/listinfo/ewcg04 ------------- 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 speckman at win.tue.nl Fri Jul 18 22:08:17 2003 From: speckman at win.tue.nl (Bettina Speckmann) Date: Mon Jan 9 13:41:11 2006 Subject: Two Ph.D. positions at TU Eindhoven (Netherlands) Message-ID: <3F1845A1.6000109@win.tue.nl> %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % OPENING FOR TWO PhD STUDENTS % % in % % COMPUTATIONAL GEOMETRY % % % % at the TU Eindhoven (the Netherlands) % % % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% THE PROJECT: KINETIC DATA STRUCTURES ------------------------------------------ Many application areas involve objects in motion. Virtual reality, simulation, air-traffic control, and mobile communication systems are just some examples. Algorithms that deal with objects in motion traditionally discretize the time axis and compute or update their structures based on the position of the objects at every time step. A major problem with this approach is the choice of the perfect time interval. If the interval is too large, important events will be missed and the data structure will be invalid for some time. If, on the other hand, the interval is too small a lot of computation time is wasted. Even if the time interval is chosen just right, this is not always a satisfactory solution: some objects may have moved only slightly, in such a way that the overall data structure is not influenced. One would like to use the temporal coherence to speed up the process - to know exactly at which point we need to take action. In fact the location of an object should require our attention if and only if it triggers an actual change in the data structure. Kinetic data structures do exactly that: they maintain not only the structure itself, but also some additional information that helps to find out when the structure will undergo a `real' (combinatorial) change. In this project we study such kinetic data structures for a variety of problems. There are two openings for PhD students on this project. One PhD student will work on more fundamental issues regarding kinetic data structures: he/she will do a theoretical study of trade-offs between the time needed to maintain the kinetic data structure and the time needed to extract the required information from it at any given time. The second PhD student will work on more applied issues: he/she will study the performance of kinetic data structures in practice. Furthermore, he/she will work on extending the current theory on KDSs for collision detection to 3-dimensional space. THE ALGORITHMS GROUP AT THE TU EINDHOVEN -------------------------------------------- The Algorithms group is a new research group at the TU Eindhoven, established in late 2002. One of the focal points of the group is computational geometry. Currently the group consists of prof.dr. Mark de Berg, dr. Otfried Cheong, dr. Bettina Speckmann (permanent staff members), dr. Joachim Gudmundsson (postdoc), and Micha Streppel (PhD student). In the coming fall two more PhD students will start (in addition to the two PhD positions advertized here). The webpage of the group is at "http://www.win.tue.nl/algo/" THE CANDIDATE ------------ The candidates should have a masters degree in computer science or mathematics, with a firm background in algorithms. The second candidate should preferably also have some experience (or at least interest) in experimental research. 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 Mark de Berg (mdberg@win.tue.nl) or Bettina Speckmann (speckman@win.tue.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 kettner at mpi-sb.mpg.de Wed Jul 30 14:41:13 2003 From: kettner at mpi-sb.mpg.de (Lutz Kettner) Date: Mon Jan 9 13:41:11 2006 Subject: 4th Max-Planck Summer School ADFOCS 2003 Message-ID: (please forward to potentially interested students and postdocs) * FINAL CALL FOR PARTICIPATION * The deadline for early registration is August 1 4th Max-Planck Summer School Advanced Course on the Foundations of Computer Science ADFOCS 2003 Saarbrücken, Germany, September 8-12, 2003 http://www.mpi-sb.mpg.de/~adfocs PROGRAM ------- The program consists of 12 lecture blocks and 8 tutorial/discussion blocks. The speakers and topics are: - Robert E. Bixby, Rice University / ILOG, and Ed Rothberg, ILOG: The CPLEX Library for Linear, Mixed-Integer, and Quadratic Programming. - Dan Halperin, Tel Aviv University: Arrangements and Their Applications. - Bertrand Meyer, ETH Zürich / Eiffel Software / Monash: Principles of Library Design, from Reuse and Contracts to Proofs: the Eiffel Experience. - Stefan N"aher, University of Trier: Design and Implementation of Efficient Data Types for Static Graphs. ABOUT ADFOCS ------------ ADFOCS is organized as part of the activities of the Algorithms and Complexity Group and the International Max-Planck Research School of the Max-Planck-Institut für Informatik. The scope of ADFOCS is international and it is addressed mainly to young researchers at the PhD student or postdoc level. The goal of ADFOCS is to provide an overview of selected topics from the foundations of computer science and to highlight major research directions in these areas. This years ADFOCS will address topics in software engineering and algorithm engineering. The course will highlight important problems, techniques and ongoing research in these areas. It will also emphasize the discussion of open problems and the active involvement of the participants, thus strengthening the links of cooperation between young researchers of the field. LOCATION & TRAVEL INFORMATION ----------------------------- ADFOCS will be held at the Max-Planck-Institut für Informatik in Saarbrücken. Saarbrücken is the capital of one of Germany's 16 states, the Saarland. It is conveniently located in the center of Europe, on the border of Germany with France, between Luxembourg, the Saar-Mosel valley, Frankfurt and Strasbourg. Being located on several main train and road routes, Saarbrücken is easily reachable from Frankfurt, Stuttgart, Paris or Luxembourg. It also has its own international airport. REGISTRATION ------------ The registration fee covers lunches and social events. The deadline for early registration is August 1, 2003 and the registration fee is Euro 100. Please note that the registration fee does not include accommodation, although MPI can help for making reservations. Per-night price including taxes and breakfast are ranging from 20 Euro (youth hostel, double room) to about 50 Euro (hotel, single room). ALCOM-FT will provides some grants for graduate students and young researchers. Priority will be given to applications of students and young researchers from ALCOM sites. CONTACT ------- The home page of ADFOCS with forms for registration and hotel reservation and information about grants can be found at http://www.mpi-sb.mpg.de/~adfocs For further information or questions, send an e-mail to adfocs@mpi-sb.mpg.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 rolf.klein at uni-bonn.de Wed Jul 30 17:47:33 2003 From: rolf.klein at uni-bonn.de (Rolf Klein) Date: Mon Jan 9 13:41:11 2006 Subject: research position Message-ID: <3F27DA85.68949799@uni-bonn.de> The Institute of Computer Science, University of Bonn, Germany, seeks to hire a researcher for the project "dilation of geometric networks". A strong background in computational or convex geometry and proven research ability would be welcome. Both post- or predocs can apply; a predoc could work towards Ph.D. Employment will be for 2 years, starting as early as possible, based on BAT IIa (~ 52.000 Euro p.a. before taxes). Please send applications before August 31 by surface mail or fax to Prof. Dr. Rolf Klein Universit?t Bonn Institut f?r Informatik I R?merstrasse 164 53117 Bonn, GERMANY Inquiries can be emailed to Ms. Knepper, knepper@informatik.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 Olivier.Devillers at sophia.inria.fr Wed Jul 30 16:56:08 2003 From: Olivier.Devillers at sophia.inria.fr (Olivier Devillers) Date: Mon Jan 9 13:41:11 2006 Subject: Workshop on Geometry compression Message-ID: <3F27CE78.9080709@sophia.inria.fr> *Workshop on Geometry compression, november 6-7 2003* (http://www-sop.inria.fr/prisme/telegeo/workshop/) Please register as soon as possible. http://www-sop.inria.fr/prisme/telegeo/workshop/inscription.html Olivier Devillers -- -------------------------------------------- O. Devillers, INRIA, rte des Lucioles, BP 93, 06902 Sophia Antipolis Olivier.Devillers@sophia.inria.fr, +33 492 38 7763, Fax +33 492 38 7643 http://www-sop.inria.fr/prisme/personnel/devillers/ ------------- 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.