From roman at swarm.cs.wustl.edu Mon Jan 3 10:11:24 2000 From: roman at swarm.cs.wustl.edu (Catalin Roman) Date: Mon Jan 9 13:40:56 2006 Subject: Faculty Positions at Washington University Message-ID: <200001031611.KAA53887@swarm.cs.wustl.edu> Washington University in Saint Louis Department of Computer Science Applications are invited for tenure-track faculty positions at the Assistant, Associate and Full Professor levels. Applicants should hold a doctorate in Computer Science or a closely related field, have a record of accomplishment in research, and demonstrate a strong commitment to teaching. Washington University is a leading private national university recognized for its world class intellectual contributions (20 Nobel Prize Laureates have been associated with the University), its exceptional resources (an endowment of $2.8 billion, among the largest in the nation), and its location in the midst of a delightful residential community which places much value on education and culture. With annual external research funding of $6.3 million, Computer Science is emerging as one of the preeminent departments in the University and the School of Engineering and Applied Science. The Department plans to expand its size from 16 to 20 regular faculty. This aggressive growth pattern will be accompanied by commensurate increases in departmental resources. The Department seeks outstanding candidates likely to develop synergistic relationships with existing areas of excellence within the department: networking and communications; distributed computing and object-oriented software technologies; graphics, visualization, and human interfaces; electronic commerce, artificial intelligence; computer architecture and engineering; theoretical computer science, algorithms, and programming languages; and computational science with emphasis on biomedical applications. Candidates with a strong background in electronic commerce, embedded systems design, graphics and visualization, and distributed databases will receive special consideration. With the strong backing of the University and the School, the Department is committed to making significant investments in promising new areas of study and to providing the kind of resources and environment that will enable new faculty members to flourish intellectually. Academic couples seeking to co-locate are strongly encouraged to apply. Research groups in search of a highly supportive institutional environment may also want to consider relocating to Washington University. For more information on our department, see our World Wide Web page at http://www.cs.wustl.edu. Qualified applicants should send a curriculum vita and the names and addresses of at least three references to Dr. Catalin Roman, Chairman, Department of Computer Science, Campus Box 1045, Washington University, One Brookings Drive, St. Louis, MO 63130-4899. Applications will be considered as they are received. Those received after February 1, 2000, may not receive full consideration. Washington University 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 roman at swarm.cs.wustl.edu Mon Jan 3 11:39:32 2000 From: roman at swarm.cs.wustl.edu (Catalin Roman) Date: Mon Jan 9 13:40:56 2006 Subject: COORDINATION 2000 (First Call for Papers) Message-ID: <200001031739.LAA55300@swarm.cs.wustl.edu> Call for Papers COORDINATION 2000 Fourth International Conference on Coordination Models and Languages Limassol, Cyprus 11-13 September 2000 http://www-gloc.di.fct.unl.pt/coord00/ The need for increased programmer productivity and rapid development of complex systems provide the pragmatic motivation for the development of coordination languages and models. The intellectual excitement associated with such endeavors is rooted in the decades-old desire to leverage off increasingly higher levels of abstractions. Coordination-based methods provide a clean separation between individual software components and their interaction within the overall software organization. This separation makes large applications more tractable, supports global analysis, and enhances reuse of software. Building on the success of the last three COORDINATION conferences, whose proceedings were published by Springer in the LNCS series, this conference provides a forum for the growing community of researchers interested in models, languages, and implementation techniques for coordination. Topics of interest include (but are not limited to): * Theoretical models and foundations for coordination: component composition, concurrency, mobility, dynamic aspects of coordination. * Specification, refinement, and analysis of software architectures: patterns and styles, verification of functional and non-functional properties. * Coordination, architectural, and interface definition languages: implementation, interoperability, heterogeneity. * Agent-oriented languages: formal models for interacting agents. * Dynamic software architectures: mobile agents, configuration, reconfiguration. * Tools and environments for the development of coordinated applications: integration within the development process. * Industrial relevance of coordination and software architectures: programming in the large, domain-specific software architectures and coordination models, case studies. Proceedings The conference proceedings will be published by Springer, in the LNCS (Lecture Notes in Computer Science) series. Submission Instructions Authors are invited to submit full papers (in English, up to 6000 words) electronically. Details on paper submission will be available on the conference web page http://www-gloc.di.fct.unl.pt/coord00/. The authors' instructions provided by Springer should be followed. They can be obtained from http://www.springer.de/comp/lncs/authors.html. Full papers must be received no later than 14 April 2000. Simultaneous or similar submissions to other conferences or journals are not allowed. An abstract of no more than 250 words must be received by 7 April 2000. Details on abstract submission will be available on the conference web page http://www-gloc.di.fct.unl.pt/coord00/. Submissions should explicitly state their contribution and their relevance to the theme of the conference. Other criteria for selection will be originality, significance, correctness, and clarity. Conference Location The conference will be held in Limassol, the most popular and lively city of Cyprus, which is located on the southern coast of the island. The conference venue will be a five-star hotel on the coast. IMPORTANT DATES Pre-submission abstracts: 7 Apr 2000 Full paper submissions: 14 Apr 2000 Notification of acceptance: 14 Jun 2000 Camera-ready version: 7 Jul 2000 Program co-chairs: Antonio Porto New University of Lisbon, Portugal ap@di.fct.unl.pt http://www-gloc.di.fct.unl.pt/~ap Gruia-Catalin Roman Washington University in St. Louis, USA roman@cs.wustl.edu http://www.cs.wustl.edu/~roman Organizing Chair: George A. Papadopoulos University of Cyprus george@cs.ucy.ac.cy http://www.cs.ucy.ac.cy/papadopo.html Program Committee (partial list): Farhad Arbab CWI, The Netherlands Farhad.Arbab@cwi.nl GianLuigi Ferrari U. Pisa, Italy giangi@di.unipi.it Jose Luiz Fiadeiro U. Lisbon, Portugal llf@di.fc.ul.pt Roberto Gorrieri U. Bologna, Italy gorrieri@cs.unibo.it Paola Inverardi U. l'Aquila, Italy inverard@univaq.it Jean-Marie Jacquet U. Namur, Belgium jmj@info.fundp.ac.be Edwin de Jong Signaal, The Netherlands edejong@signaal.nl Joost Kok U. Leiden, The Netherlands joost@wi.leidenuniv.nl Jose Meseguer SRI, USA meseguer@csl.sri.com Naftaly Minsky Rutgers U., USA minsky@cs.rutgers.edu Antonio Natali U. Bologna, Italy anatali@deis.unibo.it Rocco De Nicola U. Firenze, Italy denicola@dsi.unifi.it George Papadopoulos U. Cyprus, Cyprus george@cs.ucy.ac.cy Rick Schlichting U. Arizona, USA rick@cs.arizona.edu Robert Tolksdorf T.U. Berlin, Germany tolk@cs.tu-berlin.de Alan Wood U. York, UK wood@cs.york.ac.uk Sponsorship: This conference is officially sponsored by the Esprit Working Group 24512 "Coordina" (see http://www-gloc.di.fct.unl.pt/activity/coordina/). ------------- 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 melnik at cs.brandeis.edu Tue Jan 4 14:39:21 2000 From: melnik at cs.brandeis.edu (Ofer Melnik) Date: Mon Jan 9 13:40:56 2006 Subject: convex hull interior Message-ID: Hi, I was wondering if someone could help me out. I am interested in algorithms that given a group of red points in n-dimensional space can answer whether a new blue point is within the interior of the convex hull defined by the red points. I realize that this can be phrased as a linear programming problem. But are there specific results on this problem, in terms of exact and approximate computational complexity? Are there good algorithms to solve it? Where we know, when they will be efficient and inefficient? Thanks for any help, -Ofer ----------------------------------------------------------------- Ofer Melnik melnik@cs.brandeis.edu Volen Center for Complex Systems Ph: (781)-736-2719 Brandeis University (781)-736-DEMO Waltham MA 02254 ------------- 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 dls at eecs.tufts.edu Thu Jan 6 14:15:41 2000 From: dls at eecs.tufts.edu (Diane Souvaine) Date: Mon Jan 9 13:40:56 2006 Subject: Faculty Position at Tufts University Message-ID: <200001061915.OAA04450@nebula.eecs.tufts.edu> The Department of Electrical Engineering and Computer Science at Tufts University seeks to hire a tenure-track faculty member in Computer Science at the Assistant or Associate Professor level. The successful candidate will be responsible for excellence in teaching, research, and advising in both the undergraduate and graduate programs of the department. We also expect the successful candidate to develop funded research programs in his/her area of interest, supervise graduate research, and publish in refereed journals. A doctorate in Computer Science or a closely related field is required. Preference will be given to candidates who can teach programming-oriented courses and whose research connects to on-going departmental research in artificial intelligence, data compression, discrete math/theory, distributed computing, human-computer interaction, machine learning, multimedia, CAD for integrated circuits, computational geometry, and/or visualization and exploration of large data sets. Tufts University is a Research I class institution that happens to be the smallest such institution, giving it unique character. With about 5,000 undergraduates, 3,000 graduate students, and a world-wide reputation for its undergraduate education and several of its graduate programs, Tufts offers a unique opportunity for academic professionals interested in combining world-class research with close connections to outstanding undergraduate, Masters, and Ph.D. students. Located just a few miles or a short 'T' ride from Boston and Cambridge, the Department offers B.S., M.S. and Ph.D. programs in Electrical Engineering, in Computer Engineering, and in Computer Science. For more information on the Department or other Tufts positions available, please visit . Applications including a cover letter, a resume, a teaching statement, a research plan, and three letters of recommendation should be sent to Prof. Diane Souvaine, Chair of the Computer Science Search, Department of Electrical Engineering and Computer Science, Tufts University, 161 College Avenue, Medford, Massachusetts, 02155. Review of applications begins February 7, 2000. An Affirmative Action/Equal Opportunity employer, Tufts University is committed to excellence in teaching and scholarship, and to building a faculty that reflects the diversity of both its students and the world. Members of underrepresented groups (people of color, persons with disabilities, Vietnam veterans, and women) are strongly encouraged to apply. ------------- 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 marc at cs.uu.nl Fri Jan 7 13:46:46 2000 From: marc at cs.uu.nl (Marc van Kreveld) Date: Mon Jan 9 13:40:56 2006 Subject: PhD student position, Utrecht, NL Message-ID: <3875E036.3E318E86@cs.uu.nl> At the Department of Computer Science of Utrecht University, there is an opening for a PhD student on a project entitled Geometric Algorithms for the Visualisation of Traffic and Transportation, funded by the dr.ir. Cornelis Lely-foundation. This project has as its goal the development and implementation of algorithms for special purpose cartographic visualization for traffic and transportation. The research will be done in the Applied Algorithms group headed by prof.dr. Mark Overmars (http://www.cs.uu.nl/groups/AA/). Summary The project consists of research on geometric algorithms for the visualization of data or analyses on (road) networks. In particular, cartographic visualization by special purpose maps like schematic maps and cartograms will be studied. The topics of research are chosen in collaboration with the Advisory Board for Traffic and Transportation of the Ministry of Transport, Public Works, and Water Management. The study of the cartographic problem will lead to a suitable operationalization or formalization. This is followed by research on geometric algorithms that provides solutions to these cartographic problems. Implementations will be done to test the formalization and algorithmic solution. The algorithms to be developed may also be based on combinatorial optimization, and simulation (e.g. finite element methods). The research should lead to scientific publications in applied computational geometry and automated cartography, based on new solutions and algorithmic results. We offer - A position as a PhD student for four years - An interesting, internationally oriented working environment - Additional stipend on top of the standard (Dutch) PhD student salary We look for - A computer scientist with a Master's degree and with interest in and knowledge of algorithms, preferably geometric algorithms More information Interested candidates can contact dr. M.J. van Kreveld (Marc), phone. +31 - 30 - 2534119, e-mail: marc@cs.uu.nl ------------- 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 emo at inf.ethz.ch Tue Jan 11 12:31:47 2000 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:40:56 2006 Subject: ICALP 2000 Message-ID: <200001111131.MAA02641@shadow.inf.ethz.ch> EXTENSION OF DEADLINE FOR PAPER SUBMISSION TO JANUARY 24TH, 2000. ------------------------------------------------ Call for Papers ICALP'2000 27th International Colloquium on Automata, Languages and Programming July 9-15, 2000, Geneva, Switzerland The 27-th annual meeting of the European Association of Theoretical Computer Science will be held in Geneva, Switzerland. As is the case of the two tracks of the journal Theoretical Computer Science, the scientific program of the Colloquium is split into two parts: Track A of the meeting will correspond to Algorithms, Automata, Complexity, and Games, while Track B will correspond to Logic, Semantics and Theory of Programming. Original contributions to theory of computer science, to be presented either in Track A or in Track B, are being sought. Authors are invited to submit extended abstracts of their papers, not exceeding 12 pages in the standard Springer Verlag LNCS style. Instructions for paper submissions can be found at the conference web page. Authors from countries where access to Internet is difficult may mail a single copy of their paper directly to the address of the conference chairman. Submissions should consist of: a cover page, with the author's full name, address, fax number, e-mail address, a 100-word abstract, keywords, and to which track (A or B) the paper is being submitted and an extended abstract describing original research in no more than 12 pages. It is expected that accepted papers will be presented at the conference. Simultaneous submission to other conferences with published proceedings is not allowed. Conference Chair: Jose D. P. Rolim Centre Universitaire d'Informatique University of Geneva 24 rue du General Dufour 1211 Geneva 4 Switzerland mailto:icalp@cui.unige.ch ICALP'2000 Program Committee Track A: Emo Welzl, Chair, ETH Zuerich Harry Buhrman, CWI Amsterdam Peter Bro Miltersen, Univ. Aarhus Martin Dietzfelbinger, Techn Univ Ilmenau Afonso Ferreira, CNRS-I3S-INRIA Sophia Antipolis Marcos Kiwi, Univ. de Chile Jens Lagergren, KTH Stockholm Gheorghe Paun, Romanian Acad. Guenter Rote, Techn. Univ. Graz Ronitt Rubinfeld, Cornell Univ. Amin Shokrollahi, Bell Labs Luca Trevisan, Columbia Univ. Serge Vaudenay, ENS Paris Uri Zwick, Tel Aviv Univ. Track B: Ugo Montanari, Chair, Univ. of Pisa Rajeev Alur, Univ. Pennsylvania, Philadelphia Rance Cleaveland, SUNY at Stony Brook Pierpaolo Degano, Univ. of Pisa Jose Fiadeiro, Univ. of Lisbon Andy Gordon, Microsoft Research, Cambridge, Orna Grumberg, Technion, Haifa Claude Kirchner, Inria, Nancy Mogens Nielsen, Univ. of Aarhus Catuscia Palamidessi, Penn. State Univ, Univ. Park Joachim Parrow, KTH, Stockholm Edmund Robinson, QMW, London Jan Rutten, CWI, Amsterdam Jan Vitek, Univ. of Geneva Martin Wirsing, Ludwig-Maximilians-University, Munich Pierre Wolper, Univ. of Liege. Special Award Richard Karp, Berkeley Invited Speakers Track A: Andrei Broder, Altavista Oded Goldreich, MIT and Weizman Inst. Johan Haastad, KTH Stockholm Kurt Mehlhorn, Max Plank Institute Track B: Samsom Abramsky, Edinburgh U. Gregor Engels, Paderborn U. Roberto Gorrieri, U. Bologna Zohar Manna, Stanford U. Satellite Workshops * Workshop on Randomization and Approximation in CS. (RANDOM'2000) * Workshop on Algorithms for Communication Networks (ARACNE) * Workshop on Boolean Functions and Applications * Workshop on Intersection Types and Related Systems (ITRS '00) * Workshop on Graph Transformation and Visual Modeling Techniques * Workshop on Process Algebra and Performance Models (PAPM 2000) * Workshop on Theor. Found. of Security Analysis and Design (IFIP WG 1.7) General Information Geneva is situated along the banks of Lac Leman and Le Rhone. The lake showcases the plumed fountain Jet d'Eau, and various districts of Geneva are connected by bridges across the waterways. The University of Geneva where ICALP '00 will convene is located on the `Left Bank' off Place Neuve and along the Promenade des Bastions near the Old Town section of Geneva. Geneva is a city of water parks and gardens and welcoming walkways which encourage exploration of the historical sites, museums, and international business and shopping districts. The University of Geneva is located near `Old Town' an area dotted with sidewalk cafes, student life, and building antiquities dating back to the 5th century. Geneva is a crossroads situated in the heart of Europe and linked to the world by a vast network of motorways, airlines and railways. For those planning to attend ICALP '00 in Geneva, it is an excellent opportunity to organize short trips into the countryside of charming villages and vineyards. Tours to please all ages and interests are available including afternoon train excursions, shopping cruises on Lake Geneva and The Rhone, and bus and cablecar trips in the Alps. For some, the most inviting attraction will be mouintain climbing. Mont Blanc, one of the highest points in Europe and the city of Chamonix are less than an hour away. Accomodations at a very special ICALP rate have been reserved in a couple of hotels and very inexpensive rooms will be available at the Student Housing. Lunch will be served daily on campus and there will be morning and afternoon refreshment breaks. Note that the specially priced hotel accommodations reserved for ICALP participants are located only a 5-10 minute walk to the campus. Important Dates Workshop Proposals: November 10,1999 Submissions: January 24, 2000 Notification: March 21, 2000 Final Copies: April 18, 2000 Further Information Further information related to ICALP'00, with instructions for paper submissions and conference registration, as well as with details on conference site, registration fee, accommodation, social program, and payments, will appear at the conference webpage at http://cuiwww.unige.ch/~icalp and in forthcoming issues of EATCS Bulletin. The conference is organized by the Centre Universitaire d'Informatique of the University of Geneva. ------------- 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 scot at moosilauke.cs.dartmouth.edu Thu Jan 6 17:06:45 2000 From: scot at moosilauke.cs.dartmouth.edu (Scot Drysdale) Date: Mon Jan 9 13:40:56 2006 Subject: Dartmouth needs visitor to teach Grad. Theory In-Reply-To: <199905112214.SAA03807@moosilauke.cs.dartmouth.edu> from "Scot Drysdale" at May 11, 1999 06:14:14 PM Message-ID: <200001062206.RAA16129@moosilauke.cs.dartmouth.edu> Visitor needed to teach Graduate Theory of Computation at Dartmouth College Due to and unexpected leave Dartmouth College would like to hire a visitor to teach the Graduate Theory of Computation course this spring term (March 27-June 6). To apply please send a c.v., cover letter, and names of three references to: Professor Scot Drysdale Chair, Department of Computer Science Dartmouth College 6211 Sudikoff Laboratory Hanover, NH 03755 email: scot@cs.dartmouth.edu phone: 603/646-2101 fax: 603/646-1672 References should address both teaching and research. Dartmouth is an equal opportunity, affirmative action employer and encourages applications from women and minorities. ------------- 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 george at ada.cs.ucy.ac.cy Wed Jan 12 11:42:45 2000 From: george at ada.cs.ucy.ac.cy (George Angelos Papadopoulos) Date: Mon Jan 9 13:40:56 2006 Subject: Academic Vacancies: C.S. Dept - Univ. of Cyprus 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 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. The annual salaries for these positions (including the 13th salary) are: Professor (Scale A15-A16) CYP 25.479 - 33.120 Associate Professor (Scale A14-A15) CYP 22.473 - 30.636 Assistant Professor (Scale A13-A14) CYP 20.966 - 28.288 Lecturer (Scale A12-A13) CYP 17.706 - 25.933 (At present CYP 1 = 1.1 sterling and CYP 1 = 1.80 U.S. dollars). Presently, the Department is seeking applications for the winter and spring semesters of the academic year 2000-2001. 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-892238, 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From yap at cs.nyu.edu Wed Jan 12 10:48:13 2000 From: yap at cs.nyu.edu (Chee Yap) Date: Mon Jan 9 13:40:56 2006 Subject: New Book Message-ID: <200001121548.KAA12288@jinai.cs.nyu.edu> Announcing a new book: Fundamental Problems of Algorithmic Algebra by CHEE YAP, New York University Oxford University Press, 2000. Websites: Oxford University Press Announcement: http://www.oup-usa.org/isbn/0195125169.html Book Homepage: http://www.cs.nyu.edu/cs/faculty/yap/book/ Table of Contents: http://www.cs.nyu.edu/cs/faculty/yap/book/toc.html ============================================================== 511 pp.; 22 line illus; 7-1/2 x 9-1/4; 0-19-512516-9; $72 (US) ============================================================== Computer Algebra systems represents a rapidly growing application of computer science to all areas of scientific research and computation. Well-known computer algebra systems such as Maple, Macsyma, Mathematica and REDUCE are now a basic tool on most computers. Underlying these systems are efficient algorithms for various algebraic operations. The field of Computer Algebra, or Algorithmic Algebra, constitute the study of these algorithms and their properties, and represents a rich intersection of theoretical computer science with very classical mathematics. For researchers in computational geometry, computer algebra offers the necessary tools in the investigation of nonlinear problems and issues of current interest such as non-robustness in geometric algorithms. Yap's book focuses on a collection of core problems in this area; in effect, they are the computational versions of the classical Fundamental Problem of Algebra and its derivatives. It attempts to be self-contained in its mathematical development while addressing the algorithmic aspects of problems. The book is intended for a first course in algorithmic algebra (or computer algebra) for advanced undergraduates or beginning graduate students in computer science. Additionally, it will be a useful reference for professionals in this field. Excellent presentation of mathematics relevant to computer algebra. ==================================================== ------------- 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 dls at eecs.tufts.edu Wed Jan 12 11:03:51 2000 From: dls at eecs.tufts.edu (Diane Souvaine) Date: Mon Jan 9 13:40:56 2006 Subject: Graduate Fellowship at Tufts University Message-ID: <200001121603.LAA06831@piano.eecs.tufts.edu> ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Engineering College Graduate Student Research Fellowships $18,000 Stipend Plus Tuition The College of Engineering at Tufts University has an exciting NSF fellowship opportunity available for an outstanding graduate student computer scientist who is also interested in being involved in bringing concepts from the foundations of computer science into middle school (grades 6-8) curriculum. The fellowships are for the amount of $18,000 per twelve months, and are annually renewable up to three years, based upon fellow performance. The Computer Science Fellow chosen for this program will work with 6th through 8th grade teachers and students with the guidance of Tufts Computer Science Faculty. The goal is to infuse principles of algorithmic thinking and computer science applications into middle school mathematics classes in Massachusetts. The fellow will act as a resource for the middle school mathematics teachers. Graduate students accepted as fellows will receive $18,000 for a June May commitment and an annual full tuition scholarship for graduate study in Computer Science in the College of Engineering at Tufts University. The fellowship is in lieu of a traditional teaching or research assistantship, encouraging instead contributing an understanding of the foundations of computer science to 6-8 classes while pursuing their own advanced degree and computer science research. Please visit www.ceeo.tufts.edu for details of fellowship or application, and www.eecs.tufts.edu for details about graduate study in computer science and how to apply for the M.S./Ph.D. Program, or contact one of: Dr. Martha Cyr Prof. Diane Souvaine 105 Anderson Hall Elect. Engr. and Computer Science Dept. Tufts University Tufts University Medford, MA 02155 Medford, MA 02155 mcyr@tufts.edu dls@eecs.tufts.edu Application target date : February 14th, 2000 Fellowship Recipients must be citizens of the U.S. or permanent residents. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ------------- 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 ziegler at math.TU-Berlin.DE Thu Jan 13 16:33:06 2000 From: ziegler at math.TU-Berlin.DE (Guenter M. Ziegler) Date: Mon Jan 9 13:40:56 2006 Subject: DISCRETE AND ALGORITHMIC GEOMETRY: Euro-Conference on Crete Message-ID: <200001131533.QAA12754@zaphod.math.TU-Berlin.DE> ==================================================================== DISCRETE AND ALGORITHMIC GEOMETRY Euroconference on Crete August 19-25, 2000 ==================================================================== ... The Foundation for Research and Technology-Hellas (Institute of Applied and Computational Mathematics) ... ... in collaboration with the University of Crete (Department of Mathematics) ... ... continue in 2000 their series `` Euroconferences in Mathematics on Crete'' ... sponsored mainly by the TMR Programme of EU Commission ... including the following conference: Time: 19-25 August 2000: Topic: DISCRETE AND ALGORITHMIC GEOMETRY Organisers: Emo Welzl (ETH Z"urich, Switzerland) G"unter M. Ziegler (Berlin, Germany) Main speakers: Gil Kalai (Jerusalem, Israel) Raimund Seidel (Saarbr"ucken, Germany) Jack Snoeyink (Vancouver, Canada) Emo Welzl (ETH Z"urich, Switzerland) G"unter M. Ziegler (Berlin, Germany) Location: The conferences will take place at the Anogia Academic Village, a conference center located at the traditional Cretan village of Anogia on the slopes of the mountain Ida. Anogia is located at an elevation of 750 m, about 45 minutes by car from Heraklion, the largest city of Crete, and about half an hour from the closest coast. Costs: The living expenses (accommodation plus meals) per day for a person are estimated at about 32 Euro in a double room or 40 Euro in a single room. The registration fee amounts to 250 Euro. Financial Support available (!): The Training and Mobility of Researchers (TMR) Programme financially supports young researchers from the countries of the European Economic Area and Israel, as well as researchers from certain countries in Central and Eastern Europe, to enable them to attend the conferences. There may be also some limited funds from other sources available to support participants not belonging to the above groups. Support can cover (all or part of) travel, living and registration expenses. For information please contact the local co-ordinator: Susanna Papadopoulou Department of Mathematics University of Crete Heraklion, Crete, GREECE Fax-Nr.: 81-393881 e-mail: souzana@math.uch.gr Registration: please send the registration form below to ziegler@math.tu-berlin.de ==================================================================== DISCRETE AND ALGORITHMIC GEOMETRY Euroconference on Crete August 19-25, 2000 Name: Affiliation: Nationality: Address (e-mail and snail-mail): Fields of interest: Would you like to give a talk ? If yes, is the title already fixed ? Do you need financial support ? Short curriculum vitae: ==================================================================== ------------- 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 vlad at cs.newcastle.edu.au Sat Jan 15 00:02:47 2000 From: vlad at cs.newcastle.edu.au (Vladimir Estivill-Castro) Date: Mon Jan 9 13:40:56 2006 Subject: COCOON-2000 Message-ID: <200001141302.AAA17868@lily.newcastle.edu.au> We apologize if you have received this before. COCOON'2OOO --- FINAL Call for Papers --- Sixth Annual International Computing and Combinatorics Conference July 26-28, 2000, Bondi Beach , Sydney , Australia The Sixth Annual International Computing and Combinatorics Conference, COCOON'2000, will be held in Bondi Beach , Sydney , Australia July 26--28, 2000 (a few weeks before the XXVII Olympics, September 15 -- October 1). The conference aims to provide a forum for researchers in theoretical computer science. The conference will be followed by the 11th Australasian Workshop on Combinatorial Algorithms (AWAOCA). Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In additional to theoretical results, submissions that report substantial results in experimental and applied research are encouraged. Typical, but not exclusive, topics of interest include: * algorithms and data structures * automata, languages and logic * combinatorics related to algorithms and complexity * complexity theory * computational algebra, biology, geometry, and number theory * computational learning theory and knowledge discovery * cryptography and database theory * graph drawing and information visualization * graph theory, communication networks, and optimization * parallel and distributed computing Submissions to the conference this year will again be conducted electronically. Authors should follow the submission guidelines and send a PostScript file of a paper (in English) by February 8, 2000. The submission guidelines are in http://www.cs.newcastle.edu.au/~cocoon2000/submission.html Our home page is: http://www.cs.newcastle.edu.au/~cocoon2000 Alternatively, authors unable to access e-mail may send 6 hard copies of their papers to: Xuemin Lin - COCOON'2000 School of Computer Science and Engineering University of New South Wales Sydney, NSW 2052, Australia. e-mail: lxue@cse.unsw.edu.au A paper should start with the title of the paper, each author's name, affiliation, e-mail address, and a short summary of the main results. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance to the conference. The length of the paper should not exceed 10 pages (using 11 point or larger font, with ample margins all around). If necessary, authors may include a clearly marked appendix that will be read at the discretion of the Program Committee. An abstract of the paper must be submitted electronically by February 1, 2000. Authors will be notified of acceptance or rejection by March 30, 2000. A camera-ready copy of each accepted paper will be required by April 26, 2000. The proceedings of the conference will be published by Springer-Verlag in the Lecture Notes in Computer Science series, and will be available for distribution at the conference. The Hao Wang award will be given to the best paper (details given on our home page). We also introduce an award for the best paper from a young researcher (at most 3 years since PhD). Program Committee Co-Chairs =========================== Ding-Zhu Du (U. of Minnesota, USA) Peter Eades (Newcastle, Australia) Xuemin Lin (New South Wales, Australia) Conference Co-Chairs ==================== Vladimir Estivill-Castro (Newcastle, Australia) Arun Sharma (New South Wales, Australia) Program Committee ================= David Avis (McGill, Canada), Jianer Chen (Texas A&M, USA), Francis Chin (Hong Kong U, Hong Kong), Vladimir Estivill-Castro (Newcastle, Australia), George Havas (UQ, Australia), Hiroshi Imai (Tokyo, Japan), Tao Jiang (UC Riverside, USA), Richard Karp (UC Berkeley, USA), Michael Juenger (Cologne, Germany), D. T. Lee (Academia Sinica, Taiwan), Bernard Mans (Macquarie U., Australia), Brendan McKay (ANU, Australia), Maurice Nivat (Universitie de Paris VII, France), Takeshi Tokuyama (Tohoku, Japan), Roberto Tamassia (Brown, USA), Jie Wang (UNC Greensboro, USA), Shmuel Zaks (Technion, Israel), Louxin Zhang (NUS, Singapore), Shuzhong Zhang (CUHK, Hong Kong), Binhai Zhu (City U Hong Kong, Hong Kong) Invited Speakers ================ * Christos H. Papadimitriou (University of California, Berkeley) * Richard Brent (Oxford University Computing Laboratory) Important Dates =============== * Submission of Abstracts: February 1, 2000 * Submission of Papers: February 8, 2000. * Notification of Acceptance: March 30, 2000. * Final Version: April 26, 2000. * Conference: July 26-28, 2000 . Location ======== The conference will be held at the Swiss-Grand Hotel in Bondi Beach , Sydney , Australia. Further Information =================== Please contact cocoon2000@cse.unsw.edu.au for further information. Sponsors ======== * University of New South Wales * University of Newcastle * Computer Science Association of Australasia ------------- 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 Enrico.Gobbetti at crs4.it Sat Jan 15 01:02:49 2000 From: Enrico.Gobbetti at crs4.it (Enrico Gobbetti) Date: Mon Jan 9 13:40:56 2006 Subject: Job Opening: Research position at CRS4 Message-ID: <387FB929.E04D3A2C@crs4.it> *** *** EXPERT LEVEL RESEARCH POSITIONS IN COMPUTER GRAPHICS *** Ref.: VVR-EXPERT-0100 URL: http://www.crs4.it/vvr/contents/announce/job_01_99 The Visualization and Virtual Reality area at CRS4 invites applications for an expert-level research position in computer graphics. The following specialties are of value to us: multiresolution modeling, geometric simplification, time-critical rendering, object-oriented technology, Eiffel, C++, OpenGL, Windows NT. The successful candidates must possess the following requirements: * University Degree, preferrably MSc or Ph.D., in Computer Science or related fields; * Considerable research and development experience in the field of computer graphics; * Theoretical and practical background in geometric modeling; * A good understanding of component based object-oriented programming technology. Good communication skill, attitude to work in group, and some previous experience in international projects complete the profile of the successful candidate, that will immediatly start working on one of the projects of the group. In particular, the candidate is expected to provide a leading contribution to the development of software components for multiresolution modeling and simplification in the context of a three-year European project. A two year renewable contract will be offered, with salary depending on the demonstrated expertise of the successful candidate. This offer of employment is in accordance with the current Italian "Contratto Collettivo Nazionale di Lavoro per l'industria Metalmeccanica Privata". CRS4 is an interdisciplinary research center established in 1991 and located near Cagliari (Sardinia, Italy). Its activities encompass many areas related to computational science and information technology. The Center currently has a staff of about 90 researchers and has outstanding facilities. CRS4 provides a stimulating work environment for highly motivated individuals. Further information about CRS4's Visualization and Virtual Reality group can be obtained on the Internet at: http://www.crs4.it/vvr. The position is available immediately and applications will be accepted until the position is filled. Applicants should send a resume, including a cover letter quoting Ref. VVR-EXPERT-0100, to: Dr. Fabio Bettio CRS4 VI Strada Ovest, Z.I. Macchiareddu C.P. 94 I-09010 Uta (CA), Italy. E-mail: fabio@crs4.it Fax : +39 070 2796 216 Electronic submissions (in HTML, ASCII, PDF, or PostScript) are strongly encouraged. ------------- 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 irma at sbox.tu-graz.ac.at Sun Jan 16 19:34:44 2000 From: irma at sbox.tu-graz.ac.at (Iris Reinbacher) Date: Mon Jan 9 13:40:56 2006 Subject: thesis Message-ID: <38820F44.6658EF66@sbox.tu-graz.ac.at> I am a student at the Technical University Graz (Austria) and I am writing my diploma-thesis on "Random Triangulations (of Sets of Points)" (at Dr. Aichholzer). I am (already really desperatly) looking for the master thesis of T. Ono: A (Markov) Chain Approach to Random Generation of Triangulation I would be very grateful if you were able to tell me any sources where I could try to get it or maybe even send me a copy of it. Thanks in advance! Reinbacher Iris TU Graz Austria ------------- 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 John.Dickinson at nrc.ca Wed Jan 19 16:15:55 2000 From: John.Dickinson at nrc.ca (Dickinson, John) Date: Mon Jan 9 13:40:56 2006 Subject: Convolution of triangle meshes Message-ID: <35C5DD9F60FED21192B00004ACA6E6C77AFF91@nrclonex1.imti.nrc.ca> I need to expand a triangle mesh before doing intersection checks to ensure minimum separation distances between objects. The operation in image processing on a 2D grid would be known as convolution. Has work been done on this in 3D for free-form surfaces described by triangular meshes? I'll take any references people have even if it doesn't directly apply to meshed surfaces. 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From John.Dickinson at nrc.ca Wed Jan 19 16:38:07 2000 From: John.Dickinson at nrc.ca (Dickinson, John) Date: Mon Jan 9 13:40:56 2006 Subject: topological reconstruction of triangular meshes Message-ID: <35C5DD9F60FED21192B00004ACA6E6C77AFF92@nrclonex1.imti.nrc.ca> I am also looking for algorithms or even code that reconstruct topological information from a list of triangles. I mean tha I have a list of triangles with their surface normal and 3 vertex points specified in 3-space like: normal (nx,ny,nz) vextices 1:(x,y,z) 2:(x,y,z) 3:(x,y,z) normal (nx,ny,nz) vextices 1:(x,y,z) 2:(x,y,z) 3:(x,y,z) ... and I want to create two lists: vertices 1: (x,y,z) 2: (x,y,z) 3: (x,y,z) 4: (x,y,z) ... and triangles 1: use vertices 1,3,5 2: use vertices 2,4,5 ... etc. Note that the vertex coordinates "should" match in the data input but some loss of precision is often encountered leading to difficulties in matching vertices from different triangles together. 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://uiuc.edu/~sariel/CG/compgeom/threads.html. From gd2000 at cs.virginia.edu Fri Jan 21 17:58:15 2000 From: gd2000 at cs.virginia.edu (Graphics 2000 Conference) Date: Mon Jan 9 13:40:56 2006 Subject: CFP: Symposium on Graph Drawing (GD 2000) Message-ID: <200001212258.RAA19805@viper.cs.Virginia.EDU> Please forward this CFP to any of your colleagues who might be interested. ........................................................................ Graph Drawing 2000 Preliminary Call for Papers Colonial Williamsburg (Virginia, USA) September 20-23, 2000 http://www.cs.virginia.edu/~gd2000/ * Deadlines: ---------- o Submissions: May 24, 2000 o Notification of acceptance: July 19, 2000 o Early Registration: July 31, 2000 (Late registration TBA.) o Camera-ready copies of accepted papers: September 20, 2000 * Location: Colonial Williamsburg offers a peaceful retreat atmosphere. Located on the grounds of the 18th-century Historic Area Visitor Center, the conference is also conveniently located to shopping, restaurants, golf and more, all within walking distance. Colonial Williamsburg is located 150 miles south of Washington, D.C. on Interstate 64. Richmond International Airport is less than 50 minutes away -- rental car and shuttle service is available. Train and bus service are available from Washington, D.C. For more information on Colonial Williamsburg, visit: http://www.history.org/ * Scope: The symposium is a forum for researchers and practitioners working on all aspects of graph visualization and representation. The range of topics considered in graph drawing includes graph algorithms, graph theory, geometry, topology, visual languages, visual perception, information visualization, computer-human interaction, and graphic design. Much research in graph drawing is motivated by applications to systems for viewing and interacting with graphs. The interaction between theoretical advances and implemented solutions is an important part of the graph-drawing field. * Call for Papers and Demos: Authors are invited to submit papers describing original research of theoretical or practical significance to graph drawing. System demonstrations are also solicited. Descriptions of system demos should include illustrative screen dumps and an explanation of the system's functionality. Regular papers and demo descriptions should be labeled as either long or short; long papers will be assigned 12 pages in the conference proceedings, and short papers 6 pages. * Graph Drawing Contest: Following the tradition of previous conferences, a graph drawing contest will be held. Details will appear on the website later this Spring. * Submissions: Submitted papers and demo descriptions must be received by May 24, 2000. Each submission should include an indication of its type (paper or demo description) and length (regular or short), and contact information for the primary author. Electronic submissions in standard PostScript should be sent by e-mail. Alternatively, 16 hard copies of the submission can be mailed to the program chair. All submissions received will be acknowledged promptly by e-mail. * Proceedings: Accepted papers will be published in the conference proceedings, which will appear in the Springer-Verlag series Lecture Notes in Computer Science. Camera-ready and electronic copies of accepted papers are due at the conference. Instructions for Authors will be available after the paper notification deadline. All participants will receive a copy of the proceedings as part of their registration. * Program Committee: ------------------ Therese Biedl, University of Waterloo Peter Eades, University of Newcastle Wendy Feng, Tom Sawyer Software Ashim Garg, SUNY Buffalo Michael Goodrich, Johns Hopkins Michael Kaufmann, University of Tubingen Jan Kratochvil, Charles University Giuseppe Liotta, University of Perugia Joe Marks (chair), MERL Stephen North, AT&T Research Kathy Ryall, University of Virginia Kozo Sugiyama, JAIST Roberto Tamassia, Brown University Robin Thomas, Georgia Tech. Dorothea Wagner, University of Konstanz Stephen Wismath, University of Lethbridge * Organizing Committee: --------------------- Joe Marks, MERL Janet O'Halloran, MERL Kathy Ryall (chair), University of Virginia * Contest Committee: ------------------ Franz Brandenburg (chair), University of Passau * Contact Information: -------------------- o Conference URL: www.cs.virginia.edu/~gd2000/ o Conference Organization: gd2000@cs.virginia.edu o Electronic Submission: gd2000subm@merl.com o Hard-copy Submission: Joe Marks MERL, 201 Broadway Cambridge, MA 02139, USA Phone: 617-621-7534 ........................................................................ ------------- 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 snoeyink at cs.unc.edu Sat Jan 22 08:15:05 2000 From: snoeyink at cs.unc.edu (Jack Snoeyink) Date: Mon Jan 9 13:40:56 2006 Subject: Reminder to volunteer to review proposals for NSF, if you are able Message-ID: <005401bf64da$bf60bf20$a4840298@cs.unc.edu> Sorry for the broadcast, but your assistance could help the US-based members of our community. NSF is being flooded with proposals for its Information Technology Research program, which is targetted towards long-term, including theoretical, research. There are two categories (<=500K and >500K) and those who apply to a category cannot review for that category, which makes it difficult for NSF to find reviewers for its two-day panels. To the US-based members of our community that have applied, it is important that NSF finds panel reviewers that can speak to the quality of the research proposed. If you willing and able to travel to a panel meeting, please consider volunteering. See http://www.itr.nsf.gov for the details on the Information Technology Research program, or http://www.itr.nsf.gov/panelist/ to volunteer. I've included the dates below. Jack Snoeyink@cs.unc.edu UNC Chapel Hill, Computer Science CB 3175, Sitterson Hall, Chapel Hill, NC 27599-3175 USA http://www.cs.unc.edu/~snoeyink ph+1(919)962-1969 fax+1(919)962-1799 Preproposal panels (You will only be asked for one of the following two meeting dates). These review preproposals for the awards with budgets over $500K. 7-8 February 2000 (click if available): 10-11 February 2000 (click if available): ---------------------------------------------------------------------------- ---- Full proposal panels, proposals with budgets not over $500K (You will only be asked for one of the following dates): 20-21 March 2000 (click if available): 23-24 March 2000 (click if available): 27-28 March 2000 (click if available): 30-31 March 2000 (click if available): ---------------------------------------------------------------------------- ---- Full proposal panels, proposals with budgets over $500K (You will only be asked for one of the following dates): 22-23 May 2000 (click if available): 25-26 May 2000 (click if available): ---------------------------------------------------------------------------- ---- Click here if you prefer to attend panels meeting near Washington, DC: or on the West Coast: or in the Midwest: We'll try to follow your preferences, but subject expertise is more important than travel, and we may have to suggest a panel meeting somewhere else. We anticipate that the meetings on Mon-Fri will be in the vicinity of NSF (Arlington, Va.) and the meetings on Thu-Fri will be either in Chicago or the San Francisco areas, although the details are not certain. ------------- 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 John.Watton at alcoa.com Sun Jan 23 11:43:52 2000 From: John.Watton at alcoa.com (Watton, John D.) Date: Mon Jan 9 13:40:56 2006 Subject: topological reconstruction of triangular meshes Message-ID: <5D53FF24216DD311ABFA0000E8961A3308AA1A@na-atc1.atc.alcoa.com> You might want to check out admesh: http://www.varlog.com/products/admesh/ Source is provided in C for reading STL files which are basically triangles with vertex and normal information. The purpose of the program is to repair STL files but it does write OFF and VRML files which are formats similar to what you want back. The usual technique is to hash the triangles with the vertices as keys in order to collect shared vertices together. In order to handle tolerancing the vertex coords are divided by a tolerance and rounded. Be careful though, the integer values get large as tol goes down and integer overflows can occur. John Watton Alcoa Inc. ------------- 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 brd at snow.cs.dartmouth.edu Sun Jan 23 10:08:26 2000 From: brd at snow.cs.dartmouth.edu (Bruce Randall Donald) Date: Mon Jan 9 13:40:56 2006 Subject: WAFR 2000 Accepted Papers Message-ID: <200001231508.KAA30543@snow.cs.dartmouth.edu> WAFR 2000 Fourth International Workshop on Algorithmic Foundations of Robotics March 16-18 Dartmouth Hanover, NH http://www.cs.dartmouth.edu/~wafr/ The following papers were accepted for presentation at WAFR 2000. Further information about the conference is available at the WAFR 2000 Web site. ==================================================================== List of accepted papers Kinematic tolerance analysis with configuration spaces: method and case study --- L. Joskowicz, E. Sacks Encoders for spherical motion using discrete sensors --- E. Scheinerman, G. S. Chirikjian, D. Stein On Random Sampling in Contact Configuration Space --- X. Ji and J. Xiao AutoBalancer: An Online Dynamic Balance Compensation Scheme for Humanoid Robots --- S. Kagami, F. Kanehiro, Y. Tamiya, M. Inaba, H. Inoue Deformable Free Space Tilings for Kinetic Collision Detection --- P. Agarwal, J. Basch, L. Guibas, J. Hershberger, L. Zhang Real-time Global Deformations --- Y. Zhuang, J. Canny Planning for coordinated vehicles with bounded curvature --- A. Bicchi, L. Pallottino Randomized Path Planning for a Rigid Body Based on Hardware Accelerated Voronoi Sampling --- C. Pisula, K. Hoff, M. Lin, D. Manocha Manipulation of Pose Distributions --- Mark Moll, M. A. Erdmann Controlled Module Density Helps Reconfiguration Planning --- A. Nguyen, L. Guibas, M. Yim Positioning Symmetric and Non-Symmetric Parts using Radial and Constant Force Fields --- F. Lamiraux, L. Kavraki Weighted Region Optimal Path Problem --- J. Reif, Z. Sun Complete Distributed Coverage of Rectilinear Environments --- Z. J. Butler, A. A. Rizzi, R. L. Hollis Closed-Loop Distributed Manipulation Using Discrete Actuator Arrays --- J. E. Luntz, W. Messner, H. Choset Pulling Motion Based Tactile Sensing --- M. Kaneko, T. Tsuji Rapidly-Exploring Random Trees: Progress and Prospects --- S. M. LaValle, J. J. Kuffner Steering Algorithms for Dynamic Robotic Locomotion Systems --- J. P. Ostrowski, K. A. McIsaac Compensatory Grasping with the Parallel Jaw Gripper --- T. Zhang, G. Smith, K. Goldberg Reliable Mobile Robot Navigation From Unreliable Visual Cues --- A. J. Briggs, D. Scharstein, S. D. Abbott A Kinematics-Based Probabilistic Roadmap Method for Closed Chain Systems --- L. Han, N. M. Amato Toward Real-Time Motion Planning in Dynamic Environments --- P. Leven, S. Hutchinson Graphical Construction of Time Optimal Trajectories for Differential Drive Robots --- D. J. Balkcom, M. T. Mason Coupled Oscillators for Legged Robots --- M. D. Berkemeier Motion Planning for Kinematic Stratified Systems with Application to Quasi-Static Legged Locomotion and Finger Gaiting --- B. Goodwine, J. Burdick ==================================================================== Bruce Donald (for the WAFR Chairs). For further enquiries, please contact: wafr@cs.dartmouth.edu ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From erginduran at hotmail.com Mon Jan 24 13:15:27 2000 From: erginduran at hotmail.com (ergin duran) Date: Mon Jan 9 13:40:56 2006 Subject: Curves Morphing on Trimed Surfaces. Message-ID: <20000124121527.57480.qmail@hotmail.com> Hello, The description: multi curve contour morphing on multi surfaces (trimmed). Therefore, the equation of the curves must follow the equation of the surfaces. In some cases one curve must follow an equation of two trimmed surface equation with the small gap in between. The definitions of the surfaces and curves can be in any form, such as Bezier or Nurbs .. I know sound a little weird but is there any thing similar. At least one can give me some ideas on the limitations of the current computational solutions available on internet or in some books or some publications…? I will appreciate for any answer related. Sincerely, My name is Ergin Duran e-mail address : erginduran@hotmail.com ______________________________________________________ Get Your Private, Free Email at http://www.hotmail.com ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From emo at inf.ethz.ch Wed Jan 26 12:27:37 2000 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:40:56 2006 Subject: ESA 2000 - Call for Papers Message-ID: <200001261127.MAA13428@shadow.inf.ethz.ch> ESA 2000 - Call for Papers 8th Annual European Symposium on Algorithms 5 - 8 September 2000 Max-Planck-Institut fuer Informatik, Saarbruecken, Germany Scope The Symposium covers research in the use, design, and analysis of efficient algorithms and data structures in computer science, discrete applied mathematics and mathematical programming. ESA 2000 is jointly organized with WAE 2000 and APPROX 2000 in the framework of CONF 2000. For general information, please see http://www.mpi-sb.mpg.de/~conf2000 . Topics Papers are solicited describing original results in all areas of algorithmic research, including but not limited to: Approximation Algorithms; Machine Learning; Combinatorial Optimization; On-line Algorithms; Computational Biology; Parallel and Distributed Computing; Computational Geometry; Pattern Matching and Data Compression; Databases and Information Retrieval; Randomized Algorithms; External-memory Algorithms; Symbolic Computation. Graph and Network Algorithms; The algorithms may be sequential, distributed or parallel, and they should be analyzed either mathematically or by rigorous computational experiments. Submissions that report on experimental and applied research are especially encouraged. Important Dates Submission of Papers March 26, 2000 Notification of Acceptance May 15, 2000 Final Version due June 4, 2000 Conference September 5-8, 2000 Programme Committee Lars Arge (Duke) Mike Paterson (Chair)(Warwick) Yossi Azar (Tel Aviv) Marco Pellegrini (CNR, Pisa) Leslie Goldberg (Warwick) R. Ravi (Carnegie-Mellon) Mike Juenger (Koeln) Jan van Leeuwen (Utrecht) Danny Krizanc (Wesleyan) Emo Welzl (ETH, Zuerich) Alessandro Panconesi (Bologna) Publication Proceedings will be published in the Springer series Lecture Notes in Computer Science. Previous proceedings of ESA, 1998 in Venice and 1999 in Prague, appeared as LNCS 1461 and LNCS 1643. Submission Guidelines Submissions should consist of an extended abstract describing original research in no more than 10 pages and an optional appendix, with more details to be read/consulted at the discretion of the programme committee. The submission should give the author's email address and fax number if available. Electronic submissions are solicited. A detailed description of the electronic submission process will be available at http://www.mpi-sb.mpg.de/~conf2000/esa2000/subm.html . The postscript file must be received by 11:59pm (BST) on March 26, 2000, for your submission to be considered. In extreme cases, contributions may be submitted by sending 6 hard copies to: Mike Paterson, ESA 2000 Department of Computer Science University of Warwick Coventry, CV4 7AL, UK Your hard copy submission must be received by March 26 (or postmarked March 19 or earlier and sent by airmail) in order to be considered. Simultaneous submission to other conferences with published proceedings is not allowed except to APPROX 2000 with the understanding that if the paper is accepted to ESA 2000 then the paper will be withdrawn from APPROX 2000 immediately by sending an email message to kj@informatik.uni-kiel.de. 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. For more information see http://www.mpi-sb.mpg.de/~conf2000/esa2000/ or contact Mike Paterson (msp@dcs.warwick.ac.uk). ------------- 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 han at simsan.skku.ac.kr Sat Jan 29 13:26:49 2000 From: han at simsan.skku.ac.kr (JungHyun Han) Date: Mon Jan 9 13:40:56 2006 Subject: openings in Korea Message-ID: <004901bf6a11$12628ce0$2735fccb@skku.ac.kr> The School of Electrical and Computer Engineering at Sung Kyun Kwan University has immediate openings for three research faculty positions at the Assistant or Associate Professor level. These positions are for the three-year research project entitled "Image-based Internet VR and agent technologies for intelligent Electronic Commerce" funded by the Brain Korea 21 program of the Ministry of Education, Republic of Korea and Samsung Advanced Institute of Science and Technology. Areas of interest are (1) computer graphics or computational geometry, (2) computer vision, and (3) agent technologies for Electronic Commerce. Candidates must have a doctorate in computer science or a related field. The positions will remain open until they are filled; however, potential candidates are urged to submit their resumes via email until Feb. 10 for favorable considerations. The initial appointment is for one year with the possibility of renewal. However, two-year appointment will be considered for excellent candidates, still with the possible renewal for an additional year. The annual salary is 24,000,000 won (approximately US$21,000). Considering the low income taxes and living cost in Korea, the salary may amount to more than US$40,000. There is also generous travel support for international conferences. Sung Kyun Kwan University(SKKU) is the oldest university in Korea, established in 1398. SKKU is ranked 5th in Korea and 28th in Asia by Asia Week. SKKU has been experiencing a rapid growth lately since Samsung participated in running the University. The School of Electrical and Computer Engineering currently has 46 full-time faculty members, and offers BS/MS/PhD programs to approximately 1200 undergraduate majors and 350 graduate students. Support to the new faculty is quite excellent. Located 15 miles south of Seoul and surrounded by high-tech industries such as Samsung, SKKU combines a small town atmosphere with the advantages of a major metropolitan area. The quality of life is extraordinary, and the opportunities for consulting and joint research with industry are excellent. Please email a resume including the applicant's email address and a list of references to: Dr. Han, JungHyun (for computer graphics), Dr. Yi, June-Ho (for computer vision), or Dr. Lee, Eun-Seok (for agent technologies for Electronic Commerce). If you are interested in interdisciplinary research encompassing more than two areas, or have inquiries in the overall project, please contact Dr. Han. Dr. Han, JungHyun School of Electrical and Computer Engineering Sungkyunkwan University, Suwon, Korea 440-746 Tel: +82-331-290-7140 Fax: +82-331-290-7211 Email: han@ece.skku.ac.kr WWW: http://graphics.skku.ac.kr Dr. Yi, June-Ho Tel: +82-331-290-7142 Fax: +82-331-290-7231 Email: jhyi@yurim.skku.ac.kr WWW: http://vulcan.skku.ac.kr Dr. Lee, Eun-Seok Tel: +82-331-290-7135 Fax: +82-331-290-7211 Email: eslee@seopo.skku.ac.kr WWW: http://seopo.skku.ac.kr ------------------------------------------------ Han, JungHyun School of Electrical and Computer Engineering Sung Kyun Kwan University Suwon, 440-746, Korea +82-331-290-7140 (phone) +82-331-290-7211 (fax) http://graphics.skku.ac.kr ------------------------------------------------ -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20000129/89986d3b/attachment.htm From jopsi at mpi-sb.mpg.de Mon Jan 31 20:26:44 2000 From: jopsi at mpi-sb.mpg.de (jopsi@mpi-sb.mpg.de) Date: Mon Jan 9 13:40:56 2006 Subject: ESA, WAE, APPROX caal for papers Message-ID: <200001311926.UAA15397@mpii01704.ag1.mpi-sb.mpg.de> ----------------------------------------------------------------- Call for papers: ---------------- ESA 2000 APPROX 2000 WAE 2000 Max-Planck-Institut fuer Informatik Saarbruecken, 5-9 until 8-9 The above three conferences in the areas of Algorithms, Approximation and Algorithms Engineering are jointly organized in Saarbruecken, Germany. The deadlines for submission of papers are as follows: ESA 2000: March 26 APPROX 2000: April 3 WAE 2000: May 5 For more details have a look at the website of the conferences at http://www.mpi-sb.mpg.de/~conf2000 ----------------------------------------------------------------- ------------- 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/maillist.html.