From ca2002 at miralab.unige.ch Fri Nov 2 13:37:27 2001 From: ca2002 at miralab.unige.ch (CA 2002) Date: Mon Jan 9 13:41:03 2006 Subject: CFP - Computer Animation 2002 Message-ID: -=- CALL FOR PAPERS -=- - THE 15TH INTERNATIONAL CONFERENCE ON COMPUTER ANIMATION - COMPUTER ANIMATION 2002 www.miralab.unige.ch/ca2002/ _______________________ GENEVA, SWITZERLAND JUNE 19-21, 2002 Contact email: CA2002@miralab.unige.ch The COMPUTER GRAPHICS SOCIETY (CGS) is pleased to announce that the COMPUTER ANIMATION 2002 Conference will be held in Geneva, Switzerland. This 15th annual conference on Computer Animation will be organized by MIRALab at University of Geneva with the support of IFIP WG5.10 (Computer Graphics and Virtual Worlds). _______________________ The topics of interest in Computer Animation 2002 include but are not limited to: . Motion control . Animation for scientific . Keyframe technique visualization . Artificial life . Animation in engineering . Motion capture . Motion blur and temporal . Path planning antialising . Behavioral animation . A.I. - based animation . Physics-based animation . Robotics and animation . Virtual humans and avatars . Virtual reality . Image rendering in animation . Autonomous characters and actors . Animation languages and systems . Sound and speech synchronization . Vision techniques in animation . Virtual Cultural Heritage . VCE (Virtual Collaborative . Medical 3D simulation Environments) . Augmented Reality . Real-time simulation, animation and visualization _______________________ IMPORTANT DATES 15 December 2001 : Paper Submission Deadline 10 February 2002 : Notification of Acceptance 28 February 2002 : Camera Ready Papers Due 19 June 2002 : Start of Computer Animation 2001 _______________________ Conference Co-Chairs: Nadia Magnenat-Thalmann University of Geneva Geneva, Switzerland Dimitris Mextaxas Rutgers University, USA Program Co-Chairs Norman Badler University of Pennsylvania, USA Nadia Magnenat-Thalmann University of Geneva Geneva, Switzerland Rick Parent The Ohio State University, USA Daniel Thalmann EPFL, Switzerland ___________________________ ___________________________ PAPER SUBMISSION PROCEDURES Submissions should be made electronically, in PDF format only (no paper copy will be accepted). An electronic version should be submitted by December 15, 2002 to our submission page: www.miralab.unige.ch/ca2002/submit.html Papers must be prepared without the use of special fonts No color figures will be printed. - Authors will be notified by February 10, 2002. - Camera-ready papers are due by February 28, 2002. All papers will be reviewed carefully by the International Program Committee members and External Reviewers Group. All accepted papers will appear in a proceedings book published by IEEE Computer Society Press. _______________________ PAPER FORMAT Original unpublished papers of up to 12 pages (single-spaced, 12 points, including figures, tables and references) are invited. Manuscripts must be written in English. The first part of the paper should include a title, an abstract, keywords, and author's information (name, title, affiliation, address, phone and fax numbers, e-mail address). Any animation sequences should be made available as a URL in your paper. _______________________ SEND QUERIES TO CA 2002 secretariat Email: CA2002@miralab.unige.ch Fax: +41-227057780 Web: www.miralab.unige.ch/ca2002/ _______________________ _______________________ ------------- 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 suri at cs.ucsb.edu Thu Nov 1 16:26:18 2001 From: suri at cs.ucsb.edu (Subhash Suri) Date: Mon Jan 9 13:41:03 2006 Subject: Call for papers: 18th ACM Sumposium on Computational Geometry Message-ID: ACM Symposium on Computational Geometry 2002 June 5-7, 2002 Universitat Polit?cnica de Catalunya, Barcelona, Spain Sponsored by ACM SIGACT and SIGGRAPH URL: http://www-ma2.upc.es/~geomc/events/socg2002/cfpv.html -------------------------------------------------------------------------- Call For Papers and Videos The Eighteenth Annual Symposium on Computational Geometry, featuring both theoretical and applied research, and a video review, will be held at Universitat Polit?cnica de Catalunya, Barcelona, Spain. We invite high-quality submissions in the following research areas: * Geometric algorithms or combinatorial geometry theory; * Implementation issues or applications of computational geometry. The accepted papers will be published in the symposium proceedings format by ACM and distributed at the symposium. The proceedings will also be available separately for purchase from ACM. A selection of papers from the conference will be invited to special issues of journals. For the first time this year, there will be a prize for the best student-authored paper (see below). The Program Co-Chairs have assembled a committee spanning both theoretical and applied interests in computational geometry in an effort to encourage submissions to both a theoretical track and an applied (or experimental) track of the conference. Topics for the theoretical track include, but are not limited to design and theoretical analysis of geometric algorithms and data structures; lower bounds for geometric problems; and discrete and combinatorial geometry. Topics for the applied track include, but are not limited to experimental analysis of algorithms and data structures; mathematical and numerical issues arising from implementations; and novel uses of computational geometry in other disciplines, such as robotics, computer graphics, geometric and solid modeling, manufacturing, geographical information systems, and molecular biology. See below for additional information on the two tracks. Paper Submission Electronic submissions are preferred, but authors may instead mail 8 copies of an extended abstract to arrive by December 7, 2001 to either of the two Program Co-Chairs Subhash Suri Chandrajit Bajaj Dept. of Computer Science Dept. of Computer Sciences University of California University of Texas, Austin Santa Barbara, CA 93106, USA Austin, TX 78733, USA Phone: (805) 893-8856 Phone: (512) 471-8870 suri@cs.ucsb.edu bajaj@cs.utexas.edu Important Dates December 7, 2001: Papers due February 8, 2002: Video submissions due February 15, 2002:Notification of acceptance or rejection of papers February 22, 2002:Notification of acceptance or rejection of videos March 15, 2002: Camera-ready papers and video abstracts due April 5, 2002: Final versions of videos due June 5-7, 2002: Symposium Submission Guidelines Papers should be submitted in the form of an extended abstract, which begins with the title of the paper, each author's name, affiliation, and e-mail address, followed by a succinct statement of the problems and goals that are considered in the paper, the main results achieved, the significance of the work in the context of previous research, and a comparison to past research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages, using 11 point or larger font and with at least one-inch margins all around. If the authors consider it absolutely essential to include additional technical details that do not fit into 10 pages, these details may be added in a clearly marked appendix that should appear after the body of the paper and the references; this appendix will not be regarded as a part of the submission and will be considered only at the program committee's discretion. Optionally, authors may also indicate their preference as to which of the two tracks (theoretical or applied) the submission is targeted; however, the program committee will exercise its discretion in how best to handle each submission. Abstracts in hard copy must be received by December 7, 2001. Abstracts in electronic form are due by December 7, 5:00 PM PST. These are firm deadlines: late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 2002. A full version of each contribution in final form will be due by March 15, 2002 for inclusion in the proceedings. Best Student Paper Award A prize will be given to the author(s) of the best student-authored paper. The program committee may decline to make the award, or may split it among more than one paper. A paper is eligible if all of its authors are full-time students at the time of submission. This must be indicated in the submission cover letter or (for electronic submissions) during the on-line registration process. Conference Chairs Ferran Hurtado and Vera Sacrist?n Program Committee Pankaj Agarwal (Duke) Nina Amenta (U of Texas at Austin) Esther Arkin (SUNY Stony Brook) Chandrajit Bajaj Co-Chair (U of Texas at Austin) Jean-Daniel Boissonnat (INRIA) Siu-Wing Cheng (UST, Hong Kong) Michael Goodrich (UC Irvine) John Hershberger (Mentor Graphics) Marc van Kreveld (Utrecht) Victor Milenkovic (U of Miami) G?nter Rote (FU Berlin) Jorg-Rudiger Sack (University of Carleton) Jonathan Shewchuk (UC Berkeley) Jorge Stolfi (UNICAMP, Brazil) Subhash Suri Co-Chair (U of California, Santa Barbara) Steve Vavasis (Cornell University) Call For Videos Videos are sought for a video review of computational geometry. This video review showcases the use of visualization in computational geometry for exposition and education, as an interface and a debugging tool in software development, and for the visual exploration of geometry in research. 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. Video Submission Authors should send one preview copy of a videotape to the address below by February 8, 2002. The videotape should be at most eight minutes long (three to five minutes, preferred), and be in VHS NTSC or VHS PAL format. Each video tape must be accompanied by a one- or two-page description of the material shown in the video, and where applicable, the techniques used in the implementation. Please format descriptions following the guidelines for ACM proceedings. Additional material describing the contents of the videos, such as the full text of accompanying papers, may also be included. Textual material may be submitted electronically by e-mailing either the URL of a PostScript file (preferred) or the PostScript file itself. If electronic submission is impossible, authors should include five hardcopies of the accompanying text with their video. Videotapes and accompanying text should be sent to Gill Barequet Faculty of Computer Science The Technion-IIT Haifa 32000, Israel Phone: +972 (4) 829-3219 Fax: +972 (4) 822-1128 barequet@cs.technion.ac.il For customs purposes, it is best to declare a value of $5. If you have questions, please contact the committee chair. Notification Authors will be notified of acceptance or rejection, and given reviewers' comments by February 22, 2002. For each accepted video, the final version of the textual description will be due by March 15, 2002 for inclusion in the proceedings. Final versions of accepted videos will be due April 5, 2002 in the best format available. The accepted videos will be edited onto one tape, which will be shown at the conference and will be distributed to the participants. Video Program Committee Gill Barequet, Chair (Technion) Matthew Katz (Ben Gurion) Subodh Kumar (Johns Hopkins) Micha Sharir (Tel Aviv) Ayellet Tal (Technion) ---------------------------------------------------------------------- ------------- 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 marina at cpsc.ucalgary.ca Tue Nov 6 17:55:15 2001 From: marina at cpsc.ucalgary.ca (Marina Gavrilova) Date: Mon Jan 9 13:41:03 2006 Subject: CFP, Canadian Conference on CG'02 Message-ID: For your information. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Marina L. Gavrilova, Ph.D. Assistant Professor Dept. of Computer Science University of Calgary Calgary AB Canada T2N1N4 Phone: (403) 220-5105 Fax: (403) 284-4707 E-mail: marina@cpsc.ucalgary.ca Web site: www.cpsc.ucalgary.ca/~marina -------------- next part -------------- A non-text attachment was scrubbed... Name: cfp.ps Type: application/postscript Size: 236795 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20011106/f084852c/cfp.ps From Laurent.Moccozet at cui.unige.ch Fri Nov 9 16:50:34 2001 From: Laurent.Moccozet at cui.unige.ch (Laurent Moccozet) Date: Mon Jan 9 13:41:03 2006 Subject: CfP - Computer Animation 2002 (CA2002) Message-ID: <4.3.0.20011109165003.02af7008@cuimail.unige.ch> -=- CALL FOR PAPERS -=- - THE 15TH INTERNATIONAL CONFERENCE ON COMPUTER ANIMATION - COMPUTER ANIMATION 2002 www.miralab.unige.ch/ca2002/ _______________________ GENEVA, SWITZERLAND JUNE 19-21, 2002 Contact email: CA2002@miralab.unige.ch The COMPUTER GRAPHICS SOCIETY (CGS) is pleased to announce that the COMPUTER ANIMATION 2002 Conference will be held in Geneva, Switzerland. This 15th annual conference on Computer Animation will be organized by MIRALab at University of Geneva with the support of IFIP WG5.10 (Computer Graphics and Virtual Worlds). _______________________ The topics of interest in Computer Animation 2002 include but are not limited to: . Motion control . Animation for scientific . Keyframe technique visualization . Artificial life . Animation in engineering . Motion capture . Motion blur and temporal . Path planning antialising . Behavioral animation . A.I. - based animation . Physics-based animation . Robotics and animation . Virtual humans and avatars . Virtual reality . Image rendering in animation . Autonomous characters and actors . Animation languages and systems . Sound and speech synchronization . Vision techniques in animation . Virtual Cultural Heritage . VCE (Virtual Collaborative . Medical 3D simulation Environments) . Augmented Reality . Real-time simulation, animation and visualization _______________________ IMPORTANT DATES 15 December 2001 : Paper Submission Deadline 10 February 2002 : Notification of Acceptance 28 February 2002 : Camera Ready Papers Due 19 June 2002 : Start of Computer Animation 2002 _______________________ Conference Co-Chairs: Nadia Magnenat-Thalmann University of Geneva Geneva, Switzerland Dimitris Mextaxas Rutgers University, USA Program Co-Chairs Norman Badler University of Pennsylvania, USA Nadia Magnenat-Thalmann University of Geneva Geneva, Switzerland Rick Parent The Ohio State University, USA Daniel Thalmann EPFL, Switzerland ___________________________ ___________________________ PAPER SUBMISSION PROCEDURES Submissions should be made electronically, in PDF format only (no paper copy will be accepted). An electronic version should be submitted by December 15, 2001 to our submission page: www.miralab.unige.ch/ca2002/submit.html Papers must be prepared without the use of special fonts No color figures will be printed. - Authors will be notified by February 10, 2002. - Camera-ready papers are due by February 28, 2002. All papers will be reviewed carefully by the International Program Committee members and External Reviewers Group. All accepted papers will appear in a proceedings book published by IEEE Computer Society Press. _______________________ PAPER FORMAT Original unpublished papers of up to 12 pages (single-spaced, 12 points, including figures, tables and references) are invited. Manuscripts must be written in English. The first part of the paper should include a title, an abstract, keywords, and author's information (name, title, affiliation, address, phone and fax numbers, e-mail address). Any animation sequences should be made available as a URL in your paper. _______________________ SEND QUERIES TO CA 2002 secretariat Email: CA2002@miralab.unige.ch Fax: +41-227057780 Web: www.miralab.unige.ch/ca2002/ _______________________ _______________________ ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From ian at cs.wits.ac.za Mon Nov 12 17:02:01 2001 From: ian at cs.wits.ac.za (Ian Sanders) Date: Mon Jan 9 13:41:03 2006 Subject: stabbing -- explanation requested Message-ID: Hi all, Normally I would not bother people with something like this but I have some time pressures so I hope you will give me a bit of slack. I have been told that the problem I have been working on is "just like stabbing" and so I wanted to check this out. Unfortunately it seems that most of the literature that I can find is either not available in SA or if the journals are available here then they are currently out. Would anyone be prepared to give me a quick summary of stabbing/stabbers -- I am interested in the 2-d case only as my problem is strictly 2-d. A summary would help me decide whether to spend the money on inter-library loans from outside of South Africa (an expensive process) to get copies of the papers. Thanks Ian ---------------------------------------------------------------- Ian Sanders Telephone: (2711) 717-6187 School of Computer Science Fax: (2711) 717-6199 University of the Witwatersrand Private Bag 3 email: ian@cs.wits.ac.za 2050 WITS SOUTH AFRICA http://www.cs.wits.ac.za/~ian ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From ian at cs.wits.ac.za Tue Nov 13 09:43:07 2001 From: ian at cs.wits.ac.za (Ian Sanders) Date: Mon Jan 9 13:41:03 2006 Subject: stabbing -- a follow up Message-ID: Hi again, Yesterday I posted: >Normally I would not bother people with something like this but I have >some >time pressures so I hope you will give me a bit of slack. > >I have been told that the problem I have been working on is "just like >>stabbing" and so I wanted to check this out. Unfortunately it seems that >most >of the literature that I can find is either not available in SA or >if the >journals are available here then they are currently out. Would >anyone be >prepared to give me a quick summary of stabbing/stabbers -- I >am interested in >the 2-d case only as my problem is strictly 2-d. A >summary would help me decide >whether to spend the money on inter-library >loans from outside of South Africa >(an expensive process) to get copies >of the papers. To which Seth Teller replied: >it might make more sense for you to post a brief >description of your problem to the group. then >if people recognize similarities to stabbing we >can point you to specific papers (many of which >are online). > >seth. A good suggestion! So further indulging your patience below follows a quick summary of my problem; \section{Statement of the Problem}\label{convex-statement} Given a number of adjacent convex polygons (2-d as is all of my work currently) find the fewest axial lines contained wholly inside the polygons which will cross all of the shared boundaries (adjacencies) between adjacent polygons. An additional requirement is that each axial line should cross as many of the shared boundaries as possible -- a \emph{maximal} axial line. %%note an axial line is simply a line segment %%note polygons are strictly non-overlapping. As before, depending on how the problem is considered there are 2 similar but distinct problems which can be addressed. \begin{enumerate} \item Adjacencies can be crossed more than once but every adjacency must be crossed \emph{at least} once. \item Any adjacency has \emph{exactly} one line crossing it. \end{enumerate} Here only problem $1$ is addressed. An example of the problem is shown in Figure~\ref{convex-problem-example}. \begin{figure} \begin{center} \begin{picture}(396,360)(0,0) \put(0,0){\framebox(396,360){}} \fboxsep=0pt \psset{unit=1pt} \begin{pspicture}(0,0)(396,360) \psset{fillstyle=solid,linestyle=solid,linewidth=0,bordercolor=black} \pspolygon[fillcolor=lightgray](40,160)(45,200)(120,200)(160,160)(80,80)(45,85) \pspolygon[fillcolor=lightgray](40,200)(40,280)(120,320)(120,240)(80,200) \pspolygon[fillcolor=lightgray](120,200)(120,280)(200,240)(200,160)(160,160) \pspolygon[fillcolor=lightgray](80,40)(80,80)(120,120)(240,140)(280,120)(200,40) \pspolygon[fillcolor=lightgray](200,160)(200,240)(240,280)(280,280)(280,120) \pspolygon[fillcolor=lightgray](280,120)(280,200)(316,200)(356,160) \pspolygon[fillcolor=lightgray](280,200)(280,280)(320,296)(360,260)(360,200) \psline(64,92)(300,140) \psline(52,204)(304,148) \psline(80,268)(312,196) \end{pspicture} \end{picture} \end{center} \label{convex-problem-example} \caption{An example of placing axial lines to cross all of the adjacencies in a configuration of adjacent convex polygons} \end{figure} The decision problem can be stated as \textit{\textbf{ALP-ALCP}}\\ \emph{Instance:} A collection of convex polygons $P_1 \ldots P_n$, where each polygon is adjacent to at least one other polygon, and a positive integer $M$.\\ \emph{Question:} Is there a set $L$ of axial lines where each axial line is maximal in length, each line is wholly contained in the collection of polygons, each shared boundary between adjacent polygons is crossed at least once and $\mid L \mid \leq M$?\\ \begin{theorem} \textit{\textbf{ALP-ALCP}} is NP-Complete. \label{general} \end{theorem} I have proved this result. Thanks again. Ian ---------------------------------------------------------------- Ian Sanders Telephone: (2711) 717-6187 School of Computer Science Fax: (2711) 717-6199 University of the Witwatersrand Private Bag 3 email: ian@cs.wits.ac.za 2050 WITS SOUTH AFRICA http://www.cs.wits.ac.za/~ian ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From gabrielarcos at cantv.net Tue Nov 13 13:07:31 2001 From: gabrielarcos at cantv.net (Gabriel Arcos) Date: Mon Jan 9 13:41:03 2006 Subject: between two circles tessellation Message-ID: <006001c16c65$af1266c0$0400000a@CANTV.NET> Hi, I need to tessellate the area between two circles in 3D space living on different planes. Those planes need not to be parallel, even a circle can intersect the other. Someone knows some simple algorithm to do this? I read all the bibliography that I can without find it. thanks in advance. Gabriel Arcos. ------------- 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 John.Dickinson at nrc.ca Tue Nov 13 11:11:50 2001 From: John.Dickinson at nrc.ca (Dickinson, John) Date: Mon Jan 9 13:41:03 2006 Subject: rotation matrix Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFFED4@nrclonex1.imti.nrc.ca> I am whipping together a model of a geometry problem and need the formulas or algorithm for calculating a rotation matrix (3D) needed to align one direction vector with another. I can work it by hand if I have to but I hate doing that when in a rush not wanting to search the inevitabl bugs. Paper, book or code references welcome! John -- -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859) ---- John Kenneth Dickinson | "A sharp tongue is the only Research Council Officer IMTI-NRC | edge tool that grows keener email: john.dickinson@nrc.ca | with constant use." ------------- 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 marina at cpsc.ucalgary.ca Wed Nov 14 13:18:28 2001 From: marina at cpsc.ucalgary.ca (marina) Date: Mon Jan 9 13:41:03 2006 Subject: Call For Papers In-Reply-To: <4.3.2.7.2.20010324103316.00b1c750@shell.shore.net> Message-ID: Please find attached CFP. -------------- next part -------------- A non-text attachment was scrubbed... Name: Call for Participation 2002.pdf Type: application/pdf Size: 5288 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20011114/bde4fdca/CallforParticipation2002.pdf From biggizach at web.de Thu Nov 15 00:15:59 2001 From: biggizach at web.de (Biggi) Date: Mon Jan 9 13:41:03 2006 Subject: dynamic data structures? Message-ID: <004e01c16d64$2cf20420$0c6406d5@biggis> Dear all, I am looking for all kinds of hierarchical dynamic data structures (and even not-so-hierarchical). By "dynamic" I mean a scenario where *all* objects (points, lines, etc.) move from frame to frame, but they move only by a small amount. Right now I don't have a particular problem/application in mind, so I am interested in all kinds of datastructures/algorithms that work efficient in such a "dynamic" setting. I would be happy if you could suggest any "must's", or give me pointers or names. Thanks a lot in advance, BZ. ------------- 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 rr29 at mcs.le.ac.uk Mon Nov 19 12:46:08 2001 From: rr29 at mcs.le.ac.uk (Rajeev Raman) Date: Mon Jan 9 13:41:03 2006 Subject: WAE merges with ESA Message-ID: WAE merges with ESA I am writing to inform members of the Algorithm Engineering community that the Annual Workshop on Algorithm Engineering (WAE) will no longer exist from 2002 onwards. In recognition of the fact that Algorithm Engineering is now accepted as part of mainstream algorithms research, WAE will be formally merged into the Annual European Symposium on Algorithms (ESA), culminating the trend towards organizational convergence between these conferences over the last two years. This decision was taken at the ALGO 2001 business meeting in Aarhus in September 2001. In 2002, ESA will have an "Engineering and Applications" track, with an independent Program Committee, which will consider Algorithm Engineering submissions. ESA will be held in Rome from 17-21 September 2002. The deadline for submissions will be April 15, 2002. Please see the CFP for the 10th Annual European Symposium on Algorithms (ESA 2002) for further details. Rajeev Raman ESA 2002 PC Chair (Engineering and Applications Track) Prof. Rajeev Raman Computer Science Group, Department of Maths & Computer Science University of Leicester, Leicester LE1 7RH, UK. email: R.Raman@mcs.le.ac.uk WWW: http://www.mcs.le.ac.uk/~rraman ------------- 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 John.Dickinson at nrc.ca Mon Nov 19 11:48:21 2001 From: John.Dickinson at nrc.ca (Dickinson, John) Date: Mon Jan 9 13:41:03 2006 Subject: Term research position open Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFFEEF@nrclonex1.imti.nrc.ca> I work in reserach for the Government of Canada and we have a position opening up which is probably of interest to people who have joined the compgeom mailing list (especially graduating PhD students). I'll add the basic text description below but was wondering if anyone could suggest any other forums for disseminating this to people with a background in solid-modeling? John ===================================================================== Research Associate, Solid Modeling The Research Associate will be responsible for designing and implementing mechanisms to internally represent, in a data model, the inputted sketch data i.e. line strokes and constraints. The candidate will be involved in developing sketch interpretation techniques for inferring a designer's intent and creating 3-D solid models. The candidate will also be responsible for developing a constraint modeler and solver to manage and interpret the relationships within and between various geometrical entities (e.g. sketch data and geometrical models). The candidate will also be expected to design and implement mechanisms to preserve these relationships as the sketch evolves. Education: Ph.D. in natural science or engineering or, a Masters degree in an engineering field within the last five years. Experience: Experience with geometrical modeling, computer graphics, and pattern recognition is essential. Experience with a solid modeling kernel e.g. Parasolids or ACIS is required and experience with pattern recognition and geometrical reasoning will be an asset. For more information on this position: ============================================================================ == -- -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859) ---- John Kenneth Dickinson | "A sharp tongue is the only Research Council Officer IMTI-NRC | edge tool that grows keener email: john.dickinson@nrc.ca | with constant use." ------------- 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 doron at ece.utexas.edu Mon Nov 19 12:12:00 2001 From: doron at ece.utexas.edu (Doron Peled) Date: Mon Jan 9 13:41:03 2006 Subject: FORTE 2002, Call For Papers Message-ID: Formal Techniques for Networked and Distributed Systems FORMAL METHODS FOR PROTOCOL ENGINEERING AND DISTRIBUTED SYSTEM FORTE 2002 November 11 -- 14 , 2002, Houston, Texas http://www.ece.utexas.edu/FORTE Program Chairs: Doron A. Peled Dept. of Electrical and Comp. Eng. The University of Texas at Austin Austin, TX 78712 Phone: +1-512-232-9371 doron@ece.utexas.edu Moshe Y. Vardi Department of Comp.Science Rice University 6100 S. Main St. Houston, TX 77005 Phone: +1-713-348-5977 vardi@cs.rice.edu Program Committee: R. Alur, UPenn D. Bjorner, IT University G. v. Bochmann, Univ.of Ottawa T. Bolognesi, IEI, Italy E. Brinksma, Univ of Twente A. Cavalli, INT, France S. T. Chanson, Hong Kong Univ P. Dembinski, IPI-PAN H. Garavel, Inria S. Gnesi, CNR - IEI, Italy G. J. Holzmann, Bell Labs, USA A. Hu, UBC, Canada C. Jard, IRISA - CNRS G. Leduc, Univ. of Liege D. Lee, Bell Labs, China I. Lee, UPenn S. Leue, Univ. of Freiburg L. Logrippo, Univ.of Ottawa S. Mauw, Eindhoven K. McMillan, Cadence M. Morley, Verisity A. Muscholl, Paris 7 E. Najm, ENST, France A. Petrenko, CRIM, Canada S. Smolka, Stony Brook R. Tenney, Univ.of Massachusetts K. Turner, Univ.of Stirling B. Roscoe, Univ.of Oxford S. T. Vuong, Univ.of BC M. Yannakakis, Avaya Labs Steering Committee: G. v. Bochmann, Univ.of Ottawa E. Brinksma, Univ.of Twente S. Budkowski, INT, France G. Leduc, Univ.of Liege E. Najm, ENST, France R. Tenney, Univ.of Massachusetts K. Turner, Univ.of Stirling The IFIP TC6 WG 6.1 Joint International Conference on Formal Techniques for Networked and Distributed Systems (FORTE) is focused on formal methods for communication protocols. FORTE is the new name of the joint FORTE/PSTV meeting, which has combined FORTE and PSTV into a single joint meeting since 1997. The conference will include invited talks and tutorials by Edmund M.Clarke, David Harel, Dave Johnson, Dan Wallach and Elaine J. Weyuker. The conference is a forum for presentation and discussion of the state of the art in theory, application, tools and industrialization of Formal Description Techniques (FDT's). Research papers and industrial usage reports are solicited, particularly in the following areas: >FDT-based system and protocol engineering. >Semantical foundations. >Extensions of FDT's. >Formal approaches to concurrent/distributed Object-Oriented systems. >Real-time and probability aspects. >Performance modeling and analysis. >Quality of service modeling and analysis. >Verification and validation. >Relations between informal and formal specification. >FDT based protocol implementation. >Software tools and support environments. >FDT application to distributed systems, high speed internet protocols, multimedia and multicast protocols and services. >FDT application to wireless and mobile communication, intelligent networks, network management, network security and voice services. >Protocol testing, including conformance testing, interoperability testing, and performance testing. >Test generation, selection and coverage. >Practical experience and case studies. >Corporate strategic and financial consequences of using formal methods. Paper submission: Submission instruction will be available at the conference web site. Submissions should be received by April 20, 2002. The deadline is firm; late submissions and papers departing from the submission guidelines will not be considered. Authors will be notified of acceptance or rejection by June 30, 2002. Accepted papers will be published by Springer Verlag in the Lecture Notes in Computer Science series, and are due by August 12, 2002. The first page of the extended abstract and the cover letter should include the title of the paper, names and affiliations of authors, a brief synopsis (at most 10 lines), keywords, and contact author's name, address, phone number, fax number, and email address. Full original research papers and industrial usage reports should be up to 16 pages, including abstract, names and affiliations of all authors, and a list of keywords facilitating the assignment of papers to referees. For industrial usage reports, short papers up to 8 pages are also welcome. The submission must be in English and provide sufficient detail to allow the program committee to assess the merits of the paper. It should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference, all phrased for the non-specialist. References and comparisons with related work should be included. Technical development directed to the specialist should follow. Submissions departing significantly from these guidelines risk rejection. The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. -------------- next part -------------- A non-text attachment was scrubbed... Name: CFPm.tex Type: application/x-tex Size: 7700 bytes Desc: Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20011119/5024cb9e/CFPm.tex -------------- next part -------------- A non-text attachment was scrubbed... Name: CFPm.ps Type: application/postscript Size: 61026 bytes Desc: Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20011119/5024cb9e/CFPm.ps From hert at mpi-sb.mpg.de Fri Nov 23 10:34:18 2001 From: hert at mpi-sb.mpg.de (hert@mpi-sb.mpg.de) Date: Mon Jan 9 13:41:03 2006 Subject: [DMANET] First CGAL User Workshop -- Call for Abstracts & Participation Message-ID: <200111230934.KAA10388@mpii01905.ag1.mpi-sb.mpg.de> First CGAL User Workshop http://www.cgal.org/UserWorkshop http://www-ma2.upc.es/~geomc/events/socg2002/CGALWorkshop.html The CGAL Consortium is organizing the first CGAL User Workshop, to be held on June 4, 2002 immediately before the ACM Symposium on Computational Geometry in Barcelona, Spain. The goal of this one-day workshop is twofold: to allow CGAL users and developers to meet and share their experiences with the library while at the same time providing an opportunity for potential users to learn more about CGAL and how they might benefit from it. The day will be organized around a series of short (30-minute) presentations by users and developers. The topics to be discussed include but are not limited to: - design of library components - implementation of algorithms and data structures using CGAL - use of the library in experimentation - experiences with CGAL in teaching - comparisons of CGAL with other libraries. At the end of the day, we will have an extensive Q&A session. The focus of the meeting is not CGAL, but the users. If you have any suggestions about what should be discussed, please send a message to editor@cgal.org so we can do our best to organize the workshop to meet your needs. Abstract Submission ------------------- If you are a CGAL user and would like to present your work, we invite you to submit an abstract (in PostScript or PDF) to the CGAL Editorial Board by filling out the form on http://www.cgal.org/UserWorkshop/submission.html. The work need not be original for this workshop. The board will select presentations so as to achieve a balanced programme of general interest to other users and developers. Important Dates --------------- February 15, 2002: Abstract submission deadline March 1, 2002: Notification of acceptance or rejection June 4, 2002: Workshop Registration and Accommodation ------------------------------ You can register for the workshop when you register for SoCG'02. There is no separate registration system. Should you wish to participate only in the workshop, please check the appropriate box on the symposium registration form (available approximately Feb. 15). There will be a separate and modest registration fee for the workshop. The payment of this fee will be done on-site. Only cash in Euro will be accepted (a bank on campus will be available just in front of the conference room). You can use the SoCG'02 accommodation booking system (http://www-ma2.upc.es/~geomc/events/socg2002/socg2002.html), if you wish, even if you intent to attend only the workshop. About CGAL ---------- CGAL, the Computational Geometry Algorithm Library, is a highly modular C++ library of data structures and algorithms that has been developed via a collaborative project involving several research institutes in Europe and Israel. The mission of the project is to make the most important solutions and methods developed in computational geometry available to users in industry and academia. For more information about the project and the library, please have a look at the CGAL web site (http://www.cgal.org). ********************************************************** * * 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 moehring at math.TU-Berlin.DE Fri Nov 23 17:27:21 2001 From: moehring at math.TU-Berlin.DE (Rolf Moehring) Date: Mon Jan 9 13:41:03 2006 Subject: ESA 2002 Message-ID: <3BFE78EA.8910FC8D@math.tu-berlin.de> PRELIMINARY CALL FOR PAPERS ESA 2002 10th Annual European Symposium on Algorithms University of Rome "La Sapienza", 17-21 September, 2002. SCOPE The Symposium covers research in efficient algorithms and data structures in computer science, discrete applied mathematics, operations research and mathematical programming. The symposium has two tracks, which deal respectively with: o the design and mathematical analysis of algorithms (the "Design and Analysis" track); o real-world applications, engineering and experimental analysis of algorithms (the "Engineering and Applications" track). ESA 2002 is sponsored by EATCS (the European Association for Theoretical Computer Science) and jointly organized with WABI 2002, APPROX 2002 and ARACNE 2002 in the context of ALGO 2002. TOPICS Papers presenting original research in all areas of algorithmic research are sought, including but not limited to: Computational Biology; Computational Finance; Computational Geometry; Databases and Information Retrieval; External-Memory Algorithms; Graph and Network Algorithms; Graph Drawing; Machine Learning; Network Design; On-line Algorithms; Parallel and Distributed Computing; Pattern Matching and Data Compression; Quantum Computing; Randomized Algorithms and Symbolic Computation. The algorithms may be sequential, distributed or parallel. Submissions are especially encouraged in the areas of mathematical programming and operations research, including: Approximation Algorithms, Branch-and-Cut Algorithms, Combinatorial Optimization, Integer Programming, Network Optimization, Polyhedral Combinatorics and Semidefinite Programming. SUBMISSIONS Authors are invited to submit an extended abstract or full paper of at most 12 pages. The paper should contain a succinct statement of the issues and of their motivation, a summary of the main results, and a brief explanation of their significance, accessible to non-specialist readers. Proofs omitted due to space constraints must be put into an appendix to be read by the program committee members at their discretion. Electronic submission is highly recommended. Detailed information will be available on the ESA 2002 web site. In case of problems with access to internet, it is possible to submit six copies of the paper to the appropriate program committee chair to arrive by 5PM local time: ESA 2002 (Design and Analysis Track) Rolf Moehring Sekr. MA 6-1, Institut fuer Mathematik Fakultaet II: Mathematik und Naturwissenschaften Technische Universitaet Berlin Strasse des 17. Juni 136 D-10623 Berlin, Germany ESA 2002 (Engineering and Applications Track) Rajeev Raman Department of Maths and Computer Science University of Leicester University Road Leicester LE1 7RH, UK Simultaneous submission to other conferences with published proceedings, or to both tracks of ESA 2002, is not permitted. A paper submitted to one track of ESA 2002 may be switched to the other track if, in the opinion of the PC chairs, the paper is better suited to the other track. ESA 2002 offers the "EATCS award for the best student paper at ESA 2002". Please indicate "student paper" on the front page of the submission, if all authors are students. IMPORTANT DATES Submission deadline April 15, 2002 Notification to authors May 31, 2002 Final versions due June 26, 2002 Symposium September 17-21, 2002 PROCEEDINGS Accepted papers will be published in the Springer series Lecture Notes in Computer Science. Previous proceedings of ESA, 1999 in in Prague, 2000 in Saarbruecken and 2001 in Aarhus, appeared as LNCS 1643, 1879 and 2161. Previous proceedings of the precursor to the Engineering and Applications track, the Workshop on Algorithm Engineering, held in 1999 in London, 2000 in Saarbruecken and 2001 in Aarhus, appeared as LNCS 1668, 1982 and 2141. Accepted contributed papers will receive an allotment of 12 pages in the proceedings. It is expected that all accepted papers will be presented at the symposium by one of the authors. PROGRAM COMMITTEES Design and Analysis Track Susanne Albers (Freiburg, Germany) Stephen Alstrup (Copenhagen, Denmark) Janos Csirik (Szeged, Hungary) Thomas Erlebach (Zurich, Switserland) Sandor Fekete (Braunschweig, Germany) Lisa Fleischer (Pittsburgh, USA) Kazuo Iwama (Kyoto, Japan) Alberto Marchetti-Spaccamela (Rome, Italy) Rolf Moehring (Berlin, Germany, chair) Gunter Rote (Berlin, Germany) Andreas Schulz (Cambridge, USA) Jiri Sgall (Prague, Czech republic) Christos Zaroliagis (Patras, Greece) Uri Zwick (Tel Aviv, Israel) Engineering and Applications Track Karen Aardal (Utrecht, Netherlands) Camil Demetrescu (Rome, Italy) Olivier Devillers (Sophia Antipolis, France) Thomas Liebling (Lausanne, Switzerland) Michael Mitzenmacher (Cambridge, USA) David Mount (College Park, USA) Matthias Mueller-Hannemann (Bonn, Germany) S. Muthukrishnan (Florham Park, USA) Petra Mutzel (Vienna, Austria) Rajeev Raman (Leicester, UK, chair) Peter Sanders (Saarbruecken, Germany) ORGANIZING COMMITTEE (partial list) Giorgio Ausiello (Rome, Italy) Daniele Frigioni (L'Aquila, Italy) Stefano Leonardi (Rome, Italy) Alberto Marchetti-Spaccamela (Rome, Italy) ------------- 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 zach at cs.uni-bonn.de Thu Nov 22 12:27:13 2001 From: zach at cs.uni-bonn.de (Gabriel Zachmann) Date: Mon Jan 9 13:41:03 2006 Subject: closed form solution? Message-ID: <20011122122713.A1893@cs.uni-bonn.de> Dear all, does anybody know a closed form solution for the following equation? floor( a * 2^i/U ) = floor( b * 2^i/U ) where U = 2^d a,b in [0,U-1] I am looking for a closed form solution which would return the largest i solving the above equation. I know of 2 ways which both use some kind of lookup table of hash table, but I would prefer the closed form. (Remark: you probably have already seen that i is a common ancestor of a and b in a binary tree.) Thanks a lot in advance for any thoughts, hints, and pointers. Gabriel Zachmann. -- /---------------------------------------------------------------------\ | Wovon man nicht sprechen kann, | | darueber muss man schweigen. (Ludwig Wittgenstein) | | | | zach@cs.uni-bonn.de __@/' Gabriel.Zachmann@gmx.net | | web.informatik.uni-bonn.de/~zach __@/' www.gabrielzachmann.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 edemaine at mit.edu Sat Nov 24 18:33:03 2001 From: edemaine at mit.edu (Erik Demaine) Date: Mon Jan 9 13:41:03 2006 Subject: dynamic data structures? In-Reply-To: <004e01c16d64$2cf20420$0c6406d5@biggis> Message-ID: On Thu, 15 Nov 2001, Biggi wrote: > I am looking for all kinds of hierarchical dynamic data structures > (and even not-so-hierarchical). > By "dynamic" I mean a scenario where *all* objects (points, lines, etc.) > move from frame to frame, but they move only by a small amount. > Right now I don't have a particular problem/application in mind, > so I am interested in all kinds of datastructures/algorithms that > work efficient in such a "dynamic" setting. > I would be happy if you could suggest any "must's", or give me > pointers or names. What you describe is closely related to if not the same as what are called *kinetic data structures*. You might try a websearch with that phrase to find some relevant papers. In particular there has been interesting work on collision detection by kinetic data structures in the past few years. Erik -- Erik Demaine | edemaine@mit.edu | http://db.uwaterloo.ca/~eddemain/ ------------- 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 george at cs.ucy.ac.cy Thu Nov 22 15:51:52 2001 From: george at cs.ucy.ac.cy (George Angelos Papadopoulos) Date: Mon Jan 9 13:41:03 2006 Subject: *** CS Dept., Univ. of Cyprus: Academic Vacancies *** Message-ID: DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF CYPRUS VISITING PROFESSORSHIPS The Department of Computer Science at the University of Cyprus has a number of vacancies for visiting professors at the ranks of Assistant, Associate, and Full Professor. ALL fields of study will be considered, but preference will be given to applicants associated with one or more of the following ones: * Computer Architecture * Parallel and Distributed Processing * Programming Languages * Multimedia Information Systems * Data Communication Networks * Artificial Intelligence * Software Engineering * Database Systems A new M.Sc. course on "Advanced Information Technologies" is now offered by the Department and the successful applicants will therefore have the opportunity to teach at both the undergraduate and graduate levels. A visiting appointment is usually for one semester (Spring semester: Jan-June; Winter semester: Sept-Dec), but it can be renewed for up to four semesters. Applicants should hold a Ph.D. in a relevant subject, have post Ph.D. experience, and BE FLUENT IN GREEK (both these requirements are mandatory). The annual salaries for these positions (including the 13th salary) are: Professor (Scale A15-A16) CYP 27,875 - 36,235 Associate Professor (Scale A14-A15) CYP 24,587 - 33,518 Assistant Professor (Scale A13-A14) CYP 22,938 - 30,940 Lecturer (Scale A12-A13) CYP 17,706 - 28,372 (At present CYP 1 = 1.1 sterling and CYP 1 = 1.6 U.S. dollars). Presently, the Department is seeking applications for the winter and spring semesters of the academic year 2002-2003. The processing of applications will start on the 15th March 2002 and will continue until all the available positions have been filled. Anyone wishing to apply should send a full CV to the following address: The Chairperson Department of Computer Science University of Cyprus 75 Kallipoleos Street P.O. Box 20537, CY-1678 Nicosia, CYPRUS For more details and other information, interested individuals may contact the Chairperson of the Department of Computer Science: Associate Professor Antonis Kakas Tel: +357-2-892230/1, Fax: +357-2-339062, E-mail: antonis@ucy.ac.cy ------------- 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 edemaine at mit.edu Mon Nov 26 20:49:18 2001 From: edemaine at mit.edu (Erik Demaine) Date: Mon Jan 9 13:41:03 2006 Subject: closed form solution? In-Reply-To: <20011122122713.A1893@cs.uni-bonn.de> Message-ID: Dear Gabriel, As I understand it, you're asking for the number of most significant bits that match between a and b. To do this in constant time, lookup tables of size O(U^epsilon) for any epsilon > 0 (e.g., O(sqrt U)) are the best I know how to do. If you'll settle for a lg lg U solution, you could binary search on i. It's also conceivable that you could do it in time proportional to the number of 1 bits that match between a and b, which would be fast if you expect to have more 0's than 1's. Hope this helps, Erik -- Erik Demaine | edemaine@mit.edu | http://db.uwaterloo.ca/~eddemain/ On Thu, 22 Nov 2001, Gabriel Zachmann wrote: > Dear all, > > does anybody know a closed form solution for the following equation? > > floor( a * 2^i/U ) = floor( b * 2^i/U ) > > where > > U = 2^d > a,b in [0,U-1] > > I am looking for a closed form solution which would return the largest i > solving the above equation. > I know of 2 ways which both use some kind of lookup table of hash table, > but I would prefer the closed form. > > (Remark: you probably have already seen that i is a common ancestor > of a and b in a binary tree.) > > Thanks a lot in advance for any thoughts, hints, and pointers. > Gabriel Zachmann. ------------- 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 mbalint at email.ro Thu Nov 29 16:57:49 2001 From: mbalint at email.ro (Balint MIKLOS) Date: Mon Jan 9 13:41:03 2006 Subject: Delaunay and Voronoi in 3D Message-ID: <200111291457.fATEvnq24640@zerg.codec.ro> I would like to implement in Java an algorith to generate the Delaunay triangulation and the Voronoi cells for a set of points in 3D. I have read about an incremental agorithm, with the incircle test (for 2D), and the creation of the supertriangle at initialization. I suppose this algortihm can be adopted for 3D, with insphere test, and so on. I have read as well about data structures used, wich can be quadtree for 2D, and octree, N-tree for 3D, but I don't know what these are exactly, and how are they used. All I know is that, these trees make a distribution of the space. Please help me, with a detaicled algorithm description, and how the data structures should be used. Since this computational geometry domain seems very interesting to me, I would like to ask, where I can start to study it. I have read Fukuda's FAQ about polyhedron and polytope structures and understood things, but if you could give me a detailed, and more explained book, or paper, it would be great. I'm student at Technical Univerisity in Cluj-Napoca (2nd year), and couldn't find anything in our library. I couldn't get help from any professor at our university. Thank you in advance for your help! Balint Miklos ______________________________________________________________________ Do you want a free e-mail for life ? Get it at http://www.email.ro/ ------------- 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 tamaldey at cis.ohio-state.edu Thu Nov 29 15:53:02 2001 From: tamaldey at cis.ohio-state.edu (tamal dey) Date: Mon Jan 9 13:41:03 2006 Subject: Post doctoral position in Geometric Modeling Message-ID: <200111292053.PAA08538@cis.ohio-state.edu> We have an NSF funded post-doctoral position open in the area of Sample Based Geometric modeling in the computer science department of The Ohio State University. The position can start anytime from now. Interested persons for the position can contact Tamal K Dey (tamaldey@cis.ohio-state.edu) with their curriculum vitae. Required: Phd in computer science or geometric modeling related fields. Duration: One year and may be extended for another six months. Starting date: Anytime between now and February, 2002. For ongoing research in sample based geometric modeling at the Ohio State University, please visit http://www.cis.ohio-state.edu/~tamaldey/geohome.html ---Tamal K. Dey Dept. of CIS Ohio State University 2015 Neil Av. Columbus, OH 43210 ------------- 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 brd at snow.cs.dartmouth.edu Fri Nov 30 01:54:37 2001 From: brd at snow.cs.dartmouth.edu (Bruce Randall Donald) Date: Mon Jan 9 13:41:03 2006 Subject: Postdocs in Computational Biology Message-ID: <200111300154.BAA31830@snow.cs.dartmouth.edu> Dartmouth College Department of Computer Science (12/1/01) Postdoctoral Research Associates in Computer Science: We have received two new NSF grants for research in Computational Biology and Chemistry. We are looking for persons with a doctorate in computer science to conduct focused research in computational biology, specifically, on computational structural biology and computer-aided drug design. Applications should be sent to Professor Bruce R. Donald. For application instructions, more on this position, our research, job placement for Donald Lab alumni, and life at Dartmouth, please see: http://www.cs.dartmouth.edu/~brd/Jobs/ Some of the most challenging and influential opportunities for Physical Geometric Algorithms (PGA) arise in developing and applying information technology to understand the molecular machinery of the cell. Our recent work (and work by others) shows that many PGA techniques may be fruitfully applied to the challenges of computational molecular biology. PGA research may lead to computer systems and algorithms that are useful in structural molecular biology, proteomics, and rational drug design. Concomitantly, a wealth of interesting computational problems arise in proposed methods for discovering new pharmaceuticals. Among these problems are: identifying the low-energy conformations of molecules, interpreting protein NMR (nuclear magnetic resonance) and X-ray data, inferring constraints on the shape of active drug molecules based on measurements of activity of related drug molecules, and docking candidate drug molecules to known protein targets. In the post-genomic era, key problems in molecular biology center on the determination and exploitation of three-dimensional protein structure and function. For example, modern drug design techniques use protein structure to understand how a drug can bind to an enzyme and inhibit its function. Structural proteomics will require high-throughput experimental techniques, coupled with sophisticated computer algorithms for data analysis and experiment planning. Our lab is working in several areas, including: (1) data-directed computational protocols for high-throughput protein structure determination with nuclear magnetic resonance spectroscopy, and (2) experiment planning and data interpretation algorithms in structural mass spectrometry for protein complex binding-mode identification, and (3) reprogramming enzyme specificity, towards combinatorial biosynthesis for small-molecule diversity. In each area, computational techniques are central, and the applications present intriguing problems to computer scientists who design algorithms and implement systems. Conversely, the algorithms and computational tools we develop will be useful to the structural biology community, for studies of protein-ligand binding and protein redesign. For example, we will develop new techniques for computer-assisted drug design, including algorithms for docking flexible ligands to flexible active sites. Our web page and papers (see URL above) overview these projects, and survey some of the algorithmic and computational challenges. You will be working with a team of computer scientists, structural biologists, protein chemists, biochemists, and biologists to advance the state of the art in computational techniques for structural biology and structure-based drug design. While the work has a strong theoretical component, it will also require programming and system building, experimental (computational) work, and the ability and desire to work closely with biologists and chemists. A background in geometric algorithms, rational drug design, molecular modeling, docking, structural biology, robotics, or protein folding is a definite plus. Bruce Randall Donald Professor of Computer Science Adjunct Professor of Chemistry 6211 Sudikoff Laboratory, Rm. 113 Department of Computer Science Dartmouth Hanover, NH 03755-3510 WWW: http://www.cs.dartmouth.edu/~brd/Bio/ ------------- 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 bradb at shore.net Thu Nov 29 18:07:48 2001 From: bradb at shore.net (Brad Barber) Date: Mon Jan 9 13:41:03 2006 Subject: Delaunay and Voronoi in 3D In-Reply-To: <200111291457.fATEvnq24640@zerg.codec.ro> Message-ID: <4.3.2.7.2.20011129175943.00c9a770@127.0.0.1> At 09:57 AM 11/29/01, Balint MIKLOS wrote: >I would like to implement in Java an algorith to generate the Delaunay >triangulation and the Voronoi cells for a set of points in 3D. I have read >about an incremental agorithm, with the incircle test (for 2D), and the >creation of the supertriangle at initialization. I suppose this algortihm can >be adopted for 3D, with insphere test, and so on. Yes, that is correct. > I have read as well about >data structures used, wich can be quadtree for 2D, and octree, N-tree for 3D, >but I don't know what these are exactly, and how are they used. All I know is >that, these trees make a distribution of the space. > >Please help me, with a detaicled algorithm description, and how the data >structures should be used. A good, detailed introduction is Joseph O'Rourke's Computational Geometry in C. Cambridge University Press. >Since this computational geometry domain seems very >interesting to me, I would like to ask, where I can start to study it. I have >read Fukuda's FAQ about polyhedron and polytope structures and understood >things, but if you could give me a detailed, and more explained book, or >paper, >it would be great. There are several code samples on the web for Voronoi diagrams. You may find the Qhull 1.0 source useful (www.geom.umn.edu/locate/qhull). I hope your project goes well. --Brad >I'm student at Technical Univerisity in Cluj-Napoca (2nd year), and couldn't >find anything in our library. I couldn't get help from any professor at our >university. > >Thank you in advance for your help! >Balint Miklos > > >______________________________________________________________________ >Do you want a free e-mail for life ? Get it at http://www.email.ro/ > > >------------- >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. ------------- 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 mbalint at email.ro Fri Nov 30 18:45:54 2001 From: mbalint at email.ro (Balint MIKLOS) Date: Mon Jan 9 13:41:03 2006 Subject: Thanks! Message-ID: <200111301645.fAUGjsA15857@zerg.codec.ro> Thank you for all your answers, I'll try to get the books you recommended. I forgot to write you that I live in Romania, and it's quite hard to get those books, so if yo could tell me URLs it would be perfect. Anyway thank you for your help! Balint Miklos ______________________________________________________________________ Do you want a free e-mail for life ? Get it at http://www.email.ro/ ------------- 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 edemaine at mit.edu Fri Nov 30 21:22:52 2001 From: edemaine at mit.edu (Erik Demaine) Date: Mon Jan 9 13:41:03 2006 Subject: delaunay triangulation from arbitrary ones In-Reply-To: <200110181133.f9IBX6u16254@mailgate5.cinetic.de> Message-ID: On Thu, 18 Oct 2001, Biggi Zachmann wrote: > In 2D, one can always transfrom > an abritrary triangulation of a points set > into the Delaunay triangulation. > > Is that also true in 3D (with arbitrary tetrahedralizations)? This is a 10-year-old open problem. See Problem 28 on http://www.cs.smith.edu/~orourke/TOPP/ Erik -- Erik Demaine | edemaine@mit.edu | http://db.uwaterloo.ca/~eddemain/ ------------- 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.