From sanders at mpi-sb.mpg.de Thu Nov 7 17:02:21 2002 From: sanders at mpi-sb.mpg.de (Peter Sanders) Date: Mon Jan 9 13:41:08 2006 Subject: Postdoc at MPI for Computer Science - Algorithms Group Message-ID: <15818.36493.877365.922158@gargle.gargle.HOWL> P O S I T I O N S (Research Associates, Postdocs) at the M A X - P L A N C K - I N S T I T U T E for C O M P U T E R S C I E N C E The Max-Planck-Institute for Computer Science is located on the campus of the Universit"at des Saarlandes in Saarbr"ucken, Germany. The institute was founded in 1990 and hosts four major research groups: Algorithms and Complexity, Logic of Programming, Computer Graphics, and Computational Biology. The research group ALGORITHMS AND COMPLEXITY offers a number of postdoctoral fellowships for the year 2003/2004. We are looking for applicants from all areas of algorithmics, e.g., data structures, complexity theory, graph algorithms, approximation algorithms, parallel, distributed, external, online, probabilistic or geometric algorithms. For national and European projects we are particularly looking for applicants interested in - Design and implementation of algorithm libraries - Algorithms and software for parallel processing and memory hierarchies - Integer programming and constraint programming - Internet routing and load balancing algorithms - Geometric algorithms for curves and surfaces The group consists mainly of young researchers of several nationalities. Our working language is English. The group collaborates with several of the major research institutions in Europe and USA and has a high international visibility. There is generous travel support available for all group members. Postdoctoral fellowships are available for one or two years and currently amount to Euro 1840 per month, taxfree. Applications (including curriculum vitae, list of publications, research plan, names of references with their e-mail addresses, and intended period of stay) should be sent by January 31, 2003 to Kurt Mehlhorn Max-Planck-Institut f"ur Informatik Im Stadtwald D-66123 Saarbr"ucken Germany Electronic applications (email to mayer@mpi-sb.mpg.de) are possible but should consist of files easy to process on Unix systems (e.g., Postscript produced by dvips, pdf, ASCII, HTML). Please avoid MS Word documents or unprintable Postscript. For further information refer to http://www.mpi-sb.mpg.de/units/ag1/offers.html or contact Peter Sanders (sanders@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 ara.aslyan at unicad.am Fri Nov 15 15:32:10 2002 From: ara.aslyan at unicad.am (Ara Aslyan) Date: Mon Jan 9 13:41:08 2006 Subject: Voronoi diagrams References: <200211151114.gAFBE0a82631@grubby.research.bell-labs.com> Message-ID: <000601c28c9a$a2e230a0$e809a8c0@lan.mosaic.am> Dear collegues, I'm seeking information on efficient external memory algorithms and data structures for computing Voronoi diagrams. I'll be greatful if you could help me to find some references. Regards, Ara Aslyan. ------------- 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 moggi at disi.unige.it Sat Nov 23 19:15:34 2002 From: moggi at disi.unige.it (Eugenio Moggi) Date: Mon Jan 9 13:41:08 2006 Subject: BISS'03 call for participation Message-ID: <200211231815.gANIFY002264@venus.disi.unige.it> BISS 2003 - First Call for Participation Bertinoro International Spring School for Graduate Studies in Computer Science 3-14 March 2003, Bertinoro (Forli), Italy URL: http://www.cs.unibo.it/biss2003/ SCOPE The consortium of Italian Computer Science PhD granting institutions sponsors an annual school offering four graduate-level courses aimed at first-year PhD students. In addition to introducing students to timely research topics, the school is meant to promote acquaintance and collaboration among young European researchers. COURSES The 2003 edition of the School is the 9th in the series. The school will offer 4 courses each consists of 15 hours of lecturing: - Reliability theory and methods, A.Bobbio (Univ. Piemonte Orientale) - Multi-resolution Geometric Modeling, L.De Floriani, E.Puppo (Univ. di Genova) - Statistical learning theory, A.Verri (Univ. di Genova) - Advanced Algorithm Design and Engineering, C.Zaroliagis (Univ. of Patras) A final evaluation for each course is possible through a final exam or project as determined by the instructor. The daily schedule admits laboratory, recitation or working group activities to be organized in addition to the lectures. REGISTRATION The registration fee for the School is 850.00 Euro and includes all local expenses from the evening of 2 March to mid-day on 14 March including on-site lodging in double occupancy rooms and meals. Attendance is limited to 50 students and will be allocated on a first-come-first-served basis. SCHOLARSHIPS There is limited funding from COOPERLINK to cover the registration fee for PhD students coming from the following countries: Albania, Bosnia and Herzegowina, Croatia, Greece, Federal Republic of Yugoslava, Slovenia. IMPORTANT DATES 10 January 2003 scholarship application deadline 20 January 2003 notification of scholarship award 31 January 2003 registration deadline 3-14 March 2003 school LOCATION The School will be held in the small medieval hilltop town of Bertinoro. This town is in Emilia Romagna about 50km east of Bologna at an elevation of about 230m. It is easily reached by train and taxi from Bologna and is close to many splendid Italian locations such as Ravenna, Rimini on the Adriatic coast, and the Republic of San Marino. The School will be held in an ex-Episcopal fortress that has been converted by the University of Bologna into a modern conference center with computing facilities and Internet access. MORE INFORMATION is available from http://www.cs.unibo.it/biss2003/ SCIENTIFIC DIRECTORS: E.Moggi (Genova) O.Babaoglu (Bologna) A.Maggiolo (Pisa) LOCAL ORGANIZATION: A.Montresor (Bologna) A.Bandini, M.Schiavi (CeUB) -- ------------- 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 rajput_manoj at yahoo.co.in Tue Nov 26 08:54:41 2002 From: rajput_manoj at yahoo.co.in (=?iso-8859-1?q?manoj=20rajput?=) Date: Mon Jan 9 13:41:08 2006 Subject: Ques: Regarding bitmap vectorization Message-ID: <20021126085441.22786.qmail@web8202.mail.in.yahoo.com> Hi, Can you give me some algorithm or reference to find out the algorithm to trace out the polygon covering the chunk of 1's in the large bitmap. Thanks and Regards, Manoj Rajput ________________________________________________________________________ Missed your favourite TV serial last night? Try the new, Yahoo! TV. visit http://in.tv.yahoo.com ------------- 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 mount at cs.umd.edu Wed Nov 27 11:00:34 2002 From: mount at cs.umd.edu (Dave MOUNT) Date: Mon Jan 9 13:41:08 2006 Subject: SoCG Electronic Submissions Message-ID: Dear CGer's, We are moving to a new conference electronic submission system for this year's Symposium on Computational Geometry (SoCG'03). It is called Echelon. It will replace the email-based SIGACT conference server that has been used in the previous SOCG conferences. One advantage of the new system is that it supports submission of papers in both postscript and PDF formats. It also provides a better interface for the program committee and has built-in support for providing comments to authors. We apologize for the delay, but the system is now ready. There is, however, one unfortunate delay in bringing the system on line. The University of Maryland has scheduled a power outage from the evening of Thurs Nov 28 through the evening of Fri Nov 29 (Eastern Standard Time). During this time the conference web page and electronic submission system will not be accessible. We anticipate having everything running by Saturday, Nov 30. On Nov 30, a link to the electronic submission system will be provided on the conference web page http://www.cs.umd.edu/areas/Theory/socg03/ Instructions will be provided on how to use the new system. Thank you for your patience, David Mount and Mark de Berg SoCG'03 Program Chairs ------------- 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 thill at tomotherapy.com Tue Nov 26 09:18:12 2002 From: thill at tomotherapy.com (Ted Hill) Date: Mon Jan 9 13:41:08 2006 Subject: Closed figure expansion/contraction algorithm Message-ID: <018501c2955f$0c3cfb30$c600000a@tomotherapy.com> Hello, I am working on a medical imaging application and I need to be able to 'expand' and 'contract' closed shapes. These are defined in two dimensions as an ordered set of x,y points. I am wondering if anyone knows of an algorithm in the public domain that can be used for this? For example, in my application a physician may trace a line around a tumor using the mouse (thus defining the set of x,y points). Then the physician may want to expand the shape by adding a 1 cm margin around it. Alternatively, the physician may want to 'shrink' the contour. Thank you for any suggestions, Ted Hill Software Engineer www.tomotherapy.com ------------- 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 leymarie at lems.brown.edu Wed Nov 27 12:44:24 2002 From: leymarie at lems.brown.edu (Frederic Leymarie) Date: Mon Jan 9 13:41:08 2006 Subject: Closed figure expansion/contraction algorithm References: <018501c2955f$0c3cfb30$c600000a@tomotherapy.com> Message-ID: <3DE50478.961A2948@lems.brown.edu> Dear Ted Look for Mathematical Morphology on the web. What you are describing are called "dilations" and "erosions" by a "structural element" usually taken to be a round ball (say of radius 1cm), sometimes approximated by a squared block, etc. The same technology works in 3D; e.g., see my version of it: http://www.lems.brown.edu/vision/people/leymarie/MathMorpho/Medical.html In 2D, you will find good implementation in packages like MATLAB (with the image processing toolbox). The khoros package also has many mathematical morphology tools (the student version is free). Micromorph from the originators of the field is available under http://malte.ensmp.fr/Micromorph/mmorpha.htm I believe you can find free software from researchers active in this area (especially if you only need a simple dilation/erosion, not necessarily Euclidean, ...). I hope this helps, Frederic -- Ted Hill wrote: > Hello, > > I am working on a medical imaging application and I need to be able to > 'expand' and 'contract' closed shapes. These are defined in two dimensions > as an ordered set of x,y points. > > I am wondering if anyone knows of an algorithm in the public domain that can > be > used for this? > > For example, in my application a physician may trace a line around a tumor > using the mouse > (thus defining the set of x,y points). Then the physician may want to expand > the > shape by adding a 1 cm margin around it. Alternatively, the physician may > want to 'shrink' the contour. > > Thank you for any suggestions, > > Ted Hill > Software Engineer > www.tomotherapy.com > > ------------- > 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. -- Frederic FOL LEYMARIE, R&D Project leader, SHAPE Lab. http://www.lems.brown.edu/vision/extra/SHAPE/ Brown University, Division of Engineering, LEMS, Box D 182-4 Hope Street, Providence, Rhode Island 02912, U.S.A. Tel: +1.401.863.2760, Alternate Voice: x2177, Fax: x9039 mailto:leymarie@lems.brown.edu , http://www.lems.brown.edu/~leymarie --- It does play with dice ... but are they fixed? ------------- 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 hoffkamp at inf.fu-berlin.de Fri Nov 29 20:12:26 2002 From: hoffkamp at inf.fu-berlin.de (Andrea Hoffkamp) Date: Mon Jan 9 13:41:08 2006 Subject: [DMANET] positions for Ph.D. students and postdocs Message-ID: <20021129191226.GA27740@inf.fu-berlin.de> ---------------------------------------------------------------------------- --- European Graduate Program "COMBINATORICS, GEOMETRY, AND COMPUTATION" --- ---------------------------------------------------------------------------- In the graduate program scholarships for Ph.D.students for up to three years are available in Berlin from March 1, 2003. Applicants should have a degree in mathematics, computer science, or a related area equivalent to the German university diploma (e.g. M.S.) with grades significantly above average. Furthermore a postdoctoral position is available for at most two years. The program is a joint initiative of the ETH Zurich, the three universities of Berlin - Free University, Technical University, Humboldt-University - and the Konrad-Zuse-Research Center. The German partners are financially suppor- ted by the German Research association (Deutsche Forschungsgemeinschaft, DFG). The amount of the scholarships in Berlin is calculated according to the guidelines of the DFG and is up to Euro 1468,- per month, tax free (family supplement Euro 205,-). The scientific program ranges from theoretical fundamentals to applications. The areas of research are combinatorics, geometry, optimization, algorithms and computation. In Berlin the students are supervised by the professors Aigner, Alt, Rote, Schulz (FU), Moehring, Ziegler (TU), Proemel (HU) and Groetschel (ZIB). The scholarship includes a long-term research stay abroad, usually at the ETH Zurich. Applications with curriculum vitae, copies of certificates, theses, a letter of recommendation of the last advisor, a brief description of the proposed research and, especially for applicants for the postdoctoral position, reprints of publications should be sent in until January 24, 2003 to the speaker of the program in Berlin: Prof. Dr. Helmut Alt Institut fuer Informatik Freie Universitaet Berlin Takustrasse 9 D-14195 Berlin Further Information can be obtained from: Andrea Hoffkamp Tel. ++49-30-838 75 104 hoffkamp@math.fu-berlin.de http://www.inf.fu-berlin.de/gk-cgc --------------------------------------------------------------------------- ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zpr.uni-koeln.de/dmanet * ********************************************************** From mueller at uni-trier.de Fri Nov 29 12:36:45 2002 From: mueller at uni-trier.de (Norbert Mueller) Date: Mon Jan 9 13:41:08 2006 Subject: CfP - special issue of JLAP: exact real number computation Message-ID: <200211291236.45646.mueller@uni-trier.de> ---------------------Third (and last) call for papers----------------------- The Journal of Logic and Algebraic Programming is preparing a Special issue on the practical development of exact real number computation. You may find the Call for Papers at: http://www.informatik.uni-trier.de/~mueller/JLAP/ Attached please find the ASCII-Version of the CfP. Deadline for submissions: December 31, 2002. ------------------------------------------ I am sorry if you receive multiple copies! ------------------------------------------ Kind regards -- Dr. Norbert Mueller FB IV - Abteilung Informatik * Universitaet Trier * D-54286 Trier (Germany) email: mueller@uni-trier.de * http://www.informatik.uni-trier.de/~mueller/ Tel: ..49-(0)651-201-2845/2848 * Fax: ..49-(0)651-201-3805 -------------- next part -------------- ------------------------------------------------------------------------ Journal of Logic and Algebraic Programming Special issue on the practical development of exact real number computation Web Page: http://www.informatik.uni-trier.de/~mueller/JLAP Deadline for submissions: December 31, 2002 ------------------------------------------------------------------------ Exact real number computation addresses the gap between the practice and theory of working with real numbers. On the practical side, floating point numbers with fixed precision (being a finite set... ) dominate the daily use of real numbers on computers. On the theoretical side, models of computability and computational complexity in analysis have grown in parallel. We seek to close the gap by e.g. - research on programming languages for non denumerable data sets - algorithms of approximate nature but with unrestricted precision Here 'unrestricted precision' denotes the possibility to achieve results with an arbitrary high precision, usually combined with a strict error analysis or with the use of interval methods. The Journal of Logic and Algebraic Programming is an international journal whose aim is to publish original work in the areas of logical and algebraic methods and techniques for programming in its broadest sense. The Journal of Logic and Algebraic Programming complements Elsevier's Science of Computer Programming and Theoretical Computer Science by its focus on the foundations of logical, algebraic and categorical methods for programming. For more information, visit http://www.elsevier.com/locate/jlap. This special issue covers the spectrum from theoretical results to concrete applications of exact real number computation, with an emphasis on programming languages and implementations. Submissions are sollicited on topics including, but not limited to: - abstract models of computation for non denumerable sets - programming languages for exact real arithmetic - data structures for exact real numbers or for `large` subsets of the reals - algorithms for exact arithmetic on real numbers - algorithms for approximate arithmetic or interval arithmetic, but with unrestricted precision - complexity theory related to arithmetic on real numbers - symbolic or algebraic computations on real numbers - survey articles or case studies on the area We look for original, unpublished contributions of high quality that are not submitted elsewhere. All submissions will be evaluated on the the ususal criteria (like technical content, originality... ), but also on how they "bridge the gap", i.e. having both theoretical aspects and practical experiments will be a bonus. Deadline for submissions is December 31, 2002. Authors will be notified of acceptance or rejection before May 1, 2003. We anticipate publication of the special issue about end of 2003. Authors are requested to submit their paper (in either Postscript or PDF) electronically to the chief editor indicated below. We encourage the use of the Elsevier style file with LaTeX (see http://www.elsevier.com/locate/latex). In order to speed up the review process, authors are strongly encouraged to send (tentative) title and abstract to the chief editor as soon as available. Chief editor: Norbert Mueller mueller@uni-trier.de Fachbereich IV - Abteilung Informatik Universitaet Trier D-54286 Trier Germany Guest editors: Martin Escardo m.escardo@cs.bham.ac.uk School of Computer Science University of Birmingham Birmingham B15 2TT England Paul Zimmermann Paul.Zimmermann@loria.fr INRIA Lorraine Technopole de Nancy-Brabois 615 rue du Jardin Botanique, BP 101 F-54600 Villers-les-Nancy France