From yaronber at cs.huji.ac.il Tue Mar 1 18:38:13 2005 From: yaronber at cs.huji.ac.il (Yaron Ostrovsky-Berman) Date: Mon Jan 9 13:41:18 2006 Subject: Compute the Closest Segment for a given point? In-Reply-To: <20050223134737.M30620@dpi.ufv.br> Message-ID: <000201c51e7d$0fe13590$7a224084@hal9000> Marco, You can use the Voronoi Diagram of line segments. After obtaining the diagram, you can process it for point location queries. The new version of CGAL has a class for computing this diagram, if you?re interested. Yaron -----Original Message----- From: Marco Carim [mailto:mcarim@dpi.ufv.br] Sent: Wednesday, February 23, 2005 15:53 To: compgeom-discuss@research.bell-labs.com Subject: Compute the Closest Segment for a given point? I am a student of Master Degree in Computer Science and I studing de following problem: ?Let S be a set of n segments and given a query point, compute the closest segment in S.? Somebody would have references about methods to resolve this problem? Thanks. ----------------------------------- WebMail DPI Departamento de Inform?tica Universidade Federal de Vi?osa ----------------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050301/ac4e285b/attachment.htm From m.t.d.berg at TUE.nl Wed Mar 2 09:11:51 2005 From: m.t.d.berg at TUE.nl (Berg, M.T. de) Date: Mon Jan 9 13:41:18 2006 Subject: openings for PhD student and postdoc at TU Eindhoven Message-ID: <9F38CF35D80CAE409B979F3EB5242B4A025E1A84@winex2.campus.tue.nl> OPENINGS in COMPUTATIONAL GEOMETRY at the TU Eindhoven (the Netherlands): 1 PhD student, 1 postdoc The Algorithms group at the TU Eindhoven (the Netherlands) has two positions open in the area of computational geometry and I/O-efficient algorithms: 1 position for a PhD student, 1 position for a postdoc. The PhD student position ------------------------- An experimental analysis of multi-functional geometric data structures Data structures play an important role in applications, and researchers in computational geometry have developed many intricate geometric data structures. Unfortunately, these structures are not very versatile: each structure usually can answer only one specific type of query for one specific type of input data. In a typical application, however, one needs a multi-functional data structure: a single data structure that can handle several types of input objects simultaneously, and that can answer various different queries. In a recent project we are exploring multi-functional data structures from a theoretical point of view. The new PhD student will complement this with an experimental evaluation. The postdoc position (two years) -------------------------------- I/O-efficient algorithms for 3D visibility problems Traditionally, the running time of algorithms in computational geometry is analyzed in terms of the number of elementary operations (such as comparisons, additions, etc.) performed by the CPU. For massive data sets that do not fit into the computer's main memory, however, the number of I/O-operations usually determines the actual running time. In this project, the postdoc will work on algorithms and data structures for 3D visibility problems that have good I/O-behavior. WE ASK ------ Candidates for the PhD position: should have a masters degree in computer science or mathematics, with a firm background in algorithms. Candidates should also have some experience (or at least interest) in experimental research. Candidates for the postdoc position: should have a PhD in computer science on a topic from computational geometry or I/O-efficient algorithms. HOW TO APPLY ------------ PhD position: - send a CV, list of grades of masters courses (with an explanation of the grading scheme used), the names of one or two references, and an accompanying letter to prof.dr. Mark de Berg (mdberg@win.tue.nl). postdoc position: - Send a CV with a list of publications and the names of one or two references, and an accompanying letter, to prof.dr. Mark de Berg ( mdberg@win.tue.nl ). MORE INFORMATION ---------------- If you want to know more about the project or job conditions, please contact Mark de Berg ( mdberg@win.tue.nl ). See also the group's website at http://www.win.tue.nl/algo/ 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. -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20050302/822b41be/attachment.htm From kettner at mpi-sb.mpg.de Wed Mar 2 18:28:20 2005 From: kettner at mpi-sb.mpg.de (Lutz Kettner) Date: Mon Jan 9 13:41:18 2006 Subject: Extended deadline: 14th Annual Multimedia Review of Computational Geometry (SoCG'05) In-Reply-To: <200410071903.i97J3C628948@catbert.ams.sunysb.edu> Message-ID: We are able to offer an extension of the electronic submission deadline for one more week. CALL FOR VIDEO AND MULTIMEDIA PRESENTATIONS 14th Annual Multimedia Review of Computational Geometry part of the 21st ACM Symposium on Computational Geometry June 6 - 8, 2005 National Research Council of Italy (CNR) Area della Ricerca di Pisa, Italy Sponsored by ACM SIGACT and SIGGRAPH http://www.socg05.org/ Video and multimedia presentations are sought for a video review of computational geometry. This review showcases the use of visualization in computational geometry for exposition and education, for the visual exploration of geometry in research, and as an interface and a debugging tool in software development. Algorithm animations, visual explanations of structural theorems, descriptions of applications of computational geometry, and demonstrations of software systems are all appropriate. Videos that accompany papers submitted to the technical program committee are encouraged. Three to five minutes is ideal for most animations and presentations of applications; eight minutes is the upper limit. Standard VHS videotape is allowed, but electronic formats are encouraged (QuickTime, MPEG, .avi, .mov, or RealPlayer). We allow submission of Macromedia Flash, MS PowerPoint animations, Java applets, and limited forms of other multimedia. These formats must have a 'demo mode' that requires no interaction after e.g. pressing a 'demo' button. In case of doubt, please email the Video and Multimedia Program chair. Accepted video and multimedia presentations will be collected and made available online in various formats in a web proceedings. VIDEO/MULTIMEDIA SUBMISSION For electronic submission of a video or multimedia presentation, to arrive by March 8, 2005, the author(s) should submit a one or two-page description of the material shown in the presentation, and where applicable, the techniques used in the implementation, to the Video Review section of the electronic submission server (linked from http://www.socg05.org/). An email address of the correspondence author and a URL or ftp address where the presentation can be retrieved must be included. Additional material describing the contents of the presentations, such as the full text of accompanying papers, may also be included. The final descriptions must be formatted according to the guidelines for ACM proceedings. As an alternative, descriptions and videos on VHS videotape, in either NTSC or PAL format, can be sent to the video and multimedia presentations program chair, to arrive by March 1, 2005 (deadline passed): Lutz Kettner Max Planck Institute fuer Informatik Stuhlsatzenhausweg 85 66123 Saarbruecken, Germany Phone: +49-681-9325 106 kettner@mpi-sb.mpg.de For more information, please visit the web page http://www.mpi-sb.mpg.de/~kettner/SoCG05multimedia/ Authors will be notified of acceptance or rejection, and given reviewers' comments by March 22, 2005. For each accepted presentation, the final version of the 2-page textual description will be due by March 29, 2005 (electronically) for inclusion in the proceedings. Final versions of accepted video/MM presentations will be due April 19, 2005 in the best format available. IMPORTANT DATES March 1, 2005: Physical Video and Multimedia submissions due (passed) March 8, 2005: Electronic Video and Multimedia submissions due, extended March 22, 2005: Notification for Video/MM submissions March 29, 2005: Camera-ready video/MM abstracts due April 19, 2005: Final versions of video/MM presentations due June 6-8, 2005: Symposium in Pisa VIDEO AND MULTIMEDIA PRESENTATION PROGRAM COMMITTEE Pierre Alliez (INRIA, Sophia-Antipolis) Sariel Har-Peled (UIUC, Urbana) John Iacono (Polytechnic University, Brooklyn) Lutz Kettner (chair; Max-Planck-Institut fuer Informatik, Saarbruecken) Jack Snoeyink (UNC Chapel Hill) ------------- 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 dolzmann at dormouse.fmi.uni-passau.de Tue Mar 8 13:09:38 2005 From: dolzmann at dormouse.fmi.uni-passau.de (Dr. Andreas Dolzmann) Date: Mon Jan 9 13:41:18 2006 Subject: A3L Early Registration Ending Soon Message-ID: <200503081209.j28C9cHo023307@dormouse.fmi.uni-passau.de> Dear Friends and Colleagues The A3L early registration is going to end on Monday, 14 March 2005. Do not miss this deadline for our discount conference fee. To profit from our greatly reduced hotel prices, we strongly recommend to register as soon as possible. A list of all A3L authors and contributions is now online at www.A3L.org. There you also find all relevant information on the registration process. We are looking forward to meeting you in Passau. Andreas Dolzmann Thomas Sturm ------------- 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 roman.voznyuk at rogers.com Thu Mar 10 19:54:50 2005 From: roman.voznyuk at rogers.com (Roman Voznyuk) Date: Mon Jan 9 13:41:18 2006 Subject: simple geometry constraints solver Message-ID: <005001c525d4$ee3eba70$0500a8c0@vrv75> Geometry constraints solver is important part of CAD/CAM systems and other computation geometry applications. Simple geometry constraints solver is offered as alternative of complex and expensive DCM. http://pentities.atspace.com/geom_solver/geom_solver.htm ------------- 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 jan at math.uni-muenster.de Fri Mar 18 12:51:56 2005 From: jan at math.uni-muenster.de (Jan Vahrenhold) Date: Mon Jan 9 13:41:18 2006 Subject: MASSIVE2005: Workshop Announcement (update) Message-ID: <8ac87299ff523810dff732b6d144f95f@math.uni-muenster.de> Please note that the submission of abstracts is possible until April 20, 2005 (was: April 15, 2005). ------------------------------------------------------------------------ ---- Workshop on Massive Geometric Data Sets in connection with SoCG 05 June 9, 2005, National Research Council Campus, Pisa, Italy. Supported by: BRICS, IIT-CNR, Netherlands Organization for Scientific Research, University of Muenster. Aims and Scope: --------------- The aim of this informal workshop is to provide an opportunity for established researchers from academia, R&D peoplefrom industry, research students, and postdocs to meet and present their current work in order to further scientific interaction and international collaboration. Topics of interest include, but are not restricted to: * I/O-efficient algorithms and data structures. * Cache-oblivious algorithms and data structures. * Data Stream algorithms. * Geometric problems in spatial databases. * Geometric visualization problems. We also invite contributions that discuss work-in-progress and open problems and/or that address methodologicalissues and standards in the context of empirical research on algorithms and data structures for massive geometric data sets. The workshop is co-located with SoCG 05 (http://www.socg05.org), the 21th ACM Symposium on Computational Geometry, and will take place on the day following the conference. Participation: -------------- If you are interested in participating please send email to "massive2005 at math uni-muenster de" or use the on-line registration form (http://wwwmath.uni-muenster.de/cs/u/jan/IOWorkshop/registration.html). If you are interested in giving a talk, please also provide a short abstract (at most one page) of your talk by April 20, 2005. (Note that since this is a one-day event, it may not be possible for everyone to give a presentation.) There will be no formal proceedings, a booklet of abstracts, however, will be handed out to the participants. The workshop program will be put together by April 29, 2005, and presenters who wish to contribute extended abstracts of up to five pages for the booklet of abstracts are encouraged to do so by May 15, 2005. There will be a separate registration fee of 25 EUR for the workshop. The payment of this fee will handled (in cash) on-site. Organizing Committee: --------------------- Lars Arge, University of Aarhus / Duke University (workshop organization) Mark de Berg, TU Eindhoven (workshop organization) Adriana Lazzaroni, IIT-CNR (local arrangements) Guiseppe Liotta, University of Perugia (local arrangements) Marco Pellegrini, IIT-CNR (local arrangements) Jan Vahrenhold, University of Muenster (workshop organization) Important dates: ---------------- Submission of Abstracts: April 20, 2005 (updated) Program available: April 29, 2005 (Optional:) Extended abstracts due: May 15, 2005 For more information: --------------------- See the webpage for the workshop (http://wwwmath.uni-muenster.de/cs/u/jan/IOWorkshop) or email the organizers at "massive2005 at math uni-muenster de". ------------------------------------------------------------------------ ---- PD Dr. Jan Vahrenhold Westfaelische Wilhelms-Universitaet Institut fuer Informatik Einsteinstr. 62, 48149 Muenster, Germany mailto:jan.vahrenhold@math.uni-muenster.de Tel.: +49-251/83-38444 http://www.uni-muenster.de/informatik/users/jan/ FAX : +49-251/83-33755 ------------- 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 asishm at cs.uwindsor.ca Thu Mar 31 16:29:58 2005 From: asishm at cs.uwindsor.ca (Mukhopadhyay Asish) Date: Mon Jan 9 13:41:18 2006 Subject: CCCG 2005 - 3rd call for papers Message-ID: <200503312129.j2VLTwUj003355@sol.cs.uwindsor.ca> -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- Call for Papers 17th Canadian Conference on Computational Geometry August 10-12, 2005 University of Windsor, Windsor http://cccg.cs.uwindsor.ca -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- Objectives The Canadian Conference on Computational Geometry (CCCG) focuses on the mathematics of discrete geometry from a computational point of view. Abstracting and studying the geometric problems that underly important applications areas (such as geographic information systems, computer-aided design, simulation, robotics, solid modeling, databases, and graphics) leads not only to new mathematical results, but also provide stimulus to these areas. Despite its international following, CCCG maintains the informality of a smaller workshop and attracts a large number of students. Call for Papers Authors are invited to submit papers describing original research of theoretical and practical significance to computational geometry. Electronic submissions, in standard PostScript and not exceeding 4 pages in length, should be made from the conference web page. In case you are not able to submit electronically or are facing a problem with the electronic submission e-mail your paper to asishm@cs.uwindsor.ca Invited Speakers Joseph O'Rourke, Smith College, USA Sudipto Guha, Univerisity of Pennsylvannia, USA Jeff Erickson, University of Illinois at Urbana-Champaign, USA Special Issue The program committee will invite the authors of a selection of the accepted papers to submit a final version to a special issue of Computational Geometry: Theory and Applications. These papers will go through a full refereeing process for the journal. Important Dates Submission May 2, 2005 Notification May 31, 2005 Final version June 30, 2005 Conference August 10-12, 2005 Program Committee Binay Bhattacharya Simon Fraser University Prosenjit Bose Carleton University Timothy Chan University of Waterloo William Evans University of British Columbia Thomas Fevens Concordia University Mark Keil University of Saskatchewan Anil Maheswari Carleton University Asish Mukhopadhyay University of Windsor Godfried Toussaint McGill University Yung H. Tsin University of Windsor Stephen Wismath University of Lethbridge Local Contact Asish Mukhopadhyay School of Computer Science Faculty of Science University of Windsor 401 Sunset Avenue Windsor, Ontario N9B 3P4 Canada Phone: 519-253-3000x3778 Fax: 514-973-7093 Email: cccg@cs.uwindsor.ca ------------- 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. "CFPcccg05" 95 lines, 2995 characters ------------- 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.