From scot at moosilauke.cs.dartmouth.edu Sun Dec 3 20:46:01 2000 From: scot at moosilauke.cs.dartmouth.edu (Scot Drysdale) Date: Mon Jan 9 13:40:59 2006 Subject: Faculty Positions at Dartmouth Message-ID: <200012021611.LAA01506@moosilauke.cs.dartmouth.edu> LISTSERV.dartmouth.edu, compgeom-announce@research.bell-labs.com, sigcse.members@acm.org Date: Sat, 2 Dec 2000 11:11:05 -0500 (EST) Cc: scot@moosilauke.cs.dartmouth.edu (Scot Drysdale) X-Mailer: ELM [version 2.5 PL0pre8] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit DARTMOUTH COLLEGE Faculty Positions in Computer Science The Department of Computer Science anticipates hiring one or more Assistant Professors of Computer Science. We are particularly interested in candidates in the areas of algorithms, graphics, security, and databases. The Department of Computer Science currently includes 14 tenure-track faculty members. In addition, several faculty members in the Thayer School of Engineering and the Department of Mathematics have research interests related to computer science and hold joint or adjunct appointments in Computer Science. Dartmouth College is a highly selective Ivy League university with approximately 4000 undergraduates and 1000 graduate students. It combines the advantages of a small liberal arts college (small class size, excellent students, and close student-faculty interaction) with the research activities of a university. As an indication of this dual commitment, research and teaching both count strongly in decisions on hiring, promotion, and tenure. Persons interested should submit a curriculum vitae and a list of at least four references, at least one of whom can comment on teaching. Review of the applications will begin immediately and will continue until the search is complete. Please send application materials and general inquiries to Delia Mauceli, Computer Science Recruiting, Department of Computer Science, Dartmouth College, 6211 Sudikoff Laboratory, Hanover, NH 03755-3510. Specific questions can be referred to Scot Drysdale, at the same address or at the following email address (facapps@cs.dartmouth.edu). Information on faculty and their research, facilities, graduate students, etc. is available over the World Wide Web at URL http://www.cs.dartmouth.edu. Dartmouth is an equal opportunity/Affirmative Action employer and encourages applications from women and members of minority groups. ------------- 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. From cterlapu at cse.unl.edu Mon Dec 4 15:49:43 2000 From: cterlapu at cse.unl.edu (Chakravarthy Terlapu) Date: Mon Jan 9 13:40:59 2006 Subject: shrink wrap technique Message-ID: Hi, I have a minimum bounding rectangle around a string(eg. I have a rectangle box around NEBRASKA), but the rectangle is slightly bigger than the string. I have to shrink the rectangle such that it exactly encloses the string. Is there a way I can do this. It would be great if anyone could help me. Thanks in advance Chak Terlapu ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From roman at cs.wustl.edu Tue Dec 5 20:28:14 2000 From: roman at cs.wustl.edu (Catalin Roman) Date: Mon Jan 9 13:40:59 2006 Subject: Faculty Positions at Washington University in Saint Louis Message-ID: Washington University in Saint Louis Department of Computer Science www.cs.wustl.edu 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. Building upon the impressive recruiting successes of the last two years that included eight new tenure-track faculty, the Department plans to fill three additional faculty positions. The Department continues to seek outstanding candidates likely to develop synergistic relationships with existing areas of research excellence. 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. With the strong backing of the University and the School of Engineering and Applied Science, 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. Candidates with a strong background in networking (including wireless communication and security), software systems (particularly embedded systems, mobile computing and database), computer engineering, theory, and artificial intelligence will receive special consideration. The Department enjoys a great research reputation and impressive levels of research activity, e.g., annual research expenditures recently reached a record $450,000 per faculty member. Research areas which are well represented in the Department include: networking and communications; distributed software systems; graphics and computer vision; artificial intelligence; computer and system architecture; and computational biology. Our doctoral graduates have been heading for successful careers in academia and industrial research centers while noteworthy entrepreneurial endeavors spearheaded by our faculty and graduates (with the full support of the University) attest to a highly respected technology transfer tradition and culture. Strict limits on University undergraduate enrollments combined with the increasing popularity of Washington University allows the Department to continue to offer small classes and close personal attention to a diverse student body of exceptional quality and to benefit from strong participation by undergraduates on a wide range of research projects. A faculty known for its friendly, accepting and supportive nature provides a welcoming and mentoring environment for new arrivals. Finally, progressive fiscal policies that reward research, teaching, and innovation by the Department have created an environment rich in resources that fosters a readiness to invest in promising new initiatives. 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 $3.5 billion, among the largest in the nation), its ambitious investments in physical facilities, and its commitment to research excellence. The University is located in the midst of a delightful residential community which places much value on education and culture and is very popular with both faculty and students. 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, 2001, 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From samitch at sandia.gov Fri Dec 8 13:25:44 2000 From: samitch at sandia.gov (Scott Mitchell) Date: Mon Jan 9 13:40:59 2006 Subject: Meshing Job Opportunity Message-ID: <3A3143C8.9E19A6AC@sandia.gov> We're actively looking to hire more people in the area of mesh generation and related technologies. Experience with meshing is a plus, but is not a requirement. Please see the following link: http://www.cfd-online.com/Mesh_Jobs/showjob.php3?record_id=29 Thanks - Scott A. Mitchell ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From hil at iis.sinica.edu.tw Mon Dec 11 17:34:47 2000 From: hil at iis.sinica.edu.tw (Hsueh-I Lu) Date: Mon Jan 9 13:40:59 2006 Subject: Final Program, ISAAC'00, Taipei, Taiwan Message-ID: 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000) Final Program December 18--20, 2000 Institute of Information Science, Academia Sinica Taipei, Taiwan http://www.iis.sinica.edu.tw/isaac00/ -------- Sponsors -------- Academia Sinica National Science Council of ROC ACM Taipei/Taiwan Chapter The Inst. of Info. and Comput. Mach. (IICM) ----------------- Program Committee ----------------- Co-chair: D. T. Lee, Academia Sinica Co-chair: Shang-Hua Teng, Univ. of Illinois Helmut Alt, Free University of Berlin Nina Amenta, Univ. of Texas at Austin Gen-Huey Chen, National Taiwan Univ. Jeff Erickson, University of Illinois Giuseppe Italiano, University of Rome Kazuo Iwama, Kyoto University Marcos Kiwi, University of Chile Ming-Tat Ko, Academia Sinica Kurt Mehlhorn, Max Planck Institute Michael D. Mitzenmacher, Harvard Univ. Kunsoo Park, Seoul National University Tadao Takaoka, University of Canterbury Takeshi Tokuyama, Sendi University Peng-Jun Wan, Illinois Inst. of Technology Derick Wood, Hong Kong Univ. Sci. & Tech. =================== Sunday, December 17 =================== 6:30--9PM Reception, Western-style Resturant, Academia Sinica (located right behind the Activity Center) =================== Monday, December 18 =================== 9:00--10:00 Invited Talk (Chair: D.T. Lee) Voronoi-Based Systems of Coordinates and Surface Reconstruction, Jean-Daniel Boissonnat (INRIA, Unit\'e de Sophia Antipolis). ------------------------------------------ 10:30--12:00 (Chair: Kunsoo Park) Session 1A: Algorithms and Data Structures ------------------------------------------ Strategies for Hotlink Assignments (P. Bose, J. Czyzowicz, L. Gasieniec, E. Kranakis, D. Krizanc, A. Pelc, M. Martin) A New Competitive Analysis of Randomized Caching (C. Law and C. E. Leiserson) Online Routing in Convex Subdivisions (P. Bose, A. Brodnik, S. Carlsson, E. Demaine, R. Fleischer, A. Lopez-Ortiz, P. Morin, J. Munro) ------------------------------------------ 10:30--12:00 (Chair: Xiaotie Deng) Session 1B: Combinatorial Optimization ------------------------------------------ A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors (J. Huang, J. Chen, S. Chen) Classification of Various Neighborhood Operations for the Nurse Scheduling Problem (T. Osogami, H. Imai) Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets (Y. Chen, M.-Y. Kao, H.-I. Lu) ------------------------------------------ 2:00--3:30 (Chair: Takao Nishizeki) Session 2A: Algorithms and Data Structures ------------------------------------------ Coping with Delays and Time-Outs in Binary Search Procedures (F. Cicalese, U. Vaccaro) Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm (Z. Chen, B. Zhu) Reasoning with Ordered Binary Decision Diagrams (T. Horiyama, T. Ibaraki) ------------------------------------------ 2:00--3:30 (Chair: Kazuo Iwama) Session 2B: Approximation and Randomized Algorithms ------------------------------------------ On Approximating Minimum Vertex Cover for Graphs with Perfect Matching (J. Chen, I. A. Kanj) 2-Approximation Algorithm for Path Coloring on Trees of Rings (X. Deng, G. Li, W. Zang, Y. Zhou) An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree (Q. S. Wu, C. L. Lu, R. C. T. Lee) ------------------------------------------ 4:00--5:30 (Chair: Helmut Alt) Session 3A: Algorithms and Data Structures ------------------------------------------ Finding Independent Spanning Trees in Partial $k$-Trees (X. Zhou, T. Nishizeki) On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover (R. Niedermeier, P. Rossmanith) Constructive Linear-Time Algorithms for Small Cutwidth and Carving-Width (D. M. Thilikos, M. J. Serna, H. L. Bodlaender) ------------------------------------------ 4:00--5:30 (Chair: Yuh-Dauh Lyuu) Session 3B: Approximation and Randomized Algorithms ------------------------------------------ Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits (T. Asano, M. M. Halld\'orsson, K. Iwama, T. Matsuda) A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane (N. Kubo, K. Muramoto, S. Shimozono) Simple Algorithms for a Weighted Interval Selection Problem (T. Erlebach, F. C.R. Spieksma) ==================== Tuesday, December 19 ==================== 9:00-10:00 Invited Talk (Chair: Wen-Lian Hsu) Essentially Every Unimodular Matrix Defines an Expander, Jin-Yi Cai (State University of New York at Buffalo, University of Wisconsin) ------------------------------------------ 10:30--12:00 (Chair: Hsu-Chun Yen) Session 4A: Graph Drawing and Algorithms ------------------------------------------ Efficient Minus and Signed Domination in Graphs (C. L. Lu, S.-L. Peng, C. Y. Tang) Convex Grid Drawings of Four-Connected Plane Graphs (K. Miura, S.-i. Nakano, T. Nishizeki) An Algorithm for Finding Three-Dimensional Symmetry in Series-Parallel Digraphs (S.-H. Hong, P. Eades) ------------------------------------------ 10:30--12:00 (Chair: Takeshi Tokuyama) Session 4B: Automata, Cryptography, and Complexity Theory ------------------------------------------ Undecidability Results for Monoids with Linear-Time Decidable Word Problems (M. Katsura, Y. Kobayashi, F. Otto) Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures (R. Yoshikawa, S. Guo, K. Motegi, Y. Igarashi) Derandomizing Arthur-Merlin Games under Uniform Assumptions (C.-J. Lu) ------------------------------------------ 2:00--3:30 (Chair: Tao Jiang) Session 5A: Algorithms and Data Structures ------------------------------------------ A Near Optimal Algorithm for Vertex Connectivity Augmentation (B. Jackson, T. Jordan) Simultaneous Augmentation of Two Graphs to an $\ell$-Edge-Connected Graph and a Biconnected Graph (T. Ishii, H. Nagamochi) Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets (H. Ito, M. Ito, Y. Itatsu, H. Uehara, M. Yokoyama) ------------------------------------------ 2:00--3:30 (Chair: Kuo-Liang Chung)] Session 5B: Parallel and Distributed Algorithms ------------------------------------------ An Intuitive and Effective New Representation for Interconnection Network Structures (J. Chen, W. Jia, L. Liu, S. Chen) Randomized Leader Election Protocols in Radio Networks with no Collision Detection (K. Nakano, S. Olariu) Deterministic Broadcasting Time with Partial Knowledge of the Network (G. De Marco, A. Pelc) ------------------------------------------ 4:00-5:30 (Chair: Danny Z. Chen) Session 6A: Algorithms and Data Structures ------------------------------------------ Minimizing Makespan in Batch Machine Scheduling (C. K. Poon, P. Zhang) Preemptive Parallel Task Scheduling in O(n)+poly(m) Time (K. Jansen, L. Porkolab) Compressed Text Databases with Efficient Query Algorithms based on the Comressed Suffix Array (K. Sadakane) ------------------------------------------ 4:00-5:30 (Chair: Yaw-Ling Lin) Session 6B: Computational Geometry ------------------------------------------ A Better Lower Bound for Two-Circle Point Labeling (A. Wolff, M. Thon, Y. Xu) Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set (D.-S. Kim, D. Kim, K. Sugihara) An Improved Algorithm for Subdivision Traversal without Extra Storage (P. Bose, P. Morin) ------------------------------------------------- 6:30-10:00 PM Banquet, Business Meeting, Karaokey (Lai Lai Sheraton Hotel, Downtown Taipei) ------------------------------------------------- ====================== Wednesday, December 20 ====================== ------------------------------------------ 9:00-10:30 (Chair: Tadao Takaoka) Session 7A: Algorithms and Data Structures ------------------------------------------ Generalized H-coloring of Graphs (P. Kristiansen, J. A. Telle) Finding a Two-Core of a Tree in Linear Time (B.-F. Wang, J.-J. Lin) Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparsion (M.-Y. Kao, T.-W. Lam, W.-K. Sung, H.-F. Ting) ------------------------------------------ 9:00-10:30 (Chair: Prosenjit Bose) Session 7B: Computational Geometry ------------------------------------------ Optimal Beam Penetrations in Two and Three Dimensions (D. Z. Chen, X. (S.) Hu, J. Xu) Searching a Simple Polygon by a $k$-searcher (X. Tan) Characterization of Rooms Searchable by Two Guards (S.-M. Park, J.-H. Lee, K.-Y. Chwa) ------------------------------------------ 11:00--12:00 (Chair: Kun-Mao Chao) Session 8A: Computational Biology ------------------------------------------ Improved Phylogeny Comparisons: Non-Shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers (W.-K. Hon, M.-Y. Kao, T.-W. Lam) Phylogenetic $k$-Root and Steiner $k$-Root (G.-H. Lin, P. E. Kearney, T. Jiang) -------------------------------------- 11:00--12:00 (Chair: Rudolf Fleischer) Session 8B: Computational Geometry -------------------------------------- Maintenance of a Piercing Set for Intervals with Applications (M. J. Katz, F. Nielsen, M. Segal) Optimal Polygon Cover Problems and Applications (D. Z. Chen, X. (S.) Hu, X. Wu) ----------------- 2:00 -- Excursion ----------------- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From tech02.nascorp at incimar.com Mon Dec 11 15:50:06 2000 From: tech02.nascorp at incimar.com (Philipp Kobler) Date: Mon Jan 9 13:40:59 2006 Subject: Volume calculation Message-ID: Skipped content of type multipart/alternative-------------- next part -------------- A non-text attachment was scrubbed... Name: laser.jpg Type: image/jpeg Size: 28702 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20001211/abb19832/laser.jpg From lin at cs.unc.edu Mon Dec 11 00:00:58 2000 From: lin at cs.unc.edu (Ming Lin) Date: Mon Jan 9 13:40:59 2006 Subject: a new proximity query library, SWIFT Message-ID: <200012110500.AAA16519@geom.cs.unc.edu> We announce the release of a new proximity query package called SWIFT. SWIFT is a C++ library for collision detection, exact and approximate distance computation, and contact determination of three-dimensional polyhedral objects undergoing rigid motion. SWIFT combines multi-resolution representations with Voronoi based walking (first proposed by Lin and Canny). Some preliminary results indicate that it is faster than I-COLLIDE and V-CLIP, and more robust than I-COLLIDE. It has been successfully applied to virtual prototyping, dynamic simulation, path planning and other applications. It is free for non-commercial use. More information about the package, new proximity query algorithms, MPEG demonstrations and related publications can be found at: http://www.cs.unc.edu/~geom/SWIFT Collide Research Group Computer Science Department University of North Carolina ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From hodges at cs.duke.edu Mon Dec 11 12:18:48 2000 From: hodges at cs.duke.edu (Celeste hodges) Date: Mon Jan 9 13:40:59 2006 Subject: Position Announcement - Duke University Message-ID: <3A350C78.B2862437@cs.duke.edu> VISITING ASSISTANT PROFESSOR POSITION AVAILABLE Center for Geometric and Biological Computing Department of Computer Science Duke University A postdoctoral position at the level of Visiting Assistant Professor is available in the Center for Geometric and Biological Computing, Department of Computer Science at Duke University, for the NSF-ITR Bio-Geometry project funded by the National Science Foundation, under the supervision of Profs. Pankaj Agarwal, Herbert Edelsbrunner, and Homme Hellinga. Duke is an equal opportunity employer. The position, which is contingent upon grant funding, is for one year and can be extended to one or more additional years by mutual consent. The project, a collaborative effort with UNC, Stanford, and NC A&T, aims to develop new computational techniques and paradigms for representing, storing, searching, simulating, analyzing, and visualizing biological structures. Applicants must have clearly demonstrated experience and skills in at least one and familiarity with some of the following areas: algorithms, computational geometry, computational topology, computational biology, molecular modeling, structural biology. Teaching responsibilities include one research course per year on a related topic. Apart from pursuing his or her own research interests, the candidate is expected to play a vital role in the center and to interact closely with the PIs on the project from the three other sites. Additional responsibilities include helping prepare contracts and reports. Please send your CV and a letter of research interests, and ask three evaluators to send letters of reference, by US Mail or email to Ms. Celeste Hodges Department of Computer Science Duke University Box 90129 Durham, NC 27708-0129 Email: hodges@cs.duke.edu Tel: (919) 660-6511 To be assured of full consideration, all material including reference letters must arrive by March 16, 2001. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From george at cs.ucy.ac.cy Sat Dec 9 11:03:24 2000 From: george at cs.ucy.ac.cy (George Angelos Papadopoulos) Date: Mon Jan 9 13:40:59 2006 Subject: Advanced MSc course in Computer Science Message-ID: DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF CYPRUS ADVANCED M.Sc. PROGRAMME IN COMPUTER SCIENCE Dear Student of Computing We would like to inform you of a new Masters Program in Advanced Information Technologies at the University of Cyprus. This program focuses on recent developments in Computer Science, such as Internet Computing, Distributed and Mobile Computing and Intelligent Systems. The course aims to prepare graduates for the industry as well to give a solid foundation for further studies at a doctoral level. More information can be found at http://www.cs.ucy.ac.cy/Education/masters.html . Please note that the language of instruction is Greek. Anyone interested to attend can apply sending an application to: Department of Computer Science (c/o Postgraduate Admissions Coordinator) University of Cyprus 75 Kallipoleos Street P.O. Box 20537 CY-1678 Nicosia CYPRUS This should include: 1. Curriculum Vitae. 2. Copies of degree certificate or certificate of expected graduation in the Summer of 2001. 3. Transcript of degree. 4. Brief (up to 2 pages) statement of purpose and research interests. 5. Names and addresses of two University professors, whom the applicants should request to send letters of reference directly to the Postgraduate Admissions Tutor of the Department. The deadline for application is the 15th February 2001. For further information, you can contact us as follows: E-Mail: cs@cs.ucy.ac.cy Fax: +357-2-339062 Phone: +357-2-892230 Thank you for your interest. Department of Computer Science, University of Cyprus. -- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From emo at inf.ethz.ch Tue Dec 12 16:53:27 2000 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:40:59 2006 Subject: Pre-Doc Program - Combinatorics, Geometry, and Computation - ETH Zurich Message-ID: <200012121553.QAA15103@shadow.inf.ethz.ch> First Call for Applications Pre-Doc Program Combinatorics, Geometry, and Computation (CGC) October 2001 -- March 2002 www.cgc.ethz.ch (At ETH Zurich -- part of Berlin/Zurich CGC Graduate Program) ETH Zurich offers a one-semester study program that focuses on the preparation of a Ph.D. in areas like: Discrete and Computational Geometry; Computer Graphics and Vision; Algorithms Design, Analysis and Implementation; Optimization and Mathematical Programming. Building blocks of the program are four 5-week research oriented courses, a project and the preparation of a proposal for a Ph.D. (see schedule and topics below). ETH offers a limited number of scholarships of Sfr 2'200 per month (for a six months period) for students with a Diploma or Masters in a field related to the topics of the program (including computer science, mathematics, electrical engineering, and physics). There is a possibility of continuing a Ph.D. in the Berlin/Zurich CGC Graduate Program (although it is not automatically implied by acceptance to the PreDoc program). Students who plan to continue their Ph.D. at some other university, or are in the course of doing a Ph.D., are also welcome. Advanced Diploma or Masters students can be considered for a one-semester exchange program as well, if a feasible arrangement with their home universities can be made. The language of the program is English. The program is open to applicants of all nationalities. Students who receive a scholarship are expected to provide teaching assistance. Applications with curriculum vitae, copies of certificates, (diploma/masters) thesis, areas of interest, a letter of recommendation of the last advisor, should be sent to: Emo Welzl Institut Theoretische Informatik ETH Zentrum CH-8092 Zurich Switzerland Application deadlines are Jan 19, 2001, Mar 23, 2001, and May 30, 2001; last deadline dependent on availability. Applicants will be notified of results about one month after the respective deadline. This stepwise procedure allows students to obtain a commitment at an early stage, while leaving some options for those who fulfill the necessary prerequisites only at a later stage. For further information consult the web page of the Berlin/Zurich CGC Graduate Program or email . -------------------------------------------------------------------------- SCHEDULE 2001/2002 (Courses, lecturers, and abstracts below) --------------------------------------- Oct 1 Reading assignments --------------------------------------- Oct 22 Courses -Nov 23 Mo&Tu RandAlgs Th&Fr TopCoGe --------------------------------------- Nov 29 Projects, reading assignments -Dec 19 and presentations --------------------------------------- Jan 7 Courses -Feb 8 Mo&Tu GraphVis Th&Fr ApproxAlgs --------------------------------------- Feb 14 Preparation of Ph.D. proposal -Mar 28 and presentations --------------------------------------- COURSES Courses will be held two days a week, for a five-weeks period. As a rough framework, every day includes 3 hours of lectures, exercises in groups, and a discussion of exercises. RandAlgs Randomized Algorithms (Emo Welzl) Randomized algorithms have by now emerged in many fields, and have lead to several improvements compared to deterministic methods. We will discuss several basic methods in several areas, including graph algorithms and geometry, optimization, discrepancy, and solving of hard problems (e.g. SAT). The emphasis will be on understanding of the basic methods, so that they can be applied in several situations. TopCoGe Topological methods in combinatorics and geometry (Jiri Matousek) One of the important tools for proving results in discrete mathematics are theorems from algebraic topology, most notably various fixed-point theorems. The course covers the basic topological notions and results (simplicial complexes, Borsuk-Ulam theorem and its generalizations etc.) and proofs of several combinatorial and geometric results. The topological notions and results are kept on very elementary level. In particular, knowledge of elementary algebraic topology, like introductory homology theory, is (encouraged but) not required. GraphVis Advanced Topics in Vision and Graphics (Luc van Gool, Markus Gross, Bernt Schiele, Gabor Szekely) Although being two separate disciplines we observe that Graphics and Vision are increasingly converging. Independently developed methods and algorithms are being combined and merged into sophisticated frameworks covering a wide range of applications. In this course we will present a selection of advanced topics in Vision and Graphics illustrating the tight relationship between the two disciplines. We will discuss recent research results and developments in both areas with a special emphasis on modeling and geometry. Topics include the notion of invariance, methods for 3D reconstruction, learning and statistical modeling, mesh signal processing, image based rendering, deformable templates and FEM. The course will be organized into separate modules each of which consists of lectures and practical or theoretical exercises. ApproxAlgs Approximation: Theory and Algorithms (Johannes Bloemer, Maurice Cochand, Thomas Erlebach, Bernd Gaertner, Angelika Steger, Peter Widmayer) This course is concerned with approximation algorithms for NP-hard optimization problems. The topics covered include: basic and advanced approximation algorithms for selected problems; more general techniques such as linear programming relaxation, derandomization, and semidefinite programming; inapproximability and the PCP concept. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From sanders at mpi-sb.mpg.de Wed Dec 13 16:36:11 2000 From: sanders at mpi-sb.mpg.de (Peter Sanders) Date: Mon Jan 9 13:40:59 2006 Subject: Positions at MPI for Computer Science - Algorithms Group Message-ID: <14903.38763.981071.418413@gargle.gargle.HOWL> P O S I T I O N S (Research Associates, Postdocs and PhD-Students) at the M A X - P L A N C K - I N S T I T U T E for C O M P U T E R S C I E N C E The Max-Planck-Institute for Computer Science is located on the campus of the Universit"at des Saarlandes in Saarbr"ucken, Germany. The institute was founded in 1990 and consists, at present, of three research units: Algorithms and Complexity, Logic of Programming, and Computer Graphics. The research group ALGORITHMS AND COMPLEXITY offers - Research Associate Positions - a number of postdoctoral fellowships for the year 2001/2002 - PhD-Positions We are looking for applicants from all areas of algorithmics, e.g., data structures, complexity theory, graph algorithms, approximation algorithms, parallel, distributed, external, online, probabilistic or geometric algorithms. For national and European projects we are particularly looking for applicants interested in - Design and implementation of algorithm libraries - Algorithms and software for handling parallel disks - Integer programming and constraint programming - Internet routing and load balancing algorithms - Geometric algorithms for curves and surfaces The group consists mainly of young researchers of several nationalities. Our working language is English. The group collaborates with several of the major research institutions in Europe and USA and has a high international visibility. There is generous travel support available for all group members. Applications (including curriculum vitae, list of publications, research plan, names of references with their e-mail addresses, and intended period of stay) should be sent by January 31, 2001 to Kurt Mehlhorn Max-Planck-Institut f"ur Informatik Im Stadtwald D-66123 Saarbr"ucken Germany Electronic applications (email to mayer@mpi-sb.mpg.de) are possible but should consist of files easy to process on Unix systems (e.g., Postscript produced by dvips, pdf, ASCII, HTML). Please avoid MS Word documents or unprintable Postscript. For further information refer to http://www.mpi-sb.mpg.de/units/ag1/offers.html or contact Peter Sanders (sanders@mpi-sb.mpg.de). ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From wenk at inf.fu-berlin.de Tue Dec 19 13:37:54 2000 From: wenk at inf.fu-berlin.de (Carola Wenk) Date: Mon Jan 9 13:40:59 2006 Subject: Final Call For Papers CG01 Message-ID: <14911.22178.909543.805886@gargle.gargle.HOWL> FINAL CALL FOR PAPERS Euro-CG 2001 17th European Workshop on Computational Geometry March 26 - 28, 2001 Institute of Computer Science Freie Universitaet Berlin, Germany The 17th European Workshop on Computational Geometry (CG '01) will take place at the Institute of Computer Science of Freie Universit?t Berlin, Germany. The European Workshop on Computational Geometry is an important scientific event in which established researchers from academia, R&D people from industry, research students, and postdocs meet and present their current work, establishing scientific interaction and international collaboration. The goal of the workshop is to bring together researchers in Computational Geometry, facilitating - in an informal atmosphere - the spreading of their most recent work. Invited speakers: Heinrich Mueller, Universitaet Dortmund Jack Snoeyink, University of North Carolina at Chapel Hill Emo Welzl, ETH Zuerich Submissions: A title and a brief abstract (2-4 pages) should be submitted before January 7th, 2001 (preferrably as a postscript-file to cg01@inf.fu-berlin.de). The abstracts will be collected and distributed among the participants at the workshop. There will be no other proceedings so that preliminary work can be presented which may later appear in a more complete form at a larger conference. A special issue of ``Computational Geometry: Theory and Applications'' will be dedicated to outstanding results presented at the workshop. In order to provide a consistent layout of the collection of abstracts we encourage authors to write the abstracts in LATEX using our LATEX frame file at http://www.inf.fu-berlin.de/~cg01/frame.tex. Please submit the resulting postscript file via e-mail to cg01@inf.fu-berlin.de . If e-mail is not available, please send 2 copies to EURO CG 2001 c/o Carola Wenk Freie Universit?t Berlin Institute of Computer Science Takustr. 9 14195 Berlin Germany Important dates: Deadline for submissions: January 7th, 2001 Notification of acceptance: January 19th, 2001 Deadline for hotel registration: January 26th, 2001 Deadline for registration: February 25th, 2001 For more information see our webpage http://www.inf.fu-berlin.de/~cg01 or contact cg01@inf.fu-berlin.de . ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From marina at cpsc.ucalgary.ca Mon Dec 18 19:08:33 2000 From: marina at cpsc.ucalgary.ca (Marina Gavrilova) Date: Mon Jan 9 13:40:59 2006 Subject: CG Workshop, ICCS'2001 Message-ID: <3A3EC321.7ADCF6B5@cpsc.ucalgary.ca> Dear Colleagues, Please allow me to bring to your attention the following initiative. Thank you very much for your time, Best regards, Marina Gavrilova --------------------------------------------------------------- --------------------------------------------------------------- CALL FOR PAPERS for INTERNATIONAL WORKSHOP on COMPUTATIONAL GEOMETRY AND APPLICATIONS in conjunction with THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE 2001 San Francisco, California, USA May 28 - 30, 2001 http://www.ucalgary.ca/iccs Workshop Description -------------------------------- Papers presenting the results of original research in all areas of computational geometry and related areas, are invited for submission. The workshop web site is accessible by following a link from the ICCS web site http://www.ucalgary.ca/iccs or directly at http://www.cpsc.ucalgary.ca/~marina/Newweb/session.htm. Topics of interest include, but are not limited to: COMPUTATIONAL GEOMETRY ----------------------------------------------- Point Location Range Searching Visibility Graphs Space Partitioning Voronoi Diagrams and Delaunay triangulations Convex Hulls Arrangements of Hyperplanes Nearest-Neighbor Search Proximity Problems Parallel Computational Geometry GIS (Geographical Information Systems) --------------------------------------------------------- Mesh Generation Surface Simplification Interpolation and Surface Reconstruction Data Models and Representation Relational Databases Spacial and Terrain Analysis COMPUTER GRAPHICS AND VISION ------------------------------------------------------- Image Synthesis Image Representation and Rendering Model-Based Recognition Image Segmentation AREAS RELATED TO CG -------------------------------------- Exact Computation Robotics Solid Modeling CAD/CAM Molecular biology Astrophysics Physics Mechanics Other related areas The design and implementation of algorithms in parallel and distributed environments, and applications of such methods to mechanics and physics, are of special interest. Paper Submission ------------------------- We invite you to submit a: full paper of 6 to 10 pages (Letter or A4 paper) for oral presentation short paper of 2 to 4 pages (Letter or A4 paper) for poster presentation. Please include a cover page which lists the following: - name, affiliation, address and e-mail address of each author - name of the presenting author - name of the contact author - a maximum of 5 keywords - 3 nominated referees and contact information of all nominated referees The submitted paper must be camera-ready and formatted according to the rules of LNCS. See http://www.springer.de/comp/lncs/authors.html for formatting information. Please follow the guidelines posted at http://www.ucalgary.ca/iccs to format your submission. Electronic submissions in PS, PDF, LaTex or MS Word format are accepted. Hard copies should be mailed only if electronic submission is not possible. Submission implies the willingness of at least one of the authors to register and present the paper. Proceedings ------------------ The proceedings of the Conference will be published in the Springer-Verlag Lecture Notes in Computer Science (LNCS) series. Important Dates ---------------------- January 19, 2001: Draft papers due March 1, 2001: Notification of Acceptance March 29, 2001: Camera Ready Papers and Pre-registration due May 28 - 30, 2001: ICCS 2001 Conference Contact Information ----------------------------- All submissions to Computational Geometry and Applications Workshop can be forwarded to: Dr. Marina L. Gavrilova, Program Committee Member, Special Events Committee Member, ICCS'2001 Department of Computer Science, University of Calgary, 2500 University Drive, Calgary, Alberta, Canada, T2N1N4 Telephone: (403) 241-6315 Fax: (403) 284-4707 E-mail: marina@cpsc.ucalgary.ca Papers can be also submitted to: ICCS 2001 Department of Computer Science University of Reading Reading RG6 6AY United Kingdom Telephone: 44-118-931-6722 Fax: 44-118-975-1994 E-mail: iccs2001@csres.cs.rdg.ac.uk Electonic submissions are 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From amenta at cs.utexas.edu Fri Dec 22 15:09:16 2000 From: amenta at cs.utexas.edu (Nina Amenta) Date: Mon Jan 9 13:40:59 2006 Subject: surface reconstruction software Message-ID: <200012222109.PAA15910@corn.cs.utexas.edu> Source code and research papers about our recent Power Crust algorithm for three-dimensional surface reconstruction are now available. This algorithm always outputs the boundary of a three-dimensional solid, so it tends to be pretty robust in practice (as well at correct in a theoretical sense). It also outputs an estimate of the medial axis of the object, which can be simplified to include only features which are stable with respect to noise. Please enjoy! http://www.cs.utexas.edu/users/amenta/powercrust/ ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.