From Andreas.Fabri at sophia.inria.fr Mon Feb 4 14:44:10 2002 From: Andreas.Fabri at sophia.inria.fr (Andreas Fabri) Date: Mon Jan 9 13:41:04 2006 Subject: intersection of triangulated surfaces Message-ID: <3C5E902A.6010708@sophia.inria.fr> Hello, Can anybody give me a pointer to software that is capable of computing the intersection of two triangulated surfaces embedded in 3-space (or of a polygon soup) There is a lot around at UNC integrated in collision detection software, but it seems that there the software is optimized for collision checking queries of small objects against large scenes. That is they have high preprocessing costs to generate search structures for the scenes. I also saw the AABbox in GTS (GNU Triangulated Surface), but there the problem is probably the same as for the collision checkers. andreas ------------- 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 861 at nu.edu.pk Wed Feb 6 11:48:13 2002 From: 861 at nu.edu.pk (861) Date: Mon Jan 9 13:41:04 2006 Subject: Segmentation Message-ID: <4F7DD203738DD411B71A00B0D03DDECC01D6A47C@highway> Salam, Can any body please tell me the links and places where research for "Segmentation as defined in MPEG-4 Standards" is going on. Thanks. aijaz ------------- 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 Feb 1 11:33:02 2002 From: hra at cs.uga.edu (hra@cs.uga.edu) Date: Mon Jan 9 13:41:04 2006 Subject: 14 Int'l Joint Conferences in Computer Science & Engineering; Las Vegas, June 24-27, 2002 Message-ID: <200202011633.LAA12389@apollo.cs.uga.edu> 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/Workshops) Monte Carlo Resort, Las Vegas, Nevada, USA June 24-27, 2002 Dear Colleagues: You are invited to submit a draft paper (see instructions below) and/or a proposal to organize a technical session. All accepted papers will be published in the respective conference proceedings. The names of technical session organizers/chairs will appear on the cover of the proceedings/books as associate editors. Any help in distributing this announcement would be most appreciated. The fourteen conferences are: 1. The 2002 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'02: June 24-27, 2002, Las Vegas, USA) 2. The 2002 International Conference on Imaging Science, Systems, and Technology (CISST'02: June 24-27, 2002, Las Vegas, USA) 3. The 2002 International Conference on Artificial Intelligence (IC-AI'02: June 24-27, 2002, Las Vegas, USA) 4. The 2002 International Conference on Internet Computing (IC'02: June 24-27, 2002, Las Vegas, USA) 5. The 2002 International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS'02: June 24-27, 2002, Las Vegas, USA) 6. The 2002 International Conference on Communications in Computing (CIC'02: June 24-27, 2002, Las Vegas, USA) 7. The 2002 International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA'02: June 24-27, 2002, Las Vegas, USA) 8. The 2002 International Conference on VLSI (VLSI'02: June 24-27, 2002, Las Vegas, USA) 9. The 2002 International Conference on Information and Knowledge Engineering (IKE'02: June 24-27, 2002, Las Vegas, USA) 10. International Workshop on Computational Models of Scientific Reasoning and Applications (CMSRA'02: June 24-27, 2002, Las Vegas, USA) 11. The 2002 International Conference on Machine Learning and Applications (ICMLA'02: June 24-27, 2002, Las Vegas, USA) 12. The 2002 International Conference on Wireless Networks (ICWN'02: June 24-27, 2002, Las Vegas, USA) 13. The 2002 International Conference on Software Engineering Research and Practice (SERP'02: June 24-27, 2002, Las Vegas, USA) 14. The 2002 International Conference on Security and Management (SAM'02: June 24-27, 2002, Las Vegas, USA) (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. PROPOSAL FOR ORGANIZING TECHNICAL SESSIONS: Each technical session will have at least 6 paper presentations. The session chairs will be responsible for all aspects of their sessions; including, soliciting papers, reviewing, selecting, ... The names of session chairs will appear as Associate Editors on the cover of the conference proceedings. After the conference, some sessions will be considered for publication in relevant journals as Special Issues with the session proposer as the Guest Editor of the journal. Proposals to organize technical sessions should include the following information: name and address (+ E-mail) of proposer, title of session, a 100-word description of the topic of the session, and a short description on how the session will be advertised (in most cases, session proposers solicit papers from colleagues and researchers whose work is known to the session proposer). Mail your proposal to H. R. Arabnia; E-mail submissions are preferred. 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 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: Feb. 22, 2002 (Friday): Draft papers (about 5 pages) due March 21, 2002 (Thursday): Notification of acceptance April 22, 2002 (Monday): 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 Proposals to organize technical sessions should be submitted as soon as possible. MEMBERS OF PROGRAM & ORGANIZING COMMITTEES: The Program Committees are currently being formed. 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 tamaldey at cis.ohio-state.edu Mon Feb 4 11:19:54 2002 From: tamaldey at cis.ohio-state.edu (tamal dey) Date: Mon Jan 9 13:41:04 2006 Subject: Software for water tight surface reconstruction and medial axis (MAT) Message-ID: <200202041619.LAA03135@cis.ohio-state.edu> We in the JYAMITI group of Ohio State University announce the release of a new version of the Cocone software. This new version reconstructs WATER TIGHT surfaces from point clouds no matter how the input is. The software does not use any extra point to achieve this. The software also has an option of computing an approximate medial axis (MAT) from the point cloud in a robust manner. Check it out at: http://www.cis.ohio-state.edu/~tamaldey/cocone.html ---Tamal K. Dey http://www.cis.ohio-state.edu/~tamaldey ------------- 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 Remco.Veltkamp at cs.uu.nl Fri Feb 8 14:34:53 2002 From: Remco.Veltkamp at cs.uu.nl (Remco Veltkamp) Date: Mon Jan 9 13:41:04 2006 Subject: special issue on Shape Algorithmics Message-ID: <5.0.0.25.2.20020208143405.02ab1c30@imap.cs.uu.nl> Call for papers ALGORITHMICA Special Issue on Shape Algorithmics http://www.cs.uu.nl/people/remcov/algorithmica.html Submission deadline: 1 May 2002 Algorithmica is planning a special issue on algorithms for shape analysis. Papers describing original research are solicited that deal with algorithmic issues of the processing of sets of points, curves, regions, and volumes that represent form information. Submissions addressing general methodological issues and significant case studies in this area are especially welcome. Topics of interest include, but are not limited to: * shape representation * shape similarity measures * (weighted) point set matching * matching two (sets of) curves, regions, or volumes * skeletonization * shape decomposition * shape approximation * morphing * retrieval from a large collection * perception In all cases, the algorithmic aspects are especially important (such as the algorithm design, theoretical complexity, practical efficiency, algorithm behavior). Important Dates: o Submission Deadline: May 1, 2002. o Acceptance Decision: by September 1, 2002. o Final Version Due: October 1, 2002 Electronic submission is preferred. Please email a PostScript or PDF file of your manuscript together with a cover letter to the guest editor of this issue: Remco.Veltkamp@cs.uu.nl Alternatively, you can send 4 hardcopies to: Remco C. Veltkamp Institute of Information and Computing Sciences Padualaan 14 3584 CH Utrecht The Netherlands All submissions will be refereed following the normal standard and practices of Algorithmica. Additional information can be obtained by communicating with the special issue editor. Algorithmica is an international journal in computer science published by Springer-Verlag, http://link.springer-ny.com/link/service/journals/00453/ -------------------------------------------------------------------- Remco Veltkamp, Remco.Veltkamp@cs.uu.nl Center for Geometry, Imaging, and Virtual Environments Institute of Information and Computing Sciences, Utrecht University Padualaan 14, 3584 CH Utrecht, The Netherlands phone: +31-30-2534091, fax: +31-30-2513791 -------------------------------------------------------------------- ------------- 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 aftosmis at nas.nasa.gov Thu Feb 7 11:15:32 2002 From: aftosmis at nas.nasa.gov (Michael Aftosmis) Date: Mon Jan 9 13:41:04 2006 Subject: intersection of triangulated surfaces References: <3C5E902A.6010708@sophia.inria.fr> Message-ID: <3C62D254.697A9C50@nas.nasa.gov> NASA's "Intersect" code will intersect any number of triangulated surfaces provided that each of the surfaces is both closed and manifold (the code intersects simplicial polytopes and trims away interior geometry). see: http://www.nas.nasa.gov/~aftosmis/cart3d/surfaceModeling.html#AuxProgs (and skim down 1 paragraph to "intersect"). The code uses robust arithmatic and automatic tie-breaking for degeneracies. A good first reference for this code is AIAA Paper 97-0196: "Robust and Efficient Cartesian Mesh Generation for Component-Based Geometry" which is downloadable from http://www.nas.nasa.gov/~aftosmis/publications/publications.html -Michael Andreas Fabri wrote: > > Hello, > > Can anybody give me a pointer to software that is capable of computing the intersection > of two triangulated surfaces embedded in 3-space (or of a polygon soup) > > There is a lot around at UNC integrated in collision detection software, but it > seems that there the software is optimized for collision checking queries of small > objects against large scenes. That is they have high preprocessing costs to > generate search structures for the scenes. > > I also saw the AABbox in GTS (GNU Triangulated Surface), but there the problem > is probably the same as for the collision checkers. > > andreas > > ------------- > 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. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From emo at inf.ethz.ch Tue Feb 12 12:32:19 2002 From: emo at inf.ethz.ch (Emo Welzl) Date: Mon Jan 9 13:41:04 2006 Subject: Pre-Doc Program in "Combinatorics, Geometry, and Computation", ETH Zurich Message-ID: <200202121132.MAA25792@blabla.inf.ethz.ch> Call for Applications Pre-Doc Program Combinatorics, Geometry, and Computation October 2002 -- March 2003 http://www.cgc.ethz.ch/ (At ETH Zurich; part of Berlin/Zurich Graduate Program "Combinatorics, Geometry, and Computation") ETH Zurich offers a one-semester study program that focusses on the preparation of a Ph.D. in areas like: Discrete and Computational Geometry; Computer Graphics and Vision; Networks; Algorithms Design, Analysis and Implementation; Optimization. Building blocks of the program are four 5-weeks research oriented courses, a project and the preparation of a proposal for a Ph.D.; see schedule, speakers (including guests J. Beck, J. Bloemer, Ch. Papadimitriou, and A. Steger) and topics below. ETH offers a limited number of scholarships of Sfr 2'200 per month (for a six months period) for students with a diploma or master in a field related to the topics of the program (including computer science, mathematics, electrical engineering, and physics). There is a possibility of continuing a Ph.D. in the Berlin/Zurich Graduate Program (although it is not automatically implied by acceptance to the Pre-Doc program). Students who plan to continue their Ph.D. at some other university are also welcome. Advanced diploma or master students can be considered for a one-semester exchange program as well, if a feasible arrangement with their home universities can be made. The language of the program is English. The program is open to applicants of all nationalities. Students who receive a scholarship are expected to provide teaching assistance. Applications with curriculum vitae, copies of certificates, thesis, areas of interest, a letter of recommendation from the thesis advisor should be sent to: Emo Welzl Institut Theoretische Informatik ETH Zentrum CH-8092 Zurich Switzerland cgc.graduate@inf.ethz.ch Application deadlines are Mar 22, 2002, and May 31, 2002. Applicants are notified of results about one month after the respective deadline. This stepwise procedure allows students to obtain a commitment at an early stage, while leaving some options also for those who fulfill the necessary prerequisites only at a later stage. ---------------------------------------------------------------- COURSES Courses will be held two days a week, for a five-weeks period. As a rough framework, every day includes 3 hours of lectures, exercises in groups, and a discussion of exercises. --------- RandAlgs Randomized Algorithms Ch. Papadimitriou (UC Berkeley; USA), E. Welzl (Mo&Tu, Oct 21 - Nov 22, 2002) Randomized algorithms have by now emerged into many fields, and have lead to several improvements and simplifications compared to deterministic methods. We will discuss applications in several areas, including optimization, approximate counting and solving of hard problems (e.g. SAT). The emphasis will be on understanding of the basic methods, so that they can be applied in several situations. --------- ApproxAlgs Approximation: Theory and Algorithms J. Bloemer, M. Cochand, T. Erlebach, B. Gaertner, A. Steger, P. Widmayer (Th&Fr, Oct 21 - Nov 22, 2003) This course is concerned with approximation algorithms for NP-hard optimization problems. The topics covered include: basic and advanced approximation algorithms for selected problems; more general techniques such as linear programming relaxation and derandomization; inapproximability and the PCP concept. --------- GeomMod Surface Representations and Geometric Modeling M. Gross (Mo&Tu, Jan 6 - Feb 7, 2003) Recent advances in 3D digital geometry processing have spawned new generations of methods for the representation and interactive manipulation of large scale graphics models. This course will discuss some of the latest developments in geometric modeling and surface representations. The first such as splines and NURBS, and we will introduce the basic concepts of differential geometry. The second part of the course will address more recent developments in geometry processing inlcuding subdivision, smoothing, and geometric filtering. --------- PosGames Positional Games and Algorithms J. Beck (Rutgers University, USA) (Th&Fr, Jan 6 - Feb 7, 2003) In the last few years I keep writing a book entitled `positional games', which would be the first book on the subject. `Positional games' is completely different from both the traditional Neumann-type "game theory" and the Berlekamp-Conway-Guy type "Nim-like games" (see the well-known 2-volumed `Winning Ways' of the three authors). `Positional games' is about `Tic-Tac-Toe-like' board games, and is closely related to Ramsey theory, Matching theory and the Erdos-type "probabilistic method" (see the well-known book of Alon-Spencer). The winning and drawing strategies are effective potential function algorithms: this explains the word `algorithms' in the title. This is a brand new subject which is full of exciting open problems. The list of the subjects that we are going to cover is (1) Tic-Tac-Toe-like games, Ramsey games, game-graph and game-tree, pairing strategy, potential functions, (2) Game-theoretic first moment method, (3) Game-theoretic second moment method, (4) Graph games and random graphs, (5) Tic-Tac-Toe in higher dimensions, (6) Algorithmic and game-theoretic Lovasz Local Lemma, complexity problems. Prerequisites: Almost nothing -- it is a self-contained course, but a knowledge of the simplest concepts of combinatorics, and reasonable problem-solving skills are expected. No textbook is available: I am going to give hand-outs and problem-sheets. --------------------------------------- SCHEDULE --------------------------------------- Oct 1 Reading assignments --------------------------------------- Oct 21 Courses -Nov 22 Mo&Tu RandAlgs Th&Fr ApproxAlgs Nov 27 Exams --------------------------------------- Nov 28 Projects, reading assignments -Dec 19 and presentations --------------------------------------- Jan 6 Courses -Feb 7 Mo&Tu GeomMod Th&Fr PosGames Feb 12 Exams --------------------------------------- Feb 13 Preparation of Ph.D. proposal -Mar 28 and presentations --------------------------------------- ------------- 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 aftosmis at nas.nasa.gov Mon Feb 11 10:55:15 2002 From: aftosmis at nas.nasa.gov (Michael Aftosmis) Date: Mon Jan 9 13:41:04 2006 Subject: intersection of triangulated surfaces Message-ID: <3C681393.BA83AB34@nas.nasa.gov> Andreas, NASA's "Intersect" code will intersect any number of triangulated surfaces provided that each of the surfaces is both closed and manifold (the code intersects simplicial polytopes and trims away interior geometry). see: http://www.nas.nasa.gov/~aftosmis/cart3d/surfaceModeling.html#AuxProgs (and skim down 1 paragraph to "intersect"). The code uses robust arithmatic and automatic tie-breaking for degeneracies. A good first reference for this code is AIAA Paper 97-0196: "Robust and Efficient Cartesian Mesh Generation for Component-Based Geometry" which is downloadable from http://www.nas.nasa.gov/~aftosmis/publications/publications.html -Michael Andreas Fabri wrote: > > Hello, > > Can anybody give me a pointer to software that is capable of computing the intersection > of two triangulated surfaces embedded in 3-space (or of a polygon soup) > > There is a lot around at UNC integrated in collision detection software, but it > seems that there the software is optimized for collision checking queries of small > objects against large scenes. That is they have high preprocessing costs to > generate search structures for the scenes. > > I also saw the AABbox in GTS (GNU Triangulated Surface), but there the problem > is probably the same as for the collision checkers. > > andreas > > ------------- > 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. ------------- 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 jeffe at cs.uiuc.edu Mon Feb 11 17:26:00 2002 From: jeffe at cs.uiuc.edu (Jeff Erickson) Date: Mon Jan 9 13:41:04 2006 Subject: UIUC postdoc in geometry and meshing Message-ID: <20020211172600.I23817@granmapa.cs.uiuc.edu> Postdoc in Computational Geometry and Mesh Generation University of Illinois, Urbana-Champaign A full-time Postdoctoral Research Associate position is available in the Computational Science and Engineering program at the University of Illinois, Urbana-Champaign. The position begins in Summer or Fall 2002 and lasts for two years, with a possible extension to a third year. The postdoc is broadly in the areas of computational geometry and mesh generation. In addition to pursuing his or her own research, the candidate is expected to play a vital role in the design, analysis, implementation, and visualization of space-time meshing algorithms, under the supervision of Jeff Erickson (in the Department of Computer Science) and Bob Haber (in the Department of Theoretical and Applied Mechanics). The position is funded through the Center for Process Simulation and Design, an interdisciplinary project involving mathematicians, computer scientists, and engineers. A PhD or equivalent degree is required; experience in implementing mesh generation and/or other geometric algorithms is strongly preferred. Applicants should send a letter of application, a current curriculum vitae, and the names of three references to Jeff Erickson Digital Computer Laboratory, MC 258 University of Illinois 1304 W. Springfield Ave. Urbana, IL 61801 Phone: (217) 333-6769 Fax: (217) 244-6500 Email: jeffe@cs.uiuc.edu Electronic applications are encouraged; please email materials in PostScript or PDF. To be assured of full consideration, applications must be received by APRIL 1, 2002. Applicants may be interviewed before the closing date; however, no hiring decision will be made until after that date. Applications will continue to be accepted until the position is filled. Applications from women and minorities are encouraged. The University of Illinois is an affirmative action, equal-opportunity employer. An online version of this ad, with links to more information, is available at "http://www.cs.uiuc.edu/~jeffe/postdoc.html". -- Jeff Erickson jeffe@cs.uiuc.edu Computer Science Department http://www.uiuc.edu/~jeffe University of Illinois at Urbana-Champaign ------------- 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 hert at mpi-sb.mpg.de Tue Feb 12 19:12:42 2002 From: hert at mpi-sb.mpg.de (Susan Hert) Date: Mon Jan 9 13:41:04 2006 Subject: Final Call for Abstracts -- CGAL User Workshop Message-ID: CGAL User Workshop *** Final Call for Submissions *** http://www.cgal.org/UserWorkshop http://www-ma2.upc.es/~geomc/events/socg2002/CGALWorkshop.html The CGAL Consortium is organizing the first CGAL User Workshop, to be held on June 4, 2002 immediately before the ACM Symposium on Computational Geometry in Barcelona, Spain. The goal of this one-day workshop is twofold: to allow CGAL users and developers to meet and share their experiences with the library while at the same time providing an opportunity for potential users to learn more about CGAL and how they might benefit from it. The day will be organized around a series of short (30-minute) presentations by users and developers. The topics to be discussed include but are not limited to: - design of library components - implementation of algorithms and data structures using CGAL - use of the library in experimentation - experiences with CGAL in teaching - comparisons of CGAL with other libraries. At the end of the day, we will have an extensive Q&A session. The focus of the meeting is not CGAL, but the users. If you have any suggestions about what should be discussed, please send a message to editor@cgal.org so we can do our best to organize the workshop to meet your needs. Abstract Submission ------------------- If you are a CGAL user and would like to present your work, we invite you to submit an abstract (in PostScript or PDF) to the CGAL Editorial Board by filling out the form on http://www.cgal.org/UserWorkshop/submission.html. The work need not be original for this workshop. The board will select presentations so as to achieve a balanced programme of general interest to other users and developers. Important Dates --------------- February 15, 2002: Abstract submission deadline March 1, 2002: Notification of acceptance or rejection June 4, 2002: Workshop Registration and Accommodation ------------------------------ You can register for the workshop when you register for SoCG'02. There is no separate registration system. Should you wish to participate only in the workshop, please check the appropriate box on the symposium registration form (available approximately Feb. 15). There will be a separate and modest registration fee for the workshop. The payment of this fee will be done on-site. Only cash in Euro will be accepted (a bank on campus will be available just in front of the conference room). You can use the SoCG'02 accommodation booking system (http://www-ma2.upc.es/~geomc/events/socg2002/socg2002.html), if you wish, even if you intent to attend only the workshop. About CGAL ---------- CGAL, the Computational Geometry Algorithm Library, is a highly modular C++ library of data structures and algorithms that has been developed via a collaborative project involving several research institutes in Europe and Israel. The mission of the project is to make the most important solutions and methods developed in computational geometry available to users in industry and academia. For more information about the project and the library, please have a look at the CGAL web site (http://www.cgal.org). ------------------------------------------------------------------------- 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 ------------------------------------------------------------------------- ------------- 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 goodrich at ics.uci.edu Tue Feb 12 08:30:47 2002 From: goodrich at ics.uci.edu (Michael T. Goodrich) Date: Mon Jan 9 13:41:04 2006 Subject: Graph Drawing 2002 In-Reply-To: <20020211172600.I23817@granmapa.cs.uiuc.edu> Message-ID: Call for Papers 10th International Symposium on Graph Drawing GD2002 August 26-28, 2002, Irvine, California, USA http://www.cs.uci.edu/~gd2002/ * Deadlines: ---------- o Submissions: April 23, 2002 o Notification of acceptance: June 14, 2002 o Early Registration: July 22, 2002 o Graph Drawing Contest submission: August 9, 2002 o Camera-ready copies of accepted papers: August 22, 2002 * Location: Irvine, California * Scope: The symposium is a forum for researchers and practitioners working on all aspects of graph visualization and representation. The range of topics considered in graph drawing includes graph algorithms, graph theory, computational geometry, topology, planarity, computational cartography, visual perception, information visualization, computer-human interaction, applications, and practical systems. Much research in graph drawing is motivated by applications to systems for viewing and interacting with graphs. Graph drawing is becoming increasingly important in many applications including visualization tasks in software engineering (e.g., automatic layout of UML-diagrams), business process modeling (e.g., organization diagrams, event-driven process chains), and computational biology (e.g., display of biochemical pathways). The interaction between theoretical advances and implemented solutions is an important part of the graph-drawing field. * Call for Papers and Demos: Authors are invited to submit papers describing original research of theoretical or practical significance to graph drawing. System demonstrations are also solicited. Descriptions of system demos should include illustrative screen dumps and an explanation of the system's functionality. Regular papers and demo descriptions should be labeled as either long or short; long papers will be assigned 10 pages in the conference proceedings, and short papers 5 pages. * Graph Drawing Contest: Following the tradition of previous conferences, a graph drawing contest will be held. Details will appear on the website later this Spring. * Submissions: Submitted papers and demo descriptions must be received by April 23, 2002. Each submission should include an indication of its type (paper or demo description) and length (regular or short), and contact information for the primary author. Electronic submissions in standard PostScript should be submitted by the process described at: http://sigact.csci.unt.edu/~gd2002/gd2002.html Alternatively, 16 hard copies of the submission can be mailed to the program chair. All submissions received will be acknowledged promptly by e-mail. * Proceedings: Accepted papers will be published in the conference proceedings, which will appear in the Springer-Verlag series Lecture Notes in Computer Science. Camera-ready and electronic copies of accepted papers are due at the conference. Instructions for Authors will be available after the paper notification deadline. All participants will receive a copy of the proceedings as part of their registration. * Program Committee: ------------------ Ulrik Brandes, University of Konstanz Franz Brandenburg, University of Passau Giuseppe di Battista, University of Rome Christian Duncan, University of Miami Michael Goodrich, Univ. of California, Irvine, co-chair Xin (Roger) He, SUNY Buffalo Seok-Hee Hong, University of Sydney Michael Kaufmann, University of Tübingen Stephen Kobourov, Univ. Arizona, co-chair Giuseppe Liotta, University of Perugia Anna Lubiw, University of Waterloo Petra Mutzel, Vienna University of Technology Stephen North, AT&T Research Roberto Tamassia, Brown University Ioannis (Yanni) Tollis, Univ. of Texas, Dallas Sue Whitesides, McGill University * Organizing Committee: --------------------- Michael Goodrich, Univ. of California, Irvine * Contest Committee: ------------------ Franz Brandenburg (chair), University of Passau * Contact Information: -------------------- o Conference URL: www.cs.uci.edu/~gd2002/ o Conference Organization: gd2002@cs.uci.edu o Electronic Submission: sigact.csci.unt.edu/~gd2002/gd2002.html o Hard-copy Submission: Michael Goodrich Dept. of Information and Computer Science University of California - Irvine Irvine, CA 92697-3425 Phone: (949) 824-9366 ------------- 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 kobourov at cs.arizona.edu Wed Feb 13 12:47:22 2002 From: kobourov at cs.arizona.edu (Stephen Kobourov) Date: Mon Jan 9 13:41:04 2006 Subject: [DMANET] Graph Drawing 2002 - Call for papers Message-ID: <3C6AC2CA.31B4ED15@cs.arizona.edu> Call for Papers 10th International Symposium on Graph Drawing GD2002 August 26-28, 2002, Irvine, California, USA http://www.cs.uci.edu/~gd2002/ * Deadlines: ---------- o Submissions: April 23, 2002 o Notification of acceptance: June 14, 2002 o Early Registration: July 22, 2002 o Graph Drawing Contest submission: August 9, 2002 o Camera-ready copies of accepted papers: August 22, 2002 * Location: Irvine, California * Scope: The symposium is a forum for researchers and practitioners working on all aspects of graph visualization and representation. The range of topics considered in graph drawing includes graph algorithms, graph theory, computational geometry, topology, planarity, computational cartography, visual perception, information visualization, computer-human interaction, applications, and practical systems. Much research in graph drawing is motivated by applications to systems for viewing and interacting with graphs. Graph drawing is becoming increasingly important in many applications including visualization tasks in software engineering (e.g., automatic layout of UML-diagrams), business process modeling (e.g., organization diagrams, event-driven process chains), and computational biology (e.g., display of biochemical pathways). The interaction between theoretical advances and implemented solutions is an important part of the graph-drawing field. * Call for Papers and Demos: Authors are invited to submit papers describing original research of theoretical or practical significance to graph drawing. System demonstrations are also solicited. Descriptions of system demos should include illustrative screen dumps and an explanation of the system's functionality. Regular papers and demo descriptions should be labeled as either long or short; long papers will be assigned 10 pages in the conference proceedings, and short papers 5 pages. * Graph Drawing Contest: Following the tradition of previous conferences, a graph drawing contest will be held. Details will appear on the website later this Spring. * Submissions: Submitted papers and demo descriptions must be received by April 23, 2002. Each submission should include an indication of its type (paper or demo description) and length (regular or short), and contact information for the primary author. Electronic submissions in standard PostScript should be submitted by the process described at: http://sigact.csci.unt.edu/~gd2002/gd2002.html Alternatively, 16 hard copies of the submission can be mailed to the program chair. All submissions received will be acknowledged promptly by e-mail. * Proceedings: Accepted papers will be published in the conference proceedings, which will appear in the Springer-Verlag series Lecture Notes in Computer Science. Camera-ready and electronic copies of accepted papers are due at the conference. Instructions for Authors will be available after the paper notification deadline. All participants will receive a copy of the proceedings as part of their registration. * Program Committee: ------------------ Ulrik Brandes, University of Konstanz Franz Brandenburg, University of Passau Giuseppe di Battista, University of Rome Christian Duncan, University of Miami Michael Goodrich, Univ. of California, Irvine, co-chair Xin (Roger) He, SUNY Buffalo Seok-Hee Hong, University of Sydney Michael Kaufmann, University of T?bingen Stephen Kobourov, Univ. Arizona, co-chair Giuseppe Liotta, University of Perugia Anna Lubiw, University of Waterloo Petra Mutzel, Vienna University of Technology Stephen North, AT&T Research Roberto Tamassia, Brown University Ioannis (Yanni) Tollis, Univ. of Texas, Dallas Sue Whitesides, McGill University * Organizing Committee: --------------------- Michael Goodrich, Univ. of California, Irvine * Contest Committee: ------------------ Franz Brandenburg (chair), University of Passau * Contact Information: -------------------- o Conference URL: http://www.cs.uci.edu/~gd2002/ o Conference Organization: gd2002@cs.uci.edu o Electronic Submission: sigact.csci.unt.edu/~gd2002/gd2002.html o Hard-copy Submission: Michael Goodrich Dept. of Information and Computer Science University of California - Irvine Irvine, CA 92697-3425 Phone: (949) 824-9366 ********************************************************** * * 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 suri at cs.ucsb.edu Fri Feb 15 11:19:07 2002 From: suri at cs.ucsb.edu (Subhash Suri) Date: Mon Jan 9 13:41:04 2006 Subject: 2002 Symposium on Computational Geometry---Accepted Papers Message-ID: ------------------------------------------------------------------------ SoCG '02 Accepted Papers ------------------------------------------------------------------------ 1. Conforming Delaunay Triangulations in 3D, David Cohen-Steiner and Eric Colin de Verdiere and Mariette Yvinec 2. Quickest Paths, Straight Skeletons, and the City Voronoi Diagram, Oswin Aichholzer and Franz Aurenhammer and Belen Palop 3. Paper Position Sensing, Marshall Bern and David Goldberg 4. A Global Approach to Automatic Solution of Jigsaw Puzzles, David Goldberg and Christopher Malon and Marshall Bern 5. The Power of Subtraction in Geometric Searching, Bernard Chazelle 6. Finding the Consensus Shape for a Protein Family, L. Paul Chew and Klara Kedem 7. Guaranteed-Quality Parallel Delaunay Refinement for Restricted Polyhedral Domains, Demian Nave and Nikos Chrisochoides and Paul Chew 8. Vertex-Unfolding of Simplicial Manifolds, Erik D. Demaine and David Eppstein and Jeff Erickson and George W. Hart 9. The Probabilistic Complexity of the Voronoi Diagram of Points on a Polyhedron, Mordecai J. Golin and Hyeon-Suk Na 10. Improved Construction of Vertical Decompositions of Three-Dimensional Arrangements, Hayim Shaul and Dan Halperin 11. Cost Prediction for Ray Tracing, B. Aronov and H. Bronnimann and A.Y. Chang and Y.-J. Chiang 12. Box-Trees for Collision Checking in Industrial Installations, H.J. Haverkort and M. de Berg and J. Gudmundsson 13. A lower bound on the distortion of embedding planar metrics into Euclidean space, Ilan Newman and Yuri Rabinovich 14. Approximate Nearest Neighbor Algorithms for Frechet Distance via Product Metrics, Piotr Indyk 15. Efficient Maintenance and Self-Collision Testing for Kinematic Chains, Itay Lotan and Fabian Schwarzer and Dan Halperin and Jean-Claude Latombe 16. Optimally Cutting a Surfce into a Disk, Jeff Erickson and Sariel Har-Peled 17. Optimal Decomposition of Polygonal Models into Triangle Strips, Regina Estkowski, Joseph S.B. Mitchell and Xinyu Xiang 18. Deforming Necklaces, Leonidas J. Guibas, An Nguyen, Daniel Russel and Li Zhang 19. Testing Homotopy for Paths in the Plane, Sergio Cabello, Yuanxin Liu and Jack Snoeyink 20. Visibility Preserving Terrain Simplification -- An Experimental Study, Boaz Ben-Moshe, Matthew J. Katz, Joseph S. B. Mitchell and Yuval Nir 21. Three Dimensional Euclidean Voronoi Diagrams of Lines with a Fixed Number of Orientations, Vladlen Koltun and Micha Sharir 22. Point-Line Incidences in Space, Micha Sharir and Emo Welzl 23. Incidences Between Points and Circles in Three Dimensions, Boris Aronov, Vladlen Koltun and Micha Sharir 24. Lenses in Arrangements of Pseudo-circles and their Applications, Eran Nevo, Janos Pach, Rom Pinchasi, Micha Sharir and Shakhar Smorodinsky 25. 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 26. On the Crossing Number of Complete Graphs, Oswin Aichholzer, Franz Aurenhammer and AHannes Krasser 27. The One-Round Voronoi Game, Otfried Cheong, Sariel Har-Peled, Nathan Linial and Jiri Matousek 28. Parametric Search Made Practical, Rene van Oostrum and Remco C. Veltkamp 29. Projective Clustering in High Dimensions Using Core-Sets, Sariel Har-Peled and Kasturi R. Varadarajan 30. Interlocked Open Linkages with Few Joints, Erik D. Demain, Stefan Langerman, Joseph O'Rourke and Jack Snoeyink 31. Kinetic Maintenance of Context-Sensitive Hierarchical Representations of Disjoint Simple Polygons , David Kirkpatrick and Bettina Speckmann 32. On the Number of Embeddings of Minimally Rigid Graphs, Ciprian Borcea and Ileana Streinu 33. The Delaunay Tetrahedralization from Delaunay Triangulated Surfaces, Sunghee Choi 34. Polyhedral Voronoi Diagrams of Polyhedra in Three Dimensions, Vladlen Koltun and Micha Sharir 35. Pseudo Approximation Algorithms, with Applications to Optimal Motion Planning, Tetsuo Asano, David Kirkpatrick and Chee Yap Chandrajit Bajaj and Subhash Suri Program Committee Co-Chairs ------------- 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 farhad at cs.unt.edu Thu Feb 21 19:39:53 2002 From: farhad at cs.unt.edu (Farhad Shahrokhi) Date: Mon Jan 9 13:41:04 2006 Subject: CBMS conference in Denton Message-ID: <200202220139.g1M1dr502538@simin.csci.unt.edu> NSF/CBMS Regional Research Conference in Mathematical Sciences on GEOMETRIC GRAPH THEORY May 28 - June 1, 2002 University of North Texas, Denton The Computer Science Department at the University of North Texas will host an NSF-CBMS Regional Research Conference in Mathematical Sciences on Geometric Graph Theory from May 28 to June 1, 2002. The principal speaker will be Professor JANOS PACH of City College, CUNY and the Hungarian Academy of Sciences. GEOMETRIC GRAPH THEORY is an emerging new discipline at the borderline of computer science and discrete mathematics, abounding in open problems, which has been developed to address the fundamental questions that arise in graph drawing. During the past decade Geometric Graph Theory yielded many striking results that have proved to be instrumental for the solution of a variety of problems in combinatorial and computational geometry. The better understanding of this field will be beneficial to researchers in many branches of mathematics and computer science. Professor Pach will deliver ten one-hour lectures. His lectures are designed to introduce a broad range of classical methods applicable in Geometric Graph Theory as well as many recent developments and their applications in combinatorial and computational geometry. The opening lecture will be given by Professor Ronald L. Graham (UC San Diego). The program will also include special invited lectures by Professors Branko Grunbaum (University of Washington), Daniel J. Kleitman (M.I.T), Takao Nishizeki (Tahoku University), Miklos Simonovits (Renyi Institute), Endre Szemeredi (Rutgers University), Roberto Tamassia (Brown University), Robin Thomas (Georgia Tech.) and William T. Trotter (Arizona State and Georgia Tech.). There will be ample opportunities for discussions and interactions among the participants. Applications for participation are invited from anyone interested in this or in a related area, in particular, from researchers in discrete and computational geometry, graph theory, combinatorics, topology, theory of algorithms, and graph drawing. WOMEN and MINORITIES are especially encouraged to apply. GRADUATE STUDENTS are welcome to apply. Application for participation and for financial support should be made as soon as possible but no later than March 15, 2002. Inclusion of resume and/or statement of current research interests from junior researchers and from graduate students would be helpful in the selection process. This NSF-CBMS conference is funded by the National Science Foundation. Matching funds have been provided by the University of North Texas. Up-to-date online information and application forms are available at our website: http://www.cs.unt.edu/~cbms For more details contact FARHAD SHAHROKHI Organizing Committee Chair e-mail:farhad@cs.unt.edu ************************************************************* ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From barequet at cs.Technion.AC.IL Fri Feb 22 10:20:20 2002 From: barequet at cs.Technion.AC.IL (Gill Barequet) Date: Mon Jan 9 13:41:04 2006 Subject: 2002 Symposium on Computational Geometry---Accepted Videos Message-ID: <200202220820.g1M8KKr01119@cs.Technion.AC.IL> ------------------------------------------------------------------------ SoCG '02 Accepted Videos ------------------------------------------------------------------------ 1. Exact Minkowski Sums and Applications, Eyal Flato, Efi Fogel, Dan Halperin, and Eran Leiserowitz 2. Homotopy Techniques for Real-Time Visualization of Geometric Tangent Problems, Daniel Kotzor and Thorsten Theobald 3. Growing Fat Graphs, Alon Efrat, Stephen Kobourov, Martin Stepp, and Carola Wenk 4. AUTO-FOLLOW: Getting a Piece of the Action All the Time, Alexander Bogomjakov and Chaim Gotsman 5. Adventures of Moebius Band, Stanislav Klimenko, Gregory M. Nielson, Lialia Nikitina, and Igor Nikitin Gill Barequet Video Committee Chair ------------- 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 vsavchen at k.hosei.ac.jp Thu Feb 28 16:59:47 2002 From: vsavchen at k.hosei.ac.jp (VlSavchenko) Date: Mon Jan 9 13:41:04 2006 Subject: Cyber World 2002 conference In-Reply-To: <4.2.0.58.J.20020226114850.00aa4370@mailer.k.hosei.ac.jp> Message-ID: <4.2.0.58.J.20020227171132.00afdc80@133.25.253.140> Dear Colleagues: I would be most grateful if you would distribute this announcement for the 2002 International Conference in Computer Science to your colleagues who might be interested. The First International Symposium on Cyber Worlds (CW2002) in cooperation with IEEE Computer Society will take place in Tokyo, Japan, in November. This Symposium will include four tracks and will embrace the scopes of Methodologies, Software Engineering, Modeling, Simulations, Developments and Applications of Parallel/Distributed Computer Systems and Networks, Shape Modeling and Computer Graphics. The 2nd call for papers is available at http://cis.k.hosei.ac.jp/CW2002/ Vladimir Savchenko HOSEI University, Japan ------------- 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.