From skala at kiv.zcu.cz Sun Sep 5 12:27:30 1999 From: skala at kiv.zcu.cz (Vaclav Skala) Date: Mon Jan 9 13:40:55 2006 Subject: WSCG'2000 Call for papers - Int.Conf on Graphics, Visulization & Ineractive Digital Media, close Prague, Czech Republic Message-ID: <006101bef7b4$8141ce20$362be493@uk426pc04-kiv.fav.zcu.cz> WSCG'2000 ========================= Sorry for duplicates --------------------- Call for Papers & Participation Deadline for papers: October 13, 1999 Conference dates: February 7. - 11., 2000 Information: http://wscg.zcu.cz -------------------------------------------------------- W S C G ' 2000 The 8-th International Conference in Central Europe on Computer Graphics, Visualization and Digital Interactive Media 2000 in cooperation with EUROGRAPHICS, IFIP working group 5.10 Computer Graphics International - CGI on Computer Graphics and Virtual Worlds will be held in February 7 - 11, 2000 in Plzen close to PRAGUE, the capital of the Czech Republic ----------------------------------------------------------------------- >> If you are willing to help us as a REVIEWER, please, << >> fill in the form at the http://wscg.zcu.cz/reviewer.htm << ----------------------------------------------------------------------- Conference Chairs ================= Nadia Magnenat Thalmann, MIRALab-CUI, Univ. of Geneva, Switzerland Vaclav Skala, Univ. of West Bohemia, Czech Republic Keynote speakers ================ (preliminary) Carl Machover, Machover Associates Corp., USA Ben Delaney, CyberEdge Information Services, USA Philip J.Willis, Univ.of Bath, UK Andrej Iones, Univ.of St.Peterburg, Russia Sponsors and supporting organizations ===================================== (Preliminary) Compaq Computers, Hewlett Packard, IBM, Silicon Graphics, Intergraph, Bentley Systems, Microsoft, Autodesk, CyberEdge Information Services (USA) Topics included --------------- Fundamental algorithms, rendering and visualization, virtual reality, animation and multimedia, medical imaging, geometric modelling and fractals, graphical interaction, object-oriented graphics, WWW technologies, standards, computer vision, parallel and distributed graphics, computational geometry, computer aided geometric design, CAD/CAM, DTP and GIS systems, educational aspects of related fields, usage of graphics within mathematical software (Maple, Mathematica, MathCAD etc.) in education. >>> Papers on all aspects of computer graphics are encouraged <<< The program includes international books exhibition and video show, too. --------------------------------------------- W S C G '2000 International Exhibition ------------------------------------ Information for exhibitors: Please contact the organiser as soon as possible -------------------------- for detailed information and conditions. The WSCG Exhibition will be held in parallel. Top leading European and Czech companies active in computer graphics, visualization and computer vision, CAD/CAM and GIS systems, virtual reality, multimedia systems and others will be presenting their latest products. Special programme will be available, too. ----------------- Accepted papers will be published in the Conference proceedings with ISBN. They are reviewed by INSPEC, Cambridge Scientific Abstracts, InfoStore, IEE, ISI, AIMS, INIST and others for citations index and other purposes. The best papers will be considered for possible publication in the Journal of Visualisation and Computer Animation, Computers&Graphics, The Visual Computer, Machine Graphics & Vision and others journals. Organizer and Conference secretariat ------------------------------------ Prof.Ing.Vaclav Skala, CSc. c/o Computer Science Dept., Univ.of West Bohemia Univerzitni 8, Box 314, 306 14 Plzen, Czech Republic e-mail: skala@kiv.zcu.cz Subject: INFO WSCG tel.:+420-19-7491-188 fax:+420-19-7822-578, 799 include your e-mail!!! The latest information is available at: http://wscg.zcu.cz select WSCG'2000 Information on all WSCG conferences: http://wscg.zcu.cz In case of any problems use: http://147.228.63.9 or send a mail to maxvs@bath.ac.uk ~~~~~~~~~~~~~~~~~~~~~ Prof.Ing.Vaclav Skala, CSc. University of West Bohemia Univerzitni 8, Box 314 306 14 Plzen Czech Republic http://herakles.zcu.cz/~skala Tel./record: +420-19-78 22 188 direct Secretariat: tel: +420-19-78 22 212, fax +420-19-78 22 213 ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From stschirr at mpi-sb.mpg.de Mon Sep 6 16:41:25 1999 From: stschirr at mpi-sb.mpg.de (Stefan Schirra) Date: Mon Jan 9 13:40:55 2006 Subject: CGAL open user discussion list Message-ID: <199909061341.PAA21803@mpii01807.ag1.mpi-sb.mpg.de> Dear Geometer CGAL now also provides a discussion forum for users to communicate with other CGAL users and CGAL developers. To subscribe, please send a mail to lyris@postino.mpi-sb.mpg.de with content 'subscribe cgal-discuss-l' or subscribe on http://postino.mpi-sb.mpg.de/cgi-bin/lyris.pl?enter=cgal-discuss-l &text_mode=0 Best regards Stefan Schirra ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From eppstein at ics.uci.edu Mon Sep 6 14:48:05 1999 From: eppstein at ics.uci.edu (David Eppstein) Date: Mon Jan 9 13:40:55 2006 Subject: report on computational topology available Message-ID: <14292.10373.467627.562711@euclid.ics.uci.edu> The report from the ACM Worksh. on Computational Topology, held last June in Miami Beach in conjunction with SoCG, is now available in the ACM Computing Research Repository, at http://xxx.lanl.gov/abs/cs.CG/9909001 It provides an overview of current problems in areas related to topological computation, shape representation and reconstruction, meshing, etc, and outlines some goals and recommendations for the area. Incidentally, those of you on this mailing list who don't get the announcements of papers in the CoRR should probably subscribe -- see http://xxx.lanl.gov/list/cs.CG/recent for a list of recently uploaded geometry papers and http://xxx.lanl.gov/help/subscribe for instructions on how to add yourself to the mailing list. -- David Eppstein UC Irvine Dept. of Information & Computer Science eppstein@ics.uci.edu http://www.ics.uci.edu/~eppstein/ ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From michiel at isgnw.CS.Uni-Magdeburg.De Thu Sep 9 12:19:10 1999 From: michiel at isgnw.CS.Uni-Magdeburg.De (Michiel Smid) Date: Mon Jan 9 13:40:55 2006 Subject: PhD position in Magdeburg Message-ID: <199909090919.LAA20082@latrappe.cs.uni-magdeburg.de> PhD POSITION in the Department of Computer Science, University of Magdeburg We seek a PhD student for the research project Quantification of fractures using techniques from Computational Geometry, which is funded by the German Science Foundation (DFG). This is a joint project with the Department of Material Sciences in Magdeburg. The goal of the project is to design, analyze, implement and test algorithms to support the quantification of fractures in materials, starting from three-dimensional images obtained using a confocal lasermicroscope. There will be a close collaboration with faculty and PhD students in the Department of Material Sciences. Qualifications: Candidates should have a master degree in computer science or mathematics, and have a thorough background in algorithms, data structures, discrete mathematics, and possibly some experience in software development. The position is available for a period of two years, with a possible extension of one more year. For further information, contact Michiel Smid Department of Computer Science University of Magdeburg Universit"atsplatz 2 D-39106 Magdeburg Germany Phone: +49 (0)391 67 18557 Fax: +49 (0)391 67 11164 E-mail: michiel@isg.cs.uni-magdeburg.de WWW: http://isgwww.cs.uni-magdeburg.de/~michiel/index.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://uiuc.edu/~sariel/CG/compgeom/threads.html. From dchen at cse.nd.edu Thu Sep 9 16:56:18 1999 From: dchen at cse.nd.edu (danny chen) Date: Mon Jan 9 13:40:55 2006 Subject: Chair position opening Message-ID: <199909092056.PAA29694@euclid.cse.nd.edu> UNIVERSITY OF NOTRE DAME Chair of Computer Science & Engineering The University of Notre Dame invites applications and nominations for the position of Department Chair and Schubmehl/Prein Chair of Computer Science & Engineering in the College of Engineering, effective August 22, 2000. The CSE Department provides a center of scholarship in the areas of information and computing technologies. We see a continuing need for education and discovery in these fields to meet the demands of an expanding world population in areas such as medicine, food production, shelter, transportation, communication and commerce. The University of Notre Dame undergraduate program consistently ranks in the top 20 among national universities. The CSE Department, established in 1990, conducts undergraduate degree programs in Computer Engineering and in Computer Science, and a graduate program leading to the M.S. and Ph.D. degrees. A full- time faculty of 14, with scheduled growth to 18, develops curricula and directs research for multi-disciplinary collaborative programs in information technology, with particular focus on parallel distributed systems for high-performance computing, and the interactions among hardware, software, algorithms and VLSI technology. Strong research programs achieve national recognition for technical contributions and growth. The chair has a unique opportunity with support from a new Dean of Engineering to substantially advance the role of computing and information technologies within the University. Candidates must be eligible for appointment as a tenured full professor, and have appreciation, breadth and involvement in the range of disciplines embodying departmental growth. The chair must share the Department's vision for academic excellence and foster productive academic relationships with other departments, especially in the College of Engineering. The chair must have a personal research program with demonstrated experience in establishing standards for graduate scholarship and forming active relationships with industry, government agencies, and other universities. For further information, visit our web site at http://www.cse.nd.edu/ Applicants should send a complete resume with names of five references to: Prof. Eugene W. Henry CSE Chair Search Committee 384 Fitzpatrick Hall University of Notre Dame Notre Dame, IN 46556 Phone: 219-631-6408, FAX: 219-631-9260 E-mail: ewh@cse.nd.edu The University of Notre Dame is an equal opportunity, affirmative action employer. ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From scheng at cs.ust.hk Fri Sep 10 16:38:31 1999 From: scheng at cs.ust.hk (DR. CHENG SIU WING) Date: Mon Jan 9 13:40:55 2006 Subject: position Message-ID: <199909100738.PAA16120@cssu100.cs.ust.hk> The Department of Computer Science in the Hong Kong University of Science and Technology will have a number of faculty positions open at all levels for the 2000/2001 academic year. Current faculty members come from major universities and research institutions around the world. There are roughly 590 undergraduate and 150 postgraduate students enrolled in our programs. The medium of instructions is English. More information about the Department can be found in our WWW page. (http://www.cs.ust.hk). The Department is looking for faculty with research interests in all areas. In particular, there will be a permanent position available in theoretical computer science; applicants for all levels are encouraged to apply At the same time, we also welcome applications for visiting positions by senior theoretical computer scientists. These visiting positions can run from five months through two years. The theory group currently comprises five members whose research focus on computational geometry, combinatorics, analysis of algorithms, data structures, and formal languages. More information about the theory group can be found in the URL http://www.cs.ust.hk/tcsc. Ample research funding is available through government agencies and industry sponsored research institutes at the University. Applicants should have a Ph.D. degree and demonstrated potential in teaching and research. Senior applicants must have excellent teaching and research records. Salary and benefits are very competitive. Generous fringe benefits including medical and dental benefits, annual leave, and children's education allowance are provided. Housing benefits will also be provided where applicable. Initial appointments will normally be on a three-year contract which is renewable subject to mutual agreement. Applications, together with a curriculum vitae and the names of at least three referees, should be sent to our head: Professor Roland T. Chin, Head Department of Computer Science The Hong Kong University of Science & Technology Clear Water Bay, Kowloon HONG KONG Fax No.: (852)2358-2679 E-mail: Roland_Chin@cs.ust.hk Internet: http://www.cs.ust.hk Postscript format is preferred for applications sent through E-mail. Applications will be evaluated immediately on receipt. Priority will be given to applications received by January 31, 2000. ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From subodh at blaze.cs.jhu.edu Wed Sep 15 11:15:03 1999 From: subodh at blaze.cs.jhu.edu (Subodh Kumar) Date: Mon Jan 9 13:40:55 2006 Subject: CGC Workshop on Computational Geometry, 2nd call In-Reply-To: from "subodh" at Sep 2, 99 01:46:54 pm Message-ID: <199909151415.KAA17305@condor.cs.jhu.edu> In response to several requests for extension, the deadline for submission to the workshop is hereby extended to 5pm on Friday, Sep 17. - Subodh ######################################################################## Computer Sc., JHU, Baltimore MD 21218 Tel: (410)516-0060, Fax: 6134 http://www.cs.jhu.edu/~subodh > > Call for Papers > 4th CGC Workshop on > Computational Geometry > > Johns Hopkins University, Baltimore, MD, October 15-16, 1999 > > > > We are pleased to announce the fourth annual fall Workshop on > Computational Geometry, sponsored by the Center for Geometric > Computing, continuing a tradition established by the Mathematical > Sciences Institute at SUNY-Stony Brook. The Center for Geometric > Computing is a collaborative center of Brown, Duke, and Johns Hopkins > Universities, and is funded by the U.S. Army Research Office. > > > Scope and Format > > The aim of this workshop is to bring together researchers from > academia, industry, and the Army to stimulate collaboration on > problems of common interest arising in geometric computations. Topics > to be covered include, but are not limited to: > > Algorithmic methods in geometry > I/O-scalable geometric algorithms > Animation of geometric algorithms > Computer graphics > Solid modeling > Geographic information systems > Computational metrology > Graph drawing > Experimental studies > Geometric data structures > Implementation issues > Robustness > Computer vision > Robotics > Computer-aided design > Mesh generation > > Following the tradition of the previous MSI and CGC Workshops on > Computational Geometry, the format of the workshop will be informal, > extending over 2 days, with several breaks scheduled for discussions. > > Registration will be on-site, and will include the abstract booklet, > coffee breaks, lunches, and a reception. There will be a registration > fee of $75. > > > Invited speakers > > To be Announced > > > Submissions > > Authors are invited to submit abstracts for talks to be given at the > workshop. Please send an abstract (up to 2 pages) and a draft of a > paper (if you have one). E-mail submissions are encouraged; send to > cgc@cs.jhu.edu. Ideally, the abstract should be a PDF, PostScript, > or LaTeX, file, for ease in assembling the abstract booklet. Abstracts > can also be sent by regular mail to: > > Subodh Kumar > Department of Computer Science > Johns Hopkins University > 224 NEB, 3400 N. Charles St. > Baltimore, MD 21218 > > > Submissions should arrive by September 10, 1999. Authors will be > notified of acceptance by September 20, 1999. > > A booklet of abstracts will be distributed at the workshop and made > available electronically on the Web. There will be no formal > proceedings for this workshop, but selected papers will be invited to > a special issue of the journal "Computational Geometry: Theory and > Applications". > > Program Committee > > Pankaj K. Agarwal (Duke University), Lars Arge (Duke University), Michael > T. Goodrich (Johns Hopkins University), S. Rao Kosaraju (Johns Hopkins > University), Subodh Kumar (Johns Hopkins University), Joseph S. B. Mitchell > (State University of New York at Stony > Brook), Franco P. Preparata (Brown University), Roberto Tamassia (Brown > University), Jeffrey S. Vitter (Duke University). > > Note: > > For more information about the workshop, send mail to > cgc@cs.jhu.edu . Further information will be posted to our web site: > http://www.cs.jhu.edu/labs/cgc/cgc99 > as soon as it is available. > > Important Dates > > Deadline for submission Sep 10 --> EXTENDED TO SEP 17. > Notification of acceptance Sep 20 > Conference Oct 15-16 > ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From pankaj at cs.duke.edu Mon Sep 13 19:12:24 1999 From: pankaj at cs.duke.edu (Pankaj Kumar Agarwal) Date: Mon Jan 9 13:40:55 2006 Subject: SCG'00: Call for Papers Message-ID: <199909132212.SAA11142@polya.cs.duke.edu> CALL FOR PAPERS Sixteenth Annual Symposium on COMPUTATIONAL GEOMETRY June 12-14, 2000 Hong Kong University of Science and Technology http://www.cs.ust.hk/tcsc/scg00.html Sponsored by ACM SIGACT and SIGGRAPH The Sixteenth Annual Symposium on Computational Geometry, featuring an applied track, a theoretical track, and a video review, will be held at Hong Kong University of Science and Technology, Hong Kong. We invite high-quality submissions in the following areas: * geometric algorithms or combinatorial geometry, for the theoretical track, or * implementation issues or applications of computational geometry, for the applied track. The proceedings, with the papers of both tracks, will be distributed at the symposium and will subsequently be available for purchase from ACM. A selection of papers will be invited to special issues of journals. During the conference, sessions of presentations will alternate between the two tracks, rather than being in parallel. 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, and geographical information systems. See below for additional information on the two tracks. Theoretical Track Submission Electronic submissions are preferred for the theoretical track (see web page above for instructions), but authors may instead mail 8 copies of an extended abstract to arrive by December 6, 1999 to Pankaj K. Agarwal Department of Computer Science LSRC Building, Rm D207 Duke University Durham, NC 27706 Phone: (919) 660-6540 pankaj@cs.duke.edu Applied Track Submission Electronic submissions are preferred for the applied track (see web page above for instructions), but authors may instead mail 11 copies of an extended abstract to arrive by December 6, 1999 to Steven Fortune Room 2c459 Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 Phone: (908) 582-7042 sjf@research.bell-labs.com Important Dates December 6, 1999: Papers due, both tracks February 13, 2000: Video submissions due February 15, 2000: Notification of acceptance or rejection of papers March 1, 2000: Notification of acceptance or rejection of videos March 15, 2000: Camera-ready papers due April 15, 2000: Final versions of videos due June 12-14, 2000: Symposium Papers that primarily address practical issues and implementation experience, even if not tied to a particular application domain, should be submitted to the applied track. Papers that primarily prove theorems should be submitted to the theoretical track. Most experimental work should be submitted to the applied track; an exception would be experiments in support of mathematical investigations. Submissions to one track may be forwarded to the other for consideration, unless the authors have explicitly stated interest in one track only. Papers should be submitted in the form of an extended abstract. Papers should begin 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. For cases in which 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. Abstracts in hard copy must be received by December 6, 1999, or postmarked by November 29 and sent airmail. Abstracts in electronic form are due by December 6, 5:00 PM EST. These are firm deadlines: late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 2000. A full version of each contribution in final form will be due by March 15, 2000 for inclusion in the proceedings. Conference Chairs Siu-Wing Cheng Otfried Cheong scheng@cs.ust.hk otfried@cs.ust.hk Theoretical Track Program Committee Pankaj K. Agarwal, Chair (Duke) Franz Aurenhammer (Graz) Mark de Berg (Utrecht) Herbert Edelsbrunner (Duke) Jeff Erickson (UIUC) Hazel Everett (Montreal) Klara Kedem (Ben Gurion) Applied Track Program Committee Gill Barequet (Technion) Steven Fortune, Chair (Bell Labs) Chris Gold (Laval U.) Ken Goldberg (Berkeley) Scott Mitchell (Sandia Labs) Tom Peters (U. Conn.) Jean Ponce (UIUC) Stefan Schirra (MPI) Subhash Suri (Wash. U.) ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From pankaj at cs.duke.edu Mon Sep 13 19:13:00 1999 From: pankaj at cs.duke.edu (Pankaj Kumar Agarwal) Date: Mon Jan 9 13:40:55 2006 Subject: SCG'00: Call for Videos Message-ID: <199909132213.SAA11152@polya.cs.duke.edu> CALL FOR VIDEOS 9th Annual Video Review of Computational Geometry to be presented at the Sixteenth Annual Symposium on Computational Geometry http://www.cs.ust.hk/tcsc/scg00.html June 12-14, 2000 Hong Kong University of Science and Technology Sponsored by ACM SIGACT and SIGGRAPH Videos are sought for a video review of computational geometry. Background 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 or communications submitted to the technical program committee are encouraged. Submissions Authors should send one preview copy of a videotape to the address below by February 13, 2000. 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 to rudolf@mpi-sb.mpg.de. 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 Rudolf Fleischer Department of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1 Canada Tel: (519) 888-4567 ext 2103 FAX: (519) 885-1208 For customs purposes, it is best to declare a value of $5. If you have questions, please contact the committee chair at rudolf@mpi-sb.mpg.de or (519) 888-4567 ext 2103. Notification Authors will be notified of acceptance or rejection, and given reviewers' comments by March 1, 2000. For each accepted video, the final version of the textual description will be due by March 15, 2000 for inclusion in the proceedings. Final versions of accepted videos will be due April 10, 2000 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 Therese Biedl (U. Waterloo) Timothy Chan (U. Waterloo) Erik Demaine (U. Waterloo) Martin Demaine (U. Waterloo) Rudolf Fleischer, Chair (U. Waterloo) Anna Lubiw (U. Waterloo) Jack Snoeyink (UNC) ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From raamtin at ce.sharif.ac.ir Wed Sep 15 10:22:23 1999 From: raamtin at ce.sharif.ac.ir (Ramtin Khosravi) Date: Mon Jan 9 13:40:55 2006 Subject: Chen and Han's address Message-ID: <009DE2E4.48392B20.41@ce.sharif.ac.ir> Hi everybody, Does anybody know the e-mail address or the URL of the hompage of Jindong Chen or Yijie Han? (The designers of the quadratic algorithm for the shortest path problem on polyhedral surfaces). Please reply to raamtin@ce.sharif.ac.ir. Thanks, --Ramtin Khosravi ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From mohades at cic.aku.ac.ir Mon Sep 27 18:45:28 1999 From: mohades at cic.aku.ac.ir (Ali Mohades) Date: Mon Jan 9 13:40:55 2006 Subject: Help Message-ID: <001a01bf08ea$6aef4b60$5f0da8c0@aku.ac.ir> hi everybody, I would be very thankful to anyone who could provide me with e-mail address or any Webster which can help me to find the papers about a given subject in computational geometry. Best wishes --------------------------- Ali Mohades Amir kabir University of Technology Tehran, Iran mohades@cic.aku.ac.ir Tel: 98-21-640-6322 Fax: 1-603-925-7150 --------------------------- -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/19990927/de973611/attachment.htm From peyer at or.uni-bonn.de Thu Sep 30 19:30:32 1999 From: peyer at or.uni-bonn.de (Sven Peyer) Date: Mon Jan 9 13:40:55 2006 Subject: Delaunay Triangulation / Voronoi Diagram in L1 Message-ID: <37F39028.9BACA747@or.uni-bonn.de> Dear All, I'm interested in Delaunay-Triangulation with respect to L1-norm. The input consists of general, pairwise disjoint objects (e.g. lines, axis parallel boxes, polygons, segments). Shute, Deneen, Thomborson (Algorithmica (1991) 6: 207-221) gave an O(n logn) Plane-Sweep Algorithm for Delaunay Triangulations for L_max-norm for single points. Since there exists an isometric between L1 and L_max (equivalence under 45 rotation), this algorithm solves the problem for single points in L1 as well. This algorithm does not apply for more general objects. Recently, Papadopoulou and Lee gave an algorithm for determing the L_max-Voronoi diagram for arbitrary segments which could be applied to the L1 case. Although their algorithm is very elegant, it has two disadvantages for my purposes, unfortuntely: 1. It calculates the Voronoi diagram instead of Delaunay Triangulation (which could be retrieved afterwards from the Voronoi diagram). So I hope there is a DIRECT way to get a triangulation (e.g. see algorithm by Shute, Deneen, Thomborson for single points). 2. The algorithm is rather difficult and probably too slow in practice. (Practice means here: Input of about 100000 or more objects) So I've implemented a heuristic which discretizes all objects into a set of single points (depending on a given parameter) and applies the algorithm by Shute, Deneen, Thomborson to these points. The better (smaller) the parameter (width) is the better is the result. Nevertheless, it is a heuristic and the triangulation depends largely upon the choosen parameter. If the number of objects is very large and the width is choosen to be very small, memory problems occur because of the large number of discretized points. Therefore, I'm looking for an algorithm which gives an L1-Delaunay Triangulation for general objects. Suggestions and references are very welcome. Thank you in advance. Sven Peyer -------- Sven Peyer Research Institute for Discrete Mathematics University of Bonn Lennestr. 2 53113 Bonn ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From yap at cs.nyu.edu Thu Sep 30 18:14:25 1999 From: yap at cs.nyu.edu (Chee Yap) Date: Mon Jan 9 13:40:55 2006 Subject: Announcement of Core Library, Version 1.2 Message-ID: <199909302114.RAA29975@jinai.cs.nyu.edu> ============== SOFTWARE RELEASE ANNOUNCEMENT =================== The CORE Library, Version 1.2, is now available for free download at http://cs.nyu.edu/exact/core The CORE library is a collection of C/C++ classes for exact computation with constructible real numbers. Some Features: -- ease of use: most existing C/C++ programs can be converted into robust programs with minimal effort -- precision-driven approach to exact computation -- expanded set of sample programs -- library is small (0.75 MB compressed, including documentation) -- tested on Sparc, SGI and Linux platforms. We welcome your comments and input. -- Chee Yap (yap@cs.nyu.edu) Chen Li (chenli@cs.nyu.edu) September 30, 1999 ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From ian at cs.wits.ac.za Mon Sep 27 15:05:28 1999 From: ian at cs.wits.ac.za (Ian Sanders) Date: Mon Jan 9 13:40:55 2006 Subject: vacant posts Message-ID: Posts in the Computer Science Department University of the Witwatersrand, Johannesburg, South Africa Lecturer / Senior Lecturer Senior Tutor Tutor / Junior Lecturer The Computer Science Department at the University of the Witwatersrand is one of Africa's leading computer science departments. We are committed to educating graduates and producing research to meet South Africa's challenging needs in information technology. South Africa is in the process of political change. The government is re-evaluating tertiary education, and initial reports indicate tertiary education is regarded as a high priority. With a changing South Africa the department sees a need to look ahead. We are looking for staff who can help us develop the research aspect of our department. In exchange we offer a vibrant environment and an opportunity to contribute to a country at an important stage of its development. We now have 10 academic staff members, and we wish to appoint up to 3 new staff members, in order to expand our research and teaching roles. We would like new appointees at senior level to add strength of leadership to existing research areas, but applicants from all areas of computer science are welcomed and this could provide an opportunity for a motivated researcher to develop their own research interests. Applicants could be appointed at any one of the levels described below. Which and how many posts are filled will depend on the applicants and the seniority at which they are appointed. Please indicate which position/s you would like to be considered for when applying. We are committed to equal opportunities, and for all posts, we encourage black, women and disabled applicants. Senior Lecturer/Lecturer: ======================== These are tenure-track positions and successful applicants will be expected to teach at undergraduate and postgraduate levels, undertake research and perform departmental administration. Applicants for the senior lectureship should hold a PhD in computer science, have completed some post-doctoral research and have teaching experience. Applicants for the lectureship should hold a PhD in computer science (or be able to provide objective evidence that they will complete their PhD by the time they take up the post). Applicants should also be able to demonstrate ability to teach a range of computer science courses. A lectureship is a suitable entry-level position for a new PhD. Senior Tutor: ============ This is a tenure track position, and a successful applicant will be expected to teach undergraduate courses, and play an important role in academic and curriculum development. The successful applicant should have an honours degree in computer science. A higher degree and/or a teaching qualification and/or experience will be a recommendation. The successful applicant will be encouraged to undertake research in computer science or computer science education. Tutor/Junior Lecturer: ===================== This is an affirmative action/development position, and we will favour applicants from under-represented groups in the field. The successful applicant will have an honours degree in computer science. This person will be expected to participate in the teaching of the department, and an important objective of the post is to give a person with potential the opportunity to pursue a higher degree and gain teaching and research experience. This is a three-year contract post. For senior lecturer or lecturer posts, we would prefer someone who will strengthen one of our current research interests (see below), but the primary criteria will be the quality and potential of the applicant. The tutor/junior lecturer must be prepared to pursue their higher degree in one of the research areas of the department. Please direct any inquiries about any aspects of these posts, or the department, to Conrad Mueller --- conrad@cs.wits.ac.za Further information about the department can be found at http://www.cs.wits.ac.za/ ======================================================================== Context: ------- The University of the Witwatersrand is one of the top universities in South Africa. It prides itself on its standards and is internationally recognized. The University is located in Johannesburg, the biggest city in Southern Africa, and is thus strategically positioned in the industrial heartland of South Africa. This makes it an exciting and stimulating situation in which to work. The Department of Computer Science is in the Mathematical Sciences subject area. We are also presently involved in building an umbrella body with the other IT departments at Wits -- the Department of Electrical Engineering and the Department of Information Systems. The Department has a governing committee consisting of three members of the Department which reports directly to the Dean of the Science Faculty. There are 10 academic posts in the department, with three technical support officers, an administrator and a secretary. The department is well equipped with both PC and Mac labs for undergraduates which are networked to the internet and a UNIX server, and an SGI lab for postgraduate students. We see teaching as an important function of the department and all academic members of staff are expected to be able to teach a range of mainstream computer science topics. The department has a strong undergraduate programme, teaching only courses directed at students majoring in computer science. The undergraduate curriculum is based on the ACM/IEEE guidelines for computer science, and regularly undergoes re-evaluation. Many of our students have gone on to become respected members of the academic and business communities worldwide. The department teaches: a first year course of 200 students, a second year course of 80 students, a third year course of 70 students, an honours course of 15-25 students, and 3 to 5 higher degree students start each year. Undergraduate students register for a Bachelor of Science Degree, which has a flexible course structure. The department has always been very conscious of its role in South African society. A challenge the department is faced with is teaching students with widely differing school qualifications, which includes students from deprived educational backgrounds; empathy for these students is important. We are very proud of our achievements in developing what we believe is an outstanding undergraduate and honours degree course. The emphasis has been on trying to address the racial imbalances resulting from the historical problems in our society and at the same time maintaining excellence. The department has been innovative in this aspect; we consider ourselves to be leaders in the country in this regard and have received international recognition. As one of the leading universities in South Africa we feel that we are in an ideal position to develop our research. In addition, our location in the industrial heartland provides largely untapped opportunities to develop valuable research partnerships with industry and commerce. The Department would benefit greatly from such partnership: experience in setting up joint research projects will be one of the criteria used in selecting the candidates. We are currently initiating programmes to coordinate joint research and to support higher degree students. Recently we have put increased effort into developing our postgraduate programme. We have a thriving research programme focused on aspects of dependable computing. Staff members are also involved in a number of other areas of research -- machine learning, computational geometry, robotics, computer science education, formal methods, verification, concurrency, process algebras, image processing, pattern recognition, etc. Please direct any informal inquiries to Conrad Mueller, conrad@cs.wits.ac.za who is the current chair of the governing committee. More information about the department can be found at http://www.cs.wits.ac.za/ and more information about the University can be found at http://www.wits.ac.za/ ---------------------------------------------------------------- Ian Sanders Telephone: (2711) 716-3269 Department of Computer Science Fax: (2711) 339-3513 University of the Witwatersrand 403-9317 Private Bag 3 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From wrf at ecse.rpi.edu Thu Sep 23 21:38:29 1999 From: wrf at ecse.rpi.edu (Wm. Randolph Franklin) Date: Mon Jan 9 13:40:55 2006 Subject: Announce: 3D connected components program Message-ID: <199909240038.UAA02142@benvolio.ecse.rpi.edu> This is to announce my latest program, CONNECT, which finds the connected components in a 3-D rectangular volume of binary voxels (the universe). For each component, CONNECT writes its volume, surface area, and voxels (grouped into runs). CONNECT can do both 6-connectivity and 26-connectivity. CONNECT is very space- and time-efficient. E.g., processing one test volume of size 544x544x512, which has 151,519,232 voxels, about 1/2 empty, to find the 534,723 6-connected components, takes only 50 seconds of CPU and 45MB of virtual memory on a 233MHz Pentium with Linux and g++. The time for any particular case depends on the data complexity, e.g., number of input runs and output components. The worst 6-connectivity case would be to have alternating voxels full and empty. CONNECT could easily be extended to 4D volumes, if there was an application. It does 2D areas as a trivial subcase. A 1x1024x1024 input is processed in under 1 second, with setup overhead being most of that time. I predict that CONNECT could process a 1024x1024x1024 universe in 10 CPU minutes, depending its complexity, tho the virtual memory might page badly. Does anyone have any real test data? My confidence in CONNECT's correctness is based upon rotating the large test case around the grand diagonal, rerunning CONNECT, and sorting and comparing the output statistics of the components' volumes and areas. The results are identical. I am the author of CONNECT. You may use it for non-profit research and education. You must make appropriate acknowledgements. For more info, including detailed usage and algorithm descriptions, and a source tarball, go to http://www.ecse.rpi.edu/Homepages/wrf/research/connect/ Comments are welcome. ------------------------ Wm. Randolph Franklin Associate Professor rfranklin@altavista.net http://www.ecse.rpi.edu/Homepages/wrf/ +1 (518) 276-6077; Fax: -6261 ECSE Dept., 6026 JEC, Rensselaer Polytechnic Inst, Troy NY, 12180 USA (PGP key available) ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From subodh at blaze.cs.jhu.edu Thu Sep 2 14:46:54 1999 From: subodh at blaze.cs.jhu.edu (Subodh Kumar) Date: Mon Jan 9 13:40:57 2006 Subject: CGC Workshop on Computational Geometry, 2nd call Message-ID: <199909021746.NAA23179@condor.cs.jhu.edu> Call for Papers 4th CGC Workshop on Computational Geometry Johns Hopkins University, Baltimore, MD, October 15-16, 1999 We are pleased to announce the fourth annual fall Workshop on Computational Geometry, sponsored by the Center for Geometric Computing, continuing a tradition established by the Mathematical Sciences Institute at SUNY-Stony Brook. The Center for Geometric Computing is a collaborative center of Brown, Duke, and Johns Hopkins Universities, and is funded by the U.S. Army Research Office. Scope and Format The aim of this workshop is to bring together researchers from academia, industry, and the Army to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to: Algorithmic methods in geometry I/O-scalable geometric algorithms Animation of geometric algorithms Computer graphics Solid modeling Geographic information systems Computational metrology Graph drawing Experimental studies Geometric data structures Implementation issues Robustness Computer vision Robotics Computer-aided design Mesh generation Following the tradition of the previous MSI and CGC Workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. Registration will be on-site, and will include the abstract booklet, coffee breaks, lunches, and a reception. There will be a registration fee of $75. Invited speakers To be Announced Submissions Authors are invited to submit abstracts for talks to be given at the workshop. Please send an abstract (up to 2 pages) and a draft of a paper (if you have one). E-mail submissions are encouraged; send to cgc@cs.jhu.edu. Ideally, the abstract should be a PDF, PostScript, or LaTeX, file, for ease in assembling the abstract booklet. Abstracts can also be sent by regular mail to: Subodh Kumar Department of Computer Science Johns Hopkins University 224 NEB, 3400 N. Charles St. Baltimore, MD 21218 Submissions should arrive by September 10, 1999. Authors will be notified of acceptance by September 20, 1999. A booklet of abstracts will be distributed at the workshop and made available electronically on the Web. There will be no formal proceedings for this workshop, but selected papers will be invited to a special issue of the journal "Computational Geometry: Theory and Applications". Program Committee Pankaj K. Agarwal (Duke University), Lars Arge (Duke University), Michael T. Goodrich (Johns Hopkins University), S. Rao Kosaraju (Johns Hopkins University), Subodh Kumar (Johns Hopkins University), Joseph S. B. Mitchell (State University of New York at Stony Brook), Franco P. Preparata (Brown University), Roberto Tamassia (Brown University), Jeffrey S. Vitter (Duke University). Note: For more information about the workshop, send mail to cgc@cs.jhu.edu . Further information will be posted to our web site: http://www.cs.jhu.edu/labs/cgc/cgc99 as soon as it is available. Important Dates Deadline for submission Sep 10 Notification of acceptance Sep 20 Conference Oct 15-16 - Subodh ######################################################################## Computer Sc., JHU, Baltimore MD 21218 Tel: (410)516-0060, Fax: 6134 http://www.cs.jhu.edu/~subodh ------------- 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://uiuc.edu/~sariel/CG/compgeom/threads.html.