From snoeyink at cs.ubc.ca Tue Apr 6 08:16:23 1999 From: snoeyink at cs.ubc.ca (Jack Snoeyink) Date: Mon Jan 9 13:40:57 2006 Subject: CCCG 1st call for papers Message-ID: -------------------------------------------------------- Eleventh Canadian Conference on Computational Geometry University of British Columbia, Vancouver, Canada August 15-18, 1999 http://www.cs.ubc.ca/conferences/CCCG 1st call for papers; submission deadline May 14, 1999 -------------------------------------------------------- The Eleventh Canadian Conference on Computational Geometry (CCCG '99) will be held at the University of British Columbia, Vancouver, Canada, August 15-18, 1999. Call for Abstracts: The programme committee invites submissions of extended abstracts in all areas of computational geometry. Abstracts should use two to four pages in ACM conference format: Double column, US letter paper, in a standard 10pt font. (E.g. http://www.acm.org/sigs/pubs/proceed/template.html) We encouraged the simultaneous submission of the URL (web address) for a full paper, which will be used to provide more detailed feedback to authors. Authors will be notified if their abstacts are accepted by May 31; comments on full papers will be given at the same time (or in the following two weeks if there are more extensive comments.) Authors of all accepted papers are encouraged to contribute a full version for the electronicproceedings by July 7, otherwise the extended abstract will be used. Abstracts, in postscript or PDF, and links to full papers, should be sent by May 14, 1999 to snoeyink@cs.ubc.ca 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. Invited speakers include Victor Klee (mathematics, Univ of Washington), John Canny (computer science, UC Berkeley) and Susanne Fortier (chemistry, Queens Univ.) CCCG'99 follows WADS'99, the Workshop on Algorithms And Data Structures, which is held in downtown Vancouver. See http://www.scs.carleton.ca/~wads Important dates: Submission of abstract: May 14, 1999. Notification of acceptance: May 31, 1999. Submission of final paper: July 7, 1999. Programme Committee: Jack Snoeyink (Chair, UBC) David Kirkpatrick (UBC) Prosenjit Bose (Carlton) Hazel Everett (U Qu??bec a Montreal) Vera Sacrestan (UPC Barcelona) Tetsuo Asano (Osaka E-C University) ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From shimada+ at andrew.cmu.edu Tue Apr 13 08:27:19 1999 From: shimada+ at andrew.cmu.edu (Kenji Shimada) Date: Mon Jan 9 13:40:57 2006 Subject: 8IMR: call for papers Message-ID: <8r4mcLm00Ui701eEY0@andrew.cmu.edu> *************************************************************** ** Announcement and Call for Papers ** ** ** ** 8TH INTERNATIONAL MESHING ROUNDTABLE ** ** ** ** October 10-13, 1999 ** ** South Lake Tahoe, California, USA ** ** ** ** http://www.cfd.sandia.gov/8imr.html ** ** ** ** Sponsored by Sandia National Laboratories ** *************************************************************** Join us at the 8th International Meshing Roundtable to be held in beautiful South Lake Tahoe, California, on October 10-13th, 1999. The goal of the 8th International Meshing Roundtable is to bring together researchers and developers from industry, academia, and government labs in a stimulating, open environment for the exchange of technical information related to meshing and general pre-processing techniques. Previous Roundtables (Chicago, Illinois, 1992, Albuquerque, New Mexico, 1993-1995, Pittsburgh, Pennsylvania, 1996, Salt Lake City, Utah, 1997, and Dearborn, Michigan, 1998) have enjoyed significant participation from each of these groups from a large number of countries. This year's poster session will be sponsored by Major Shared Resource Centers (MSRC) established by the Department of Defense (DOD) High Performance Computing Modernization Office (HPCMO) and the International Society of Grid Generation (ISGG, http://www.erc.msstate.edu/isgg/) to encourage more participants from the grid generation research and user community. EVENTS ------ Events at this year's roundtable will include: * Technical presentations from contributed papers * Keynote and invited speakers * Poster session with "Best Poster" and "Meshing Maestro" awards on top of Heavenly Mountain overlooking Lake Tahoe. * Birds-of-a-feather session which will provide a discussion forum for small groups of researchers working in similar fields * Panel discussion * Dinner banquet and cruise aboard a paddlewheel boat cruising Lake Tahoe In addition, this year's conference will include a new feature: * Pre-conference Short Course on Sunday, October 10 More information on the Roundtable, as it becomes available, can be found on the International Meshing Roundtable WWW page at: http://www.cfd.sandia.gov/8imr.html IMPORTANT DATES --------------- June 13, 1999 Full paper due August 1, 1999 Acceptance/rejection notices sent to authors August 22, 1999 Final, camera-ready papers due September 10, 1999 Early conference registration due and hotel reservation due for special discount rates Oct. 10-13, 1999 8th International Meshing Roundtable South Lake Tahoe, California, USA CALL FOR PAPERS --------------- Papers are being sought that present original results on meshing, grid generation, and other pre-processing techniques. In addition to our core topics in meshing related algorithms, we are also interested in obtaining technical papers that relate analysis and application solution to the mesh generation process. Potential topics include but are not limited to: * Volume and surface mesh generation * Structured grid generation * CAD Interface for meshing and grid generation * Hybrid meshing * Anisotropic mesh generation * Mesh smoothing and optimization * Mesh quality control * Adaptive mesh refinement * Geometry decomposition and clean-up * Geometry simplification for meshing * Industrial robustness and complex geometries * Large mesh manipulation * Theoretical or novel ideas with practical potential * Technical presentations from industrial researchers * Parallel algorithms * Mesh visualization * Parameterized model construction PAPER SUBMISSIONS ----------------- Papers should contain significant technical content to be accepted. No paper will be accepted for publication without an accompanying presentation at the conference. Accepted papers will be published in the proceedings and may also be available on the website pending author approval. Papers should be 6-12 pages in length (9 point, two columns) and received by June 13, 1999. Paper submissions will be accepted in Microsoft Word, postscript or PDF, by electronic submission only. A template for paper submission will be provided at the 8IMR website. Papers can be transferred by anonymous ftp to endo.sandia.gov (place in directory pub/incoming/tjtautg/imr99/) or can be emailed to tjtautg@sandia.gov. Files transferred via anonymous ftp should be named as follows to avoid name collisions on the ftp site: names should start with the primary author's initials, followed by a hyphen, followed by the last four digits of the author's phone number. Immediately after placing a paper on the ftp site, the author should send email to Tim Tautges (tjtautg@sandia.gov) with the paper title and file name. Timothy Tautges, Paper Submission Sandia National Laboratories (telecommuting from UW-Madison) 1500 Johnson Drive Madison, WI 53706 Phone: (608) 263-8485 Fax: (608) 263-4499 E-Mail: tjtautg@sandia.gov PROCEEDINGS AND JOURNAL SPECIAL ISSUE ------------------------------------- The conference proceedings will be published by Sandia National Laboratories and distributed at the Roundtable. In addition, papers of exceptionally high quality will be published in a special issue of a widely-circulated journal. CONFERENCE REGISTRATION ----------------------- A detailed registration packet and registration form will be mailed and is also being made available on the International Meshing Roundtable WWW page at http://www.cfd.sandia.gov/8imr.html. Registration fee: $285 for full registration prior to September 11th $325 after September 11th $80 for students (doesn't include the banquet) The registration fee can be paid by credit card, check or money order. Checks should be made payable to "Sandia National Laboratories," and money orders should be sent to the conference coordinator. CONFERENCE LOCATION AND HOTEL RESERVATIONS ------------------------------------------ The site of this year's Roundtable is the city of South Lake Tahoe, California. Sitting in a high alpine valley between the peaks of the Sierra Nevadas, Tahoe is considered one of the most beautiful lakes in the world. The Roundtable will be held at the Embassy Suites Resort in South Lake Tahoe. Regularly scheduled air service is offered at the Reno Tahoe International Airport. Shuttle service is available from Reno Tahoe International Airport to the Embassy Suites Resort. Embassy Suites Resort 4130 Lake Tahoe Boulevard South Lake Tahoe, California 96150 (916) 544-5400 (Reservation Desk) (916) 544-7643 (Fax Number) http://www.embassytahoe.com/home.htm A block of rooms has been reserved at the Embassy Suites Resort at a special conference rate of $115 Sunday-Thursday and $149 Friday/Saturday plus state and local taxes. To ensure obtaining this rate, participants should make their own reservations, or make reservation by the conference registration sheet, before September 10th, 1999. You must mention that you will be attending the "8TH INTERNATIONAL MESHING ROUNDTABLE" sponsored by Sandia National Laboratories to receive our special rate for the nights of October 10-13th. STEERING COMMITTEE ------------------ The International Meshing Roundtable steering committee consists of representatives from government research labs, academia, and industry. This year's committee is: Kenji Shimada, Chairman Carnegie Mellon University Phone: (412) 268-3614 Fax: (412) 268-3348 E-Mail: shimada@cmu.edu Tammy Eldred, Conference Coordinator Sandia National Laboratories Phone: (505) 844-0180 Fax: (505) 844-8251 E-Mail: tjeldre@sandia.gov Timothy Tautges, Paper Submission Sandia National Laboratories (telecommuting from UW-Madison) Phone: (608) 263-8485 Fax: (608) 263-4499 E-Mail: tjtautg@sandia.gov Steve Owen, Paper Submission Ansys, Inc. Phone: (724) 514-3093 Fax: (724) 514-3114 E-Mail: steve.owen@ansys.com Bharat Soni, Poster Session Sr.CFD Lead ARL_ASC PET_MSRC NSF Engineering Research Center Mississippi State University Phone: (601) 325-8278 or 325-2647 Fax: (601) 325-7692 E-Mail: bsoni@erc.msstate.edu Ed D'Azevedo Oak Ridge National Laboratory Phone: (423) 576-7925 Fax: (423) 574-0680 E-Mail: efdazedo@alcor.epm.ornl.gov David Hardin Lawrence Livermore National Laboratory Phone: (925) 423-2514 Fax: (925) 423-9208 E-Mail: hardin3@llnl.gov Glen McCann SDRC Phone: (513) 576-2850 Fax: (513) 576-2850 E-Mail: glen.mccann@sdrd.com ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From gaertner at inf.ethz.ch Fri Apr 16 16:25:32 1999 From: gaertner at inf.ethz.ch (Bernd Gaertner) Date: Mon Jan 9 13:40:57 2006 Subject: New code for smallest enclosing balls Message-ID: <199904161325.PAA14661@shadow.inf.ethz.ch> A new C++ code for computing the smallest enclosing ball of points in d-dimensional Euclidean space is now available from my web page, at http://www.inf.ethz.ch/personal/gaertner/miniball.html Some of you might know that I maintain and distribute (upon request) code for this problem already for quite some time (to be precise, for eight years), but only now has it reached a level of robustness that allows me to release it officially. The main new features of the code are the following: - very fast in low dimensions due to improved primitive operations and template programming; the dimension is fixed at compile-time, allowing the compiler to unroll time-critical loops. - improved performance in higher dimensions. While the previously best method -- Emo Welzl's move-to-front heuristic -- quits in dimension 20, my code can solve large problems up to dimension 30. In dimension 20, it's by a factor of 40 faster. - increased numerical stability. All computations are done in standard floating-point arithmetic, but most input degeneracies previously found to be critical (cospherical points, multiple points, points close together) are now routinely handled. - compact, readable and understandable code. The code itself is small (about 300 lines, excluding prototypes and test suite) and comes with full documentation following the literate programming paradigm. This means, the code is part of the documentation and not the other way round. - Support of major platforms. I have tested Microsoft Visual C++, GNU and EGCS as well as MIPS (SGI), but it should be easy to adapt to other recent platforms. In the future, the code will become part of CGAL, the European Computational Geometry Algorithms Library. If you are interested, simply download the code from the above address - it's free for non-commercial use. I would be glad about any feedback that helps me to further improve the code. Best regards, Bernd Gaertner. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From orourke at grendel.csc.smith.edu Fri Apr 16 09:38:26 1999 From: orourke at grendel.csc.smith.edu (Joseph O'Rourke) Date: Mon Jan 9 13:40:57 2006 Subject: Call for Steering Committee nominations Message-ID: Dear CG Community, You may recall that the Computational Geometry Steering Committee was elected in May of 1996 for a term of two years. It is therefore time elect a new committee. I write you now to call for nominations. The current committee is: Nina Amenta Bernard Chazelle Herbert Edelsbrunner Joseph O'Rourke (Secretary) Mark Overmars (Chair) The committee organizes the annual SoCG (Symposium on Computational Geometry), conducts its business meeting, serves as liaisons to other organizations (e.g., FCRC), and so on. We will conduct the election in the same manner as before. Any member of the community may nominate any other member by sending me (the Secretary) email by the deadline (see below). Nominations for past committee members are allowed. It is not necessary to check with those whom you nominate. After nominations have been received, the Steering Committee will contact those nominated and ask them if they are willing to serve. A list of candidates will then be prepared and circulated via compgeom-announce. The community will be asked to vote for five from the list. The five with the most votes will then become the new Steering Committee. It will be up to them to select a Chair and otherwise organize themselves. All of this should be completed in time for SoCG at Miami Beach June 13-16. To nominate someone, send email to orourke@cs.smith.edu with "Subject: Nomination" by 11:59PM Sunday May 2, 1999. We look forward to hearing from you! Joe O'Rourke Secretary ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From vjm at alpha.cs.miami.edu Fri Apr 16 15:36:17 1999 From: vjm at alpha.cs.miami.edu (Victor Milenkovic) Date: Mon Jan 9 13:40:57 2006 Subject: 15th Annual ACM Symposium on Computational Geometry Message-ID: <9904161836.AA05664@alpha.cs.miami.edu> Fifteenth Annual ACM Symposium on Computational Geometry June 13-16, 1999 Miami Beach, Florida http://www.cs.miami.edu/events/SCG99 The SCG'99 web site is LIVE with conference info and READY for your registration requests. This year, registration is completely online and payment is ``semi'' online (you still have to print and mail or fax a piece of paper). Hit the beach for a refreshing morning dip in the ocean. Attend a superb collection of presentations and interact with geometers from around the world. Enjoy shopping, dining, sightseeing, and night-life in beautiful South Beach and Coconut Grove, each with its distinctive style and flair. This is the first year for online registration. Please report problems to me (vjm@cs.miami.edu), and thanks in advance for your patience. See you at the beach!! Victor Milenkovic Local Arrangements Chair, SCG '99 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From bradb at shore.net Sat Apr 17 20:30:59 1999 From: bradb at shore.net (Brad Barber) Date: Mon Jan 9 13:40:57 2006 Subject: decomposition of non-convex objects Message-ID: <3.0.3.32.19990417193059.0086bb70@shell1.shore.net> I received the following request from John Nagle. Any ideas? Thanks for your help. --Brad ----------------- X-Sender: nagle@shell5.ba.best.com Date: Mon, 12 Apr 1999 19:06:06 -0800 To: Brad Barber From: nagle@animats.com (John Nagle) Subject: Decomposition into convex objects A problem related to convex hulling is the decomposition of a nonconvex solid into convex solids. This problem doesn't seem to be well-studied. Is there any active work in that area of which you are aware? It's worth noting that, while the usual mathematical formulation of this question is the decomposition of a nonconvex solid into a set of convex solids whose sum is the original solid, a set of convex solids whose UNION is the original solid would be equally useful for collision detection work. That might be an easier problem. In fact, decomposition into a set of convex patches whose sum is the surface of the original would be quite useful for collision detection, and probably much easier than the other problems. The hard problems in convex decomposition mostly involve the creation of new interior surfaces. John Nagle Animats www.animats.com -------------------------------------------- Brad Barber Cambridge MA bradb@shore.net http://www.geom.umn.edu/locate/qhull version 2.6 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From vshapiro at engr.wisc.edu Mon Apr 19 14:30:40 1999 From: vshapiro at engr.wisc.edu (Vadim Shapiro) Date: Mon Jan 9 13:40:57 2006 Subject: decomposition of non-convex objects In-Reply-To: <3.0.3.32.19990417193059.0086bb70@shell1.shore.net> Message-ID: <199904191825.NAA24606@me.engr.wisc.edu> This problem is a special case of the boundary to CSG conversion, where CSG form is limited to the union of intersection (sum of products) terms. Some references: @Article{sv91a, author = {V. Shapiro and D. L. Vossler}, title = {Construction and optimization of {CSG} representations}, journal = {Computer-aided design}, volume = 23, number = 1, pages = {4--20}, month = jan, year = 1991 } @Article{shvo93, author = {Shapiro, V. and Vossler, D. L.}, title = {Separation for boundary to {CSG} conversion}, journal = {ACM Transactions on Graphics}, volume = 12, number = 1, month = jan, year = 1993, pages = {35--55}} The first reference is probably sufficient for your purposes. The second deals more with curved solids. There is also an implementation of the general conversion procedure for solids bounded by planar and quadric halfspaces that can be modified to produce this form of CSG only. The implementation requires use of Parasolid kernel and is publicly available from Cornell or from U. Wisconsin. Cheers, -Vadim Vadim Shapiro -------------------------------------------------------------------- Mechanical Engineering and Computer Sciences University of Wisconsin-Madison 1513 University Avenue, Madison, WI 53706 SA phone: (608) 262-3591, fax: (608) 265-2316 vshapiro@engr.wisc.edu http://sal-cnc.me.wisc.edu/ At 07:30 PM 4/17/99 -0400, Brad Barber wrote: >I received the following request from John Nagle. Any ideas? > >Thanks for your help. > --Brad > >----------------- >X-Sender: nagle@shell5.ba.best.com >Date: Mon, 12 Apr 1999 19:06:06 -0800 >To: Brad Barber >From: nagle@animats.com (John Nagle) >Subject: Decomposition into convex objects > > A problem related to convex hulling is the decomposition of a nonconvex >solid into convex solids. This problem doesn't seem to be well-studied. >Is there any active work in that area of which you are aware? > > It's worth noting that, while the usual mathematical formulation of >this question is the decomposition of a nonconvex solid into a set of convex >solids whose sum is the original solid, a set of convex solids whose UNION >is the original solid would be equally useful for collision detection work. >That might be an easier problem. > > In fact, decomposition into a set of convex patches whose sum is the >surface of the original would be quite useful for collision detection, >and probably much easier than the other problems. The hard problems >in convex decomposition mostly involve the creation of new interior >surfaces. > > John Nagle > Animats > www.animats.com > > > > >-------------------------------------------- >Brad Barber Cambridge MA bradb@shore.net >http://www.geom.umn.edu/locate/qhull version 2.6 > >------------- >The compgeom mailing lists: see >http://netlib.bell-labs.com/netlib/compgeom/readme.html >or send mail to compgeom-request@research.bell-labs.com with the line: >send readme >Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.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://uiuc.edu/~sariel/CG/compgeom/threads.html. From pratt at cme.nist.gov Mon Apr 19 11:20:29 1999 From: pratt at cme.nist.gov (Mike Pratt - MIDT) Date: Mon Jan 9 13:40:57 2006 Subject: decomposition of non-convex objects Message-ID: <199904191420.KAA16516@h185161.nist.gov> Try the following reference, and the other refs it contains: Y. S. Kim, Recognition of Form Features using Convex Decomposition, Computer Aided Design, Vol 24, #9, pp. 461 - 476. The approach is based on an original idea by Tony Woo. The decomposition tree may be recast in various forms, including a purely additive one. Mike Pratt ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From stolfi at dcc.unicamp.br Sun Apr 18 09:53:53 1999 From: stolfi at dcc.unicamp.br (Jorge Stolfi) Date: Mon Jan 9 13:40:57 2006 Subject: SIBGRAPI'99 - LAST CALL FOR PAPERS and DEADLINE EXTENSION Message-ID: <199904181153.IAA23269@coruja.dcc.unicamp.br> [ My apologies if you get this message through several lists. ] [ Please redistribute within your institution. ] !!!!!!!!!! LAST CALL FOR PAPERS !!!!!!!!!! S I B G R A P I ' 9 9 XII Brazilian Symposium on Computer Graphics and Image Processing University of Campinas, SP, Brazil - October 17--20, 1999 http://www.dca.fee.unicamp.br/sibgrapi99/ !!!!!!!!!! NOTE - DEADLINE EXTENDED TO MAY 05, 1999 !!!!!!!!!! --------------------------------------------------------------------- Posted by: J.Stolfi - Program Committee Chair - SIBGRAPI'99 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html.