From kobourov at CS.Arizona.EDU Mon Aug 8 10:10:11 2005 From: kobourov at CS.Arizona.EDU (Stephen Kobourov) Date: Mon Jan 9 13:41:21 2006 Subject: 12th Annual Graph Drawing Contest Message-ID: <42F783E3.8070407@cs.arizona.edu> The Graph Drawing Contest shall be held in conjunction with the International Symposium on Graph Drawing in Limerick, Ireland, September 12-14, 2005. The anticipated funding for the contest is US$1,000. Submissions for the contest are due by September 8th 2005, while the challenge will take place during the conference. More details can be found by following the GD Contest link from the GD'05 webpage: http://www.gd2005.org. -- Stephen Kobourov Assistant Professor Department of Computer Science University of Arizona http://www.cs.arizona.edu/~kobourov ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From marco.pellegrini at iit.cnr.it Tue Aug 9 10:29:27 2005 From: marco.pellegrini at iit.cnr.it (Marco Pellegrini) Date: Mon Jan 9 13:41:21 2006 Subject: Post-doc positions in graph theory and algorithms at IIT-CNR Pisa. Message-ID: <6.1.2.0.0.20050809092911.01dd8748@mx.iit.cnr.it> Istituto di Informatica e Telematica Consiglio Nazionale delle Ricerche Pisa - Italy. We invite applications for a Post-doc positions to be held at the Istituto di Informatica e Telematica of the Consiglio Nazionale delle Ricerche (CNR) of Italy in the year 2005 for research in "Application of techniques for representing, decompose, sparsify and navigate in graphs for the determination of emergent cyber-communities in the web-graph ". The fellowship will be funded within the European Research and Training Network COMBSTRU. Details about the Network and about the Network's partners can be found at http://dimatia.mff.cuni.cz/combstru/. A brief sketch of the relevant conditions is as follows. Level: Post-doc Limitations: EU citizen or of Associated States, except Italians or non-Italians resident in Italy for more than 5 years. Age: below 35. Duration: 10 months. Deadline for application: September 5th 2005 Commencement: October 1st indicatively. Gross salary: 23,500 Euro General Skills needed in : Discrete Mathematics and Computer Science. Graph Theory, Design and Analysis of Algorithms, Combinatorics Full Call to be downloaded at http://www.iit.cnr.it/lavoro/assegni_contratti/assegni_contratti.php (Bando n. 27/2005 del 5 Agosto 2005) in Italian and English. In case of controversy the Italian version is the authoritative one. Associated States of the European Union at the start of 5th Framework Programme (2002) were: Cyprus (which requested EU membership in 1990), eleven countries of Central and Eastern Europe (Bulgaria, Czech Republic, Estonia, Hungary, Latvia, Lithuania, Malta, Poland, Romania, Slovakia and Slovenia, all of which submitted their requests for EU membership in the period 1994-1996), and, since the 1 of March 2001, Malta Moreover: Norway, Iceland, Liechtenstein and Israel (whose association is already in force). An up to date list of Associated Countries might be found at: http://www.cordis.lu/fp5/enlargement/faq.htm. Contact person: Marco Pellegrini marco.pellegrini (AT) iit.cnr.it Marco Pellegrini IIT - CNR Area della Ricerca. Via Moruzzi 1 56124 Pisa ITALY tel: (+39) 050 315 2410 fax: (+39) 050 315 2333 e-mail: marco.pellegrini@iit.cnr.it web: http://www.imc.pi.cnr.it/~pellegrini -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050809/1ca3bc48/attachment.htm From Barbara.Munday at nicta.com.au Mon Aug 8 17:44:01 2005 From: Barbara.Munday at nicta.com.au (Barbara Munday) Date: Mon Jan 9 13:41:21 2006 Subject: NICTA-HCSNet: Multimodal User Interaction Workshop 2005: 13-14 Sept, Sydney Message-ID: <09D3F703EF3B0A4CBE28449EA9F3D320016A1757@nicta-atp-mail.in.nicta.com.au> Skipped content of type multipart/alternative-------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: image/gif Size: 4137 bytes Desc: clip_image002.gif Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050808/1d764391/attachment.gif From Joachim.Gudmundsson at nicta.com.au Mon Aug 8 16:05:25 2005 From: Joachim.Gudmundsson at nicta.com.au (Joachim Gudmundsson) Date: Mon Jan 9 13:41:21 2006 Subject: 2nd CFP: CATS 2006 Message-ID: <09D3F703EF3B0A4CBE28449EA9F3D320016A16DB@nicta-atp-mail.in.nicta.com.au> CALL FOR PAPERS CATS 2006 Computing: The Australasian Theory Symposium, January 16-19, 2006, Hobart, Australia. http://www-staff.it.uts.edu.au/~cbj/cats06 CATS is the premier theoretical computer science conference in Australasia. It is held annually as part of Australasian Computer Science Week (ASCW) which comprises many other conferences and is overseen by the Computer Research and Education Association (CORE). CATS 2006 will be the twelfth time that CATS has been held. The symposium will consist of invited talks and formal paper presentations. All papers will be fully refereed with proceedings published by CRPIT. Papers are invited on all aspects of Theoretical Computer Science. Some representative, but not exclusive, topics include the following: logic and type systems semantics of programming languages formal program specification and transformation concurrent, parallel and distributed systems algorithms and data structures automata theory and formal languages computational complexity applications of discrete mathematics and optimisation Full papers for CATS 2006 should be submitted electronically no later than Friday, 19th of August, 2005. Submissions must be original work, not published or submitted elsewhere. All submissions will be refereed. Accepted papers will appear in the published proceedings. Selected papers will be invited to submit to a special issue of International Journal of Foundations of Computer Science (IJFCS). Program Committee Tetsuo Asano, JAIST, Japan. Mike Atkinson, University of Otago, New Zealand. Ljiljana Brankovic, University of Newcastle, Australia Prosenjit Bose, Carleton University, Canada Rod Downey, University of Wellington, New Zealand Joachim Gudmundsson (Co-chair), NICTA, Australia James Harland, RMIT, Australia Barry Jay (Co-chair), UTS, Australia Mike Johnson, Macquarie University, Australia Paul Kelly, Imperial College, U.K. Delia Kesner, Universite de Paris 7, France Ling Li, Curtin University, Australia Eugenio Moggi, Univ. di Genova, Italy Jens Palsberg, UCLA, U.S.A. Andrew Solomon, UTS, Australia Gerhard Woeginger, TU Eindhoven, The Netherlands Important Dates Submission of full papers August 19, 2005 Notification of authors October 3, 2005 Final version due October 28, 2005 Author registration October 28, 2005 Conference January 16-January 19, 2006 -------------------------------------------------------------------------- This email and any attachments may be confidential. They may contain legally privileged information or copyright material. You should not read, copy, use or disclose them without authorisation. If you are not an intended recipient, please contact us at once by return email and then delete both messages. We do not accept liability in connection with computer virus, data corruption, delay, interruption, unauthorised access or unauthorised amendment. This notice should not be removed. ------------- 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 scot at moosilauke.cs.dartmouth.edu Mon Aug 1 16:39:32 2005 From: scot at moosilauke.cs.dartmouth.edu (Scot Drysdale) Date: Mon Jan 9 13:41:21 2006 Subject: New discrete mathematics text Message-ID: <200508011939.j71JdWrj023007@moosilauke.cs.dartmouth.edu> This falls under the catagory of a "shameless plug". _Discrete Mathematics for Computer Science_, by Ken Bogart, Cliff Stein, and me has just been published by Key College Publishing (a small press that collaborates with Springer-Verlag). It is designed for students who know how to program already, and ideally is taken concurrently with a Data Structures course. Almost all of the examples are taken from Computer Science. It was written for a Discrete Math course that we have taught at Dartmouth for several years. Because it is intended for computer scientists we teach a number of topics from a different point of view than many other discrete math texts. Proof techniques are introduced in the concept of RSA crytography and the number theory needed to understand it. We emphasize proof by induction, and in particular strong induction and induction on structures like trees and graphs. We introduce recursion trees and the Master Theorem for solving the sorts of recurrencess that arise in the analysis of recursive programs. Probability examples are drawn from hashing and average-case run time analyses. If you are interested, look at: http://www.keycollege.com/ and click on the title. You can also request an examination copy on-line from the book's web page. Scot Drysdale ------------- 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 phardy at esri.com Wed Aug 3 19:03:28 2005 From: phardy at esri.com (Paul Hardy) Date: Mon Jan 9 13:41:21 2006 Subject: Job opportunity at ESRI for computation geometry person Message-ID: <5C6EEBF1BBFF5843830BFBB465F523F7028C22F0@highwire.esri.com> There is an interesting job opportunity at ESRI for a computation geometry software person. See online description at http://gis.esri.com/jobs/index.cfm?fuseaction=job_det&id=217&keywords=&l ocation=1&category=, or see the summary below. Software Developer - Cartography and Generalization --------------------------------------------------- Be part of a small dynamic team responsible for the advanced cartographic and derived mapping capabilities of ESRI's full suite of GIS products. We are currently seeking a software development programmer to join our core cartography team who can implement efficient graphical algorithms at the leading edge of technology. Responsibilities: ----------------- * Work closely with other programmers and developers to develop robust software components. * Design and implement efficient algorithms for spatial data processing, often based on academic research. * Develop solutions to user scenarios, particularly ones related to cartography and derivation of mapping from source data. * Diagnose and fix software problems Qualifications: --------------- * B.S./M.S./PhD in computer science, engineering, mathematics, GIS, remote sensing, Physics, Astronomy or a related field. * Ability to implement efficient software to handle geospatial data concepts, including coordinates, vectors, graphics and topology * Superior design and development skills * Expertise in at least one of the following: C, C++, MFC, or COM; strong Windows background Recommended Qualifications -------------------------- * 1-5 years of directly relevant experience with cartographic, GIS or similar spatial software products * Prior experience with software development and release of commercial software products. * Qualifications or experience in Computational Geometry * Familiarity with a variety of vector geospatial data products is a plus. * Familiarity with GIS/ESRI software a plus, * Excellent communication skills and the ability to work in a fast paced environment -- Paul Hardy Cartography Product Manager, ESRI Redlands 380 New York St, Redlands, CA, 92373, USA phardy@esri.com, tel (909)793-2853 x1868 ------------- 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 daescu at utdallas.edu Tue Aug 2 16:14:19 2005 From: daescu at utdallas.edu (Ovidiu Daescu) Date: Mon Jan 9 13:41:21 2006 Subject: SoCG'05, open problem 5 Message-ID: (Koltun's 9 points conjecture) The answer is negative: there are (3+3+3) configurations of 3 red, 3 green and 3 blue points moving on linear trajectories at common constant speed for which each trichromatic circle becomes empty. Unlike Koltun's 2+3+3 configuration given in the open problem, it seems these configurations are random, i.e. do not have special structure (maybe some special structure exists in the past/future along the moving directions). This suggests that increasing the number of points would give the same answer. The first configuration (below) was found by Jiayun Chen, a recent HS graduate working with me this summer. Other configurations were found by one of my PhD students, James Palmer. James has made available a verification program at http://tiger3k.com/~james/trichrome.exe This program lets you zoom in and out (by clicking with the left and right mouse buttons) and step forward and back by 1, 10, 100 or 1000 steps. The actual length of the step is controlled by the data file, in the format: [# of steps] [red point count] [green point count] [blue point count] [step size (float)] [red x] [red y] [red velocity angle] ... [green x] [green y] [green velocity angle] ... [blue x] [blue y] [blue velocity angle] ... The angle is between 0 and 360. It can also be run in "batch" mode from the command line to search for solutions (randomly). Fell free to try it to generate more counterexamples, especially for more points (4+3+3, 4+4+4, etc.). Jiayun's configuration is: 50 3 3 3 1 -7 2 137 13.5 -6.5 152 -11 -13 24 -18 18 307 6 17.5 260 -3.5 -8.5 301 -9 0 333 12.5 -4 235 6.5 -7.5 90 (Better seen with step size 0.1 instead of 1; the time step can have a big effect, especially when a circle "flips" its axis: as it flips, if the time step is too large you can miss an event where the circle becomes empty. By making the time step smaller one could get solutions that would be missed otherwise but then it takes a lot more time to compute a solution.) James has run trials with a time step of 0.1 and points randomly distributed from -14 to 14 in both x and y. For about 40,000 trials only one randomly generated scenario has yielded a solution. Plotting the generated solutions with k empty circles would probably show an exponential curve of sorts as k is near 27. Thus, trying a similar approach with more points (4+3+3, 4+4+4, etc.) could be time consuming. ******************************************************************** Ovidiu Daescu, Assistant Professor Department of Computer Science University of Texas at Dallas Richardson, TX 75083-0688 Phone : 972-883-4196 Fax : 972-883-2349 E-mail: daescu@utdallas.edu ******************************************************************** ------------- 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 ayellet at ee.technion.ac.il Mon Aug 8 13:12:45 2005 From: ayellet at ee.technion.ac.il (Ayellet Tal) Date: Mon Jan 9 13:41:21 2006 Subject: call for papers: Special Issue on "Mesh Analysis" Message-ID: <1123492365.18156.82.camel@graphics-ee.technion.ac.il> CALL FOR PAPERS COMPUTERS & GRAPHICS An International Journal of Systems & Applications in Computer Graphics Special Issue on "Mesh Analysis" (vol. 30, no. 6, Dec 2006) Recent progress in digital data storage, digital data acquisition, and modeling techniques have made large repositories of meshes increasingly more accessible. Meshes are used in numerous application fields of computer graphics including motion pictures, computer games, computer aided design, medical and engineering. Developing effective techniques for representing, analyzing, searching and re-using meshes has become an important challenge in computer graphics. Contributions to the special issue describing original research are solicited which present automatic as well as interactive techniques for mesh analysis. Topics of interest for this special issue include, but are not limited to: * Mesh segmentation and partitioning * Mesh sub-part re-use * Mesh editing and manipulation * Mesh feature extraction * Fixing mesh models * Mesh registration * Mesh deformations * Similarity measures between meshes * Matching and partial matching of meshes * Search and retrieval of meshes * Mesh recognition * Parameterization * Ontologies Papers for this special issue will be chosen from the submissions based on their quality and originality. Papers published previously in conferences should contain significant new material, while including the previous version with the submission. Please submit your manuscript via email to cg.special.issue@idc.ac.il. Your email message should include the paper title, author names, contact author address and email, abstract, and attached pdf file. Important dates: Submission Deadline: Nov. 5, 2005 Completion of Minor Revision Reviews: Feb. 5, 2006 Publication Materials Due: May 5, 2006 Publication: Dec 2006 Please address all questions and correspondence regarding this special issue to the following address: cg.special.issue@idc.ac.il Guest Editors: Ayellet Tal Technion ayellet@ee.technion.ac.il Thomas A. Funkhouser Princeton University funk@cs.princeton.edu Ariel Shamir The interdisciplinary center arik@idc.ac.il -------------- next part -------------- A non-text attachment was scrubbed... Name: MeshAnalysisCall.pdf Type: application/pdf Size: 117159 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050808/b3a63d76/MeshAnalysisCall.pdf From papers at kuwaitoilexpo.com Mon Aug 1 07:51:12 2005 From: papers at kuwaitoilexpo.com (Kuwait Oil and Gas Conference) Date: Mon Jan 9 13:41:21 2006 Subject: Kuwait 2nd International Oil and Gas conference and Exhibition Message-ID: <200508010351.j713oxKr005983@hoemail2.lucent.com> An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050801/2ec57d5b/attachment.htm From marco.pellegrini at iit.cnr.it Wed Aug 3 11:05:46 2005 From: marco.pellegrini at iit.cnr.it (Marco Pellegrini) Date: Mon Jan 9 13:41:21 2006 Subject: Pre-doc positions in combinatorics and algorithms at IIT-CNR Pisa in 2005/2006 Message-ID: <6.1.2.0.0.20050803100515.01ea3ec0@mx.iit.cnr.it> Institute for Informatics and Telematics (IIT) National Research Council (CNR) Pisa - Italy. We invite expressions of interest for Pre-doc positions in the general areas of Combinatorics, Discrete Mathematics, Graph Theory, Complexity Theory and Design and Analysis of Algorithms, to be held at the Istituto di Informatica e Telematica (http://www.iit.cnr.it/english/index.php) of the Consiglio Nazionale delle Ricerche (CNR) of Italy in the year 2005/2006. Duration and Commencement of the fellowships are to be determined by mutual agreement. The fellowship will be funded within the European Research and Training Network COMBSTRU. Details about the Network and about the Network's partners can be found at http://dimatia.mff.cuni.cz/combstru/. A brief sketch of the relevant conditions is as follows: Level: Pre-doc (at least three years of Ph.D. studies). Limitations: The candidate must be a EU citizen or citizen of an Associated States, except Italians or non-Italians resident in Italy for more than 5 years. Age: below 35. Duration: to be agreed, indicatively up to 10 months. Commencement: to be agreed, but preferably October 2005. Gross salary: 1,500 Euro/month. Deadline for sending the expressions of interests: September 1, 2005. General Themes: Discrete Mathematics and Computer Science. Graph Theory. Design and Analysis of Algorithms. Specific Themes: Computational Economics, Computational Geometry, Computational Biology, Information Retrieval, Computer Networks, Wireless networks. Associated States of the European Union at the start of 5th Framework Programme (2002) were: Cyprus (which requested EU membership in 1990), eleven countries of Central and Eastern Europe (Bulgaria, Czech Republic, Estonia, Hungary, Latvia, Lithuania, Malta, Poland, Romania, Slovakia and Slovenia, all of which submitted their requests for EU membership in the period 1994-1996), and, since the 1 of March 2001, Malta Moreover: Norway, Iceland, Liechtenstein and Israel (whose association is already in force). An up to date list of Associated Countries might be found at: http://www.cordis.lu/fp5/enlargement/faq.htm. Please send by post or email your CV, a letter of intents, and contact data of a referee to: Marco Pellegrini IIT - CNR Area della Ricerca. Via Moruzzi 1 56124 Pisa ITALY tel: (+39) 050 315 2410 fax: (+39) 050 315 2333 e-mail: marco.pellegrini (AT) iit.cnr.it web: http://www.imc.pi.cnr.it/~pellegrini ------------- 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 papers at promedia-international.com Tue Aug 9 02:49:38 2005 From: papers at promedia-international.com (Kuwait Water Conference and Exhibition) Date: Mon Jan 9 13:41:21 2006 Subject: Kuwait First International Water Conference and Exhibition Message-ID: <200508082249.j78MnQk4014075@hoemail1.lucent.com> Kuwait First International Water Conference and Exhibition will be held in Kuwait 28-30 March 2006 at the Radisson SAS Hotel. The conference will be an open forum for the discussion of current water policies, research, projects, and water management in Kuwait, and the GCC. we are pleased to invite you to submit an abstract on any of the conference topics, the issues to be addressed in the Conference should be based on research, management and operation aspects of the following topics: Stakeholder/community participation Technology transfer Information sharing and networking Legislative reforms International co-operation Water demand management Water use efficiency technologies Managing the urban water cycle Water conservation systems Raw water treatment Wastewater treatment and re-use Onsite/decentralized systems and concepts. Pre-emptive solutions (e.g. separation of waste at the source) Ecological sanitation In-stream monitoring and treatment GIS and Remote Sensing applications For further information about the conference, please visit: www.kuwait-water.com or www.mefrm.com Looking forward seeing you in Kuwait, The Technical Committee From info at gis-summit.com Wed Aug 17 02:46:44 2005 From: info at gis-summit.com (Kuwait GIS Summit) Date: Mon Jan 9 13:41:21 2006 Subject: Kuwait GIS Summit Message-ID: <200508162246.j7GMkWeX020729@hoemail1.lucent.com> The most successful and cost effective GIS implementations are those that proceed, according to a well thought out plan, toward clear goals, while maintaining and increasing political support. Hence, this summit aims at generating the needed political support, and interest or excitement about what GIS can do officials and executives from government and large enterprises, for the purpose of getting the right commitment, involvement, support and resources. The organizing committee would like to invite you to the GIS Summit to be held during the period 27-28 November 2005 in Kuwait. Our theme for this summit will be" Toward a country wide GIS implementation" . The audience of this summit should include under Secretaries, Directors and Executives from all the government and private sectors from Kuwait and the GCC. These two-day Summit will be intense and educational and are targeted towards attracting individuals inside & outside the GIS realm. Date: 27-28 November 2005 Venue: Crown Plaza Hotel, Kuwait for more information: www.gis-summit.com From marc at cs.uu.nl Wed Aug 31 18:20:58 2005 From: marc at cs.uu.nl (Marc van Kreveld) Date: Mon Jan 9 13:41:21 2006 Subject: Two postdoc positions at Utrecht University Message-ID: <4315CADA.5000600@cs.uu.nl> At the Institute of Information and Computing Sciences of Utrecht University, there are two openings for POSTDOCs for 2.5 years in computational geometry on a project entitled GADGET: Geometric Algorithm Design for Geographic Environments funded by the Netherlands Organisation for Scientific Research (NWO). The planned starting date for both postdocs is Fall 2005 or Spring 2006. The project leader is dr. Marc van Kreveld, and research will be done at the Center for Geometry, Imaging and Virtual Environments (GIVE), headed by prof.dr. Mark Overmars. See http://www.give.nl/ Summary ------- One of the most important application areas of computational geometry is geographic information science (GIS). Geometric algorithms are needed for a variety of tasks, among which geographical analysis. Geographical analysis involves combination of, or further computation on spatial data sets to test hypotheses, compute measures and trends, or derive other information. It gives rise to a variety of computational problems that require the design of new algorithms. This proposal addresses such computational problems by designing these algorithms, complemented with efficiency analyses. An important aspect of the proposed research is the formalization of a concrete geographic task into an abstract geometric computation problem. Algorithm design for realistic geographical analysis leads to challenging new questions, since the problem statements involve more aspects than usual. The results of this project will be new formalizations and new geometric algorithms that solve such problems either exact, or with an approximation algorithm for which a performance can be proved. Geographical analysis is refined in three ways. Firstly, more realistic versions of analysis tasks are treated, for example, spatial interpolation and clustering with obstacles. Secondly, new types of information are computed, such as spatio-temporal patterns for data mining. Thirdly, geographical analyses are complemented by metadata, where the outcome also provides minimal and maximal values based on data imprecision. We offer -------- - A position as a postdoctoral researcher for two-and-a-half years, as part of a team consisting of two postdocs, the project leader (40%), and a scientific programmer. A related project involves two PhD students with whom collaboration is also desirable. - An interesting, internationally oriented working environment that specializes in computational geometry and its applications. See http://www.give.nl/ We look for computer scientists with a PhD degree and ---------------------------------------------------------- - Considerable knowledge of algorithms, preferably geometric algorithms, and several publications in this field - Interest in applications to the spatial sciences More information ---------------- Interested candidates can contact dr. M. van Kreveld (Marc), phone. +31 - 30 - 2534119, or e-mail: marc@cs.uu.nl, for a more extensive project description. Applications consisting of an application letter and CV can be sent by e-mail to dr. M. van Kreveld. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From gaertner at inf.ethz.ch Tue Aug 30 11:26:50 2005 From: gaertner at inf.ethz.ch (Bernd Gaertner) Date: Mon Jan 9 13:41:21 2006 Subject: CFP - Special issue of CGTA on CGAL Message-ID: <4314184A.3050609@inf.ethz.ch> We apologize for multiple copies. --------------------------------------------------------------------------------- CALL FOR PAPERS Special Issue of Computational Geometry: Theory and Applications on CGAL - the Computational Geometry Algorithms Library Submission deadline: February 1, 2006 The international journal Computational Geometry: Theory and Applications is planning a special issue on CGAL, the Computational Geometry Algorithms Library. CGAL is an open source C++ library, see http://www.cgal.org. Its goal is to make the most important methods developed in computational geometry available to users in industry and academia, by providing easy access to robust and generic geometric algorithms. Scope: We solicit original research papers describing contributions to CGAL, or applications critically using CGAL. Topics of interest include implementations of known and new algorithms in computational geometry, the design of generic software, algorithm engineering aspects, experimental verification, and benchmarking. Work describing contributions to CGAL should be related to existing packages, or to new packages submitted to the CGAL editorial board. Formally, acceptance is independent of the package reviewing process, but the opinion of the editorial board will be a factor in the decision. Work describing applications should clearly state in which way the application depends on CGAL, and why the usage of CGAL is crucial for its functionality. Format: We ask for regular papers, not source code, not documentation. It is expected that the paper provides a link to source code, and there may be code fragments also in the paper to show how some functionality is used or realized. Full versions of previous conference papers are encouraged. Important dates: * Submission Deadline: February 1, 2006 * Acceptance Decision: July 1, 2006 * Final version due: November 1, 2006 All efforts will be made to ensure timeliness of the special issue. Please submit only if you are able to deliver the final version of your accepted paper by the indicated date. Electronic submission is preferred. Please email a PostScript or PDF file of your manuscript together with a cover letter to either of the two guest editors of this special issue: Bernd.Gaertner@inf.ethz.ch or Remco.Veltkamp@cs.uu.nl Alternatively, you can send 4 hardcopies to one of the editors: Bernd G?rtner Institute for Theoretical Computer Science ETH Z?rich CH-8092 Z?rich Switzerland Remco Veltkamp Center for Geometry, Imaging, and Virtual Environments Institute of Information and Computing Sciences Padualaan 14 3584 CH Utrecht The Netherlands All submissions will be refereed following the usual high standards of the journal. Additional information can be obtained by communicating with the special issue guest editors. Computational Geometry, Theory and Applications is an international journal in computer science published by Elsevier, see http://www.elsevier.com/locate/comgeo ------------- 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 sungeui at cs.unc.edu Tue Aug 9 19:33:27 2005 From: sungeui at cs.unc.edu (Sung-Eui Yoon) Date: Mon Jan 9 13:41:21 2006 Subject: Software release for computing cache-oblivious layouts of meshes and graphs Message-ID: <200508100133.j7A1XZBt020636@smtp.unc.edu> Dear Geometers: We are pleased to announce the release of the OpenCCL library, which constructs cache-oblivious layouts of graphs and polygonal meshes. This library constructs layouts that minimize the expected number of cache misses for applications that have random, but cache-coherent runtime access patterns. This work was presented at the following paper: Sung-Eui Yoon, Peter Lindstrom, Valerio Pascucci, and Dinesh Manocha Cache-Oblivious Mesh Layouts ACM SIGGRAPH (ACM Trans. on Graphics) 2005 This library can be downloaded at: http://gamma.cs.unc.edu/COL/OpenCCL Thank you so much. Sung-Eui Yoon +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- http://www.cs.unc.edu/~sungeui/ +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+- -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050809/ff9aec4e/attachment.htm From nielsen at csl.sony.co.jp Fri Aug 12 16:35:30 2005 From: nielsen at csl.sony.co.jp (Frank NIELSEN) Date: Mon Jan 9 13:41:21 2006 Subject: [Book announcement] Visual Computing: Geometry, Graphics, and Vision Message-ID: <20050812063530.29FDA24FB2@trumpet.csl.sony.co.jp> This mail is to announce that the book entitled "Visual Computing: Geometry, Graphics, and Vision" is freshly out! The book provides a concise introduction to common notions, methodologies, data structures and algorithmic techniques arising in the fields of computer graphics, computer vision, and computational geometry. The companion website offers over 50 C++/OpenGL(R) programs (URL = http://www.charlesriver.com/visualcomputing/ ). Table of contents: 1. Overview 2. Abstract Data Structures 3. Coordinate Pipelines 4. Images 5. Meshes 6. Animation 7. Randomization 8. Higher Dimensions for 3D 9. Robustness (Chapter 7 is provided in PDF format at http://www.charlesriver.com/books/BookDetail.aspx?productID=117120) As always, I welcome your comments, criticisms or suggestions. Frank Nielsen (Frank.Nielsen@acm.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 Remco.Veltkamp at cs.uu.nl Fri Aug 19 15:31:01 2005 From: Remco.Veltkamp at cs.uu.nl (Remco Veltkamp) Date: Mon Jan 9 13:41:21 2006 Subject: Postdoc position in shape indexing Message-ID: <4305D105.7010405@cs.uu.nl> Postdoc position in shape indexing For the European research project PROFI - Perceptually-relevant Retrieval Of Figurative Images, Utrecht University is looking for a postdoc with a background is data structures, algorithms, and computational geometry. The postdoc will cooperate with a PhD student. The task is to develop and evaluate new algorithms for: * Indexing shapes in a huge metric space of trademark images. * Indexing the relative spatial layout of shapes within those images. For a detailed project description, see http://www.cs.uu.nl/profi/ The position will be for about 1.5 year. Information on salary and how to apply can be found at http://www.cs.uu.nl/vacatures/en/62409.html Please send you application no later than September 18, 2005. -- -------------------------------------------------------------------- Remco Veltkamp, Remco.Veltkamp@cs.uu.nl Center for Geometry, Imaging, and Virtual Environments Department of Information and Computing Sciences, Utrecht University Padualaan 14, 3584 CH Utrecht, The Netherlands phone: +31-30-2534091, fax: +31-30-2513791 -------------------------------------------------------------------- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.