From cqquan at hotmail.com Fri Jan 3 02:32:47 2003 From: cqquan at hotmail.com (Steven Cui) Date: Mon Jan 9 13:41:08 2006 Subject: algorithm for computing the Medial Axis Message-ID: Hi: I need a C(C++) algorithm for computing the Medial Axis. Anyone knows about it? Steven _________________________________________________________________ 享用世界上最大的电子邮件系统— MSN Hotmail。 http://www.hotmail.com 8^r墿侁&櫒x%娝l瀱踚鐉賐o鲛朹錳r壙濍e壙堍j`z壙潤镝秈hf`z畓j!鵝n宪"azX澸辤贋6b界Zm +滮鏽'!縭墿侁&X鴐 From yaronber at cs.huji.ac.il Sun Jan 5 17:25:33 2003 From: yaronber at cs.huji.ac.il (Yaron Berman) Date: Mon Jan 9 13:41:08 2006 Subject: lower envelopes of circular arcs Message-ID: <000001c2b4ce$b026ca30$01c94184@cas01> Hello, Does anyone know of an existing algorithm for finding the lower (upper) envelope of circular arc segments? Obviously the complexity should be better than computing the arrangement of the arcs, preferably O(nlogn). Yaron Ostrovsky-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 daescu at utdallas.edu Wed Jan 8 10:51:32 2003 From: daescu at utdallas.edu (Ovidiu Daescu) Date: Mon Jan 9 13:41:08 2006 Subject: lower envelopes of circular arcs In-Reply-To: <000001c2b4ce$b026ca30$01c94184@cas01> Message-ID: Yaron, See Gill Barequet, Danny Z. Chen, Ovidiu Daescu, Michael T. Goodrich and Jack Snoeyink: Efficiently approximating polygonal paths in three and higher dimensions, Algorithmica, Vol. 33, No. 2, 2002, pg. 150-167. Ovidiu ******************************************************************** Ovidiu Daescu, Assistant Professor Department of Computer Science Erik Jonsson School of Engineering and Computer Science Box 830688, MS EC 31 University of Texas at Dallas Richardson, TX 75083-0688 Phone : 972-883-4196 Fax : 972-883-2349 E-mail: daescu@utdallas.edu ******************************************************************** On Sun, 5 Jan 2003, Yaron Berman wrote: > Hello, > > Does anyone know of an existing algorithm for finding the lower (upper) > envelope of circular arc segments? > Obviously the complexity should be better than computing the arrangement > of the arcs, preferably O(nlogn). > > Yaron Ostrovsky-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. > ------------- 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 facsearch at cs.duke.edu Thu Jan 9 16:49:51 2003 From: facsearch at cs.duke.edu (Faculty Search Committee) Date: Mon Jan 9 13:41:08 2006 Subject: Faculty Position at Duke University Computer Science Message-ID: <3E1DEE7F.3080208@cs.duke.edu> Duke University Department of Computer Science Theory/Algorithms Faculty Position We invite applications and nominations for a tenure-track or tenured faculty position at any rank in the Department of Computer Science at Duke University, to start September 2003. Preference will be given to applicants in the area of theory of computer science and algorithms. We continue to build upon an already strong, highly collaborative group in theory/algorithms. We are broadly interested in all areas, including but not exhausting bio-informatics, complexity theory, cryptography, combinatorial algorithms, external memory algorithms, distributed algorithms, data structures, mesh generation and geometric modeling. This faculty hire will be in a position to help guide and influence the continued expansion of our vibrant and growing Department. For more information about the faculty, facilities and other resources, please refer to www.cs.duke.edu. Applications should be submitted online at http://www.cs.duke.edu/csnews/facsearch. Applications should include a curriculum vitae and copies up to four of the most important publications. A Ph.D. in computer science or related area is required. Applicants should arrange for at least four letters of reference to be sent directly to the Faculty Search Chair. To guarantee full consideration, applications and letters of reference should be received no later than January 15, 2003. Duke University is an affirmative action, equal opportunity employer. -------------- next part -------------- A non-text attachment was scrubbed... Name: Theory-Algorithms Search Ad - 2002.doc Type: application/msword Size: 35840 bytes Desc: not available Url : http://compgeom.poly.edu/pipermail/compgeom-announce/attachments/20030109/1137b7ae/Theory-AlgorithmsSearchAd-2002.doc From Andreas.Fabri at geometryfactory.com Tue Jan 14 13:55:55 2003 From: Andreas.Fabri at geometryfactory.com (Andreas Fabri) Date: Mon Jan 9 13:41:08 2006 Subject: GeometryFactory Message-ID: <3E2408DB.6030208@geometryfactory.com> Dear computational geometry community members, the GeometryFactory got incorporated on January 6 2003. This company is a spring-off of the CGAL project (www.cgal.org). It starts modestly with one person, and we hope to grow to a four people company until the end of the year. Products Our products are geometric software components, not a library. This reflects the fact that few people need all of CGAL. Furthermore, it allows to differentiate components concerning their maturity (industry strong for integration in products, vs. early access versions for rapid prototyping in research), concerning their licenses, concerning the supported platforms, concerning the component owner, etc. Our goal is to have separately downloadable components in spring. Relationship to Academia We do not consider academia as a market, so CGAL is and will continue to be free for academic usage. We consider acadmia as partner: In the past academic users gave us, the CGAL developers, valuable feedback on components that were in an early stage, which helped us a lot to improve CGAL. Furthermore, there are first extensions of CGAL which were developed outside of the CGAL project. We currently work towards license agreements to have such extensions in the product catalogue. You can find more information about us at: www.geometryfactory.com Best regards, 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 michiel at scs.carleton.ca Tue Jan 14 16:37:40 2003 From: michiel at scs.carleton.ca (Michiel Smid) Date: Mon Jan 9 13:41:08 2006 Subject: CFP: WADS 2003 Message-ID: <3E248324.C38406C2@scs.carleton.ca> Call For Papers Workshop on Algorithms and Data Structures (WADS) July 30 - August 1, 2003 Ottawa, Canada NEW SUBMISSION DEADLINE: February 20, 2003 The Workshop, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. We invite submissions of papers presenting original research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry, databases, graphics, parallel and distributed computing. Contributors are invited to submit a full paper (not exceeding 12 pages). Detailed submission instructions are located at http://www.wads.org. Submissions must arrive on or before Feb. 20 at 12:00 noon EST. Authors will be notified of acceptance or rejection by April 21, 2003. Proceedings will be published in the Springer Verlag series Lecture Notes in Computer Science. The final versions of accepted papers must arrive in camera-ready form before May 12, 2003 to ensure the availability of the proceedings at the conference. Selected papers will be invited for publication in a special issue of Computational Geometry: Theory and Applications. Invited Speakers: Gilles Brassard, Daniel Spielman, Dorothea Wagner. Special Presentation: Wing T. Yan (Nelligan O'Brien Payne LLP, www.nelligan.ca), "Protecting your intellectual property". Pre-Workshop Special Event: one-day seminar on "Neural Networks in System Identification and Forecasting: Principles, Techniques, Applications" by Georg Zimmermann, Siemens AG, Muenchen Conference Chair: Michiel Smid Program Committee: Co-Chairs: F. Dehne, J.-R. Sack, M. Smid. PC-Members: Lars Arge (Duke) Susanne Albers (Freiburg) Michael Atkinson (Dunedin) Hans Bodlaender (Utrecht) Gerth Brodal (Aarhus) Tom Cormen (Dartmouth) Timothy Chan (Waterloo) Erik Demaine (MIT) Mike Fellows (Newcastle) Pierre Freigniaud (Paris-Sud) Naveen Garg (Delhi) Andrew Goldberg (Microsoft) Giuseppe Italiano (Rome) Ravi Janardan (Minneapolis) Rolf Klein (Bonn) Stephan Naeher (Trier) Giri Narasimhan (Florida International University) Rolf Niedermeier (Tuebingen) Viktor Prasanna (Southern California) Andrew Rau-Chaplin (Halifax) R. Ravi (Carnegie Mellon) Paul Spirakis (Patras) Roberto Tamassia (Brown) Jeff Vitter (Purdue) Dorothea Wagner (Konstanz) Peter Widmayer (Zurich) ------------- 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 Andreas.Fabri at geometryfactory.com Thu Jan 16 09:29:39 2003 From: Andreas.Fabri at geometryfactory.com (Andreas Fabri) Date: Mon Jan 9 13:41:08 2006 Subject: GeometryFactory Message-ID: <3E266D73.10501@geometryfactory.com> Dear computational geometry community members, the GeometryFactory got incorporated on January 6 2003. This company is a spring-off of the CGAL project (www.cgal.org). It starts modestly with one person, and we hope to grow to a four people company until the end of the year. Products Our products are geometric software components, not a library. This reflects the fact that few people need all of CGAL. Furthermore, it allows to differentiate components concerning their maturity (industry strong for integration in products, vs. early access versions for rapid prototyping in research), concerning their licenses, concerning the supported platforms, concerning the component owner, etc. Our goal is to have separately downloadable components in spring. Relationship to Academia We do not consider academia as a market, so CGAL is and will continue to be free for academic usage. We consider acadmia as partner: In the past academic users gave us, the CGAL developers, valuable feedback on components that were in an early stage, which helped us a lot to improve CGAL. Furthermore, there are first extensions of CGAL which were developed outside of the CGAL project. We currently work towards license agreements to have such extensions in the product catalogue. You can find more information about us at: www.geometryfactory.com Best regards, 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 jopsi at informatik.uni-halle.de Fri Jan 17 18:52:33 2003 From: jopsi at informatik.uni-halle.de (Jop Sibeyn) Date: Mon Jan 9 13:41:08 2006 Subject: SIROCCO 2003 Call for Papers Message-ID: <20030117175233.GB9147@informatik.uni-halle.de> ---------------------------------------------------------- CALL FOR PAPERS FOR SIROCCO 2003 June 18-20, Umea, Sweden http://www.informatik.uni-halle.de/sirocco2003/ ---------------------------------------------------------- The 10th Colloquium on Structural Information and Communication Complexity (SIROCCO 2003) is organized at the Computing Science Department of Umea University. SIROCCO brings together researchers active in the communication domain and is known for its pleasant atmosphere. The colloquium is co-located with IWIN 2003, held 16-17 June. Umea, the largest city in the northern half of Sweden, is easily reached with 15 daily flights from Stockholm. It offers a combination of culture with real nature in the close vicinity and 24 hours of daylight in summer. Topics: communication complexity complexity of constructing and maintaining structural information models of communication network topologies routing schemes sense of direction structural properties and computability topological awareness, metric information topology-dependent communication, broadcasting and gossiping Important Dates: Submission & March 21, 2003 Notification & April 22, 2003 Early registration & May 3, 2003 Final version due & May 7, 2003 Colloquium & June 18-20, 2003 Program Committee: Bogdan Chlebus, University of Colorado Francesc Comellas, UPC, Barcelona Pierre Fraigniaud, Universit? Paris-Sud Cyril Gavoille, LABRI, Bordeaux Jan van Leeuwen, Universiteit Utrecht Art Liestman, SFU, Vancouver Linda Pagli, Universit? di Pisa Joseph Peters, SFU, Vancouver Guido Proietti, Universit? dell'Aquila Geppino Pucci, Universit? di Padova Dana Richards, GMU, Fairfax Heiko Schr?der, Melbourne RMIT University Jop Sibeyn (Chair), Universit?t Halle Ondrej Sykora, Loughborough University Antonios Symvonis, University of Ioannina Eli Upfal, Brown University, Providence Berthold V?cking, MPII, Saarbr?cken Conference Chair: David Peleg, Weizmann Institute, Rehovot ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From marina at cpsc.ucalgary.ca Mon Jan 20 13:28:09 2003 From: marina at cpsc.ucalgary.ca (Marina Gavrilova) Date: Mon Jan 9 13:41:08 2006 Subject: CGA'03 2nd CFP In-Reply-To: <200209091311.g89DBRw12873@tau.ac.il> Message-ID: Dear Colleagues, Please find attached the 2nd CFP for CGA'03: 2nd CALL FOR PAPERS ============================================================ International Workshop on Computational Geometry and Applications CGA'03 in conjunction with The 2003 International Conference on Computational Science and its Applications (ICCSA 2003) http://www.ucalgary.ca/iccsa/events.htm May 18, 2003 -- May 21, 2003 Montreal, Canada ============================================================ Workshop Web Site: http://pages.cpsc.ucalgary.ca/~marina/Newweb/session.htm Conference web sites: http://www.ucalgary.ca/iccsa/ http://www.cs.qub.ac.uk/iccsa/ http://www.optimanumerics.com/iccsa/ http://www.sharcnet.ca/iccsa/ ============================================================ Workshop Chair: Marina Gavrilova, University of Calgary Workshop Co-Chair: Ovidiu Daescu (University of Texas at Dallas, USA) Invited speakers ---------------- Prof. Chee Yap, NYU Prof. Godfried Toussaint, McGill University Important Dates --------------- February 1, 2003: Deadline for paper submission. February 21, 2003: Notification of acceptance. February 28, 2003: Camera Ready Papers and Pre-registration. May 18 -- 22, 2003: ICCSA 2003 Conference in Montreal, Canada. Workshop Description -------------------- The Workshop, held for the third year in a row in conjunction with the International Conference on Computational Science, is intended as an international forum for researchers in all areas of computational geometry. Submissions of papers presenting a high-quality original research are invited to one of the two Workshop tracks:? ?- theoretical computational geometry ?- implementation issues and applied computational geometry. Topics of interest: ----------------------- - Algorithmic methods in geometry - Animation of geometric algorithms? - Lower bounds and algorithm complexity - Solid modeling? - Geographic information systems? - Computational methodology? - Computer graphics and image processing? - Illumination problems - Visibility graphs - Space Partitioning - Data structures (including Voronoi Diagrams and Delaunay triangulations) - Geometric computations in parallel and distributed environments - Mesh generation - Interpolation and surface reconstruction - Spatial and terrain analysis - Computer graphics and image processing? - Computational methods in manufacturing - Applications in molecular biology, granular mechanics, computational physics, oceanography - Exact computations - Robotics - Path planning - Algorithm Implementation - CAD/CAM Submissions in other related areas will also be considered. The design and implementation of geometric algorithms in parallel and distributed environments, exact computations, and applications in mechanics, physics and biology, are of special interest. Proceedings ------------- Proceedings of the Workshop will be published in the Springer-Verlag Lecture Notes in Computer Science (LNCS) series. The proceedings will also be available separately for purchase from Springer-Verlag (proceedings of the previous Workshops on Computational Geometry and Applications appeared in LNCS vol. 2073, vol. 2329-2331).? Papers from the Workshop may be invited to special issues of International Journal of Computational Geometry and Applications, Journal of CAD/CAM, Journal of Computational Methods in Sciences and Engineering (JCMSE) and the Journal of Supercomputing (pending agreement). Best Student Paper Award and Travel Grant ------------------------------------------ This year, a best student paper will be selected for a Best Student Paper Award. This award will be available exclusively to CGA'03 participants. A paper is eligible if at least one of its authors is a full or part-time student at the time of submission.? Author of the paper submitted to CGA'03 will be also eligible to apply for Travel Grant, provided by ICCSA'03 sponsors. The ICCSA'03 program committee may decline to make the award, or may split it among more than one participant. Available Financial Assistance ------------------------------ Author of the paper submitted to CGA'03 will be automatically eligible for assistance, if he belongs to Canadian University, educational institution, government agency or industry. Students enrolled at Canadian institutions are also eligible for a discount of registration fees. Paper Submission Conference fees ---------------- For all details with respect to the conference fees see http://www.ucalgary.ca/iccsa/. Special discounts for students and participants from some academia/research institutions are available. For more information, please visit the Workshop web site. Submission ----------- We invite you to submit a draft of the paper of up to 10 pages (Letter or A4) paper. Please include a cover page (in ascii format) which lists the following: - Title of the paper - List of authors - name, affiliation, address and e-mail address of each author - name of the contact author - preferred track (theoretical or applied track) - a maximum of 5 keywords - intent to be considered for the Best Student Paper Award (exclusively for CGA'03 participants) - intent to apply for Travel Grant (available for all ICCSA'03 participants) The submission must be camera-ready and formatted according to the rules of LNCS. Electronic submissions in PS, PDF, or LaTex (please also submit all .eps, .dvi, and .ps files). MS Word submissions will also be accepted. Please submit your paper directly to e-mall address: iccsa@sharcnet.com or marina@cpsc.ucalgary.ca Indicate in the header of the message "CGA'03 submission". Organizing Committee Conference Chairs Vipin Kumar (Army High Performance Computing Center, USA and University of Minessota, USA) Honorary Chair Marina Gavrilova (University of Calgary, Canada) Conference Chair C. J. Kenneth Tan (Heuchera Technologies, Canada and SHARCNET, Canada) Conference Chair Pierre L'Ecuyer (University of Montreal, Canada) Local Organizing Committee Chair Program Committee Sergei Bespamyatnikh (Duke University, USA) Tamal Dey (Ohio State University, USA) Frank Dehne (Carleton University, Canada) Ovidiu Daescu (University of Texas at Dallas, USA) Christopher Gold (Hong Kong Polytechnic University) Deok-Soo Kim (Hanyang University, Korea) Andres Iglesias (University de Cantabria, Spain) Kokichi Sugihara (University of Tokyo, Japan) Vaclav Skala (University of West Bohemia, Czech Republic) Stephen Wismath (University of Lethbridge, Canada) J. A. Rod Blais (University of Calgary, Canada) Marian Bubak (AGH, Poland) Toni Cortes (Universidad de Catalunya, Barcelona, Spain) Brian J. d'Auriol (University of Texas at El Paso, USA) Ivan Dimov (Bulgarian Academy of Sciences, Bulgaria) Matthew F. Dixon (Heuchera Technologies, UK) Geoffrey Fox (Indiana University, USA) Marina L. Gavrilova (University of Calgary, Canada) Bob Hertzberger (Universiteit van Amsterdam, The Netherlands) Chris Johnson (University of Utah, USA) Benjoe A. Juliano (California State University at Chico, USA) Vipin Kumar (University of Minnesota, USA) Antonio Lagana (Universit? Degli Studi di Perugia, Italy) Michael Mascagni (Florida State University, USA) Cathy McDonald (Department of Defense HPC Modernization Program, USA) Graham Megson (University of Reading, UK) Jiri Nedoma (Academy of Sciences of the Czech Republic, Czech Republic) Robert Panoff (Shodor Education Foundation, USA) Renee S. Renner (California State University at Chico, USA) David Taniar (Monash University, Australia) Koichi Wada (University of Tsukuba, Japan) Jerzy Wasniewski (Danish Computing Center for Research and Education, Denmark) Roy Williams (California Institute of Technology, USA) Osman Yasar (SUNY at Brockport, USA) Zahari Zlatev (Danish Environmental Research Institute, Denmark) CGA'01 and CGA'02 profiles To view electronic proceedings of the CGA'01, follow the link to LNCS web site: http://turing.zblmath.fiz-karlsruhe.de/cs/www_lncs.1.html? Volume 2073, Springer Verlag. Invited speaker for CGA'01: Kokichi Sugihara, University of Tokyo, Japan Invited speakers for CGA'02: Mark Overmars, Utrecht University Contributed Presentation: Pieter Huybers, the Netherlands List of papers appeared at CGA'01 and CGA'02 can be found on Workshop web site. On behalf of ICCSA 2003 and CGA'03 Organization Committees, Marina Gavrilova ICCSA 2003 Co-Chair Department of Computer Science, University of Calgary, 2500 University Drive, Calgary, Alberta, Canada, T2N1N4 Telephone: (403) 241-6315 Fax: (403) 284-4707 E-mail: marina@cpsc.ucalgary.ca ------------- 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 sjowen at sandia.gov Tue Jan 21 08:59:51 2003 From: sjowen at sandia.gov (Owen, Steven James) Date: Mon Jan 9 13:41:08 2006 Subject: 4th Symposium on Trends in Unstructured Mesh Generation Message-ID: <2E714B3E290FAD4AB8D63ABD2F33BC991147E771@es01snlnt.sandia.gov> CALL FOR ABSTRACTS Abstracts Due January 31, 2003 ========================================================= 4th Symposium on Trends in Unstructured Mesh Generation at the 7th US National Congress on Computational Mechanics July 27-31 2003 Albuquerque, New Mexico ========================================================= The Symposium on Trends in Unstructured Mesh Generation brings together a wide variety of disciplines for the exchange of technical information related to unstructured mesh generation. It is a biennial symposium held in conjuction with the US National Congress on Computational Mechanics (USNCCM), the main congress of the United States Association for Computational Mechanics (USACM). Previous Symposia have been held at North Western University (1997), The University of Colorado, Boulder (1999) and Dearborn, Michigan (2001). The 2003 symposium will be held in Albuquerque, New Mexico. Automatic mesh generation continues to be a vital technology in computational field simulations. As computing technology continues to advance and modeling requirements become more precise, automatic mesh generation techniques must rise to fulfill ever-increasing and diverse expectations. Providing a medium for this rapidly advancing technology is the Trends in Unstructured Mesh Generation Symposium. It is a principal forum for unstructured meshing technology and its related disciplines. Topics of interest include: -Surface and volume meshing algorithms -Mesh improvements criteria and algorithms -Mesh adaptation algorithms -Anisotropic mesh generation and adaptation -Dealing with geometry issues including integration with CAD and high order elements -Mesh evolution in evolving geometry problems -Automatic geometric simplification techniques -Interesting applications of automated and adaptive analysis -Novel new domain discretization schemes -Parallel implementations and control of very large meshes -The Design-to-Analysis Process -Data Translation -Solid Modeling -Geometry cleanup/repair -Automation -Best practices, data standards -Design for analysis issues In addition to the traditional focus on unstructured mesh generation, the scope of this year's symposium has been broadened to include Design-to-Analysis Issues. The efficiency of the process for transferring engineering design data to computational analysis model data plays a central role in the application of computational analysis to engineering design. The challenges involved in integrating these disciplines and their associated tools are often underestimated and have a profound effect on the utilization of computational analysis in the engineering design cycle. This mini-symposium will also explore some of the challenges presented by the design-to-analysis process as well as promising approaches to increasing the efficiency of this process. Abstract Submission Abstracts are required for the conference and will be included in the conference proceedings. All abstracts must be submitted electronically through the USNCCM web site under the category "MeshTrends" by January 31, 2003. Examples and templates for abstract submission are also located on the USNCCM website. Paper Submission As part of this symposium, full papers will be solicited from the accepted presentations for inclusion in a peer-reviewed special journal edition. Publication solicitation will be based on the interest of the participating authors and the technical merit of the presentation. Important Dates Deadline for Preliminary Abstract Submission January 31 2003 Final Selection of Abstracts March 15 2003 Deadline for Print-ready Abstracts May 31 2003 Deadline Early Registration June 15 2003 Cut-Off Date four Double Tree & Hyatt Regency USNCCM Room Rates June 26 2003 US National Congress on Computational Mechanics Technical Program July 28-July 30 2003 Pre and Post-Conference Short Course July 27 & 31 2003 Symposium Organizers Steven J. Owen, Ph.D. Computational Modeling Sciences Department Sandia National Laboratories Albuquerque, New Mexico, U.S.A. Phone: (505) 284-6599 Email: sjowen@sandia.gov Mark S. Shephard, Ph.D. Director, Scientific Computation Research Center Rensselaer Polytechnic Institute Troy New York, U.S.A. Phone: (518) 276-6795 Fax: (518) 276-4886 Email: shephard@scorec.rpi.edu Shawn Burns Sandia National Laboratories Albuquerque, New Mexico, U.S.A. Phone: (505) 844-6200 Email: spburns@sandia.gov Additional information on the conference can be found at: http://www.esc.sandia.gov/usnccm.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 pankaj at cs.duke.edu Mon Jan 27 00:59:03 2003 From: pankaj at cs.duke.edu (Pankaj Kumar Agarwal) Date: Mon Jan 9 13:41:08 2006 Subject: DIMACS Workshop on Geometric Optimization Message-ID: <200301270559.AAA02976@kant.cs.duke.edu> ******************************************************************** * DIMACS * * Center for Discrete Mathematics and Theoretical Computer Science * * Founded as a National Science and Technology Center * ******************************************************************** DIMACS Workshop on Geometric Optimization Dates: May 19 - 21, 2003 Location: DIMACS Center, Rutgers University, Piscataway NJ, 08854-8018 Organizers: Pankaj K. Agarwal, Duke University, pankaj@cs.duke.edu Joseph S. B. Mitchell, Stony Brook University, jsbm@ams.sunysb.edu Presented under the auspices of the DIMACS Special Focus on Computational Geometry and Applications. Rationale: Combinatorial optimization typically deals with problems of maximizing or minimizing a function of one or more variables subject to a large number of constraints. In many applications, the underlying optimization problem involves a constant number of variables and a large number of constraints that are induced by a given collection of geometric objects; these problems are referred to as geometric-optimization problems. Typical examples include facility location, low-dimensional clustering, network-design, optimal path-planning, shape-matching, proximity, and statistical-measure problems. In such cases one expects that faster and simpler algorithms can be developed by exploiting the geometric nature of the problem. Much work has been done on geometric-optimization problems during the last twenty-five years. Many elegant and sophisticated techniques have been proposed and successfully applied to a wide range of geometric-optimization problems. Several randomization and approximation techniques have been proposed. In parallel with the effort in the geometric algorithms community, the mathematical programming and combinatorial optimization communities have made numerous fundamental advances in optimization, both in computation and in theory, during the last quarter century. Interior-point methods, polyhedral combinatorics, and semidefinite programming have been developed as powerful mathematical and computational tools for optimization, and some of them have been used for geometric problems. Scope and Format: This workshop aims to bring together people from different research communities interested in geometric-optimization problems. The goal is to discuss various techniques developed for geometric optimization and their applications, to identify key research issues that need to be addressed, and to help establish relationships which can be used to strengthen and foster collaboration across the different areas. Call for Participation: Authors are invited to submit abstracts for talks to be given at the workshop. Please send the organizers an abstract (up to 2 pages) and a draft of a paper (if you have one). (Since there are no formal proceedings for the workshop, submission of material that is to be submitted to (or to appear in) a refereed conference is allowed and encouraged.) Submissions will be due March 31, 2003. Notification of acceptance: April 15, 2003. Invited Speakers: Sanjeev Arora, Princeton University Daniel Bienstock, Columbia University David Eppstein, UC Irvine Micha Sharir, Tel Aviv University Santosh Vempala, MIT Emo Welzl, ETH Zurich Contributed Talks: The program will be announced April 15, 2003. Registration: (Pre-registration date: May 04, 2003) Regular rate Preregister before deadline $120/day After preregistration deadline $140/day Reduced Rate* Preregister before deadline $60/day After preregistration deadline $70/day Postdocs Preregister before deadline $10/day After preregistration deadline $15/day DIMACS Postdocs $0 Non-Local Graduate & Undergraduate students Preregister before deadline $5/day After preregistration deadline $10/day Local Graduate & Undergraduate students $0 (Rutgers & Princeton) DIMACS partner institution employees** $0 DIMACS long-term visitors*** $0 Registration fee to be collected on site, cash, check, VISA/Mastercard accepted. Our funding agencies require that we charge a registration fee for the workshop. Registration fees cover participation in the workshop, all workshop materials, breakfast, lunch, breaks, and any scheduled social events (if applicable). * College/University faculty and employees of non-profit organizations will automatically receive the reduced rate. Other participants may apply for a reduction of fees. They should email their request for the reduced fee to the Workshop Coordinator at workshop@dimacs.rutgers.edu. Include your name, the Institution you work for, your job title and a brief explanation of your situation. All requests for reduced rates must be received before the preregistration deadline. You will promptly be notified as to the decision about it. ** Fees for employees of DIMACS partner institutions are waived. DIMACS partner institutions are: Rutgers University, Princeton University, AT&T Labs - Research, Avaya, Bell Labs, NEC Research Institute and Telcordia Technologies. ***DIMACS long-term visitors who are in residence at DIMACS for two or more weeks inclusive of dates of workshop. Information on participation, registration, accommodations, and travel can be found at: http://dimacs.rutgers.edu/Workshops/GeomOpt/index.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 leymarie at lems.brown.edu Fri Jan 24 18:38:26 2003 From: leymarie at lems.brown.edu (Frederic Leymarie) Date: Mon Jan 9 13:41:08 2006 Subject: 3D Shape Representation via Shock Flows References: <3BC2AD58.7744E25@site-eerie.ema.fr> <3BC78031.A79869C9@cs.mcgill.ca> Message-ID: <3E31CE72.78F2C569@lems.brown.edu> My thesis is now available on-line: http://www.lems.brown.edu/~leymarie/phd/ Abstract We address the problem of representing 3D shapes when partial and unorganized data is obtained as an input, such as clouds of point samples on the surface of a face, statue, solid, etc., of regular or arbitrary complexity (free-form), as is commonly produced by photogrammetry, laser scanners, computerized tomography, and so on. Our starting point is the medial axis (MA) representation which has been explored mainly for 2D problems since the 1960's in pattern recognition and image analysis. The MA makes explicit certain symmetries of an object, corresponding to the shocks of waves initiated at the input samples, but is itself difficult to directly use f or recognition tasks and applications. Based on previous work on the 2D problem, we propose a new representation in 3D which is derived from the MA, producing a graph we call the shock scaffold. The nodes of this graph are defined to be certain singularities of the shock flow along the MA. This graph can represent exactly the MA --- and the original inputs --- or approximate it, leading to a hierarchical description of shapes. We develop accurate and efficient algorithms to compute for 3D unorganized clouds of points the shock scaffold, and thus the MA, as well as its close cousin the Voronoi diagram. One computational method relies on clustering and visibility constraints, while the other simulates wavefront propagation on a 3D grid. We then propose a method of splitting the shock scaffold in two sub-graphs, one of which is related to the (a priori unknown) surface of the object under scrutiny. This allows us to simplify the shock scaffold making more explicit coarse scale object symmetries, while at the same time providing an original method for the surface interpolation of complex datasets. In the last part of this talk, we address extensions of the shock scaffold by studying the case where the inputs are given as collections of unorganized polygons. -- Frederic FOL LEYMARIE, R&D Project leader, SHAPE Lab. http://www.lems.brown.edu/vision/extra/SHAPE/ Brown University, Division of Engineering, LEMS, Box D 182-4 Hope Street, Providence, Rhode Island 02912, U.S.A. Tel: +1.401.863.2760, Alternate Voice: x2177, Fax: x9039 mailto:leymarie@lems.brown.edu , http://www.lems.brown.edu/~leymarie --- ------------- 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 mcallist at cs.dal.ca Fri Jan 31 19:31:51 2003 From: mcallist at cs.dal.ca (Michael McAllister) Date: Mon Jan 9 13:41:08 2006 Subject: CCCG '03: First Call for Papers Message-ID: <20030131193151.A23816@cs.dal.ca> -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- First Call for Papers 15th Canadian Conference on Computational Geometry August 11-13, 2003 Dalhousie University http://www.cs.dal.ca/~cccg -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- Objectives The Canadian Conference on Computational Geometry (CCCG) focuses on the mathematics of discrete geometry from a computational point of view. Abstracting and studying the geometry problems that underly important applications of computing (such as geographic information systems, computer-aided design, simulation, robotics, solid modeling, databases, and graphics) leads not only to new mathematical results, but also to improvements in these applications. Despite its international following, CCCG maintains the informality of a smaller workshop and attracts a large number of students. Call for Papers Authors are invited to submit papers describing research of theoretical and practical significance to computational geometry. Electronic submissions, in standard PostScript and not exceeding 4 pages length, should be made from the conference web page. Program Committee Therese Biedl (Univ. of Waterloo) Mark Keil (Univ. of Saskatchewan) Alex Lopez-Ortiz (Univ. of Waterloo) Michael McAllister (Dalhousie University) Henk Meijer (Queen's University) Tom Shermer (Simon Fraser University) Bettina Speckmann (ETH Zurich) Cao-An Wang (Memorial University) Steven Wismath (Univ. of Lethbridge) Important Dates Submission May 2, 2003 Notification May 31, 2003 Final version June 27, 2003 Conference August 11-13, 2003 Contact Michael McAllister Faculty of Computer Science Dalhousie University 6050 University Avenue Halifax, Nova Scotia, Canada B3H 1W5 phone: (902) 494-3151 fax: (902) 492-1517 email: mcallist@cs.dal.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.