From dls at eecs.tufts.edu Sat Sep 2 15:20:51 2000 From: dls at eecs.tufts.edu (Diane Souvaine) Date: Mon Jan 9 13:40:58 2006 Subject: ACM Symposium on Computional Geometry 2001: Call for Papers Message-ID: <200009021820.OAA16373@andante.eecs.tufts.edu> ******************************************************************************* CALL FOR PAPERS Seventeenth Annual Symposium on COMPUTATIONAL GEOMETRY June 3--5, 2001 Tufts University, Medford, Massachusetts http://www.eecs.tufts.edu/EECS/scg01 Sponsored by ACM SIGACT and ACM SIGGRAPH The Seventeenth Annual Symposium on Computational Geometry, featuring an applied track, a theoretical track, and a video review, will be held at Tufts University, Medford, Massachusetts. We invite high-quality submissions in the following areas: * geometric algorithms or combinatorial geometry, for the theoretical track, OR * implementation issues or applications of computational geometry, for the applied track. The proceedings, with the papers of both tracks, will be distributed at the symposium and will subsequently be available for purchase from ACM. A selection of papers will be invited to special issues of journals. During the conference, sessions of presentations will alternate between the two tracks, rather than being in parallel. Topics for the theoretical track include, but are not limited to design and theoretical analysis of geometric algorithms and data structures; lower bounds for geometric problems; and discrete and combinatorial geometry. Topics for the applied track include, but are not limited to experimental analysis of algorithms and data structures; mathematical and numerical issues arising from implementations; and novel uses of computational geometry in other disciplines, such as robotics, computer graphics, geometric and solid modeling, manufacturing, geographical information systems, and molecular biology. Electronic submissions are preferred for the THEORETICAL TRACK (see web page above for instructions), but authors may instead mail 8 copies of an extended abstract to arrive by *****DECEMBER 6, 2000****** to David Eppstein Dept. of Information Computer Science, University of California, Irvine, Irvine, CA 92697-3425 USA. Phone: (949) 824-6384; Email: eppstein@ics.uci.edu Electronic submissions are preferred for the APPLIED TRACK (see web page above for instructions), but authors may instead mail 10 copies of an extended abstract to arrive by *****DECEMBER 6, 2000****** to Dan Halperin School of Computer Science Schreiber Building, Rm 219 Tel Aviv University Tel Aviv 69978 Israel Phone: +972-3-640-6478; Email: halperin@math.tau.ac.il IMPORTANT DATES: December 6, 2000: Papers due, both tracks February 13, 2001: Video submissions due February 15, 2001: Notification of acceptance or rejection of papers March 1, 2001: Notification of acceptance or rejection of videos March 15, 2001: Camera-ready papers due April 15, 2001: Final versions of videos due June 3--5, 2001: Symposium Papers that primarily address practical issues and implementation experience, even if not tied to a particular application domain, should be submitted to the applied track. Papers that primarily prove theorems should be submitted to the theoretical track. Most experimental work should be submitted to the applied track; an exception would be experiments in support of mathematical investigations. Submissions to one track may be forwarded to the other for consideration, unless the authors have explicitly stated interest in one track only. Papers should be submitted in the form of an extended abstract. Papers should begin with the title of the paper, each author's name, affiliation, and e-mail address, followed by a succinct statement of the problems and goals that are considered in the paper, the main results achieved, the significance of the work in the context of previous research, and a comparison to past research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages, using 11 point or larger font and with at least one-inch margins all around. For cases in which the authors consider it absolutely essential to include additional technical details that do not fit into 10 pages, these details may be added in a clearly marked appendix that should appear after the body of the paper and the references; this appendix will not be regarded as a part of the submission and will be considered only at the program committee's discretion. Abstracts in hard copy must be received by December 6, 2000, or postmarked by November 29 and sent airmail. Abstracts in electronic form are due by December 6, 5:00 PM EST. These are firm deadlines: late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 2001. A full version of each contribution in final form will be due by March 15, 2001 for inclusion in the proceedings. Theoretical Track Program Committee: Applied Track Program Committee: Boris Aronov (Polytechnic U, Brooklyn) Nancy Amato (Texas A ) Otfried Cheong (Utrecht U) Karl Bo"hringer (U Washington, Seattle) Jesu's De Loera (UC Davis) Franca Gianini (IMA, Genova) David Eppstein, Chair (UC Irvine) Lutz Kettner (UNC Chapel Hill) Sariel Har-Peled (UI Urbana Champaign) Dan Halperin, Chair (Tel Aviv U) Piotr Indyk (MIT) Kurt Mehlhorn (MPII, Saarbru"cken) Edgar A. Ramos (MPII Saarbru"cken) Mark Overmars (Utrecht U) Ileana Streinu (Smith College) Seth Teller (MIT) Peter Widmayer (ETH Zurich) Conference Chair: Mariette Yvinec (INRIA Sophia-Antipolis) Diane L.Souvaine (Tufts U) ******************************************************************************* ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From dls at eecs.tufts.edu Sat Sep 2 14:48:05 2000 From: dls at eecs.tufts.edu (Diane Souvaine) Date: Mon Jan 9 13:40:58 2006 Subject: ACM Symposium on Computational Geometry 2001: Call for Videos Message-ID: <200009021748.NAA15704@andante.eecs.tufts.edu> *********************************************************************************** CALL FOR VIDEOS 10th Annual Video Review of Computational Geometry to be presented at the Seventeenth Annual Symposium on Computational Geometry June 3--5, 2001 Tufts University, Medford, Massachusetts Videos are sought for a video review of computational geometry. BACKGROUND: This video review showcases the use of visualization in computational geometry for exposition and education, as an interface and a debugging tool in software development, and for the visual exploration of geometry in research. Algorithm animations, visual explanations of structural theorems, descriptions of applications of computational geometry, and demonstrations of software systems are all appropriate. Videos that accompany papers or communications submitted to the technical program committee are encouraged. SUBMISSIONS: Authors should send one preview copy of a videotape to the address below by *****FEBRUARY 13, 2001******. The videotape should be at most eight minutes long (three to five minutes, preferred), and be in VHS NTSC or VHS PAL format. Each video tape must be accompanied by a one- or two-page description of the material shown in the video, and where applicable, the techniques used in the implementation. Please format descriptions following the guidelines for ACM proceedings. Additional material describing the contents of the videos, such as the full text of accompanying papers, may also be included. Textual material may be submitted electronically by e-mailing either the URL of a PostScript file (preferred) or the PostScript file itself to . If electronic submission is impossible, authors should include five hardcopies of the accompanying text with their video. Videotapes and accompanying text should be sent to Dinesh Manocha Department of Computer Science University of North Carolina Chapel Hill, NC 27599-3175 USA Phone: (919) 962-1749; Email: dm@cs.unc.edu For customs purposes, it is best to declare a value of $5. If you have questions, please contact the committee chair. NOTIFICATION: Authors will be notified of acceptance or rejection, and given reviewers' comments by March 1, 2001. For each accepted video, the final version of the textual description will be due by March 15, 2001 for inclusion in the proceedings. Final versions of accepted videos will be due April 15, 2001 in the best format available. The accepted videos will be edited onto one tape, which will be shown at the conference and will be distributed to the participants. Video Program Committee: Jonathan Cohen (Johns Hopkins) Herbert Edelsbrunner (Duke) Subodh Kumar (Johns Hopkins) Ming C. Lin (UNC Chapel Hill) Dinesh Manocha, Chair (UNC Chapel Hill) Amitabh Varshney (U of Maryland) ************************************************************************************* ------------- 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 pascucci at hemi.llnl.gov Thu Sep 14 15:38:42 2000 From: pascucci at hemi.llnl.gov (Valerio Pascucci) Date: Mon Jan 9 13:40:58 2006 Subject: 3D Sierpinski Message-ID: Does anyone can give a pointer to the 3D definition of the Sierpinski space filling curve? In Sagan book Chapter 5 I have found only the 2D case. Thanks -- Valerio ------------- 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 marek at cs.ucr.edu Wed Sep 13 11:32:10 2000 From: marek at cs.ucr.edu (Marek Chrobak) Date: Mon Jan 9 13:40:58 2006 Subject: FOCS 2000 program and registration info Message-ID: FOCS 2000 The 41 st Annual IEEE Computer Society Conference on Foundations of Computer Science http://www.cs.cmu.edu/~FOCS2000 November 12-14, 2000 Redondo Beach, California Sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing In cooperation with ACM SIGACT --------------------------------------------------------- REGISTRATION The deadline for early registration is OCTOBER 16. Instructions on how to register by fax or mail can be found at http://www.cs.cmu.edu/~FOCS2000. The registration desk will be open from 6 pm to 10 pm on Saturday, and during the day on Sunday and Monday. --------------------------------------------------------- HOTEL The conference will take place at the Crowne Plaza Hotel, 300 N. Harbor Drive, Redondo Beach, CA 90277, USA. A block of rooms has been reserved in the hotel at the special rate of $125 per day, single or double. To obtain the room at this price, you need to make a reservation by OCTOBER 16. To reserve a room you can * call the hotel at 310-318-8888 or 800-368-9760, or * fill the hotel reservation form at http://www.cs.cmu.edu/~FOCS2000 and fax it to the hotel at 310-376-1930. If you make the reservation by phone, please specify that you request the special rate for IEEE FOCS 2000. --------------------------------------------------------- CORPORATE SUPPORT FOCS 2000 gratefully acknowledges financial support from IBM Research and Akamai Technologies. ========================================================= CONFERENCE PROGRAM ========================================================= SATURDAY, NOVEMBER 11, 2000 Welcome Reception 7:00 pm - 8:30pm ---------------------------------------------------------- SUNDAY, NOVEMBER 12, 2000 SESSION 1: 8:30 am - 10:10 am, Chair: David Zuckerman Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors, O. Reingold, S. Vadhan, and A. Wigderson Universality and tolerance, N. Alon, M. Capalbo, Y. Kohayakawa, V. Rodl, A. Rucinski, and E. Szemeredi Extracting randomness via repeated condensing, O. Reingold, R. Shaltiel, and A. Wigderson Extracting randomness from samplable distributions, L. Trevisan and S. Vadhan Pseudorandom generators in propositional proof complexity, M. Alekhnovich, E. Ben-Sasson, A.A. Razborov, and A. Wigderson SESSION 2: 10:30am - 12:10pm, Chair: David Williamson Random graph models for the web graph, R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal Optimization problems in congestion control, R. Karp, E. Koutsoupias, C. Papadimitriou, and S. Shenker Fairness measures for resource allocation, A. Kumar and J. Kleinberg On the approximability of trade-offs and optimal access of web sources, C.H. Papadimitriou and M. Yannakakis How bad is selfish routing?, T. Roughgarden and E. Tardos SESSION 3: 1:30pm - 2:50pm, Chair: Sanjeev Arora A polylogarithmic approximation of the minimum bisection, U. Feige and R. Krauthgamer Approximability and in-approximability results for no-wait shop scheduling problems, M. Sviridenko and G. Woeginger Nested graph dissection and approximation algorithms, S. Guha Approximating the single source unsplittable min-cost flow problem, M. Skutella SESSION 4: 3:10pm - 4:30pm, Chair: Michael Sipser Hardness of approximate hypergraph coloring, V. Guruswami, J. Hastad, and M. Sudan "Soft-decision" decoding of Chinese remainder codes, V. Guruswami, A. Sahai, and M. Sudan Super-linear time-space tradeoff lower bounds for randomized computation, P. Beame, M. Saks, X. Sun, and E. Vee On the hardness of graph isomorphism, J. Toran SESSION 5: 4:50pm - 6:10pm, R. Ravi Stable distributions, pseudorandom generators, embeddings and data stream computation, P. Indyk New data structures for orthogonal range searching, S. Alstrup, G.S. Brodal, and T. Rauhe Nearly optimal expected-case planar point location, S. Arya, T. Malamatos and D.M. Mount On levels in arrangements of curves, T.M. Chan FOCS Business Meeting 9:00 pm - 10:00 pm ---------------------------------------------------------- MONDAY, NOVEMBER 13, 2000 SESSION 6: 8:30 am - 10:10 am, Chair: Avrim Blum Detecting a network failure, J. Kleinberg Testing of clustering, N. Alon, S. Dar, M. Parnas, and D. Ron Testing of functions that have small width branching programs, I. Newman Testing that distributions are close, T. Batu, L. Fortnow, R. Rubinfeld, W.D. Smith, and P. White Using upper confidence bounds for online learning, P. Auer SESSION 7: 10:30am - 12:10pm, Chair: Joe Kilian Zaps and their applications C. Dwork and M. Naor Randomizing polynomials: a new representation with applications to round-efficient secure computation, Y. Ishai and E. Kushilevitz Lower bounds on the efficiency of generic cryptographic constructions, R. Gennaro and L. Trevisan Concurrent oblivious transfer, J. Garay and P. MacKenzie The relationship between public key encryption and oblivious transfer, Y. Gertner, S. Kannan, T. Malkin, O. Reingold, and M. Viswanathan SESSION 8: 1:30pm - 2:50pm, Chair: Leonard Schulman The online median problem, R. Mettu and G. Plaxton Polynomial time approximation schemes for geometric k-clustering, R. Ostrovsky and Y. Rabani Clustering data streams, S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan On clusterings: good, bad and spectral, R. Kannan, S. Vempala and A. Vetta SESSION 9: 3:10pm - 4:30pm, Chair: Leonard Schulman Fully dynamic transitive closure: breaking through the O(n^2) barrier, C. Demetrescu and G.F. Italiano Opportunistic data structures with applications, P. Ferragina and G. Manzini Cache-oblivious B-trees, M.A. Bender, E.D. Demaine, and M. Farach-Colton Using expander graphs to find vertex connectivity, H.N. Gabow SESSION 10: 4:50pm - 6:10pm, Chair: M. Szegedy On the boundary complexity of the union of fat triangles, J. Pach and G. Tardos Straighting polygonal arcs and convexifying polygonal cycles, R. Connelly, E.D. Demaine and G. Rote A combinatorial approach to planar non-colliding robot arm motion planning, I. Streinu Topological persistence and simplification, H. Edelsbrunner, D. Letscher, and A. Zomorodian Banquet and Knuth Prize Lecture 7:00 pm ---------------------------------------------------------- TUESDAY, NOVEMBER 14, 2000 SESSION 11: 8:30 am - 10:10 am, Chair: Leslie Goldberg The cover time, the blanket time, and the Matthews bound, J. Kahn, J.H. Kim, L. Lovasz, and V. H. Vu The product replacement algorithm is polynomial, I. Pak Efficient algorithms for universal portfolios, A. Kalai, and S. Vempala Sampling adsorbing staircase walks using a new Markov chain decomposition method, R. Martin and D. Randall The randomness recycler: a new technique for perfect sampling, J.A. Fill and M.L. Huber SESSION 12: 10:30am - 12:10pm, Chair: Umesh Vazirani An improved quantum Fourier transform algorithm and applications, L. Hales and S. Hallgren Fast parallel circuits for the quantum Fourier transform, R. Cleve and J. Watrous Succinct quantum proofs for properties of finite groups, J. Watrous Private quantum channels, A. Ambainis, M. Mosca, A. Tapp, and R. de Wolf The quantum complexity of set membership, J. Radhakrishnan, P. Sen, and S. Venkatesh SESSION 13: 1:30pm - 2:50pm, Leslie Goldberg Randomized rumor spreading, R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking Fast broadcasting and gossiping in radio networks, M. Chrobak, L. Gasieniec and W. Rytter Linear waste of best fit bin packing on skewed distributions, C. Kenyon and M. Mitzenmacher Optimal myopic algorithms for random 3-SAT, D. Achlioptas and G.B. Sorkin SESSION 14: 3:10pm - 4:30pm, Chair: David Williamson Hierarchical placement and network design problems, S. Guha, A. Meyerson, and K. Munagala Building Steiner trees with incomplete global knowledge, D.R. Karger and M. Minkoff Cost-distance: two metric network design, A. Meyerson, K. Munagala, and S. Plotkin Combinatorial feature selection problems, M. Charikar, V. Guruswami, R. Kumar, S. Rajagopalan, and A. Sahai SESSION 15: 4:50pm - 6:10pm, Michael Sipser The common fragment of CTL and LTL, M. Maidl On the existence of booster types, M. Herlihy and E. Ruppert Existential second-order logic over graphs: charting the tractability frontier, G. Gottlob, P. Kolatis and T. Schwentick Computing the determinant and Smith form of an integer matrix, W. Eberly, M. Giesbrecht, and G. Villard ======================================================== COMMITTEES ======================================================== Conference General Chair: Alok Aggarwal, IBM Research. Program Committee Chair: Avrim Blum, Carnegie Mellon. Program Committee: Sanjeev Arora, Avrim Blum, Faith Fich, Leslie Ann Goldberg, Michael Goodrich, Monika Henzinger, Joe Kilian, Yishay Mansour, R. Ravi, Leonard Schulman, Michael Sipser, Mario Szegedy, Umesh Vazirani, David Williamson, David Zuckerman. Local Arrangements: Marek Chrobak and Tao Jiang, University of California, Riverside. ------------- 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 exact at CIMS.NYU.EDU Fri Sep 22 14:21:01 2000 From: exact at CIMS.NYU.EDU (Chee Yap) Date: Mon Jan 9 13:40:58 2006 Subject: Core Library Version 1.3 released. Message-ID: ===================== SOFTWARE RELEASE ANNOUNCEMENT ========================== Core Library Version 1.3 is now available for free download at http://cs.nyu.edu/exact/core/ The Core Library (CORE) is a collection of C/C++ classes to support exact computation with constructible real numbers (+,-,x,/,sqrt). Numerical nonrobustness is a widely acknowledged problem. It has proven particularly intractible in the context of geometric algorithms where numerical data and combinatorial data are intermixed in a strongly constrained manner. Recent research in the computational geometry community has demonstrated a variety of techniques that can address such problems. A basic goal of our library is to make such techniques easily accessible to the wider community of programmers and researchers. Basic CORE Features: -- ease of use: Any C/C++ programmer can now write numerical or geometric code that are fully robust. -- ease of migration: Many existing C/C++ programs can be converted into robust programs with minimal effort. -- natural and novel numerical accuracy model: Users can choose and get the numerical accuracy that best fit their applications. -- state of art technology: Precision-driven approach to exact geometric computation, best known root bounds, etc, will be incorporated into the library as the field progresses. In this way, the user's application program will automatically be upgraded (at the cost of re-compilation). -- small system: Just over 2MB (including source and documentation, compressed). It can serve as the "core" for your own applications. -- tested on Sun Sparc and Linux platforms: Earlier CORE 1.2 was also tested on SGI and Windows. What is new with CORE 1.3 ? -- improved speed: The runtime for all the samples programs in this distribution takes 55.0 seconds under CORE 1.3. Under CORE 1.2.2, the time is 1040.38 seconds. The test was performed on a Sun UltraSPARC 10, 440 MHz machine, -- improved root bounds: This yield great speedups for the important class of expressions expressions with division (e.g., expressions with rational number or floating point number inputs). -- adoption of LiDIA's number kernel: This allows the easy plug-in of alternative big number packages such as Gnu's gmp. CORE Distribution comes with CLN, one of the fastest big number packages (it implements the Schonhage-Strassen multiplication). Because of the move to LiDIA, we now support only the g++ compiler. -- improved numerical output: Only significant digits are printed, and a choice of scientific or positional formats. -- improved numerical input: With input from strings, the user can control precision of conversion, including forcing exact input. Again, choice of scientific or positional formats. -- more sample programs: Examples show how one can easily use CORE to compute transcendental constants (Pi) or functions (e.g., sin, log) to any an desired precision. An improved randomized prover for ruler-and-compass theorems, etc. For further information http://cs.nyu.edu/exact/ mailto://exact@cs.nyu.edu. We welcome your comments and input. -- Chee Yap (yap@cs.nyu.edu) Chen Li (chenli@cs.nyu.edu) September 22, 2000 | Department of Computer Science | Courant Institute of Mathematical Sciences | New York University | 251 Mercer Street | New York, NY 10012, USA ===================== SOFTWARE RELEASE ANNOUNCEMENT ========================== ------------- 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 ajbg96r at ecs.soton.ac.uk Mon Sep 25 17:31:37 2000 From: ajbg96r at ecs.soton.ac.uk (Antonio Barragan-Guaymare) Date: Mon Jan 9 13:40:58 2006 Subject: question Message-ID: <39CF6FD8.76DAC996@ecs.soton.ac.uk> Dear All I have come across the following problem: A set of points, each given by its (x,y,z) coordinates in 3D is given. These points are known to be coplanar. Then the following two questions arise: - Is there a way to know if these points can be arranged to form a single, closed polygon? - Is there a way to know if these points can be arranged to form several closed polygons? - Is there a way to construct such polygon(s)? This arises when a planar polyhedron, given by a collection of points, faces and edges, is "cut" by an arbitrary plane. Another way of stating the problem is: To determine the closed polygon(s) resulting from the intersection of the polyhedron and the plane. Any suggestion will be greatly appreciated. -- Antonio Barragan University of Southampton Concurrent Computation Group Building 59 Level 3 Room 3237 Highfield Southampton SO17 1BJ Hants UK Fax: 00-44-2380-593903 -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20000925/34496251/attachment.htm From jsbm at ams.sunysb.edu Thu Sep 28 10:28:02 2000 From: jsbm at ams.sunysb.edu (jsbm@ams.sunysb.edu) Date: Mon Jan 9 13:40:58 2006 Subject: 2nd Call for Papers: Fall CG Workshop Message-ID: <200009281328.JAA25800@amirani.ams.sunysb.edu> SECOND CALL FOR PAPERS TENTH ANNUAL FALL WORKSHOP ON COMPUTATIONAL GEOMETRY October 27--28, 2000 http://www.ams.sunysb.edu/~jsbm/cgworkshop.html ** Please send abstracts (by email) for contributed talks by midnight (New York time), October 3 We will announce the program and accepted papers by October 10. ** Hotels: Three Village Inn and Danford's have been holding some rooms for us through this week, at discounted rates, however these may be expired or filling up fast. See web site for details on how to contact them. We hope/expect a block of rooms at the Holiday Inn Express to become available after October 6. You may want to check with them next week if they do not have rooms available now. We suggest you make hotel reservations ASAP, if you have not done so already! (If you have trouble finding space in the 3 closest hotels, we can suggest some alternatives if you contact us.) ** Grad student accommodations: As in the past, we hope to have local grad students host visiting students. Please email to cgworkshop@ams.sunysb.edu to request that your name be added to the list of students to be hosted for free sofa/floorspace accommodations. ** Transportation: Consider flights into Islip (= Long Island Macarthur airport), if possible. It is closer to Stony Brook than JFK or LaGuardia, and is a smaller, more convenient airport. Southwest Airlines has had some special fares lately. The airport has been recently expanded: see http://www.macarthurairport.com/ for details and which carriers fly into it. SECOND CALL FOR PAPERS TENTH ANNUAL FALL WORKSHOP ON COMPUTATIONAL GEOMETRY October 27--28, 2000 http://www.ams.sunysb.edu/~jsbm/cgworkshop.html We are pleased to announce the tenth in a series of annual fall workshops on Computational Geometry. This workshop series, founded under the sponsorship of the Mathematical Sciences Institute (MSI) at Stony Brook (with funding from the U.S. Army Research Office), has continued during 1996-1999 under the sponsorship of the Center for Geometric Computing, a collaborative center of Brown, Duke, and Johns Hopkins Universities, also funded by the U.S. Army Research Office. This year, for the tenth in the workshop series, the workshop returns to the campus of the University at Stony Brook. Scope and Format The aim of this workshop is to bring together students and researchers from academia and industry, to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to: Algorithmic methods in geometry I/O-scalable geometric algorithms Animation of geometric algorithms Computer graphics Solid modeling Geographic information systems Computational metrology Graph drawing Experimental studies Geometric data structures Implementation issues Robustness Computer vision Robotics Computer-aided design Mesh generation Manufacturing applications of geometry Following the tradition of the previous workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. There will also be an Open Problem Session in order to promote a free exchange of questions and research challenges. We strongly encourage registration in advance, through the workshop web site; registration can also be completed on-site. There will be no registration fee. Students are especially encouraged to attend and participate! We expect to be able to provide free accommodations (couch space, floor space, etc.) for visiting students with some of Stony Brook's local graduate student hosts who are taking part in the organization. Invited speakers George Hart Ari Kaufman: "Volume Graphics" Micha Sharir: "Combinatorics of arrangements - recent progress" Ileana Streinu Submissions Authors are invited to submit abstracts for talks to be given at the workshop. Please send an abstract (up to 2 pages) and a draft of a paper (if you have one). E-mail submissions are encouraged; send to cgworkshop@ams.sunysb.edu. Ideally, the abstract should be a PDF, PostScript, or LaTeX, file, for ease in assembling the abstract booklet. Abstracts can also be sent by regular mail to: Joseph Mitchell Department of Applied Mathematics and Statistics University at Stony Brook Stony Brook, NY 11794-3600 Submissions should arrive by October 3, 2000. Authors will be notified of acceptance by October 10, 2000. A booklet of abstracts will be distributed at the workshop and made available electronically on the Web. There will be no formal proceedings for this workshop. Program Committee Pankaj K. Agarwal (Duke University), Esther M. Arkin (Stony Brook), Michael A. Bender (Stony Brook), Michael T. Goodrich (Johns Hopkins University), Joseph S. B. Mitchell (Stony Brook), Steven S. Skiena (Stony Brook), Roberto Tamassia (Brown University) Note: For more information about the workshop, send mail to cgworkshop@ams.sunysb.edu. Further information will be posted to our web site: http://www.ams.sunysb.edu/~jsbm/cgworkshop.html as soon as it is available. Important Dates Deadline for submission Oct 3, 2000 Notification of acceptance Oct 10, 2000 Conference Oct 27-28, 2000 Sponsored by the Department of Applied Mathematics and Statistics and the Department of Computer Science and Engineering, State University of New York at Stony Brook, with partial support from the National Science Foundation. ------------- 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 skala at kiv.zcu.cz Sat Sep 23 07:12:23 2000 From: skala at kiv.zcu.cz (Vaclav Skala) Date: Mon Jan 9 13:40:58 2006 Subject: No subject Message-ID: <001101c02545$1c631300$4e3fe493@fav.zcu.cz> To: Subject: WSCG2001 - Int.Conf.on Graphics, Visualization & Computer Vision - REMINDER Date: Sat, 23 Sep 2000 09:41:18 +0200 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-2" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2919.6600 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2919.6600 Content-Transfer-Encoding: quoted-printable X-MIME-Autoconverted: from 8bit to quoted-printable by ori.zcu.cz id LAA32121 DEADLINE REMINDER ----------------------------- >> Nice opportunity >> to visit the Golden City Prague - visit, please http://www.czechsite.com/ >> to drink the best beer - the original Pilsener Urquell >> visit the Plzen city - Information Center http://www.plzen-city.cz ---------------------------------------------------------- --------------------- Sorry for duplicates and cross-posting --------------------- W S C G ' 2001 The 9-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2001 in cooperation with EUROGRAPHICS, IFIP WG 5.10 & Computer Graphics Society to be held in February 5 - 9, 2001 in Plzen very close to PRAGUE, the capital of the Czech Republic Honorary Chair =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D Jarek Rossignac, GVU Center, Georgia Institute of Technology, USA Conference Chairs =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D Nadia Magnenat Thalmann, MIRALab-CUI, Univ. of Geneva, Switzerland Vaclav Skala, Univ. of West Bohemia, Czech Republic >>>> Deadline for authors: October 10, 2000 >>>> Conference dates: February 5 - 9, 2001 Information: http://wscg.zcu.cz Accepted papers will be published in the Conference proceedings with ISBN and processed by INSPEC, ISI, Cambridge Scientific Abstracts and others f= or citations index. ------------------------------------------------------------------ >> If you are willing to help us as a REVIEWER, please, << >> fill in the form at the http://wscg.zcu.cz/reviewer.htm << ------------------------------------------------------------------ Topics included --------------- Fundamental algorithms, rendering and visualization, computer vision, pattern recognition and image processing, virtual reality, medical imaging, geometric modelling and fractals, parallel and distributed graphics, computational geometry, graphical interaction and standards, object-oriented graphics, WWW technologies, animation and multimedia, computer aided geometric design, CAD/CAM, DTP and GIS systems, educational aspects of related fields, usage of graphics within mathemati= cal software (Maple, Mathematica, MathCAD etc.) in education. >>> Papers on all aspects of computer graphics are encouraged <<< The program includes international books exhibition and video show, too. --------------------------------------------- W S C G '2001 International Exhibition ------------------------------------ Information for exhibitors: Please contact the organiser as soon as possi= ble -------------------------- for detailed information and conditions. The WSCG Exhibition will be held in parallel. Top leading European and Cz= ech companies active in computer graphics, visualization and computer vision, CAD/CAM and GIS systems, virtual reality, multimedia systems and others will be presenting their latest products. Special programme will be available, too. ----------------- Accepted papers will be published in the Conference proceedings with ISBN. They are reviewed by INSPEC, Cambridge Scientific Abstracts, InfoStore, IEE, ISI, AIMS, INIST and others for citations index and other purposes. The best papers will be considered for possible publication in the Journa= l of Visualisation and Computer Animation, Computers&Graphics, The Visual Computer, Machine Graphics & Vision, High Performace Computer Graphics an= d others journals. Organizer and Conference secretariat ------------------------------------ Prof.Ing.Vaclav Skala, CSc. c/o Computer Science Dept., Univ.of West Bohemia Univerzitni 8, Box 314, 306 14 Plzen, Czech Republic e-mail: skala@kiv.zcu.cz Subject: INFO WSCG tel.:+420-19-7491-188 fax:+420-19-7822-578, 799 include your e-mail i= n all messages!!! The latest information is available at (please RELOAD the pages all the time to get the latest information): http://wscg.zcu.cz select WSCG'2001 Information on all WSCG conferences: http://wscg.zcu.cz --- Odchoz=ED zpr=E1va neobsahuje viry. Zkontrolov=E1no antivirov=FDm syst=E9mem AVG (http://www.grisoft.cz). Verze: 6.0.191 / Virov=E1 b=E1ze: 91 - datum vyd=E1n=ED: 11.9.2000 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html.