From hert at mpi-sb.mpg.de Fri Mar 1 16:12:05 2002 From: hert at mpi-sb.mpg.de (Susan Hert) Date: Mon Jan 9 13:41:04 2006 Subject: [DMANET] CGAL User Workshop Programme Message-ID: CGAL User Workshop Programme http://www.cgal.org/UserWorkshop http://www-ma2.upc.es/~geomc/events/socg2002/CGALWorkshop.html Following is the list of user and developer presentations to be given at the CGAL User Workshop to be held on June 4 at Universitat Politecnica de Catalunya, Barcelona, Spain immediately before the 2002 Symposium on Computational Geometry. Tight Cocone and CGAL Tamal Dey and Samrat Goswami The Ohio State University How to Add Facet Attributes to CGAL's 3D Geometric Triangulations Joachim Giesen and Matthias John ETH Zurich An Experimental Comparison of Two-dimensional Triangulation Packages Oliver Zlotowski and Matthias Baesken Trier University Parametric Search using CGAL Rene van Oostrum and Remco Veltkamp Utrecht University Building a Map Edit Tool with the Support of the Planar Map Class in CGAL Duong Ahn Duc, Nguyen Dong Ha, and Le thi Thuy Hang University of Natural Sciences - Vietnam National University of Ho Chi Mihn City Exact Minkowski Sums and Applications Eyal Flato and Dan Halperin Tel Aviv University Planar Maps and Arrangements in CGAL: Extensions and Improvements Eti Ezra, Eyal Flato, Dan Halperin, Shai Hirsch, Eugene Lipovetsky, Ron Wein Tel Aviv University Efficient Exact Geometric Predicates for Delaunay Triangulations Sylvain Pion INRIA Sophia-Antipolis Boolean Operations on 3D Surfaces Using Nef Polyhedra Miguel Granados, Susan Hert, Lutz Kettner, Michael Seel Max-Planck-Institut fuer Informatik The full programme for the workshop is available from http://www.cgal.org/UserWorkshop/programme.html and from the SoCG 2002 web page: http://www-ma2.upc.es/~geomc/events/socg2002/socg2002.html Registration for the workshop should be done through the SoCG registration form (accessible from the above web page), where you will be able to register for only the workshop or the workshop and the Symposium on Computational Geometry. You can also use the booking system on the SoCG web page to arrange your accommodations in Barcelona. This service is available until May 12 only. We hope to see you in Barcelona! ------------------------------------------------------------------------- Susan Hert hert@mpi-sb.mpg.de MPI fuer Informatik Phone: ++49 681 9325 116 Stuhlsatzenhausweg 85 Fax : ++49 681 9325 199 66123 Saarbruecken, Germany http://www.mpi-sb.mpg.de/~hert ------------------------------------------------------------------------- ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zpr.uni-koeln.de/dmanet * ********************************************************** From morin at cs.carleton.ca Fri Mar 1 13:24:11 2002 From: morin at cs.carleton.ca (Pat Morin) Date: Mon Jan 9 13:41:04 2006 Subject: CFP: ISAAC 2002 Message-ID: <3C7FC74B.8943429D@cs.carleton.ca> CALL FOR PAPERS Thirteenth International Symposium on Algorithms and Computation ISAAC 2002 Vancouver, Canada November 21-23, 2002 The 13th Annual International Symposium on Algorithms and Computation (ISAAC 2002) will be held in Vancouver, Canada on November 21-23, 2002 at the Delta Pinnacle Hotel, with a reception on the evening of November 20. ISAAC 2002 is coupled with FOCS 2002 which will be held at the same location from November 16-19. This is the first time that ISAAC has ventured into North America. The main themes for ISAAC 2002 are: o Algorithms and Data Structures, o Computational Geometry, o Approximation Algorithms, o Randomized Algorithms, o Graph Drawing and Graph Algorithms, o Combinatorial Optimization, o Computational Biology, o Computational Finance, o Cryptography, o Parallel and Distributed Computing. SUBMISSIONS Authors are invited to submit papers presenting original and unpublished research results on the symposium themes listed above. Papers in applied areas with a strong foundational emphasis are also welcome. Submissions should not exceed 12 pages using 11 point or larger font. Authors who feel that more details are necessary may include a clearly marked appendix which will be read at the discretion of the Program Committee. Selected papers from the conference will be invited for submission to a special issue of Theory of Computing Systems. Submissions to the symposium this year will only be conducted electronically either by e-mail or web. Hard-copy submissions will not be accepted. Details on the submission procedure are outlined in the website: http://www.cs.carleton.ca/isaac2002. Any inquiries should be directed to isaac2002@cs.carleton.ca. For an accepted paper to be included in the proceedings, at least one of the authors must commit to presenting the paper at the symposium. Accepted papers will be published in Lecture Notes in Computer Science, Springer-Verlag. ORGANIZING COMMITTEE o Binay Bhattacharya, Simon Fraser, Canada o Prosenjit Bose, Carleton University, Canada o Arvind Gupta, Simon Fraser University, Canada o Tiko Kameda, Simon Fraser University, Canada PROGRAM COMMITTEE o Prosenjit Bose, Chair, Carleton University, Canada o Tetsuo Asano, JAIST, Japan o Binay Bhattacharya, Simon Fraser Univ., Canada o Hans Bodlaender, Utrecht University, Pays Bas o Rudolf Fleischer, HKUST, Hong Kong o Naveen Garg, IIT Delhi, India o Arvind Gupta, Simon Fraser University, Canada o Wen-Lian Hsu, Academia Sinica, Taiwan o David Kirkpatrick, Univ. British Columbia, Canada o Danny Krizanc, Wesleyan University, USA o Ming Li, University of Waterloo, Canada o Michael Molloy, University of Toronto, Canada o Pat Morin, Carleton University, Canada o Ian Munro, University of Waterloo, Canada o Lata Narayanan, Concordia University, Canada o Rajeev Raman, University of Leicester, UK o Sunil Shende, Rutgers University, USA o Hisao Tamaki, Meiji University, Japan o Roberto Tamassia, Brown Univeristy, USA o Denis Therien, McGill University, Canada o Takeshi Tokuyama, Tohoku University, Japan IMPORTANT DATES o Submission Deadline: June 3, 2002 o Notification: July 22, 2002 o Deadline for Proceedings: August 9, 2002 INVITED SPEAKERS o Luc Devroye, McGill University, Canada o Janos Pach, New York University, USA o Nicholas Pippenger, Univ. British Columbia, Canada ------------- 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 vera at ma2.upc.es Fri Mar 1 19:34:28 2002 From: vera at ma2.upc.es (Vera Sacristan) Date: Mon Jan 9 13:41:04 2006 Subject: SoCG 2002 Call for participation Message-ID: <3C7FC9B4.F4BC2C26@ma2.upc.es> CALL FOR PARTICIPATION We are pleased to announce that the registration for the 18th ACM Symposium on Computational Geometry which will be held at the Universitat Polit?cnica de Catalunya, Barcelona, Spain, June 5-7, is now open, and we would like to encourage participation to this significant event. The conference website at http://www-ma2.upc.es/~geomc/events/socg2002.html contains registration form, accomodation form, preliminary program (an ASCII version is attached below), general information about the conference, local information, as well as details about the CGAL User Workshop on June 4th. The early registration deadline is May 12, but we would like to encourage you to register as soon as possible, as accomodation will be reserved on a first-come-first-served basis, and finding a hotel room in Barcelona, a very popular touristic destination, is not at all a trivial matter. We are looking forward to seeing you in Barcelona! Ferran Hurtado and Vera Sacrist?n Conference Chairs ======================================================================== Preliminary Program JUNE 4th 18:00 - 20:00 Reception and registration JUNE 5th 8:30 - 9:00 Late registration 9:00 - 10:20 Session 1 - Parametric Search Made Practical, Rene van Oostrum and Remco C. Veltkamp - A Local Search Approximation Algorithm for k-Means Clustering, Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine Piatko, Ruth Silverman and Angela Y. Wu - On the Crossing Number of Complete Graphs, Oswin Aichholzer, Franz Aurenhammer and Hannes Krasser - On the Number of Embeddings of Minimally Rigid Graphs, Ciprian Borcea and Ileana Streinu 10:20 - 10:50 Coffee break 10:50 - 11:50 Session 2 - Deforming Necklaces, Leonidas J. Guibas, An Nguyen, Daniel Russel and Li Zhang - Efficient Maintenance and Self-Collision Testing for Kinematic Chains, Itay Lotan and Fabian Schwarzer and Dan Halperin and Jean-Claude Latombe - Box-Trees for Collision Checking in Industrial Installations, H.J. Haverkort and M. de Berg and J. Gudmundsson 11:50 - 12:00 Small break 12:00 - 13:00 INVITED TALK 1 13:00 - 15:00 Lunch 15:00 - 16:00 Session 3 - Finding the Consensus Shape for a Protein Family, L. Paul Chew and Klara Kedem - Paper Position Sensing, Marshall Bern and David Goldberg - A Global Approach to Automatic Solution of Jigsaw Puzzles, David Goldberg and Christopher Malon and Marshall Bern 16:00 - 16:15 Coffee break 16:15 - 17:15 Open Problems 17:30 - 20:30 Social event: Gaud? Tour JUNE 6th 9:00 - 10:20 Session 4 - The Power of Subtraction in Geometric Searching, Bernard Chazelle - A lower bound on the distortion of embedding planar metrics into Euclidean space, Ilan Newman and Yuri Rabinovich - The One-Round Voronoi Game, Otfried Cheong, Sariel Har-Peled, Nathan Linial and Jiri Matousek - Approximate Nearest Neighbor Algorithms for Frechet Distance via Product metrics, Piotr Indyk 10:20 - 10:50 Coffee break 10:50 - 11:50 Session 5 - Point-Line Incidences in Space, Micha Sharir and Emo Welzl - Incidences Between Points and Circles in Three Dimensions, Boris Aronov, Vladlen Koltun and Micha Sharir - Lenses in Arrangements of Pseudo-circles and their Applications, Eran Nevo, Janos Pach, Rom Pinchasi, Micha Sharir and Shakhar Smorodinsky 11:50 - 12:00 Small break 12:00 - 13:00 INVITED TALK 2 13:00 - 15:00 Lunch 15:00 - 16:20 Session 6 - Guaranteed-Quality Parallel Delaunay Refinement for Restricted Polyhedral Domains, Demian Nave and Nikos Chrisochoides and Paul Chew - The Delaunay Tetrahedralization from Delaunay Triangulated Surfaces, Sunghee Choi - Quickest Paths, Straight Skeletons, and the City Voronoi Diagram, Oswin Aichholzer and Franz Aurenhammer and Belen Palop - Testing Homotopy for Paths in the Plane, Sergio Cabello, Yuanxin Liu and Jack Snoeyink 16:20 - 16:50 Coffee break 16:50 - 17:50 Session 7 - Pseudo Approximation Algorithms, with Applications to Optimal Motion Planning, Tetsuo Asano, David Kirkpatrick and Chee Yap - Kinetic Maintenance of Context-Sensitive Hierarchical Representations of Disjoint Simple Polygons , David Kirkpatrick and Bettina Speckmann - Interlocked Open Linkages with Few Joints, Erik D. Demain, Stefan Langerman, Joseph O'Rourke and Jack Snoeyink 18:00 - 19:00 Business meeting 20:30 - Social event: Conference Dinner JUNE 7th 9:00 - 10:20 Session 8 - Conforming Delaunay Triangulations in 3D, David Cohen-Steiner and Eric Colin de Verdiere and Mariette Yvinec - The Probabilistic Complexity of the Voronoi Diagram of Points on a Polyhedron, Mordecai J. Golin and Hyeon-Suk Na - Three Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations, Vladlen Koltun and Micha Sharir - Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions, Vladlen Koltun and Micha Sharir 10:20 - 10:50 Coffee break 10:50 - 11:50 Session 9 - Vertex-Unfolding of Simplicial Manifolds, Erik D. Demaine and David Eppstein and Jeff Erickson and George W. Hart and Joseph O'Rourke - Optimally Cutting a Surfce into a Disk, Jeff Erickson and Sariel Har-Peled - Optimal Decomposition of Polygonal Models into Triangle Strips, Regina Estkowski, Joseph S.B. Mitchell and Xinyu Xiang 11:50 - 12:00 Small break 12:00 - 13:00 INVITED TALK 3 13:00 - 15:00 Lunch 15:00 - 16:00 Videos session - Exact Minkowski Sums and Applications, Eyal Flato, Efi Fogel, Dan Halperin, and Eran Leiserowitz - Homotopy Techniques for Real-Time Visualization of Geometric Tangent Problems, Daniel Kotzor and Thorsten Theobald - Growing Fat Graphs, Alon Efrat, Stephen Kobourov, Martin Stepp, and Carola Wenk - AUTO-FOLLOW: Getting a Piece of the Action All the Time, Alexander Bogomjakov and Craig Gotsman - Adventures of Moebius Band, Stanislav Klimenko, Gregory M. Nielson, Lialia Nikitina, and Igor Nikitin 16:00 - 16:30 Coffee break 16:30 - 17:50 Session 10 - Improved Construction of Vertical Decompositions of Three-Dimensional Arrangements, Hayim Shaul and Dan Halperin - Cost Prediction for Ray Tracing, B. Aronov and H. Bronnimann and A.Y. Chang and Y.-J. Chiang - Visibility Preserving Terrain Simplification - An Experimental Study, Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell and Yuval Nir - Projective Clustering in High Dimensions Using Core-Sets, Sariel Har-Peled and Kasturi R. Varadarajan 17:50 Conference concludes ------------- 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 hra at cs.uga.edu Fri Mar 1 14:18:39 2002 From: hra at cs.uga.edu (Hamid Arabnia) Date: Mon Jan 9 13:41:04 2006 Subject: Extended Deadline: March 11; Joint International Conferences in Computer Science; Las Vegas, June 24-27, 2002 Message-ID: <200203011918.OAA15739@apollo.cs.uga.edu> EXTENDED DEADLINE FOR SUBMISSIONS - New Deadline: March 11, 2002 C A L L F O R P A P E R S ============================= The 2002 International Multiconferences in Computer Science (14 Joint Int'l Conferences) Monte Carlo Resort, Las Vegas, Nevada, USA June 24-27, 2002 Dear Colleagues: You are invited to submit a draft paper (see instructions below.) All accepted papers will be published in the respective conference proceedings. Any help in distributing this announcement would be most appreciated. Fourteen Joint Conferences: 1. The 2002 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'02) 2. The 2002 International Conference on Imaging Science, Systems, and Technology (CISST'02) 3. The 2002 International Conference on Artificial Intelligence (IC-AI'02) 4. The 2002 International Conference on Internet Computing (IC'02) 5. The 2002 International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS'02) 6. The 2002 International Conference on Communications in Computing (CIC'02) 7. The 2002 International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA'02) 8. The 2002 International Conference on VLSI (VLSI'02) 9. The 2002 International Conference on Information and Knowledge Engineering (IKE'02) 10. International Workshop on Computational Models of Scientific Reasoning and Applications (CMSRA'02) 11. The 2002 International Conference on Machine Learning and Applications (ICMLA'02) 12. The 2002 International Conference on Wireless Networks (ICWN'02) 13. The 2002 International Conference on Software Engineering Research and Practice (SERP'02) 14. The 2002 International Conference on Security and Management (SAM'02) (a link to each conference's URL is available from http://www.ashland.edu/~iajwa/conferences) Please regard this announcement as General Guidelines. You are requested to send your submission to the Multiconferences chair whose address appears below. CONFERENCES CONTACT: H. R. Arabnia, Ph.D. Chair, The 2002 Int'l Multiconferences in Computer Science The University of Georgia Department of Computer Science 415 Graduate Studies Research Center Athens, Georgia 30602-7404, U.S.A. Tel: (706) 542-3480 Fax: (706) 542-2966 email: hra@cs.uga.edu HISTORY: The International Multiconferences in Computer Science is a major annual international research event. The last Multiconferences attracted over 1400 computer science researchers. It is anticipated that The 2002 International Multiconferences will attract about 2000 participants. The 2002 event will be composed of 14 (planned) international conferences - attendees will have full access to all 14 conferences' sessions and tracks. SUBMISSION OF PAPERS: Prospective authors are invited to submit three copies of their draft paper (about 5 pages - single spaced and font size of 10 to 12) to H. R. Arabnia by the due date (who may be forwarding the papers to respective conference chairs/committees). E-mail and Fax submissions are also acceptable. The length of the Camera-Ready papers (if accepted) will be limited to 7 (IEEE style) pages. Papers must not have been previously published or currently submitted for publication elsewhere. The first page of the draft paper should include: title of the paper, name, affiliation, postal address, E-mail address, telephone number, and Fax number for each author. The first page should also include the name of the author who will be presenting the paper (if accepted) and a maximum of 5 keywords. EVALUATION PROCESS (General): Papers will be evaluated for originality, significance, clarity, and soundness. Each paper will be refereed by two researchers in the topical area. The Camera-Ready papers will be reviewed by one person. PUBLICATION: The conference proceedings will be published by CSREA Press (ISBN) in hardcopy. The proceedings will be available at the conference. Some accepted papers will also be considered for journal publication (soon after the conference). (In addition to the hardcopy, it is also planned to publish the papers on a CD.) All conference proceedings published by CSREA Press are considered for inclusion in major database indexes that are designed to provide easy access to the current literature of the sciences (database examples: ISI Thomson Scientific, IEE INSPEC, ...). ORGANIZERS/SPONSORS: A number of university faculty members and their staff in cooperation with the Monte Carlo Resort (Conference Division, Las Vegas ), will be organizing the conferences. The conferences will be technically sponsored by World Academy of Sciences and co-sponsored by Computer Science Research, Education, & Applications Press (CSREA: USA Federal EIN # 58-2171953) together with research centers, international associations, international research groups, and developers of high-performance machines and systems. The complete list of sponsors and co-sponsors will be available at a later time. (Previous conferences' sponsors included: CSREA, the National Supercomputing Center for Energy and the Environment - DOE, The International Association for Mathematics and Computers in Simulation, The International Technology Institute (ITI), The Java High Performance Computing research group, World Scientific and Engineering Society, Sundance Digital Signal Processing Inc., the Computer Vision Research and Applications Tech., The Korea Information Processing Society (KIPS), Information Processing Society of Japan (SIGMPS/IPSJ), ...) LOCATION OF CONFERENCES: The conferences will be held in the Monte Carlo Resort hotel Las Vegas, Nevada, USA (with any overflows at other near-by hotels). The Monte Carlo Resort is a mega hotel with excellent conference facilities and over 3,000 rooms. The hotel is minutes from the Las Vegas airport with 24-hour shuttle service to and from the airport. This hotel has many vacation and recreational attractions, including: waterfalls, casino, spa, pools & kiddie pools, sunning decks, Easy River water ride, wave pool with cascades, lighted tennis courts, health spa (with workout equipment, whirlpool, sauna, ...), arcade virtual reality game rooms, nightly shows, snack bars, a number of restaurants, shopping area, bars, ... Many of these attractions are open 24 hours a day and most are suitable for families and children. The negotiated hotel's room rate for conference attendees is very reasonable (79USD + tax) per night (no extra charge for double occupancy) for the duration of the conference. The hotel is within walking distance from most other Las Vegas attractions (major shopping areas, recreational destinations, fine dining and night clubs, free street shows, ...). For the benefit of our international colleagues: the state of Nevada neighbors with the states of California, Oregon, Idaho, Utah, and Arizona. Las Vegas is only a few driving hours away from other major cities, including: Los Angeles, San Diego, Phoenix, Grand Canyon, ... EXHIBITION: An exhibition is planned for the duration of the conferences. Interested parties should contact H. R. Arabnia (address is given below). All exhibitors will be considered to be the co-sponsors of the conferences. IMPORTANT DATES: March 11, 2002: Draft papers (about 5 pages) due March 21-April 1, 2002: Notification of acceptance April 22, 2002: Camera-Ready papers & Prereg. due June 24-27, 2002: All 14 Int'l Conferences: PDPTA'02 + CISST'02 + IC-AI'02 + IC'02 + METMBS'02 + CIC'02 + ERSA'02 + VLSI'02 + IKE'02 + CMSRA'02 + ICMLA'02 + ICWN'02 + SERP'02 + SAM'02 MEMBERS OF PROGRAM & ORGANIZING COMMITTEES: The Program Committees are currently being formed. Currently (as of Feb. 26, 2002) there are 420 members in the committees - we need more members. Those interested in joining the Program Committees should email H. R. Arabnia (hra@cs.uga.edu) the following information: Name, affiliation and position, complete mailing address, email address, tel/fax numbers, name of the conference offering to help with, a short biography together with research interests. SCOPE OF PDPTA'02 (Topics of interest include, but are not limited to): (The 2002 International Conference on Parallel and Distributed Processing Techniques and Applications) O Parallel/Distributed applications: Numerical computations/methods, neural networks and fuzzy logic, medicine, remote sensing, GIS, computer vision, computer graphics and virtual reality, parallel/distributed databases, banking, financial markets, ... O Parallel/Distributed architectures: Clusters and parallel systems of various topologies, supercomputers, shared memory, distributed memory, general- and special-purpose architectures, instructional level parallelism, ... O Building block processors: Applications of processors that can be used as basic building blocks for multicomputer systems. O Networks and Interconnection networks: Scalable networks, Reconfigurable networks, routing issues, general-purpose network performance for distributed applications, network protocols, ATM-based systems, internet technology, Optical interconnections and computing, ... O Reliability and fault-tolerance: Software and hardware fault-tolerance (system- and application-level), fault diagnosis, fault-tolerance measurement. O Performance analysis, evaluation, prediction, ... O Real-time and embedded systems: Small-scale parallel systems for high-performance control, data acquisition, and analysis; configuration, routing, scheduling, performance guarantees. O Parallel/Distributed algorithms: Algorithms exploiting clusters and general-purpose distributed and parallel systems, new vector/pipeline issues, shared memory, distributed memory, virtual memory, ... O Mobile computation and communication. O Object Oriented Technology and related issues. O Multimedia Communications, Systems, and Applications: High-speed networking, multimedia architectures and protocols, multimedia applications, quality of service support, operating system and networking support, internet tools and applications, audio/video delivery over the internet, ... O Software tools and environments for parallel and distributed platforms: Operating systems, compilers, languages, debuggers, monitoring tools, software engineering on parallel/distributed systems, ... O High-performance computing in Computational Science: Intra-disciplinary and multi-disciplinary research programs and applications. O Information and data fusion. O Petri Nets: theory, analysis, tools and applications O Web-based simulation and computing. O Education: parallel and distributed processing in computer science curriculum (both graduate and undergraduate levels.) O Recent history (last decade) of parallel/distributed processing and what to expect during the next decade if history repeats itself; New horizons. O Other aspects and applications relating to high-performance computations. SCOPE OF CISST'02 (Topics of interest include, but are not limited to): (The 2002 International Conference on Imaging Science, Systems, and Technology) O Image generation, acquisition, and processing O Image display techniques O Image data structures and databases O Convergence of imaging media (video and computer) O Virtual reality O Image compression, coding, and encryption O Multimedia / Applications O Tools for multimedia production and services O Digital imaging for film and television O Visualization O Scene and object modeling O Knowledge acquisition O Visual inspection O Document image understanding O Image algebra O Optical image processing systems O Mathematical morphology O Architecture of imaging and vision systems (including parallel architectures and algorithms) O Neural network techniques and fuzzy logic O Performance analysis and evaluation O Software tools and environments for imaging O Animation O Geometric modeling and Fractals O CAD/CAM systems O Rendering techniques O Applications including: medicine, robotic, GIS, remote sensing, industrial inspection (or machine vision), nondestructive evaluation (or NDE), ... O Multi-resolution and multi-spectral image processing O Image sequence processing O Information fusion O Other aspects and applications relating to imaging science SCOPE OF IC-AI'02 (Topics of interest include, but are not limited to): (The 2002 International Conference on Artificial Intelligence) O Intelligent Information Systems O Intelligent Software Engineering O Intelligent Agents O Intelligent Networks O Intelligent Databases O Brain Models O Evolutionary Algorithms O Data mining O Reasoning Strategies O Automated Problem Solving O Distributed AI Algorithms and Techniques O Distributed AI Systems and Architectures O Expert Systems O Fuzzy Logic O Genetic Algorithms O Heuristic Searching O Knowledge Acquisition O Knowledge Discovery O Knowledge Representation O Knowledge-Intensive Problem Solving Techniques O Languages and Programming Techniques for AI O Software Tools for AI O Natural Language Processing O Neural Networks and Applications O Multisource Information Fusion: Theory and Applications O Multisource-Multisensor Data Fusion O Learning and Adaptive Sensor Fusion O Multisensor Data Fusion Using Neural and Fuzzy Techniques O Integration of AI with other Technologies O Evaluation of AI Tools O Evolutionary Computation O Social Impact of AI O Applications - Computer Vision O Applications - Signal Processing O Applications - Military O Applications - Surveillance O Applications - Robotics O Applications - Medicine O Applications - Pattern Recognition O Applications - Face Recognition O Applications - Finger Print Recognition O Applications - Finance and Marketing O Applications - Stock Market O Applications - Education O Emerging Applications SCOPE OF IC'02 (Topics of interest include, but are not limited to): (The 2002 International Conference on Internet Computing) O Web based computing O Network Management O Design and Analysis of Internet Protocols O Network Architectures O Performance Evaluation of the Internet O Network Computing O Network Operating Systems O Quality of Service O Resource Management and Location O Wide Area Consistency O Internet Security O Internet Applications and Appliances O Electronic Commerce O The WWW and Intranets O Metacomputing O Grid based Computing and Tools O Languages for Distributed Programming O Cooperative Applications O Tele-Medical and other applications O Internet Telephony O Mobile Computing O Educational Applications O Digital Libraries/Digital Image Collections O Web Interfaces to Databases O User-interface/Multimedia/Video/Audio/User Interaction O Markup Languages/HTML/XML/VRML O Java Applications on Internet O Alternative Web lifestyles, role-playing, chat, ... O Caching Algorithms for the Internet O Traffic Models & Statistics O Server Space/Web Server Performance O Web Monitoring O Web Documents Management O Web Site Design and Coordination O Other aspects & applications relating to internet-based computing SCOPE OF METMBS'02 (Topics of interest include, but are not limited to): (The 2002 International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences) O Data mining in medicine and biological sciences O Pattern recognition in medicine and biological sciences O Signal processing in medicine and biological sciences (e.g. biomedical signal processing, ...) O Image processing in medicine and biological sciences (e.g. biomedical image processing, biomedical imaging, ...) O Medical decision-making O Medical Physics O Biomedical Engineering O Biomedical Electronics O Biosignal interpretation O Any application of computers in Medicine and biological sciences (protein structure-function analysis, drug and protein design, molecular modeling and simulation, ...) O Application of information technology in biomedicine (e.g. medical database management, information retrieval and use of computers in hospitals) O Application of Computational Intelligence (artificial neural networks, fuzzy logic, and evolutionary computing) in medicine and biological sciences O Medical and bio-computing O Computer-based medical systems (automation in medicine, ...) O Recent history (1990-2001) of Mathematics and engineering techniques in medicine and biological sciences, and what to expect during the next decade (2001-2010); New horizons. Review articles) O Other aspects and applications relating to technological advancements in medicine and biological sciences SCOPE OF CIC'02 (Topics of interest include, but are not limited to): (The 2002 International Conference on Communications in Computing) O High Performance Applications (e.g. scientific, commercial, ...) O Distributed Systems and Advanced Applications (e.g. multimedia, cooperative systems) O Grid computing O Scalable and Interoperable Systems and Associated Standards O Software Systems (e.g. operating system support, middleware, environments, tools, distributed objects) O Architecture (e.g. VLSI, SIMD, MIMD, vector, systolic, reconfigurable, special-purpose) O Interconnection networks (e.g. bus-based, optical) O ATM based networks O Communications (e.g. routing, wireless, mobile) O Visualization (e.g. scientific visualization, debugging and load balancing tools) O Photonics and Optical Computing O Performance Issues (e.g. benchmarks, performance measurement, evaluation and prediction) O Modeling and Simulation of High Performance Systems O Advanced Compilation Techniques (e.g. parallelizing compilers) O Programming Languages for Parallel and other High Performance Computing Environments O Parallel/Distributed/Vector Algorithms O Reliability and Fault Tolerance O Embedded and Real Time Systems O Digital Signal Processing O Neural Computing, Genetic Algorithms O Issues in High Performance Computing (e.g. evolving paradigms, grand challenge problems) O Internet & web based processing, E-commerce, telecommunication network, cluster-based computing SCOPE OF ERSA'02 (Topics of interest include, but are not limited to): (The 2002 International Conference on Engineering of Reconfigurable Systems and Algorithms) O Theory, Mapping and Parallelization. Mapping algorithms into hardware, space-time mapping and synthesis of regular arrays, IP based methods, dataflow and functional programming approaches, formal methods using logical specification and verification, developing correct circuits, the impact of reconfigurable hardware architectures onto algorithm parallelization, biologically inspired methods etc. O System Architectures, Aspects and Evaluation. Complex systems using reconfigurable processors, application-tailored reconfigurable Systems-on-Chip (SoC), architectures of SoCs, adaptive and evolvable systems, rapid system prototyping, ... O CAD: Specification, Partitioning and Synthesis. Hardware compilation, hardware/software codesign, IP-based specification and mapping methods for reconfigurable systems, object oriented models and mapping methods, hardware description languages, design environments and interfaces, ... O Reconfigurable Hardware Architectures. Dynamically reconfigurable hardware architectures, reconfigurable processor architectures, compiled accelerators, performance evaluation of reconfigurable SoCs, application-specific communication interfaces of reconfigurable SoCs, low power evaluation and optimization of reconfigurable systems, fault-tolerance using reconfigurable hardware, trade-offs measurements, ... O Algorithms and Optimization. Newly developed algorithms for efficient implementation on reconfigurable systems, in hardware, in space and time, algorithms for design optimization, ... O Applications. Possible applications areas of interest include, but are not limited to: Classical image and signal processing - digital filters, edge and line detection, morphological operators, motion and stereo estimation, discrete transformations, linear algebra, radar systems, object recognition, ... Multimedia and virtual reality - telecommunication, data compression, video imaging, image databases, computational geometry and computer graphics, software radio, digital libraries, genetic databases, ... Automotive industry - lane detection and obstacle detection, vehicle guidance, traffic systems, object recognition, navigation of robots, ... Security systems - object recognition and tracking, cryptology, Internet and security, ... SCOPE OF VLSI'02 (Topics of interest include, but are not limited to): (The 2002 International Conference on VLSI) O Quantum Computing O Nanoelectronics O Molecular and Biological Computing O MEMS O Circuits and Systems O Novel Design and Methodologies O System-on-a-Chip: Design and Methodology O Low Power VLSI System Design O Complexity Issues O Simulation Tools O Algorithm Design Approaches (AI, Genetic, ...) O High-Level Design Methodologies O ASIC Architectures O Reconfigurable Systems Design O Novel Devices and Circuits O Emerging Trends O High-Performance Circuits O Reusable Architectures O Test and Verification O Synthesis O Mixed-Signal Design and Analysis O Electrical/Packaging Designs and Co-Designs O Applications (all applications will be considered) SCOPE OF IKE'02 (Topics of interest include, but are not limited to): (The 2002 International Conference on Information and Knowledge Engineering) O Client-Server Architectures O Information and Knowledge Engineering O Mobile Agents O Web-Based Design and Development O Knowledge and Information Management Techniques O Data Mining Techniques O Database Engineering and Systems O Knowledge Delivery Methods O Document Processing O Data Security O Knowledge Life Cycle O Business Architectures O Formal and Visual Specification Languages O Software Tools and Support O QoS issues O Performance Evaluation Techniques O Knowledge-Based Systems O Clustering Techniques O Web Technology and Systems for Information and Knowledge Based Applications O Dataweb Models and Systems O Data Warehouses O Workflow Management O Knowledge and Information Extraction and Discovery Techniques O Service Recovery / Fault-Tolerance O Large-Scale Information Processing Methods O Data and Knowledge Processing O Data Structures O Video Databases O Distributed Databases O Information and Knowledge Structures O Databanks - issues, methods, and standards O Information Quality (Quality Metrics) O E-Libraries (Digital Libraries) O Intelligent Knowledge-Based Systems O XMI O Agent-Based Techniques and Systems O Content Management O Information Reliability and Security O Hardware Architectures O Modeling and Simulation O Decision Support Systems O Expert Systems O Aspect-Oriented Programming O Re-usability of Software/Knowledge/Information O Privacy Issues O Interoperability Issues O Transaction Systems O Object-Oriented Modeling and Systems O RAID Architectures O Knowledge Classification Tools O Case-Based Reasoning O Bayesian Techniques O Ubiquitous Computing O Managing Copyright Laws O Digital Watermarking O Data/Information/Knowledge Models O Applications (e-Commerce, Multimedia, Business, Banking, ...) SCOPE OF CMSRA'02 (Topics of interest include, but are not limited to): (International Workshop on Computational Models of Scientific Reasoning and Applications) O Inference Procedures: Ampliative Inference Argumentative and Defeasible Reasoning Analogy, Induction and Abduction Paraconsistent Logics Plausible and Hypothetical Reasoning Causal and Explanatory Reasoning Hypothesis Formation, Learning and Discovery Coherence, Explanation and Acceptance Procedural Rationality O Philosophical Aspects of the Computational Models of Scientific Reasoning: Computational Epistemology and Theory of Science Cognitive Theory Formation Acceptance and Decision Making Reasoning as opposed to Logic Concept Formation and Conceptual Change Design in Scientific Method The Growth of Knowledge O Social Metaphors: Science as Distributed Computing Internet Epistemology Self-Organizing Agents Team Theory Rules of Negotiation Social Choice Sociology of Knowledge Evolutionary Epistemology O Applications: New Information Technologies Computational Theories in the Sciences Intelligent Data Mining Agent-Based Scientific Discovery Modelling Agreement Intelligent Protocols for E-Commerce SCOPE OF ICMLA'02 (Topics of interest include, but are not limited to): (The 2002 International Conference on Machine Learning and Applications) O multistrategy learning O statistical learning O neural network learning O bayesian network O case-based reasoning O evolutionary computation O reinforcement learning O machine learning of natural language O grammatical inference O knowledge acquisition and learning O knowledge discovery in databases O knowledge intensive learning O knowledge management and learning O information retrieval and learning O theories and models for plausible reasoning O cooperative learning O planning and learning O multi-agent learning O web navigation and mining O inductive logic programming O computational learning theory O cognitive-modeling O hybrid algorithms SCOPE OF ICWN'02 (Topics of interest include, but are not limited to): (The 2002 International Conference on Wireless Networks) O Wireless network architectures O Wireless communications O Multiple access O Routing O Signaling O Mobile Internet O Transport-layer issues O Wireless security O Wireless and mobile applications O Mobile computing O Modeling, simulation, and measurement of wireless systems/networks O Mobile ad-hoc networks O 3G, 4G, and beyond O Satellite-based systems O Wireless LAN and home networks O Wireless sensor networks O Wireless mobile ATM (wmATM) O MIMO O Adaptive antennas O Coding and modulation O Synchronization O Multi-user detection O Power management and control, low-power protocols O IEEE 802.11, 802.15, 802.16, Bluetooth O OFDM O CDMA, B-CDMA O QoS routing, power-aware routing, location-aware routing O Resource management, wireless QoS O Wireless IP networks, interworking O Wireless multimedia, QoS adaptation O WAP, mobile e-commerce O Location-based service, GPS O Mobile agents O Distributed algorithms for wireless networks SCOPE OF SERP'02 (Topics of interest include, but are not limited to): (The 2002 International Conference on Software Engineering Research and Practice) O Software architectures O Object-Oriented technology O Measurement, metrics and analysis O Survivable systems O Requirements engineering O Reverse engineering O Software domain modeling O Software process modeling O Workflow - Computer Supported Cooperative Work (CSCW) O Project management issues O Distributed and parallel systems O Legal issues and standards O Configuration management (issues and tools) O Automated software specification O Automated software design and synthesis O Theoretic approaches (formal methods, graph, ...) O Domain modeling and meta-modeling O Evolution and maintenance O Knowledge acquisition O Reflection and metadata methodologies O Artificial intelligence approaches to Software Engineering O Automated software engineering O Component-based engineering O Data mining O Interoperability O Intelligent CASE tools O Multimedia in software engineering O Hypermedia O Software reuse O Verification, validation and quality assurance O Performance critical systems O Engineering practices O Programming languages O Program understanding issues O Education (software engineering curriculum design) O Software engineering versus Systems engineering O Software documentation O Technology adoption O Human-Computer Interaction (HCI) O Architecture tradeoff analysis O Novel software tools and environments SCOPE OF SAM'02 (Topics of interest include, but are not limited to): (The 2002 International Conference on Security and Management) O Security Protocols O Mobility Management O Security Algorithms O Location Management O QoS Management O Key Management Techniques O Security in E-commerce and M-commerce O Security Policies O Resource Management O Mobile Network Security O Channel Management O AAA O Encryption O Security in Mobile IPv4/IPv6 O VPN O Firewall O IDS (Intrusion Detection System) O Digital contents copyright protection techniques O Watermarking O Secure OS O Honeypot O Virus Issues (Detection, Prevention, ...) O Tracing Techniques in Internet O Active Networks O Security in CDN (Contents Distribution Networks) O Hacking Techniques and Related Issues O Security in GRID O Biological Security Technologies O Surveillance Technologies O High-Tech Systems at Airports O Face Recognition Systems O Signature Recognition Systems O Network Management O System Management O Network Security Management O Management in Network Equipments O SAN (Storage Area Networks) Management O GRID Middleware O GRID Applications O GRID Networks O Security for Protocol Management O Management Protocol (SNMP, CMIP, etc) ------------- 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 vera at ma2.upc.es Sun Mar 3 22:13:35 2002 From: vera at ma2.upc.es (Vera Sacristan) Date: Mon Jan 9 13:41:04 2006 Subject: [DMANET] SoCG 2002 Correction References: <3C7FC9B4.F4BC2C26@ma2.upc.es> Message-ID: <3C8291FE.9B36BF4B@ma2.upc.es> CALL FOR PARTICIPATION We are pleased to announce that the registration for the 18th ACM Symposium on Computational Geometry which will be held at the Universitat Polit?cnica de Catalunya, Barcelona, Spain, June 5-7, is now open, and we would like to encourage participation to this significant event. The conference website at http://www-ma2.upc.es/~geomc/events/socg2002/socg2002.html contains registration form, accomodation form, preliminary program (an ASCII version is attached below), general information about the conference, local information, as well as details about the CGAL User Workshop on June 4th. The early registration deadline is May 12, but we would like to encourage you to register as soon as possible, as accomodation will be reserved on a first-come-first-served basis, and finding a hotel room in Barcelona, a very popular touristic destination, is not at all a trivial matter. We are looking forward to seeing you in Barcelona! Ferran Hurtado and Vera Sacrist?n Conference Chairs ======================================================================== Preliminary Program JUNE 4th 18:00 - 20:00 Reception and registration JUNE 5th 8:30 - 9:00 Late registration 9:00 - 10:20 Session 1 - Parametric Search Made Practical, Rene van Oostrum and Remco C. Veltkamp - A Local Search Approximation Algorithm for k-Means Clustering, Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine Piatko, Ruth Silverman and Angela Y. Wu - On the Crossing Number of Complete Graphs, Oswin Aichholzer, Franz Aurenhammer and Hannes Krasser - On the Number of Embeddings of Minimally Rigid Graphs, Ciprian Borcea and Ileana Streinu 10:20 - 10:50 Coffee break 10:50 - 11:50 Session 2 - Deforming Necklaces, Leonidas J. Guibas, An Nguyen, Daniel Russel and Li Zhang - Efficient Maintenance and Self-Collision Testing for Kinematic Chains, Itay Lotan and Fabian Schwarzer and Dan Halperin and Jean-Claude Latombe - Box-Trees for Collision Checking in Industrial Installations, H.J. Haverkort and M. de Berg and J. Gudmundsson 11:50 - 12:00 Small break 12:00 - 13:00 INVITED TALK 1 13:00 - 15:00 Lunch 15:00 - 16:00 Session 3 - Finding the Consensus Shape for a Protein Family, L. Paul Chew and Klara Kedem - Paper Position Sensing, Marshall Bern and David Goldberg - A Global Approach to Automatic Solution of Jigsaw Puzzles, David Goldberg and Christopher Malon and Marshall Bern 16:00 - 16:15 Coffee break 16:15 - 17:15 Open Problems 17:30 - 20:30 Social event: Gaud? Tour JUNE 6th 9:00 - 10:20 Session 4 - The Power of Subtraction in Geometric Searching, Bernard Chazelle - A lower bound on the distortion of embedding planar metrics into Euclidean space, Ilan Newman and Yuri Rabinovich - The One-Round Voronoi Game, Otfried Cheong, Sariel Har-Peled, Nathan Linial and Jiri Matousek - Approximate Nearest Neighbor Algorithms for Frechet Distance via Product metrics, Piotr Indyk 10:20 - 10:50 Coffee break 10:50 - 11:50 Session 5 - Point-Line Incidences in Space, Micha Sharir and Emo Welzl - Incidences Between Points and Circles in Three Dimensions, Boris Aronov, Vladlen Koltun and Micha Sharir - Lenses in Arrangements of Pseudo-circles and their Applications, Eran Nevo, Janos Pach, Rom Pinchasi, Micha Sharir and Shakhar Smorodinsky 11:50 - 12:00 Small break 12:00 - 13:00 INVITED TALK 2 13:00 - 15:00 Lunch 15:00 - 16:20 Session 6 - Guaranteed-Quality Parallel Delaunay Refinement for Restricted Polyhedral Domains, Demian Nave and Nikos Chrisochoides and Paul Chew - The Delaunay Tetrahedralization from Delaunay Triangulated Surfaces, Sunghee Choi - Quickest Paths, Straight Skeletons, and the City Voronoi Diagram, Oswin Aichholzer and Franz Aurenhammer and Belen Palop - Testing Homotopy for Paths in the Plane, Sergio Cabello, Yuanxin Liu and Jack Snoeyink 16:20 - 16:50 Coffee break 16:50 - 17:50 Session 7 - Pseudo Approximation Algorithms, with Applications to Optimal Motion Planning, Tetsuo Asano, David Kirkpatrick and Chee Yap - Kinetic Maintenance of Context-Sensitive Hierarchical Representations of Disjoint Simple Polygons, David Kirkpatrick and Bettina Speckmann - Interlocked Open Linkages with Few Joints, Erik D. Demain, Stefan Langerman, Joseph O'Rourke and Jack Snoeyink 18:00 - 19:00 Business meeting 20:30 - Social event: Conference Dinner JUNE 7th 9:00 - 10:20 Session 8 - Conforming Delaunay Triangulations in 3D, David Cohen-Steiner and Eric Colin de Verdiere and Mariette Yvinec - The Probabilistic Complexity of the Voronoi Diagram of Points on a Polyhedron, Mordecai J. Golin and Hyeon-Suk Na - Three Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations, Vladlen Koltun and Micha Sharir - Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions, Vladlen Koltun and Micha Sharir 10:20 - 10:50 Coffee break 10:50 - 11:50 Session 9 - Vertex-Unfolding of Simplicial Manifolds, Erik D. Demaine and David Eppstein and Jeff Erickson and George W. Hart and Joseph O'Rourke - Optimally Cutting a Surfce into a Disk, Jeff Erickson and Sariel Har-Peled - Optimal Decomposition of Polygonal Models into Triangle Strips, Regina Estkowski, Joseph S.B. Mitchell and Xinyu Xiang 11:50 - 12:00 Small break 12:00 - 13:00 INVITED TALK 3 13:00 - 15:00 Lunch 15:00 - 16:00 Videos session - Exact Minkowski Sums and Applications, Eyal Flato, Efi Fogel, Dan Halperin, and Eran Leiserowitz - Homotopy Techniques for Real-Time Visualization of Geometric Tangent Problems, Daniel Kotzor and Thorsten Theobald - Growing Fat Graphs, Alon Efrat, Stephen Kobourov, Martin Stepp, and Carola Wenk - AUTO-FOLLOW: Getting a Piece of the Action All the Time, Alexander Bogomjakov and Craig Gotsman - Adventures of Moebius Band, Stanislav Klimenko, Gregory M. Nielson, Lialia Nikitina, and Igor Nikitin 16:00 - 16:30 Coffee break 16:30 - 17:50 Session 10 - Improved Construction of Vertical Decompositions of Three-Dimensional Arrangements, Hayim Shaul and Dan Halperin - Cost Prediction for Ray Tracing, B. Aronov and H. Bronnimann and A.Y. Chang and Y.-J. Chiang - Visibility Preserving Terrain Simplification - An Experimental Study, Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell and Yuval Nir - Projective Clustering in High Dimensions Using Core-Sets, Sariel Har-Peled and Kasturi R. Varadarajan 17:50 Conference concludes ********************************************************** * * Contributions to be spread via DMANET are submitted to * * DMANET@zpr.uni-koeln.de * * Replies to a message carried on DMANET should NOT be * addressed to DMANET but to the original sender. The * original sender, however, is invited to prepare an * update of the replies received and to communicate it * via DMANET. * * DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET) * http://www.zpr.uni-koeln.de/dmanet * ********************************************************** From rr29 at mcs.le.ac.uk Thu Mar 7 18:27:20 2002 From: rr29 at mcs.le.ac.uk (Rajeev Raman) Date: Mon Jan 9 13:41:04 2006 Subject: 2nd CFP: 10th Annual European Symposium on Algorithms (ESA 2002) Message-ID: CALL FOR PAPERS ESA 2002 10th Annual European Symposium on Algorithms University of Rome "La Sapienza", 17-21 September, 2002. SCOPE The Symposium covers research in efficient algorithms and data structures in computer science, discrete applied mathematics, operations research and mathematical programming. The symposium has two tracks, which deal respectively with: o the design and mathematical analysis of algorithms (the "Design and Analysis" track); o real-world applications, engineering and experimental analysis of algorithms (the "Engineering and Applications" track). ESA 2002 is sponsored by EATCS (the European Association for Theoretical Computer Science) and jointly organized with WABI 2002, APPROX 2002 and ARACNE 2002 in the context of ALGO 2002 (http://www.dis.uniroma1.it/~algo02/). TOPICS Papers presenting original research in all areas of algorithmic research are sought, including but not limited to: Computational Biology; Computational Finance; Computational Geometry; Databases and Information Retrieval; External-Memory Algorithms; Graph and Network Algorithms; Graph Drawing; Machine Learning; Network Design; On-line Algorithms; Parallel and Distributed Computing; Pattern Matching and Data Compression; Quantum Computing; Randomized Algorithms and Symbolic Computation. The algorithms may be sequential, distributed or parallel. Submissions are especially encouraged in the areas of mathematical programming and operations research, including: Approximation Algorithms, Branch-and-Cut Algorithms, Combinatorial Optimization, Integer Programming, Network Optimization, Polyhedral Combinatorics and Semidefinite Programming. SUBMISSIONS Authors are invited to submit an extended abstract or full paper of at most 12 pages. The paper should contain a succinct statement of the issues and of their motivation, a summary of the main results, and a brief explanation of their significance, accessible to non-specialist readers. Proofs omitted due to space constraints must be put into an appendix to be read by the program committee members at their discretion. Electronic submission is highly recommended; procedures for electronic submission may be found at the following URLs. Design and Analysis track: http://sigact.csci.unt.edu/~esa2002a/ESA2002A.html Engineering and Applications track: http://sigact.csci.unt.edu/~esa2002b/ESA2002B.html The postscript file must be received by 23:59 Pacific Time on the 15th of April (06:59 GMT on the 16th of April) to be considered. In case of problems with access to internet, it is possible to submit 6 copies of the paper to the appropriate program committee chair. ESA 2002 (Design and Analysis Track) Rolf Moehring Sekr. MA 6-1, Institut fuer Mathematik Fakultaet II: Mathematik und Naturwissenschaften Technische Universitaet Berlin Strasse des 17. Juni 136 D-10623 Berlin, Germany ESA 2002 (Engineering and Applications Track) Rajeev Raman Department of Maths and Computer Science University of Leicester University Road Leicester LE1 7RH, UK Hard copy submissions must be received by the 15th of April, or postmarked no later than 8th of April and sent by airmail, to be considered. It is expected that all accepted papers will be presented at the symposium by one of the authors. SIMULTANEOUS SUBMISSION Simultaneous submission to other conferences with published proceedings, or to both tracks of ESA 2002, is not permitted. A paper submitted to one track of ESA 2002 may be switched to the other track if, in the opinion of the PC chairs, the paper is better suited to the other track. BEST STUDENT PAPER AWARD EATCS sponsors an award of EUR 500 for the best student paper at ESA 2002. All of a paper's authors must be students for the paper to be considered for this award. Please indicate "student paper" on the front page of the submission, if all authors are students. IMPORTANT DATES Submission deadline April 15, 2002 (23:59 US Pacific Time) Notification to authors May 31, 2002 Final versions due June 26, 2002 Symposium September 17-21, 2002 PROCEEDINGS Accepted papers will be published in the Springer series Lecture Notes in Computer Science. Previous proceedings of ESA, 1999 in in Prague, 2000 in Saarbruecken and 2001 in Aarhus, appeared as LNCS 1643, 1879 and 2161. Previous proceedings of the precursor to the Engineering and Applications track, the Workshop on Algorithm Engineering, held in 1999 in London, 2000 in Saarbruecken and 2001 in Aarhus, appeared as LNCS 1668, 1982 and 2141. Accepted contributed papers will receive an allotment of 12 pages in the proceedings. Algorithmica will publish a special issue devoted to selected papers from ESA 2002. PROGRAM COMMITTEES Design and Analysis Track Susanne Albers (Freiburg, Germany) Stephen Alstrup (Copenhagen, Denmark) Janos Csirik (Szeged, Hungary) Thomas Erlebach (Zurich, Switserland) Sandor Fekete (Braunschweig, Germany) Lisa Fleischer (Pittsburgh, USA) Kazuo Iwama (Kyoto, Japan) Alberto Marchetti-Spaccamela (Rome, Italy) Rolf Moehring (Berlin, Germany, chair) Gunter Rote (Berlin, Germany) Andreas Schulz (Cambridge, USA) Jiri Sgall (Prague, Czech republic) Christos Zaroliagis (Patras, Greece) Uri Zwick (Tel Aviv, Israel) Engineering and Applications Track Karen Aardal (Utrecht, Netherlands) Camil Demetrescu (Rome, Italy) Olivier Devillers (Sophia Antipolis, France) Thomas Liebling (Lausanne, Switzerland) Michael Mitzenmacher (Cambridge, USA) David Mount (College Park, USA) Matthias Mueller-Hannemann (Bonn, Germany) S. Muthukrishnan (Florham Park, USA) Petra Mutzel (Vienna, Austria) Rajeev Raman (Leicester, UK, chair) Peter Sanders (Saarbruecken, Germany) ORGANIZING COMMITTEE Giorgio Ausiello Fabrizio d'Amore Camil Demetrescu Silvana Di Vincenzo Paolo Giulio Franciosa Daniele Frigioni Stefano Leonardi Alberto Marchetti-Spaccamela Alessandro Panconesi ------------- 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 arvasey at sandia.gov Thu Mar 7 07:53:46 2002 From: arvasey at sandia.gov (Vasey, Anita R) Date: Mon Jan 9 13:41:04 2006 Subject: CALL FOR PAPERS Message-ID: <2E714B3E290FAD4AB8D63ABD2F33BC9901AA6845@ES01SNLNT.sandia.gov> Skipped content of type multipart/alternative-------------- next part -------------- A non-text attachment was scrubbed... Name: Nature Bkgrd.jpg Type: image/jpeg Size: 3781 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20020307/3a61a4dc/NatureBkgrd.jpg From yaronber at cs.huji.ac.il Wed Mar 13 10:20:32 2002 From: yaronber at cs.huji.ac.il (Yaron Berman) Date: Mon Jan 9 13:41:04 2006 Subject: Implementation of Additively Weighted Voronoi Diagram Message-ID: Hello, Do you know of an existing implementation to the Additively Weighted Voronoi Diagram? If so, is it possible to obtain it for research purposes? If not, can you think of some implementation of Voronoi diagrams that may be altered so to take into account additive weights? Kind regards, Yaron Berman ------------- 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 ah at atlas.dgp.toronto.edu Thu Mar 14 12:55:49 2002 From: ah at atlas.dgp.toronto.edu (Alejo Hausner) Date: Mon Jan 9 13:41:04 2006 Subject: Implementation of Additively Weighted Voronoi Diagram In-Reply-To: Message-ID: On Wed, 13 Mar 2002, Yaron Berman wrote: > Do you know of an existing implementation to the Additively Weighted > Voronoi Diagram? > If so, is it possible to obtain it for research purposes? > If not, can you think of some implementation of Voronoi diagrams that may > be altered so to take into account additive weights? If you can tolerate a pixelized approximation to your problem, it's fairly easy to do this using graphics hardware. Since each Voronoi diagram is defined by the distance function attached to each site, it's just a matter of drawing a uniquely-coloured cone at each site, and looking down on it from above. To understand why this works, consider two generators, and their associated cones. The cones will intersect at a hyperbola which, seen from above, is a line. That line is the perpendicular bisector of the line through the two points. In other words, it's a voronoi edge. Of course, this only gives you a discretized approximation. You can refine it by identifying adjacent distinctly-coloured pixels. If two neighbouring pixels differ, then there is an edge between the two sites, in the Delaunay triangulation. You can then re-draw the voronoi edge exactly. If a colour is missing, its region was too small for the pixel spacing, and you'll need to "zoom in" on that site to see it. In this way, you can reconstruct the exact voronoi diagram, eventually. (by the way, Fortune's sweepline alg for voronoi diagrams corresponds to this approach, looking down at the cones from a 45-degree direction) Using different cones, you can draw different kinds of voronoi diagrams. I used something like this arrange decorative mosaic tiles, and have some code for that purpose. Alejo Hausner (ah@dgp.utoronto.ca) ------------- 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 icalp2002 at informatica.uma.es Thu Mar 21 19:19:45 2002 From: icalp2002 at informatica.uma.es (icalp2002@informatica.uma.es) Date: Mon Jan 9 13:41:04 2006 Subject: ICALP2002: accepted papers and preliminary program Message-ID: Dear Sir/Madam, I'm sending you the following information: -the list of accepted papers for ICALP'2002 (an HTML table with two columns; authors and title) -the preliminary program of ICALP'2002 is available on http://sirius.lcc.uma.es/ICALP2002/PreliminarySchedule.html (and on the "news" of ICALP2002 pages: http://www.lcc.uma.es/ICALP2002) -the preliminary program of the satellite event "Global Computing" (in the same link). I consider that this conference can be of your interest. The registration will be open in a few days. Best regards, Rafael Morales -------------- next part -------------- An HTML attachment was scrubbed... URL: http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20020321/f7110c72/tableAceptICALP2002.htm From exact at cs.nyu.edu Fri Mar 15 16:22:22 2002 From: exact at cs.nyu.edu (Chee Yap) Date: Mon Jan 9 13:41:04 2006 Subject: Software Release Announcement Message-ID: <200203152122.g2FLMM515659@jinai.cs.nyu.edu> ===================== SOFTWARE RELEASE ANNOUNCEMENT ========================== March 15, 2002: Core Library Version 1.4 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 computation with constructible real numbers (+,-,x,/,sqrt), under a variety of precision requirements. Numerical nonrobustness is a widely acknowledged problem. It has proven particularly intractable in the context of geometric algorithms where numerical data and combinatorial data are intermixed in a strongly constrained manner. Recent research in computational geometry has demonstrated a variety of techniques based on the principles of Exact Geometric Computation (EGC) 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 write numerical or geometric code that are fully robust just by calling our Library. -- ease of migration: Many existing C/C++ programs can be converted into robust CORE 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: The precision-driven approach to EGC, best known root bounds, filter technology, 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: It can serve as the "core" for your own applications. Just over 200KB (including source, extensions, demos, documentation) when gmp is not included. With gmp, the distribution is 2MB. -- tested on Sun Sparc, Linux, cygwin and Windowx platforms. What is new with CORE 1.4 ? -- adoption of gmp as the big number kernel -- the BFS floating point filter implemented (significant speedup possible) -- improved speed from incremental sqrt algorithm -- file I/O in decimal or hex, allowing linear time file I/O of numbers -- improved precision-driven algorithms -- redesigned geometry 2d and 3d extension libraries -- support for cygwin and Windoz platforms -- more sample programs, including the contribution of a hypergeometric package from M.Eleftheriou and J.Moreira of IBM T.J.Watson We welcome your comments and input. -- Chee Yap (yap@cs.nyu.edu) Zilin Du (zilin@cs.nyu.edu) March 15, 2002 |============================================= | Exact Computation Project | Department of Computer Science | Courant Institute of Mathematical Sciences | New York University | 251 Mercer Street | New York, NY 10012, USA | | For further information: | http://cs.nyu.edu/exact/ | mailto://exact@cs.nyu.edu. | | Supported by NSF/ITR Grant CCR-0082056. |============================================= ===================== 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From guha at blatz.cs.uwm.edu Mon Mar 25 15:08:54 2002 From: guha at blatz.cs.uwm.edu (Dr. Sumanta Guha) Date: Mon Jan 9 13:41:04 2006 Subject: A 3d curve reconstruction software Message-ID: Greetings, We are pleased to announce a 3d curve reconstruction software package ready for download at http://www.cs.uwm.edu/~pnb It is based on a locating monotone pieces of the given curve within the boxes of an octree and we call it PointsNBoxes. Enjoy, Sumanta Guha EE&CS UW-Milwaukee ------------- 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 teuhola at cs.utu.fi Wed Mar 27 13:58:59 2002 From: teuhola at cs.utu.fi (Jukka Teuhola) Date: Mon Jan 9 13:41:04 2006 Subject: SWAT 2002 Call for Participation Message-ID: -------------------------------------------------------------- CALL FOR PARTICIPATION Eighth Scandinavian Workshop on Algorithm Theory (SWAT 2002) July 3-5, 2002 Turku, Finland http://www.cs.utu.fi/swat2002 -------------------------------------------------------------- The SWAT workshop, which alternates with the Workshop on Algorithms and Data Structures (WADS), is intended as an international forum for researchers in the area of design and analysis of algorithms and data structures. The deadline for early registration is April 22nd, 2002. Registration is open at the web address http://www.cs.utu.fi/swat2002/registration.htm For more information please check the conference web pages or send email to swat2002@cs.utu.fi Invited speakers: ----------------- Torben Hagerup: "An Efficient Quasidictionary" Heikki Mannila: "Algorithmic and Probabilistic Techniques in Data Mining" Accepted papers: ---------------- Agnarsson, Damaschke and Halldorsson: "Powers of Geometric Intersection Graphs and Dispersion Algorithms" Alber, Fellows and Niedermeier: "Efficient Data Reduction for Dominating Set: A Linear Problem Kernel for the Planar Case" Albert and Atkinson: "Sorting with a Forklift" Alstrup, Brodal, G?rtz and Rauhe: "Time and Space Efficient Multi-Method Dispatching" Anand, Erlebach, Hall and Stefanakos: "Call Control with k Rejections" Arkin, Hassin, Rubinstein and Sviridenko: "Approximations for Maximum Transportation Problem with Permutable Supply Vector and other Capacitated Star Packing Problems" Augustine and Seiden: "Linear Time Approximation Schemes for Vehicle Scheduling" Azar, Epstein, Richter and Woeginger: "All-norm Approximation Algorithms" Bazgan, de la Vega and Karpinski: "Approximability of Dense Instances of Nearest Codeword Problem" Bodlaender and Fomin: "Tree decompositions with small cost" Bodlaender and Rotics: "Computing the treewidth and the minimum fill-in with the modular decomposition" Broersma, Fomin, Kratochvil and Woeginger: "Planar graph coloring with forbidden subgraphs: Why trees and paths are dangerous" Chleb?k and Chleb?kov?: "Approximation Hardness of the Steiner Tree Problem" Demaine, Lopez-Ortiz and Munro: "Robot Localization without Depth Perception" Eidenbenz: "Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains" Ellis, Fan and Fellows: "The Dominating Set Problem is Fixed Parameter Tractable for Graphs of Bounded Genus" Even, Kortsarz and Slany: "On network design problems: fixed cost flows and the Covering Steiner Problem" Frederiksen and Larsen: "Packet Bundling" Gabow and Pettie: "The Dynamic Vertex Minimum Problem and its Application to Clustering-type Approximation Algorithms" Golynski and Horton: "A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid" Goswami, Das and Nandy: "Simplex range searching and k nearest neighbors of a line segment in 2D" Hepner and Stein: "Minimizing Makespan for the Lazy Bureaucrat Problem" Katajainen and Madsen: "Performance Tuning an Algorithm for Compressing Relational Tables" Katajainen and Pasanen: "A Randomized In-Place Algorithm for Positioning the kth Element in a Multiset" K?rkk?inen: "Computing the Threshold for q-Gram Filters" K?nemann, Li, Parekh and Sinha: "Approximation algorithms for edge-dilation k-center problems" Lai: "Paging on a RAM with Limited Resources" Lev-Tov and Peleg: "Exact Algorithms and Approximation Schemes for Base Station Placement Problems" Levcopoulos, Lingas and Mitchell: "Adaptive algorithms for constructing convex hulls and triangulations of polygonal chains" L?pez-Ortiz and Schuierer: "On-line Parallel Heuristics and Robot Searching under the Competitive Framework" Mastrolilli: "A PTAS for the single machine scheduling problem with controllable processing times" Pal?, Pontelli and Ranjan: "An Optimal Algorithm for Finding NCA on Pure Pointer Machines" Pe'er, Shamir and Sharan: "On the Generality of Phylogenies from Incomplete Directed Characters" Puri and Tripakis: "Algorithms for the Multi-Constrained Routing Problem" Qin and Zhu: "A factor-2 approximation for labeling points with maximum sliding labels" Ramnath: "Forewarned is fore-armed: Dynamic digraph connectivity with lookahead speeds up a static clustering algorithm" Roy, Goswami, Das and Nandy: "Optimal Algorithm for a Special Point-labeling Problem" Sanders and V?cking: "Tail bounds and Expectations for Random Arc Allocation and Applications" Shamir and Tsur: "Improved Algorithms for the Random Cluster Graph Model" Sharir and Smorodinsky: "On Neighbors in Geometric Permutations" Skulrattanakulchai: "On a theorem of Erdos, Rubin, and Taylor" Soisalon-Soininen and Widmayer: "Amortized Complexity of Bulk Updates in AVL-Trees" Sztainberg, Arkin, Bender and Mitchell: "Analysis of Heuristics for the Freeze-Tag Problem" Social program: --------------- Reception of the city of Turku Excursion to the archipelago Conference dinner Program Committee: ------------------ Martti Penttonen, co-chair, University of Kuopio Erik Schmidt, co-chair, University of ?rhus Micah Adler, University of Massachusetts Martin Dietzfelbinger, Technische Universit?t Ilmenau Pinar Heggernes, University of Bergen Giuseppe F. Italiano, University of Rome Haim Kaplan, Tel Aviv University Rolf Karlsson, University of Lund Jyrki Katajainen, University of Copenhagen Olli Nevalainen, University of Turku Jop Sibeyn, University of Ume? Michiel Smid, Carleton University Organizing Committee: --------------------- Timo J?rvi, chair, University of Turku Lasse Bergroth, University of Turku Timo Kaukoranta, University of Turku Olli Nevalainen, University of Turku Timo Raita, University of Turku Jouni Smed, University of Turku Jukka Teuhola, University of Turku Office: ------- Jaana Lindgren, Congress Office, University of Turku Email: cescon@utu.fi Fax: +358-2-3335008 or +358-2-3336410 ------------- 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 aupetit at dase.bruyeres.cea.fr Wed Mar 27 11:03:36 2002 From: aupetit at dase.bruyeres.cea.fr (aupetit) Date: Mon Jan 9 13:41:04 2006 Subject: About complexity of Gabriel Graphs Message-ID: <200203271003.LAA16583@tupai.bruyeres.cea.fr> Hello, does someone know which is the complexity of the algorithm to compute Gabriel Graphs? I found the brute force one in O(n?) but I don't know if it exists a better algorithm. Thanks Michael ------------- 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 aupetit at dase.bruyeres.cea.fr Thu Mar 28 08:41:55 2002 From: aupetit at dase.bruyeres.cea.fr (aupetit) Date: Mon Jan 9 13:41:04 2006 Subject: About complexity of Gabriel Graphs Bis... Message-ID: <200203280742.IAA25189@tupai.bruyeres.cea.fr> Hello all, thank you for your answers, but I have to precise my query: I need to compute the Gabriel Graph in high dimension d, and for d>2, the complexity of Delaunay graph is no more O(n.log(n)) but O(n^|d/2|) [Fortune1992] (with |x|=ceil(x)) hence it becomes intractable for large d to compute Delaunay graph and extract Gabriel graph from it. The brute force algorithm I have is O(d.n^2) and I wonder if it exists a better one "for d>2". Thanks Michael ------------- 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 yaronber at pob.huji.ac.il Fri Mar 29 14:32:58 2002 From: yaronber at pob.huji.ac.il (Yaron Berman) Date: Mon Jan 9 13:41:04 2006 Subject: LEDA sources Message-ID: Hello, I understand that LEDA is no longet free for academic research, but there are older versions that are still available. I'm trying to work with both LEDA and CGAL on Windows2000 and apparently I have to recompile the LEDA sources for this to work. Does anyone know where I can find the source files of an older version? Regards, Yaron ------------- 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 mszczepa at ia.polsl.gliwice.pl Fri Mar 29 13:09:22 2002 From: mszczepa at ia.polsl.gliwice.pl (Marek Szczepanski) Date: Mon Jan 9 13:41:04 2006 Subject: No subject Message-ID: <016c01c1d74c$d60b84d0$200e9e9d@ztsmspc> To: Subject: ICCVG 2002 Date: Fri, 29 Mar 2002 19:04:33 +0100 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_0169_01C1D754.905E5310" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 6.00.2600.0000 X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000 This is a multi-part message in MIME format. ------=_NextPart_000_0169_01C1D754.905E5310 Content-Type: text/plain; charset="iso-8859-2" Content-Transfer-Encoding: quoted-printable **************** Sorry for duplicates / Please distribute = ***************** =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= CALL FOR PAPERS * CALL FOR PAPERS * CALL FOR PAPERS * CALL FOR = PAPERS=20 -------------------------------------------------------------------------= -- = =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= ICCVG'2002 = =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D International Conference on Computer Vision and Graphics 25-29 September, 2002, Zakopane, Poland = =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D The ICCVG'2002 intends to group the best researchers active in the field of pictorial information exchange between computer and its environment. The reviewing process and strict acceptance criteria assure high quality = of the accepted papers.=20 The Conference is planned as one track (oral and poster) presentations = and the=20 number of participants is limited to max 100 persons. The conference will be a forum for presentation of theoretical aspects, = methods,=20 applications and systems of image processing. Unpublished research = papers are=20 solicited, concerning the following main topics: -- Modeling of human visual perception -- Computational geometry -- Geometrical models of objects and scenes -- Illumination and reflection models and methods=20 -- Image formation -- Noise modeling, reduction and cancellation -- Image and video coding -- Image filtering and enhancement -- Biomedical image processing -- Color and multispectral image processing -- Pattern recognition in image processing -- Image analysis and scene understanding -- Motion analysis, visual navigation and active vision -- Visualization and graphical data presentation -- Data visualization -- Biomedical graphics=20 -- Computer-aided graphic design -- 3D imaging, shading and rendering -- Computer animation -- Graphics for internet and mobile systems -- Virtual reality -- Image and video databases -- Digital watermarking -- Multimedia applications -- Computer Art=20 -- Industrial applications The programme will include: invited papers by leading researchers, = selected=20 contributions in oral and poster sessions, open session and social = events. DATE: 25-29 September, 2002.=20 SUBMISSIONS: Authors are requested to submit an electronic version of a manuscript in English (max. 6 pages).=20 Upon acceptance by the reviewers and Programme Committee (selection=20 criteria include originality of ideas, accuracy and clarity of = explanation),=20 authors will be asked to submit a final version (camera ready copy)=20 of the paper, prepared in PDF format.=20 The best paper will be rewarded.=20 Declaration form is expected by 15.06.2002. DEADLINES:=20 Papers -- 30.06.2002. Notification for acceptance -- 31.07.2002. Submission of final version of papers -- 18.08.2002. CHAIR of the Conference: K. WOJCIECHOWSKI (PL)=20 Contact address: ICCVG'2002,=20 Marek Kazimierz Szczepanki, =20 Akademicka 16, Silesian Technical University,=20 44-100 Gliwice, Poland tel.: +48 32 2371912 fax.: +48 32 2371165 e-mail: kwojciechowski@ia.polsl.gliwice.pl ICCVG'2002 on World Wide Web: http://www.zts.ia.polsl.gliwice.pl/iccvg/ =20 DECLARATION FORM: Prospective participants are kindly requested=20 to fill the Declaration Form below and send it by ordinary mail=20 or by fax to the Conference Contact Address given above. See you at the Conference in Zakopane ! K. Wojciechowski =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D = =20 ICCVG'2002 DECLARATION FORM I intend to participate in the ICCVG'2002 Conference* =20 Signature: ............ Date: .........=20 Name and title: ................................................=20 Affiliation: ...................................................=20 Address: ....................................................... ................................................................ ................................................................ =20 I plan: |_| to take part in the conference only =20 |_| to submit a paper in an oral session=20 |_| to submit a paper in a poster session=20 Title of the paper ................................................................. ................................................................. .................................................................=20 * - number of participants is limited to 100 persons =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D ------=_NextPart_000_0169_01C1D754.905E5310 Content-Type: text/html; charset="iso-8859-2" Content-Transfer-Encoding: quoted-printable

**************** = Sorry for=20 duplicates / Please distribute *****************
 
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D
 

CALL FOR PAPERS  *  CALL FOR PAPERS  = * =20 CALL FOR PAPERS  *  CALL FOR PAPERS=20
---------------------------------------------------------------------= ------
 
 
 
       =20 =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= ICCVG'2002=20 =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D
           = =20 International Conference on Computer Vision and=20 Graphics
          &= nbsp;       =20 25-29 September, 2002,  Zakopane,=20 Poland
          &nb= sp;  =20 =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D<= /FONT>
 
 
 
The ICCVG'2002 intends to group the best = researchers active in the field
of pictorial information exchange = between=20 computer and its environment.
The reviewing process and strict = acceptance=20 criteria assure high quality
of the accepted papers.
 

The Conference is planned as one track (oral and = poster)=20 presentations and the
number of participants is limited to max 100=20 persons.
 

The conference will be a forum for presentation of=20 theoretical aspects, methods,
applications and systems of image = processing.=20 Unpublished research papers are
solicited, concerning the = following =20 main topics:
 

-- = Modeling of human=20 visual perception
-- Computational geometry
-- Geometrical models = of=20 objects and scenes
-- Illumination and reflection models and methods =
--=20 Image formation
-- Noise modeling, reduction and cancellation
-- = Image and=20 video coding
-- Image filtering and enhancement
-- Biomedical = image=20 processing
-- Color and multispectral image processing
-- Pattern=20 recognition in image processing
-- Image analysis and scene=20 understanding
-- Motion analysis, visual navigation and active = vision
--=20 Visualization and graphical data presentation
-- Data = visualization
--=20 Biomedical graphics
-- Computer-aided graphic design
-- 3D = imaging,=20 shading and rendering
-- Computer animation
-- Graphics for = internet and=20 mobile systems
-- Virtual reality
-- Image and video = databases
--=20 Digital watermarking
-- Multimedia applications
-- Computer Art =
--=20 Industrial applications
 

The = programme will=20 include: invited papers by leading researchers, selected =
contributions in=20 oral and poster sessions, open session and social events.
 

DATE: = 25-29 September,=20 2002.
 

SUBMISSIONS: Authors are requested = to submit=20 an electronic
version of a manuscript in English (max. = 6 pages).=20
Upon acceptance by the reviewers and = Programme=20 Committee (selection
criteria include=20 originality of ideas, accuracy and clarity of explanation), =
authors will be asked to submit a final = version=20 (camera ready copy)
of the paper, prepared in PDF format. =
 

The best paper will be rewarded.
 

Declaration form is=20 expected by 15.06.2002.
 

DEADLINES: =
Papers          &nb= sp;           &nbs= p;            = ;=20 --  30.06.2002.
Notification for=20 acceptance          &nb= sp;   =20 --  31.07.2002.
Submission of final version of=20 papers     --  18.08.2002.
 

CHAIR of = the=20 Conference: K. WOJCIECHOWSKI (PL)
 

Contact=20 address:
 

ICCVG'2002,
Marek = Kazimierz=20 Szczepanki, 
Akademicka 16,
Silesian Technical University,=20
44-100 Gliwice, Poland
tel.: +48 32 2371912
fax.: +48 32=20 2371165
e-mail:
kwojciechowski@ia.polsl.gliwice.pl
 

ICCVG'2002 = on World=20 Wide Web:
http://www.zts.ia.polsl.gliwice.pl/iccvg/
          =20
DECLARATION FORM: Prospective participants are kindly requested=20
to fill the Declaration Form below and = send it by=20 ordinary mail
or by fax to the Conference Contact = Address given=20 above.
 

See you at = the=20 Conference in Zakopane !
 
 
 

K.=20 Wojciechowski
 
 
 
 
 

=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D  &nbs= p;            = ;            =       =20
 

           &n= bsp;           &nb= sp;           &nbs= p;            = ;   =20 ICCVG'2002
 

           &n= bsp;           &nb= sp;   =20 DECLARATION FORM
 

     I intend to participate in = the=20 ICCVG'2002=20 Conference*
         &nbs= p;            = ;     =20
       Signature:=20 ............          Date: = .........
 

Name and = title:=20 ................................................
 

Affiliation:=20 ...................................................
 

Address:=20 .......................................................
..............= ..................................................
...................= .............................................
 
 
 
 
I plan:
 

  |_| = to take=20 part in the conference only 
  |_| to submit a paper in an = oral=20 session
  |_| to submit a paper in a poster session =
 
 
 
Title of the=20 paper
................................................................= .
..................................................................................................................................=20
 

* - number of participants is = limited to 100=20 persons
 

=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D
 
 
------=_NextPart_000_0169_01C1D754.905E5310-- ------------- 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.