From compgeom-owner@research.bell-labs.com Sun Jun 14 06:12:43 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id GAA17549 for ; Sun, 14 Jun 1998 06:12:42 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-8-10.research.bell-labs.com [135.104.8.10]) by post.tau.ac.il (8.8.8/8.8.4) with SMTP id GAA26312 for ; Sun, 14 Jun 1998 06:11:28 +0300 (IDT) Received: from research.research.bell-labs.com by netlib2; Fri Jun 12 23:49:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Jun 12 23:48:44 EDT 1998 Received: from newman.cs.purdue.edu ([128.10.2.6]) by dusty; Fri Jun 12 23:48:43 EDT 1998 Received: from arcturus.cs.purdue.edu (arcturus.cs.purdue.edu [128.10.8.27]) by newman.cs.purdue.edu (8.8.7/8.8.7/PURDUE_CS-2.0) with ESMTP id WAA02222 for ; Fri, 12 Jun 1998 22:48:43 -0500 (EST) Received: from localhost (localhost [127.0.0.1]) by arcturus.cs.purdue.edu (8.8.7/8.8.7/PURDUE_CS-2.0) with SMTP id WAA26036; Fri, 12 Jun 1998 22:48:35 -0500 (EST) Message-Id: <199806130348.WAA26036@arcturus.cs.purdue.edu> X-Authentication-Warning: arcturus.cs.purdue.edu: localhost [127.0.0.1] didn't use HELO protocol To: compgeom-announce@research.bell-labs.com cc: cmh@cs.purdue.edu Subject: ARO Job Opening Date: Fri, 12 Jun 1998 22:48:31 -0500 From: cmh@cs.purdue.edu ("Christoph M. Hoffmann") Precedence: bulk Status: RO Dear Colleagues, The Army is advertising to fill the position of Program Manager for Discrete Mathematics and Computer Science at ARO. This position was formerly held by Ming Lin. If you know of any colleagues or students who would be interested in this job, please let them know about it. Applications will be accepted until July 31, 1998. To find out more about this position, go to the ARO web site, http://www.aro.army.mil/ click on employment and then navigate through the Army Civilian Personnel web site. Alternatively, the announcement can be found at: http://www.cpol.army.mil/vacancy/va_get.cgi?ViewJob=D26498.dat Sincerely, Stephen Davis Army Research Office ------------- 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 From compgeom-owner@research.bell-labs.com Mon Jun 15 21:43:29 1998 Return-Path: Received: from netlib2.cs.bell-labs.com (H-135-104-8-10.research.bell-labs.com [135.104.8.10]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id VAA29163 for ; Mon, 15 Jun 1998 21:43:11 +0300 (GMT+0300) Received: from research.research.bell-labs.com by netlib2; Sun Jun 14 21:37:01 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Sun Jun 14 21:36:34 EDT 1998 Received: from me.engr.wisc.edu ([128.104.189.230]) by dusty; Sun Jun 14 21:36:33 EDT 1998 Received: from [144.92.209.195] by me.engr.wisc.edu (SMI-8.6/SMI-SVR4) id UAA13986; Sun, 14 Jun 1998 20:36:00 -0500 X-Sender: vshapiro@me.engr.wisc.edu Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Sun, 14 Jun 1998 20:54:37 -0500 To: compgeom-announce@research.bell-labs.com From: Vadim Shapiro Subject: CFP - special issue of Computer-Aided Design Precedence: bulk Status: RO CALL FOR PAPERS Special Issue of Computer-Aided Design Geometric Programming: Languages and Interfaces Guest Editors: Graham Jared, Cranfield University Vadim Shapiro, University of Wisconsin Deadline for Submission of Full Papers: 28 August 1998 Expected Publication: March 1999 The specification, construction, query, transformation and exchange of geometric information are common programming activities in many areas of computing, with numerous applications across engineering, the sciences, and beyond. Progress in 'geometric programming' is documented in the literature and demonstrated in commercial systems. However, geometric programming is still inhibited by unresolved problems in interfacing and exchanging geometric data and algorithms, which are compounded by factors such as incompatible models and assumptions, legacy data, and the adoption of case-by-case solutions. These difficulties are somewhat similar to the challenges that have been faced in other areas of computing over the last twenty years. Indeed, software engineering concepts, including portability of applications, plug-and-play software, and standardized application programming interfaces have been advocated as partial solutions to the interface problem in geometric programming; familiar results of this approach include kernel modellers and component-based CAD systems. However, more profound interoperability of geometric systems requires formal frameworks for defining common syntax and semantics of geometric constructs and operations which are largely independent of specific representations. This special issue will contain papers presenting new research results in topics including, but not limited to: * Advantages and limitations of existing methods in geometric programming, and the theoretical and practical barriers to further progress. * New abstractions and techniques for geometric programming. * General principles for designing and constructing geometric languages and interfaces. * Formal methods for defining the syntax and semantics of geometric programs. * Spatial (geometric, topological, and combinatorial) abstractions and models, and their applications in geometric programming. * Specification, design and implementation of application-specific languages, toolkits, and environments: in areas such as design and manufacture, robotics, architecture, and scientific visualization. Well-researched survey papers are also particularly welcome. All papers will be refereed. Authors should consult the "Notes for Authors", which are printed at the back of most issues of Computer-Aided Design, for information about preparation of their manuscripts. Papers of an appropriate standard which are not included in the special issue may be considered for publication in a regular issue of Computer-Aided_Design. Please submit papers to: Graham Jared School of Industrial and Manufacturing Science Building 50 Cranfield University Cranfield Bedford MK43 0AL U K Fax: +44-1234-750875 E-mail: g.jared@cranfield.ac.uk Or to: Vadim Shapiro Department of Mechanical Engineering University of Wisconsin - Madison 1513 University Avenue Madison WI 53706-1572 U S A FAX +1-608-265-2316 E-mail: vshapiro@engr.wisc.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 From compgeom-owner@research.bell-labs.com Fri Jun 19 16:27:28 1998 Return-Path: Received: from netlib2.cs.bell-labs.com (H-135-104-8-10.research.bell-labs.com [135.104.8.10]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id QAA24162 for ; Fri, 19 Jun 1998 16:27:18 +0300 (GMT+0300) Received: from research.research.bell-labs.com by netlib2; Thu Jun 18 13:07:03 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Jun 18 13:06:39 EDT 1998 Received: from muff.cs.mcgill.ca ([132.206.3.12]) by dusty; Thu Jun 18 13:06:38 EDT 1998 Received: by muff.cs.mcgill.ca (5.65a/IDA-1.4.2c/SOCS-2f) id AA00581 (mail destined for compgeom-announce@research.bell-labs.com) on Thu, 18 Jun 98 13:06:24 -0400 Date: Thu, 18 Jun 1998 13:06:23 -0400 (EDT) From: CCCG 98 X-Sender: cccg98@muff.cs.mcgill.ca To: compgeom-announce@research.bell-labs.com Subject: Call for participation Message-Id: Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO ------------------------------------------------------------------------ Tenth Canadian Conference on Computational Geometry Call for participation ------------------------------------------------------------------------ McGill University, Montreal, Canada, August 10-12, 1998 URL: http://cgm.cs.mcgill.ca/cccg98 E-mail: cccg98@cgm.cs.mcgill.ca The Tenth Canadian Conference on Computational Geometry (CCCG '98) will be held at McGill University, Montreal, Canada, August 10 - 12, 1998. The symposium is a forum for researchers, practitioners, developers and users working on all aspects of computational geometry. The list of papers to be presented at the conference is available on our web site at http://cgm.cs.mcgill.ca/cccg98. There is no registration fee. However, we ask that you register as soon as possible if you are attending, as we are planning a welcoming dinner-reception. In addition, we will be printing only as many copies of the proceedings as we have registrants. Registration is available online on our web site at http://cgm.cs.mcgill.ca/cccg98 CCCG '98 precedes the 6th Annual Symposium on Graph Drawing, August 13-15, 1998, also to be held at McGill University. See http://gd98.cs.mcgill.ca Organizing/Programming Committee: * David Avis * Therese Biedl * Luc Devroye * Sylvain Lazard * Godfried Toussaint * Sue Whitesides ------------- 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 From compgeom-owner@research.bell-labs.com Wed Jun 24 16:31:50 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA06742 for ; Wed, 24 Jun 1998 16:31:49 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-8-10.research.bell-labs.com [135.104.8.10]) by post.tau.ac.il (8.8.8/8.8.4) with SMTP id QAA06574 for ; Wed, 24 Jun 1998 16:27:22 +0300 (IDT) To: compgeom-announce@research.bell-labs.com Received: from research.research.bell-labs.com by netlib2; Mon Jun 22 14:55:07 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Jun 22 14:53:39 EDT 1998 Received: from mailgw.rational.com ([192.232.7.78]) by dusty; Mon Jun 22 14:53:37 EDT 1998 Received: from fort-ext.rational.com (fort-ext.pureatria.com [192.232.7.130]) by mailgw.rational.com (8.8.7/8.8.7/RATIONAL-mailgw) with SMTP id LAA06316 for ; Mon, 22 Jun 1998 11:53:30 -0700 (PDT) Received: from mailhub.rational.com by fort-ext.rational.com via smtpd (for [192.232.7.78]) with SMTP; 22 Jun 1998 18:53:30 UT Received: from mail.nc.rational.com (dns.nc.rational.com [192.168.240.10]) by mailhub.rational.com (8.8.7/8.8.7/RATIONAL-mailhub) with ESMTP id LAA07004 for ; Mon, 22 Jun 1998 11:53:27 -0700 (PDT) Received: from PACorp.com (192.168.240.213) by mail.nc.rational.com with SMTP (Eudora Internet Mail Server 1.1.2); Mon, 22 Jun 1998 14:53:21 -0400 Received: by PACorp.com (/==/ Smail3.1.25.1 #25.31) id ; Mon, 22 Jun 98 14:49 EDT Message-ID: <009601bd9e0f$9bdf4280$a4f0a8c0@pdwyer1.nc.rational.com> From: "pdwyer" To: , , Subject: Career Openings at Rational Software Date: Mon, 22 Jun 1998 14:57:31 -0400 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_0093_01BD9DEE.14BE3930" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 4.72.3110.5 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3 Precedence: bulk Status: RO This is a multi-part message in MIME format. ------=_NextPart_000_0093_01BD9DEE.14BE3930 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Rational Software is the world's leading provider of software = development tools and services that automate the component-based = development of software applications. This major industry trend has been = embraced by the largest software suppliers such as Microsoft, Oracle and = IBM - providing us with annual growth up to 47% and a global presence. =20 Referrers of successful applicants and successful applicants usually get = cash rewards. Send all resumes to pdwyer@rational.com or mail to: Paul = Dwyer c/o Rational Software 8521 Six Forks Rd. Suite 200, Raleigh NC = 27615. =20 These positions are in our Automated Test Business Unit in Raleigh, NC. =20 Senior Software Engineers: In these positions with our client/server protocol engineering team = you'll help develop record and playback technology for our Load Testing = R&D organization. Both require a BS/MS CS/EE or equiv. , 3+ years of = C/C++ software development in Unix or WindowsNT, experience with = transaction monitors such as Tuxedo and MTX, plus the ability to design, = implement and unit test significant projects, largely on your own. Other = desireables include: - client-side data base API programming - system-level programming such as drivers and kernals - familiarity with SQL language and database design - experience with network protocols like TCP/IP - experience with DCOM/DCOM+, CORBA, IIOP, etc. =20 QA Test Engineers Working with the development team, you will participate in the QA = activities for WindowsNT and Unix load testing products. = Responsibilities include developing test plans, requirements and = automated suites. Requires a BSCS\EE or equiv. with 2+ years in software = testing, and 1+ with QA and test tools. Familiarity with C, shell = scripting, formal testing methods and attention to detail also needed. = Network, SQL, API, protocol and database experience a plus. =20 Principal Technical Writer You will create an online help framework, online videos, multimedia = projects, and web documents; write help text, perform peer edits, = provide artwork and screen captures as needed and do other production = related duties. You'll also write manuals, plan, organize, schedule and = coordinate other documentation; and interface with other departments and = sites. Requires knowledge of client/server technology, Microsoft = Windows, Microsoft Word, Windows 80K Help Compiler or RoboHelp and a = graphics package like CorelDraw. Knowledge of programming languages, = database, HTML and SGML converters a plus. =20 =20 ------=_NextPart_000_0093_01BD9DEE.14BE3930 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable
 
Rational Software is the world's leading provider of = software=20 development tools and services that automate the component-based = development of=20 software applications. This major industry trend has been embraced by = the=20 largest software suppliers such as Microsoft, Oracle and IBM - providing = us with=20 annual growth up to 47% and a global presence.
 
Referrers of successful applicants and successful = applicants=20 usually get cash rewards. Send all resumes to pdwyer@rational.com  or = mail to: Paul=20 Dwyer c/o Rational Software 8521 Six Forks Rd. Suite 200, Raleigh NC=20 27615.
 
These positions are in our Automated Test Business = Unit in=20 Raleigh, NC.
 
Senior Software Engineers:
In these positions with our client/server protocol = engineering=20 team you'll help develop record and playback technology for our Load = Testing=20 R&D organization. Both require a BS/MS CS/EE or equiv. , 3+ years of = C/C++=20 software development in Unix or WindowsNT, experience with transaction = monitors=20 such as Tuxedo and MTX, plus the ability to design, implement and unit = test=20 significant projects, largely on your own. Other desireables=20 include:
- client-side data base API programming
- system-level programming such as drivers and=20 kernals
- familiarity with SQL language and database=20 design
- experience with network protocols like = TCP/IP
- experience with DCOM/DCOM+, CORBA, IIOP, = etc.
 
QA Test Engineers
Working with the development team, you will = participate in the=20 QA activities for WindowsNT and Unix load testing products. = Responsibilities=20 include developing test plans, requirements and automated suites. = Requires a=20 BSCS\EE or equiv. with 2+ years in software testing, and 1+ with QA and = test=20 tools. Familiarity with C, shell scripting, formal testing methods and = attention=20 to detail also needed. Network, SQL, API, protocol and database = experience a=20 plus.
 
Principal Technical Writer
You will = create an online=20 help framework, online videos, multimedia projects, and web documents; = write=20 help text, perform peer edits, provide artwork and screen captures as = needed and=20 do other production related duties. You'll also write manuals, plan, = organize,=20 schedule and coordinate other documentation; and interface with other=20 departments and sites. Requires knowledge of client/server technology, = Microsoft=20 Windows, Microsoft Word, Windows 80K Help Compiler or RoboHelp and a = graphics=20 package like CorelDraw. Knowledge of programming languages, database, = HTML and=20 SGML converters a plus.
 
 
 
------=_NextPart_000_0093_01BD9DEE.14BE3930-- ------------- 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 From compgeom-owner@research.bell-labs.com Fri Jun 26 15:48:15 1998 Return-Path: Received: from netlib2.cs.bell-labs.com (H-135-104-8-10.research.bell-labs.com [135.104.8.10]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id PAA25774 for ; Fri, 26 Jun 1998 15:47:33 +0300 (GMT+0300) Received: from research.research.bell-labs.com by netlib2; Thu Jun 25 17:31:03 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Jun 25 17:30:49 EDT 1998 Received: from grendel.csc.smith.edu ([131.229.222.23]) by dusty; Thu Jun 25 17:30:48 EDT 1998 Received: from demeter.csc.smith.edu (demeter.csc.smith.edu [131.229.222.48]) by grendel.csc.smith.edu (8.8.8/8.8.8/SC-CS-1.0) with ESMTP id RAA19361; Thu, 25 Jun 1998 17:30:47 -0400 (EDT) From: "Joseph O'Rourke" Received: (from orourke@localhost) by demeter.csc.smith.edu (8.8.8/8.8.8/SC-CScli-1.0) id RAA00367; Thu, 25 Jun 1998 17:30:44 -0400 (EDT) Message-Id: <199806252130.RAA00367@demeter.csc.smith.edu> Subject: Minutes of SoCG Business Meeting To: compgeom-announce@research.bell-labs.com Date: Thu, 25 Jun 1998 17:30:44 -0400 (EDT) Cc: clarkson@research.bell-labs.com (Ken Clarkson) Content-Type: text Precedence: bulk Status: RO Minutes of SoCG Business Meeting 7 June 1998, Minneapolis, MN, USA Throughout this document, SoCG stands for the ACM Symposium on Computational Geometry. The business meeting was conducted by Mark Overmars, Chair of the SoCG Steering Committee. 1. Reports on 14th SoCG (1998) Ravi Janardan reported that there were approximately 140 registrants for the conference, including 30 students. The Program Chairs reported the following submissions and acceptances: ________________________________________________________________ | Track |Program Chair |Comm. Members||Submittd|Accepted | |____________|_______________|_____________||________|_________| | Applied |Jarek Rossignac| 15 || 53 | 19 | | Theoreticl |Ken Clarkson | 11 || 57 | 25 | | Total | | 26 || 110 | 44 | | Video |Dan Halperin | 7 || 10 | 7 | |____________|_______________|_____________||________|_________| Ken Clarkson noted that all but three theory track submissions were sent via email, using the SIGACT server, and all but one accepted paper was sent using the SIGACT server. 2. 15th SoCG (1999): Miami Beach Victor Milenkovic, 1999 Conference Chair, detailed the plans for the 15th annual conference, to be held June 13-16 on Miami Beach, FL, USA. The rooms at the Radisson Hotel are $98+tax per night. The Program Chairs for the applied and theoretical tracks are John Canny and Marshall Bern respectively. Jeff Erickson will chair the Video Review. 3. 16th SoCG (2000): Hong Kong Two bids were offered: Hong Kong (Otfried Cheong [ne Schwarzkopf] and Siu-Wing Cheng) and Israel (Klara Kedem). After a discussion of both options, a vote was taken, with Hong Kong favored by the majority (50 vs. 31). Although the airfares are expensive (currently $700-$800 US/Canada-Hong Kong; $1200 Europe-Hong Kong), lodging costs and registration fees are expected to lower the total cost toward comparability with a North American site. 4. 17th SoCG (2001) There was a discussion of attempting to co-locate with another relate d conference in 2001, and the Steering Committee was given freedom to investigate possibilities and report back to the community. 5. e-Print Archives I informed the community that the Los Alamos LANL e-Print archive (http://xxx.lanl.gov) is expanding into Computer Science [it started in Physics in the early 1990's, and has since expanded into Mathematics], and that I volunteered to Joseph Halpern (Cornell), who chairs a committee on this topic, to help moderate in computational geometry. The response at the meeting was enthusiastic, with the only cautionary note concerning whether computational geometry papers will have a natural category, or will it be so fractured across classification boundaries that focus will be difficult. Subsequent to the business meeting, this issue has advanced in two ways. First, Jeff Erickson has volunteered to share the moderator duties with me. Second, I have written to Joe Halpern to convey the community's concern on categorization, and he is very sympathetic, and hopes that this can be addressed by, e.g., filtering mailing lists by keyword. 6. Procedures Mark Overmars walked through a number of points from a SoCG Procedures document he drafted, an attempt to make explicit how we intend to run the conference in the future. 1. Conference format: Four days, two nonparallel tracks (applied and theoretical), 50-60 total presentations of 20-25 minutes each. No short communications. 2. Two program committees, whose chairs are selected by the Steering Committee. Recommended 6-8 committee members for each track. 3. Ten-page abstracts submitted to a particular track. No submissions by program committee members to their own track (but they may submit to the other track). 4. The selection process should be essentially the same for both tracks: same deadlines, same guidelines, same committee size, same type of feedback to authors, either both have a committee meeting or both run the selection electronically, etc. 5. No track switches after reviewing, but the two chairs should try to meet early on and move papers (with permission of the authors) to the other track if they deem it appropriate. Various people spoke for or against specific points, but the basic outline-- emphasizing continuation of this year's format coupled with uniformity and collaboration between the two tracks--was accepted. Joseph O'Rourke, Secretary of the SoCG Steering Committee. orourke@cs.smith.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 From compgeom-owner@research.bell-labs.com Tue Jun 30 17:42:50 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id RAA12671 for ; Tue, 30 Jun 1998 17:42:48 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-8-10.research.bell-labs.com [135.104.8.10]) by post.tau.ac.il (8.8.8/8.8.4) with SMTP id RAA17283 for ; Tue, 30 Jun 1998 17:40:11 +0300 (IDT) Received: from research.research.bell-labs.com by netlib2; Mon Jun 29 14:31:01 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Jun 29 14:30:18 EDT 1998 Received: from inesc.inesc.pt ([146.193.0.1]) by dusty; Mon Jun 29 14:30:16 EDT 1998 Received: from toutatis.inesc.pt by inesc.inesc.pt with SMTP; id AA19869 (/); Mon, 29 Jun 1998 19:30:13 +0100 Received: from toutatis.inesc.pt (localhost [127.0.0.1]) by toutatis.inesc.pt (8.6.11/8.6.9) with ESMTP id TAA31843 for ; Mon, 29 Jun 1998 19:51:39 +0200 Resent-Message-Id: <199806291751.TAA31843@toutatis.inesc.pt> Prev-Resent: Mon, 29 Jun 1998 19:51:37 +0200 Prev-Resent: "compgeom-announce@research.bell-labs.com " Received: from inesc.inesc.pt (inesc.inesc.pt [146.193.0.1]) by toutatis.inesc.pt (8.6.11/8.6.9) with SMTP id SAA30997 for ; Mon, 29 Jun 1998 18:53:17 +0200 Received: from mail2.ip.pt by inesc.inesc.pt with SMTP; id AA17003 (/); Mon, 29 Jun 1998 18:31:45 +0100 Received: from ursa.cns.umist.ac.uk (ursa.cns.umist.ac.uk [130.88.210.1]) by mail2.ip.pt with SMTP id SAA05885 for ; Mon, 29 Jun 1998 18:29:38 +0100 (WET DST) Received: from dangermouse.eg.org (eg.org) [130.88.200.44] by ursa.cns.umist.ac.uk with esmtp (Exim 1.81 #4) id 0yqhic-00026g-00; Mon, 29 Jun 1998 18:27:54 +0100 Received: (from majordomo@localhost) by eg.org (8.8.8/8.8.8) id SAA02615; Mon, 29 Jun 1998 18:19:51 +0100 (BST) (envelope-from owner-non-members@eg.org) Received: from serenity.mcc.ac.uk (serenity.mcc.ac.uk [130.88.200.93]) by eg.org (8.8.8/8.8.8) with SMTP id SAA02611 for ; Mon, 29 Jun 1998 18:19:37 +0100 (BST) (envelope-from jaj@toutatis.inesc.pt) Received: from (inesc.inesc.pt) [146.193.0.1] by serenity.mcc.ac.uk with smtp (Exim 1.81 #4) id 0yqhaJ-0000qs-00; Mon, 29 Jun 1998 18:19:25 +0100 Received: from toutatis.inesc.pt by inesc.inesc.pt with SMTP; id AA16510 (/); Mon, 29 Jun 1998 18:18:19 +0100 Received: from toutatis.inesc.pt (localhost [127.0.0.1]) by toutatis.inesc.pt (8.6.11/8.6.9) with ESMTP id SAA30847 for ; Mon, 29 Jun 1998 18:39:38 +0200 Message-Id: <199806291639.SAA30847@toutatis.inesc.pt> To: general@eg.org Subject: Eurographics'98 Reminder Date: Mon, 29 Jun 1998 18:39:36 +0200 From: Joaquim A Jorge Sender: owner-non-members@eg.org Precedence: bulk Resent-To: compgeom-announce@research.bell-labs.com Resent-Date: Mon, 29 Jun 1998 19:51:37 +0200 Resent-From: Joaquim A Jorge Precedence: bulk Status: RO REMINDER -------- Early registration for Eurographics'98 ends June 30. To benefit from reduced rates, your registration form must be RECEIVED before July 1st. For further information on the conference and on how to register, consult the conference Web site at: http://www.eg98.gpcg.pt/registration Or contact registration@eg98.gpcg.pt ------------- 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 From compgeom-owner@research.bell-labs.com Mon Jul 6 16:15:00 1998 Return-Path: Received: from netlib2.cs.bell-labs.com (H-135-104-8-10.research.bell-labs.com [135.104.8.10]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id QAA05501 for ; Mon, 6 Jul 1998 16:14:21 +0300 (GMT+0300) Received: from research.research.bell-labs.com by netlib2; Thu Jul 2 11:21:05 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Jul 2 11:20:50 EDT 1998 Received: from goofy.fi.upm.es ([138.100.8.23]) by dusty; Thu Jul 2 11:20:44 EDT 1998 Received: from zape.fi.upm.es by relay.fi.upm.es (PMDF V5.1-10 #U2758) with ESMTP id <01IYXLH5YUPW0004H7@relay.fi.upm.es> for compgeom-discuss@research.bell-labs.com; Thu, 2 Jul 1998 17:19:09 MET-DST Received: from fi.upm.es (gauss.dma.fi.upm.es) by mail.fi.upm.es (PMDF V5.1-10 #U2758) with ESMTP id <01IYXLFW1T3E00034V@mail.fi.upm.es> for compgeom-discuss@research.bell-labs.com; Thu, 02 Jul 1998 17:18:07 +0200 (MET-DST) Date: Thu, 02 Jul 1998 17:25:19 +0200 From: Pedro Ramos Subject: Data for roundness algorithms To: compgeom-discuss@research.bell-labs.com Message-id: <359BA65F.A3F97C6F@fi.upm.es> MIME-version: 1.0 X-Mailer: Mozilla 4.05 [en] (Win95; I) Content-type: text/plain; charset=iso-8859-1 Content-transfer-encoding: 8BIT Precedence: bulk Status: RO Hello, I am trying to compare different algorithms for measuring roundness of objects in 2D and 3D. I have been doing some experiments with simulated data, but it would be nice to work on REAL data. Unfortunately, such real data seem to be difficult to get, because CMS's (machines measuring properties of the objects) are usually ''black boxes''. Does anybody has any pointer about where I can get such data? Thank you very much in advance Pedro Ramos -- **************************************************************** Pedro A. Ramos http://www.dma.fi.upm.es/pramos Dpto. Matemática Aplicada email: pramos@fi.upm.es Facultad de Informática phone: (34) 913367424 28660 Boadilla del Monte fax: (34) 913367422 Madrid (SPAIN) **************************************************************** ------------- 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 From compgeom-owner@research.bell-labs.com Mon Jul 6 16:27:32 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA05937 for ; Mon, 6 Jul 1998 16:27:31 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-8-10.research.bell-labs.com [135.104.8.10]) by post.tau.ac.il (8.8.8/8.8.4) with SMTP id QAA22648 for ; Mon, 6 Jul 1998 16:23:13 +0300 (IDT) Received: from research.research.bell-labs.com by netlib2; Fri Jul 3 16:49:01 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Jul 3 16:48:04 EDT 1998 Received: from ardeal.cs.jhu.edu ([128.220.13.20]) by dusty; Fri Jul 3 16:48:04 EDT 1998 Received: from michigan.cs.jhu.edu ([128.220.13.18]) by ardeal.cs.jhu.edu with smtp (ident root using rfc1413) id m0ysCkS-000w6GC (Debian Smail-3.2 1996-Jul-4 #2); Fri, 3 Jul 1998 16:48:00 -0400 (EDT) Received: from geom.cs.jhu.edu ([127.0.0.1]) by michigan.cs.jhu.edu with smtp (ident goodrich using rfc1413) id m0ysCkQ-0004spC (Debian /oo/ Smail3.1.29.1 #29.37); Fri, 3 Jul 98 16:47 EDT Message-Id: To: compgeom-announce@research.bell-labs.com cc: goodrich@cs.jhu.edu Subject: ALENEX 99 Date: Fri, 03 Jul 1998 16:47:58 -0400 From: "Michael T. Goodrich" Precedence: bulk Status: RO CALL FOR PAPERS ALENEX99 Workshop on Algorithm Engineering and Experimentation January 15-16, 1999 Omni Hotel, Baltimore, Maryland The first Workshop on Algorithm Engineering and Experimentation (ALENEX99) is sponsored by DIMACS, the Center for Discrete Mathematics and Theoretical Computer Science, with additional support from SIAM. This workshop will be immediately before SODA 99, which will be held in the same location. The aim of ALENEX99 is to provide a forum for the presentation of original research in the implementation and experimental evaluation of algorithms and data structures. Papers are invited which present significant case studies in experimental analysis (which may tighten, extend, or otherwise improve current theoretical results), or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios. We also invite papers that address methodological issues and standards in the context of empirical research on algorithms and data structures. The scientific program will include invited talks as well as contributed research papers, and will include time for discussion and debate of topics in this rapidly evolving research area. It is planned to publish the proceedings of ALENEX99 as a volume of the Springer Lecture Notes in Computer Science series. This workshop is colocated with SODA '99 and will be held on the two days preceeding that conference. A (10-page or 2-page) paper which has been reviewed and accepted for presentation at SODA is not eligible for submission to ALENEX. However we recognize that some research projects spawn multiple papers that elaborate on different aspects of the work, and we are willing to respond to inquiries about overlapping papers. Authors are invited to submit 10-page extended abstracts to the organizers by SEPTEMBER 11, 1998. For physical submissions, send 10 copies of the extended abstract to: Catherine C. McGeoch Department of Mathematics and Computer Science Amherst College Amherst, MA 01002 Instructions about electronic submissions will appear at our conference website: http://www.cs.jhu.edu/Conferences/ALENEX99/ Extended abstracts will be made available to participants at the workshop. The deadline for submission of full papers for publication in the proceedings is JANUARY 15, 1999. The ALENEX Workshop is intended to alternate in future years with the (European) ALEX conference. The last ALEX meeting was ALEX98, and the next is planned for the year 2000. PROGRAM COMMITTEE: Richard Anderson University of Washington, Seattle, WA Roberto Battiti University of Trento, Trento, Italy Michael Goodrich, Co-chair Johns Hopkins University, Baltimore MD Giuseppe F. Italiano Universita Ca Foscari di Venezia, Italy Davis S. Johnson AT&T Labs, Florham Park, NJ David R. Karger MIT, Cambridge, MA Catherine C. McGeoch, Co-chair Amherst College, Amherst, MA Steve Skienna SUNY Stony Brook, NY Roberto Tamassia Brown University, Providence, RI ------------- 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 From compgeom-owner@research.bell-labs.com Mon Jul 6 16:32:44 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA06145 for ; Mon, 6 Jul 1998 16:32:43 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-8-10.research.bell-labs.com [135.104.8.10]) by post.tau.ac.il (8.8.8/8.8.4) with SMTP id QAA23232 for ; Mon, 6 Jul 1998 16:29:48 +0300 (IDT) Received: from research.research.bell-labs.com by netlib2; Sun Jul 5 01:33:00 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Sun Jul 5 01:32:12 EDT 1998 Received: from taurus.math.tau.ac.il ([132.67.64.4]) by dusty; Sun Jul 5 01:32:10 EDT 1998 Received: from lune.math.tau.ac.il (lune.math.tau.ac.il [132.67.96.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id IAA01533 for ; Sun, 5 Jul 1998 08:32:06 +0300 (GMT+0300) From: "Joseph S. B. Mitchell" Received: (from jsbm@localhost) by lune.math.tau.ac.il (8.8.3/8.8.3) id IAA15391 for compgeom-announce@research.bell-labs.com; Sun, 5 Jul 1998 08:31:32 +0300 (GMT+0300) Date: Sun, 5 Jul 1998 08:31:32 +0300 (GMT+0300) Message-Id: <199807050531.IAA15391@lune.math.tau.ac.il> To: compgeom-announce@research.bell-labs.com Subject: CFP: Solid Modeling'99 Precedence: bulk Status: RO Please note that Solid Modeling'99 and the SoCG'99 have been scheduled next year in order not to overlap; in fact, we want to encourage computational geometry participation in the Solid Modeling conference! SoCG'99: June 13-16, 1999 (Miami) Solid Modeling'99: June 9-11, 1999 (Ann Arbor) Best, Joe Mitchell ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ********************* * CALL FOR PAPERS * ********************* ***************************************** * * * SOLID MODELING '99 * * * * FIFTH ACM SYMPOSIUM ON * * SOLID MODELING AND APPLICATIONS * * * ***************************************** Sheraton Inn, Ann Arbor, Michigan, June 9-11, 1999 Sponsored by ACM SIGGRAPH This symposium provides an international forum for the exchange of recent research and practical results in all areas and applications of solid modeling. Emphasis is on solid modeling in design, analysis and manufacturing. Previous symposia in this series (Austin, Texas, 1991, Montreal, Canada, 1993, Salt Lake City, Utah, 1995, and Atlanta, Georgia, 1997) brought together the most prominent researchers, key practitioners, and numerous students in the field. In 1999, the symposium will have several new features, including: * tutorials on June 8 * panel sessions * ACIS Best Paper Award, sponsored by Spatial Technology Inc. * sponsorship by ONR of undergraduate students to attend the symposium. More information on the symposium, as it becomes available, can be found on the Solid Modeling '99 WWW page at: http://www.engin.umich.edu/dept/meam/deslab/cadcam/ACMSM/ If you do not have access to the WWW, you can request a copy of this page by sending an email to dutta@engin.umich.edu. The schedule for submission of papers is as follows: September 30, 1998: Abstracts due October 30, 1998: Full papers due January 31, 1999: Notice of acceptance and reviewers' comments February 28, 1999: Final camera-ready papers and extended abstracts due For details on how to submit abstracts and papers, please consult the WWW page. Abstracts are used to facilitate the review process, and should be 150-300 words long. Papers should be at most 12 normally typeset pages, including figures and references, and should present previously unpublished original results. Papers will be peer-reviewed and can be selected for presentation at a plenary session with publication in the conference proceedings published by ACM Press, or presentation at a poster session with publication of an extended two-page abstract in the conference proceedings. A revised version of a number of selected papers will also be published in a special issue of the journal Computer-Aided Design. The ACIS Best Paper Award of $1500, sponsored by Spatial Technology Inc., will be awarded by a jury. Video and other special equipment will be available for presentations when requested. Topics for papers include, but are not limited to: 1) Geometric and topological representations 2) Multiresolution models 3) Heterogeneous models 4) Geometric interrogations and reasoning 5) Computational geometry relevant to modeling 6) Robustness of geometric computations 7) Blends, sweeps, offsets, deformations and other constructional methods 8) Procedural, constraint-based and parametric modeling 9) Modeling families of geometric objects 10) Feature-based modeling 11) Conceptual design techniques 12) Product modeling 13) Assembly modeling 14) Representation conversion 15) Product data exchange 16) User interaction techniques 17) Collaborative/distributed design 18) Virtual environments and prototypes 19) Reverse engineering 20) Engineering analysis, including FE mesh generation 21) Engineering tolerances 22) Manufacturing and assembly planning 23) Computational support for new manufacturing technologies General Chair ------------- Deba Dutta, University of Michigan Financial Chair --------------- Ming Lin, University of North Carolina Program Co-Chairs ----------------- Wim Bronsvoort, Delft University of Technology David Anderson, Purdue University Program Committee ----------------- Adrian Bowyer, University of Bath Beat Bruderlin, Technical University of Ilmenau Pere Brunet, Polytechnic University of Catalonia Richard Crawford, University of Texas Gershon Elber, Technion Bianca Falcidieno, CNR Italy Mark Henderson, Arizona State University Chris Hoffmann, Purdue University Fumihiko Kimura, University of Tokyo R\"udiger Klein, Daimler Benz Kunwoo Lee, Seoul National University Remi Lequette, ILOG Dinesh Manocha, University of North Carolina Martti M\"antyl\"a, Helsinki University of Technology Jai Menon, IBM Research Jim Miller, University of Kansas Joseph Mitchell, SUNY Stony Brook Nick Patrikalakis, MIT Mike Pratt, Rensselaer/NIST Ari Rappoport, Hebrew University Jarek Rossignac, Georgia Institute of Technology Vadim Shapiro, University of Wisconsin-Madison George Turkiyyah, University of Washington Tamas Varady, Hungarian Academy of Sciences Kevin Weiler, Autodesk John Woodwark, Information Geometers ------------- 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 From compgeom-owner@research.bell-labs.com Wed Jul 8 15:55:41 1998 Return-Path: Received: from netlib2.cs.bell-labs.com (H-135-104-8-10.research.bell-labs.com [135.104.8.10]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id PAA00640 for ; Wed, 8 Jul 1998 15:54:33 +0300 (GMT+0300) Received: from research.research.bell-labs.com by netlib2; Tue Jul 7 10:47:00 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Jul 7 10:46:57 EDT 1998 Received: from jeff.cs.mcgill.ca ([132.206.3.110]) by dusty; Tue Jul 7 10:46:52 EDT 1998 Received: (from therese@localhost) by jeff.cs.mcgill.ca (8.8.8/8.8.8) id KAA14308; Tue, 7 Jul 1998 10:46:50 -0400 (EDT) Date: Tue, 7 Jul 1998 10:46:48 -0400 (EDT) From: "Therese C. Biedl" X-Sender: therese@jeff.cs.mcgill.ca To: DMANET@math.utwente.nl, THEORYNT@LISTSERV.NODAK.EDU, compgeom-announce@research.bell-labs.com Subject: GD'98 - Final Call for Posters - Due July 15th Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Final call for POSTERS Deadline: July 15, 1998 Graph Drawing '98 McGill University, Montreal, Canada, August 13-15, 1998. URL: http://gd98.cs.mcgill.ca email: info@gd98.cs.mcgill.ca The paper submission deadline for GD '98 has now passed, and the list of accepted papers is available at the above Web site. However, poster submissions for GD '98 are still welcome. Graph Drawing '98 (GD '98) will be held at McGill University, Montreal, Canada, August 13 - 15, 1998. The symposium is a forum for researchers, practitioners, developers and users working on all aspects of graph drawing. GD '98 follows the 10th Canadian Conference on Computational Geometry, August 10-12, 1998, held at McGill University. See http://cgm.cs.mcgill.ca/cccg98. Call for Posters: Submissions of posters in graph drawing and related areas are solicited. The purpose of posters is to provide a forum for the communication of results to the graph drawing community. These posters may contain results that have appeared or will appear elsewhere. They may also pose open problems of interest to the graph drawing community. To increase the interaction between graph drawing and other areas, posters that present topics related to graph drawing in fields such as cartography, chemistry, computational biology, geographic information systems, graphics, perception and vision, scientific visualization, and software engineering are particularly encouraged. To allow for questions and discussion, at least one author of each poster is expected to be present at the conference. Proceedings: The proceedings of GD '98 will be published in the Springer-Verlag Lecture Notes in Computer Science series. These proceedings will contain a Poster Gallery Report, with a 1-2 page abstract per poster. The camera-ready version of this abstract is due at the conference. To prepare your hard copy, please follow the directions for authors in the LNCS series of Springer-Verlag. These directions are available at the LNCS homepage. Submission: To submit a poster, send a 1-2 page abstract by email (in postscript, LaTeX, or plain text) or as hard copy to the Poster Chair Therese Biedl School of Computer Science McGill University 3480 University Street #318 Montreal, Quebec H3A 2A7, Canada email: therese@cs.mcgill.ca Important dates: Submissions: July 15, 1998. Final version: August 15, 1998. ------------- 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 From compgeom-owner@research.bell-labs.com Thu Jul 9 05:54:26 1998 Return-Path: Received: from netlib2.cs.bell-labs.com (H-135-104-8-10.research.bell-labs.com [135.104.8.10]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id FAA18318 for ; Thu, 9 Jul 1998 05:54:22 +0300 (GMT+0300) To: compgeom-discuss@research.bell-labs.com Received: from research.research.bell-labs.com by netlib2; Wed Jul 8 10:49:03 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Jul 8 10:47:19 EDT 1998 Received: from repulse.concentric.net ([207.155.248.4]) by dusty; Wed Jul 8 10:47:19 EDT 1998 Received: from brutus (ts001d09.col-co.concentric.net [206.83.80.21]) by repulse.concentric.net (8.8.5/) id KAA07532; Wed, 8 Jul 1998 10:47:13 -0400 (EDT) [ConcentricHost SMTP Relay] Errors-To: From: "Bud Curtis" To: Subject: Looking for a Heads-Up Date: Wed, 8 Jul 1998 08:46:50 -0600 Message-ID: <000001bdaa7f$3e156540$155053ce@brutus> MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook 8.5, Build 4.71.2173.0 Importance: Normal X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3 Precedence: bulk Status: RO Nancy Amato suggested that I post this inquiry to this news group. I hope you don't mind this inquiry. It has been my experience that it is better to ask for insight versus experiencing it directly once you have gone down a blind alley with an algorithm development. I am planning a development that involves the placement of 2D circles in a restricted area. I would appreciate any leads you may have with regard to a similar study or project at a University. The best way to describe the development is to imagine a cluster of balloons. Each balloon has a fixed (equal) diameter and has an elastic string tied to it. The other end of the string is tied to an origin point. Each balloon's origin is spaced from another's origin in an arbitrary pattern. The origin to origin spacing is typically less than the diameter of a balloon, so a balloon can't be placed over its origin without pushing the adjacent balloons off their origins. The object of the development is to bring all the balloons as close to their origins as possible (minimizing the tension of the elastic string) with each balloon just touching. I have two fairly straight forward approaches, but frequently they do not represent the best way to solve the problem. One would simply explode the balloons from a geometric center beyond any possible intersection with the other balloons. Then it would use the elastic string to pull the balloons back as close as possible to the respective origin never allowing overlap while doing the pull back. The other would start with each balloon at its origin and then working from computed overlap forces move the balloons until no overlap occurs. I would be very interested in any suggestions you might have of similar research I could review. Thank you for listening, and please excuse the intrusion. |~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ |Bud Curtis Bud@CurtisCAE.cnchost.com |Curtis CAE Consultants |15065 Herring Road |Colorado Springs, CO 80908 (719)495-8266 |~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ | Custom Database & Information Processing for | the Design & Manufacturing Industry |~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ------------- 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 From compgeom-owner@research.bell-labs.com Fri Jul 10 00:38:24 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA29785 for ; Fri, 10 Jul 1998 00:38:23 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-8-10.research.bell-labs.com [135.104.8.10]) by post.tau.ac.il (8.8.8/8.8.4) with SMTP id AAA00400 for ; Fri, 10 Jul 1998 00:35:54 +0300 (IDT) To: compgeom-announce@research.bell-labs.com Received: from research.research.bell-labs.com by netlib2; Thu Jul 9 10:15:07 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Jul 9 10:13:37 EDT 1998 Received: from mailer.siam.org ([192.108.225.1]) by dusty; Thu Jul 9 10:13:37 EDT 1998 Received: from venn.siam.org (gateway.siam.org [192.108.225.116]) by mailer.siam.org (8.8.5/8.8.5) with SMTP id KAA03515 for ; Thu, 9 Jul 1998 10:13:37 -0400 (EDT) From: flores@siam.org Received: from ccMail by venn.siam.org (ccMail Link to SMTP R8.00.00) id AA899993615; Thu, 09 Jul 98 10:13:37 -0500 Message-Id: <9807098999.AA899993615@venn.siam.org> X-Mailer: ccMail Link to SMTP R8.00.00 Date: Thu, 09 Jul 98 10:13:33 -0500 To: Subject: Please Post MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="simple boundary" Precedence: bulk Status: RO --simple boundary Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Sixth SIAM Conference on Geometric Design November 2-5, 1999 Sheraton Old Town Hotel Albuquerque, New Mexico SIAM and the Organizing Committee for the Sixth SIAM Conference on Geometric Design are pleased to announce that the conference Call for Papers is now available on the Web. To know more about the conference themes, invited plenary speakers, minisymposia, and deadlines for submission of minisymposium proposals or contributed abstracts, please visit now -- www.siam.org/meetings/gd99/ or contact: Trini Flores flores@siam.org meetings@siam.org --simple boundary Content-Type: text/plain; charset=US-ASCII; name="RFC822.TXT" Content-Transfer-Encoding: 7bit Content-Disposition: attachment; filename="RFC822.TXT" Received: from netlib2.cs.utk.edu by venn.siam.org (ccMail Link to SMTP R8.00.00) ; Mon, 22 Jun 98 09:00:00 -0500 Return-Path: Received: from na-net.ornl.gov by netlib2.cs.utk.edu with SMTP (cf v2.9t-netlib) id JAA03381; Mon, 22 Jun 1998 09:00:32 -0400 Date: Mon, 22 Jun 1998 09:00:32 -0400 Message-Id: <199806221300.JAA03381@netlib2.cs.utk.edu> From: na-net@netlib2.cs.utk.edu To: flores@siam.org subject: Received your na-digest article --simple boundary-- ------------- 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 From compgeom-owner@research.bell-labs.com Wed Jul 22 04:21:33 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id EAA00389 for ; Wed, 22 Jul 1998 04:21:31 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-9-27.research.bell-labs.com [135.104.9.27]) by post.tau.ac.il (8.8.8/8.8.4) with SMTP id EAA13307 for ; Wed, 22 Jul 1998 04:19:40 +0300 (IDT) Received: from research.research.bell-labs.com by netlib2; Fri Jul 10 11:31:03 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Jul 10 11:29:28 EDT 1998 Received: from sargas.inria.fr ([138.96.16.9]) by dusty; Fri Jul 10 11:29:26 EDT 1998 Received: from localhost by sargas.inria.fr (8.8.8/8.8.5) with ESMTP id RAA13207 for ; Fri, 10 Jul 1998 17:29:27 +0200 (MET DST) Message-Id: <199807101529.RAA13207@sargas.inria.fr> X-Mailer: exmh version 2.0.2 2/24/98 To: compgeom-tribune@research.bell-labs.com Subject: next issue soon! Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Fri, 10 Jul 1998 17:29:26 +0200 From: Herve Bronnimann Precedence: bulk Status: RO Dear readers: I'd like to announce that after a long pregnancy of 9 months, the tribune is getting into shape for a new issue. It's not going to be premature, but please send me your contributions: o call for papers, announcements for the agenda o a report on a conference, workshop, or seminar that you attended o if you have organized an event, you must have written a report also; consider contributing this report to the tribune o a short contribution (1 column) on some problems that you have been looking at lately; very welcome are problems involving multiple disciplins (e.g. geometry and graphics, vision, shape reconstruction, manufacturing, robotics, astrophysics or molecular biology) o open question you never found the answer of (don't be shy!) o anything you would like to see in the CG Tribune Your friendly editor, Herve Bronnimann. http://www.inria.fr/prisme/personnel/bronnimann/cgt/ --- Herve ------------- 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 From compgeom-owner@research.bell-labs.com Wed Jul 22 04:23:36 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id EAA00445 for ; Wed, 22 Jul 1998 04:23:36 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-9-27.research.bell-labs.com [135.104.9.27]) by post.tau.ac.il (8.8.8/8.8.4) with SMTP id EAA14783 for ; Wed, 22 Jul 1998 04:21:45 +0300 (IDT) Received: from research.research.bell-labs.com by netlib2; Fri Jul 10 11:31:03 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Jul 10 11:29:28 EDT 1998 Received: from sargas.inria.fr ([138.96.16.9]) by dusty; Fri Jul 10 11:29:26 EDT 1998 Received: from localhost by sargas.inria.fr (8.8.8/8.8.5) with ESMTP id RAA13207 for ; Fri, 10 Jul 1998 17:29:27 +0200 (MET DST) Message-Id: <199807101529.RAA13207@sargas.inria.fr> X-Mailer: exmh version 2.0.2 2/24/98 To: compgeom-tribune@research.bell-labs.com Subject: next issue soon! Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Fri, 10 Jul 1998 17:29:26 +0200 From: Herve Bronnimann Status: RO Dear readers: I'd like to announce that after a long pregnancy of 9 months, the tribune is getting into shape for a new issue. It's not going to be premature, but please send me your contributions: o call for papers, announcements for the agenda o a report on a conference, workshop, or seminar that you attended o if you have organized an event, you must have written a report also; consider contributing this report to the tribune o a short contribution (1 column) on some problems that you have been looking at lately; very welcome are problems involving multiple disciplins (e.g. geometry and graphics, vision, shape reconstruction, manufacturing, robotics, astrophysics or molecular biology) o open question you never found the answer of (don't be shy!) o anything you would like to see in the CG Tribune Your friendly editor, Herve Bronnimann. http://www.inria.fr/prisme/personnel/bronnimann/cgt/ --- Herve From compgeom-owner@research.bell-labs.com Fri Jul 24 17:12:26 1998 Return-Path: Received: from netlib2.cs.bell-labs.com (H-135-104-9-27.research.bell-labs.com [135.104.9.27]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id RAA19293 for ; Fri, 24 Jul 1998 17:11:47 +0300 (GMT+0300) Received: from research.research.bell-labs.com by netlib2; Thu Jul 23 22:37:01 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Jul 23 22:35:17 EDT 1998 Received: from tango.CS.McGill.CA ([132.206.3.130]) by dusty; Thu Jul 23 22:35:14 EDT 1998 Received: (from sue@localhost) by tango.CS.McGill.CA (8.6.10/8.6.9) id WAA05633 for compgeom-announce@research.bell-labs.com; Thu, 23 Jul 1998 22:35:16 -0400 Date: Thu, 23 Jul 1998 22:35:16 -0400 From: "Prof. Sue WHITESIDES" Message-Id: <199807240235.WAA05633@tango.CS.McGill.CA> To: compgeom-announce@research.bell-labs.com Subject: Graph Drawing '98 program and late registration Precedence: bulk Status: RO Graph Drawing '98 (GD '98) August 13-15, 1998 Registration for Graph Drawing '98 (GD '98) increases to CD$300 (regular) and CD$175 (student) on 1 August. The registration forms are available at the web site, http://gd98.cs.mcgill.ca. Here is the preliminary program. ------------------------------------------------------------- Graph Drawing '98 (GD '98) August 13-15, 1998 McGill University, Montreal, Canada Preliminary Program http://gd98.cs.mcgill.ca info@gd98.cs.mcgill.ca All technical talks and demos are in the Redpath Museum Lecture Hall, 859 Sherbrooke St. West, on the McGill campus. McGill is on Sherbrooke St. West between McTavish and University Streets in the heart of downtown Montreal. All papers and demos are of 20 minutes duration. Registration is at Thomson House, 3650 McTavish St. above Dr. Penfield Street, 7pm-10pm Wednesday, August 12. Registration is also available at the technical sessions. Lunch (included in registration fee) on Thursday and Friday is at Thomson House. GD '98 closes at 12:30pm on Saturday, August 15. Saturday lunch is not provided. The banquet takes place (to be confirmed) at Club St. Denis, 257 Sherbrooke St. East on Friday, August 14, from 7pm. The results of the Graph Drawing Contest are to be announced at that time. Please examine the web site for updates close to conference time. ----------------------- Wednesday, August 12 ---------------------- Registration: Thomson House, 3650 McTavish St. 7pm-10pm party: GD '98 participants are invited to the farewell party for CCCG, upstairs in Thomson House, beginning at 8pm. ----------------------- Thursday, August 13 ----------------------- Registration: 8-9am Redpath Museum + during morning coffee break 10:30-11 9:00-9:10 Welcome Words Session I: 9:10-10:30am (4 papers) 9:10-9:30 "Embedding Planar Graphs at Fixed Vertex Locations" Janos Pach and Rephael Wenger 9:30-9:50 "Planar Polyline Drawings with Good Angular Resolution" Carsten Gutwenger and Petra Mutzel 9:50-10:10 "A Framework for Drawing Planar Graphs with Curves and Polylines" Michael T. Goodrich and Christopher G. Wagner 10:10-10:30 "Crossing Number of Abstract Topological Graphs" Jan Kratochvil --------------------------------------------------------- 10:30-11am break, registration desk open, poster gallery --------------------------------------------------------- Session II: 11-noon (3 papers) 11:00-11:20 "Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs" Christian A. Duncan, Michael T. Goodrich and Stephen G. Kobourov 11:20-11:40 "Geometric Thickness of Complete Graphs" Michael B. Dillencourt, David Eppstein and Daniel S. Hirschberg 11:40-noon "NP-Completeness of some Tree-Clustering Problems" F. Schreiber and K. Skodinis -------------------------- 12-2pm lunch Thomson House -------------------------- Session III: 2-3:30pm (3 demos) 2:00-2:20 "Edge Labeling in the Graph Layout Toolkit" Ugur Dogrusoz, Konstantinos G. Kakoulis, Brendan Madden and Ioannis G. Tollis ~2:30-2:50 "Graph Multidrawing: Finding Nice Drawings Without Defining Nice" Therese Biedl, Joe Marks, Kathy Ryall and Sue Whitesides ~3:00-3:20 "JIGGLE: Java Interactive General Graph Layout Environment" Daniel Tunkelang ------------------------------- 3:20-4pm break & poster gallery ------------------------------- Session IV: 4-5:20pm (4 papers) 4:00-4:20 "Approximation Algorithms for Finding Best Viewpoints" Michael E. Houle and Richard Webber 4:20-4:40 "A Combinatorial Framework for Map Labeling" Alexander Wolff and Frank Wagner 4:40-5:00 "Self-Organizing Graphs" Bernd Meyer 5:00-5:20 "Using Graph Layout to Visualize Train Interconnection Data" Ulrik Brandes and Dorothea Wagner --------------------------------------- 5:20-6pm Book Launching Redpath Museum --------------------------------------- ----------------------- Friday, August 14 ------------------------- Registration: 8-9am Redpath Museum + during morning break 10-10:30 Session V: 9-10am (3 papers) 9:00-9:20 "An Algorithm for Three-Dimensional Orthogonal Graph Drawing" David R. Wood 9:20-9:40 "Three Approaches to 3D-Orthogonal Box-Drawings" Therese C. Biedl 9:40-10:00 "A Split&Push Approach to 3D Orthogonal Drawing" Giuseppe Di Battista, Maurizio Patrignani and Francesco Vargiu ------------------------------------------------------ 10-10:30 break, registration desk open, poster gallery ------------------------------------------------------ Session VI: 10:30-11:50am (4 papers) 10:30-10:50 "On Improving Orthogonal Drawings: The 4M-Algorithm" Ulrich Foessmeier, Carsten Hess and Michael Kaufmann 10:50-11:10 "Refinement of Orthogonal Graph Drawings" Janet M. Six, Konstantinos G. Kakoulis and Ionnis G. Tollis 11:10-11:30 "Difference Metrics for Interactive Orthogonal Graph Drawing Algorithms" Stina Bridgeman and Roberto Tamassia 11:30-11:50 "A Layout Adjustment Problem for Disjoint Rectangles Preserving Orthogonal Order" Kunihiko Hayashi, Michiko Inoue, Toshimitsu Masuzawa and Hideo Fujiwara ---------------------------------------------------------------- 11:50-noon group photo (to be confirmed) on the steps of Redpath noon-2pm lunch Thomson House ---------------------------------------------------------------- Session VII: 2-3:20pm (3 demos) 2:00-2:20 "Cooperation between Interactive Actions and Automatic Drawing in a Schematic Editor" Gilles Paris ~2:30-2:50 "Improved Force-directed Layouts" Emden R. Gansner and Stephen C. North ~3:00-3:20 "Large Graph Exploration with H3Viewer and Site Manager" Tamara Munzner --------------------------------- 3:20-4pm break and poster gallery --------------------------------- Session VIII: 4-5pm (3 papers) 4:00-4:20 "Level Planarity Testing in Linear Time" Michael Juenger, Sebastian Leipert and Petra Mutzel 4:20-4:40 "Upward Planarity Checking: Faces Are More than Polygons" Giuseppe Di Battista and Giuseppe Liotta 4:40-5:00 "Quasi-Upward Planarity" Paola Bertolazzi, Giuseppe Di Battista and Walter Didimo ------------------------------------------------------------- 7pm-11pm banquet Club St. Denis, 257 Sherbrooke East near St. Denis (dinner followed by award ceremony for Graph Drawing Contest Winners) ------------------------------------------------------------- ----------------------- Saturday, August 15 ----------------------- Session IX: 9-10:20am (4 papers) 9:00-9:20 "Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions" Seok-Hee Hong, Peter Eades, Aaron Quigley and Sang-Ho Lee 9:20-9:40 "Proximity Drawings: Three Dimensions are Better than Two" Paolo Penna and Paola Vocca 9:40-10:00 "Drawing of Two-dimensional Irregular Meshes" Alok Aggarwal, S. Rao Kosaraju and Mihai Pop 10:00-10:20 "Algorithmic Patterns for Graph Drawing" Natasha Gelfand and Roberto Tamassia ------------------------------------ 10:20-10:50am break & poster gallery ------------------------------------ Session X: 10:50am-12:20pm (3 demos) 10:50-11:10 "Visualization of Parallel Execution Graphs" Bjoern Steckelbach, Till Bubeck, Ulrich Foessmeier, Michael Kaufmann, Marcus Ritt and Wolfgang Rosestiel ~11:20-11:40 "A Fully Animated Interactive System for Clustering and Navigating Huge Graphs" Mao Lin Huang and Peter Eades ~12:00-12:20 "HIGRES -- System Demonstration" Ivan A. Lisitsyn ------------------------------------------------------------ Closing Remarks: 12:20-12:30pm See you in Prague at GD '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 From compgeom-owner@research.bell-labs.com Mon Aug 3 02:04:36 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id CAA13752 for ; Mon, 3 Aug 1998 02:04:35 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-9-27.research.bell-labs.com [135.104.9.27]) by post.tau.ac.il (8.8.8/8.8.4) with SMTP id CAA03217 for ; Mon, 3 Aug 1998 02:02:54 +0300 (IDT) Received: from research.research.bell-labs.com by netlib2; Mon Jul 27 22:07:00 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Jul 27 22:06:14 EDT 1998 Received: from duke.cs.duke.edu ([152.3.140.1]) by dusty; Mon Jul 27 22:06:11 EDT 1998 Received: from euclid.cs.duke.edu (euclid.cs.duke.edu [152.3.140.121]) by duke.cs.duke.edu (8.8.5/8.8.5) with ESMTP id WAA12224 for ; Mon, 27 Jul 1998 22:06:12 -0400 (EDT) From: Pankaj Kumar Agarwal Received: (pankaj@localhost) by euclid.cs.duke.edu (8.8.5/8.6.9) id WAA11706 for compgeom-announce@research.bell-labs.com; Mon, 27 Jul 1998 22:06:12 -0400 (EDT) Date: Mon, 27 Jul 1998 22:06:12 -0400 (EDT) Message-Id: <199807280206.WAA11706@euclid.cs.duke.edu> To: compgeom-announce@research.bell-labs.com Subject: SCG'98: Open problems Precedence: bulk Status: RO Problems presented at the open-problem session of SCG'98 are finally available on web. URL: http://www.cs.duke.edu/~pankaj/scg98-openprobs/open-probs.html The problems will also appear in the CG column of the next issue of SIGACT news. -Pankaj ------------- 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 From compgeom-owner@research.bell-labs.com Mon Aug 3 02:07:58 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id CAA13883 for ; Mon, 3 Aug 1998 02:07:57 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-9-27.research.bell-labs.com [135.104.9.27]) by post.tau.ac.il (8.8.8/8.8.4) with SMTP id CAA03273 for ; Mon, 3 Aug 1998 02:05:50 +0300 (IDT) Received: from research.research.bell-labs.com by netlib2; Tue Jul 28 19:01:01 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Jul 28 18:59:44 EDT 1998 To: compgeom-announce@research.bell-labs.com Received: from chronos.lnec.pt ([193.136.104.19]) by dusty; Tue Jul 28 18:59:42 EDT 1998 Received: from inesc.inesc.pt (inesc.inesc.pt [146.193.0.1]) by chronos.lnec.pt (AIX4.2/UCB 8.7/8.7) with SMTP id UAA18830 for ; Tue, 28 Jul 1998 20:54:28 +0100 (GDT) From: info@eg98.gpcg.pt Received: from toutatis.inesc.pt by inesc.inesc.pt with SMTP; id AA03696 (/); Tue, 28 Jul 1998 20:54:28 +0100 Received: (from jaj@localhost) by toutatis.inesc.pt (8.6.11/8.6.9) id VAA29995 for divulg-all@chronos.lnec.pt; Tue, 28 Jul 1998 21:17:49 +0200 Date: Tue, 28 Jul 1998 21:17:49 +0200 Message-Id: <199807281917.VAA29995@toutatis.inesc.pt> Subject: EUROGRAPHICS'98, LISBOA, PORTUGAL: Call for Participation Reply-To: info@eg98.gpcg.pt Errors-To: nobody@eg98.gpcg.pt Apparently-To: divulg-all@chronos.lnec.pt Precedence: bulk Status: RO (please accept our apologies if you receive this more than once) CALL FOR PARTICIPATION EUROGRAPHICS'98 19th Annual Meeting of the EUROGRAPHICS Association August 31-September 4, 1998 Lisboa, Portugal Fundac,a~o Calouste Gulbenkian http://www.eg98.gpcg.pt/ EUROGRAPHICS has become the leading international computer graphics conference in Europe. Promoted by the EUROGRAPHICS Association, EUROGRAPHICS'98 its 19th annual meeting, takes place in Lisboa, Portugal, from 31 August to September 4 1998, under the motto "Discovering New Realities". EG98 main technical program comprises 35 top-quality research papers from computer graphics researchers from all over the world, in twelve technical sessions covering interesting topics such as Virtual and Augmented Environments, Integrated Audiovisual and Haptic Virtual Worlds, Virtual Reality, VRML and Graphics on the World-Wide Web, Computer Graphics and Multimedia, Rendering and Realistic Image Synthesis and Human-Computer Interaction. As usual, EG98 also includes State-of-the-Art-Reports and Panels as well as three distinguished invited speakers, Andries van Dam, James Foley and Jose' Encarnac,a~o. Researchers from Silicon Graphics and Microsoft among others, will present the latest developments on the industry front. New this year are twenty Short Presentations and Interactive Demonstrations featuring quality work in progress, well formulated ideas and application results. In addition to the main conference, five pre-conference tutorials and two pre-conference workshops offer in depth tuition and discussion of specific hot topics in the field. The conference takes place in Fundac,a~o Calouste Gulbenkian, an international conference centre strategically located in Lisboa. If you are interested in participating in EUROGRAPHICS'98, it is very important to register for the event, book hotel accommodations and flights as soon as possible. Due to the World Fair EXPO'98, plane seats and hotel rooms may be difficult to come by. Full details of the main conference program, workshops, tutorials and other events, plus registration and accommodation information, and a web-based registration form are available on the website. If you would like to receive an email attachment with the final program and registration form please respond to this email. ------------- 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 From compgeom-owner@research.bell-labs.com Mon Aug 3 02:09:55 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id CAA13978 for ; Mon, 3 Aug 1998 02:09:54 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-9-27.research.bell-labs.com [135.104.9.27]) by post.tau.ac.il (8.8.8/8.8.4) with SMTP id CAA03336 for ; Mon, 3 Aug 1998 02:08:16 +0300 (IDT) Received: from research.research.bell-labs.com by netlib2; Wed Jul 29 11:11:04 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Jul 29 11:09:43 EDT 1998 Received: from mail.cs.uu.nl ([131.211.80.32]) by dusty; Wed Jul 29 11:09:43 EDT 1998 Received: from xbach.cs.uu.nl (xbach.cs.uu.nl 131.211.80.243) by mail.cs.uu.nl (VMailer) via SMTP id 2F71B82FDF; Wed, 29 Jul 1998 17:09:43 +0200 (MET DST) Date: Wed, 29 Jul 1998 17:09:43 +0200 (MDT) From: Remco Veltkamp To: compgeom-announce@research.bell-labs.com Subject: CGAL release 1.1 Message-ID: X-Org: Department of Computer Science; Utrecht University X-Org: P.O. Box 80.089; 3508 TB Utrecht; The Netherlands. X-Org: phone: +31-30-2531454; telefax: +31-30-2513791 MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO We are pleased to announce release 1.1 of CGAL, the Computational Geometry Algorithms Library. Additions to release 1.0 include - 3D intersections - kD points - 3D convex hull - kD smallest enclosing sphere The CGAL project is a collaborative effort to develop a robust, easy to use, and efficient C++ software library of geometric data structures and algorithms. The CGAL library contains: - Basic geometric primitives such as points, vectors, lines, predicates such as for relative positions of points, and operations such as intersections and distance calculation. - A collection of standard data structures and geometric algorithms, such as convex hull, (Delaunay) triangulation, planar map, polyhedron, smallest enclosing sphere, and multidimensional query structures. - Interfaces to other packages, e.g. for visualisation, and I/O, and other support facilities. For further information and for downloading the library and documentation, please visit the CGAL web page: http://www.cs.uu.nl/CGAL/ Should you have any questions or comments, please send a message to cgal@cs.uu.nl -------------------------------------------------------------------- Remco Veltkamp | email: Remco.Veltkamp@cs.uu.nl | phone: +31-30-2534091 Dept. Computing Science | fax: +31-30-2513791 Utrecht University | Padualaan 14 | P.O. Box 80089 3584 CH Utrecht | 3508 TB Utrecht The Netherlands | The Netherlands -------------------------------------------------------------------- ------------- 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 From compgeom-owner@research.bell-labs.com Mon Aug 3 02:11:52 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id CAA14062 for ; Mon, 3 Aug 1998 02:11:51 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-9-27.research.bell-labs.com [135.104.9.27]) by post.tau.ac.il (8.8.8/8.8.4) with SMTP id CAA03402 for ; Mon, 3 Aug 1998 02:10:10 +0300 (IDT) Received: from research.research.bell-labs.com by netlib2; Thu Jul 30 10:21:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Jul 30 10:20:17 EDT 1998 Received: from snow.cs.dartmouth.edu ([129.170.212.127]) by dusty; Thu Jul 30 10:20:14 EDT 1998 Received: by snow.cs.dartmouth.edu (8.8.8/4.2) id KAA14133; Thu, 30 Jul 1998 10:19:37 -0400 (EDT) Date: Thu, 30 Jul 1998 10:19:37 -0400 (EDT) Message-Id: <199807301419.KAA14133@snow.cs.dartmouth.edu> From: Bruce Randall Donald To: compgeom-announce@research.bell-labs.com Subject: Research Associate Job at Dartmouth X-aleph-stage: Copernican Haifa tarpon. Reply-To: brd@CS.Dartmouth.EDU (Bruce Randall Donald) Precedence: bulk Status: RO Dartmouth Department of Computer Science Postdoctoral Research Associate in Computer Science: We are looking for someone with a doctorate in computer science to conduct focused research on computational (structural) biology and computer-aided drug design. The position involves a two-year appointment which may be extended depending on funding. The research is concerned with geometric algorithms and systems for drug design and for the automated interpretation of protein NMR data. For more information on this position see http://www.cs.dartmouth.edu/~brd/job.html#CompBio. Applicants should send a resume and have at three referees send letters of recommendation to Prof. Bruce Randall Donald, Dept. of Computer Science, Dartmouth, 6211 Sudikoff Laboratory, Hanover, NH 03755-3510, brd@cs.dartmouth.edu, http://www.cs.dartmouth.edu/~brd/. Electronic submissions (ascii text only, no enclosures please) are encouraged. Review of applications will begin immediately, and continue until this position is filled. Dartmouth is an Equal Opportunity Affirmative Action employer. ------------- 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 From compgeom-owner@research.bell-labs.com Tue Aug 11 00:34:02 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA13717 for ; Tue, 11 Aug 1998 00:34:01 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-9-27.research.bell-labs.com [135.104.9.27]) by post.tau.ac.il (8.9.1/8.9.1) with SMTP id AAA20132 for ; Tue, 11 Aug 1998 00:33:55 +0300 (IDT) Received: from research.research.bell-labs.com by netlib2; Tue Aug 4 00:57:01 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Aug 4 00:55:24 EDT 1998 Received: from jupiter.kaist.ac.kr ([143.248.174.81]) by dusty; Tue Aug 4 00:55:19 EDT 1998 Received: (from isaac98@localhost) by jupiter.kaist.ac.kr (8.8.8Ha/8.8.8-NOSPAM) id NAA15016 for compgeom-announce@research.bell-labs.com; Tue, 4 Aug 1998 13:55:06 +0900 (KST) Message-ID: <19980804135506.A15012@jupiter.kaist.ac.kr> Date: Tue, 4 Aug 1998 13:55:06 +0900 From: "ISAAC '98" To: compgeom-announce@research.bell-labs.com Subject: [ISAAC'98] Accepted Papers Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Mailer: Mutt 0.93.2i Precedence: bulk Status: RO Below is a list of paper accepted to ISAAC'98 to be held in Taejon, Korea on December 14-16, 1998. More information can be obtained from the conference web site: http://tclab.kaist.ac.kr/~isaac98/ *************************************************************************** On-Line Scheduling of Parallel Jobs with Runtime Restrictions --- Stefan Bischof and Ernst W. Mayr Approximation algorithms for some optimum communication spanning tree problems --- Bang Ye Wu, Kun-Mao Chao, and Chuan Yi Tang Approximation and Exact Algorithms for {RNA} Secondary Structure Prediction and Recognition of Stochastic Context-free Languages --- Tatsuya Akutsu An optimal algorithm for on-line palletizing at delivery industry --- J. Rethmann and E. Wanke Generalized Self-Approaching Curves --- Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, and Guenter Rote A New Approach for Speeding Up Enumeration Algorithms --- Takeaki Uno Two New Families of List Update Algorithms --- Frank Schulz Two-Layer Planarization in Graph Drawing --- Petra Mutzel and Ren'e Weiskircher Randomized $O( log log n)$-Round Leader Election Protocols in Packet Radio Networks --- Koji Nakano and Stephan Olariu Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image --- Tetsuo Asano, Hiro Ito, Souichi Kimura, and Nariaki Shimazu Convertibility among Grid Filling Curves --- Tetsuo Asano, Naoki Katoh, Hisao Tamaki, and Takeshi Tokuyama Selecting the k Largest Elements with Parity Tests --- T.W. Lam and H.F. Ting Disjunctions of Horn Theories and their Cores --- Thomas Eiter, Toshihide Ibaraki, and Kazuhisa Makino Optimality and Integer Programming Formulations of Triangulations in General Dimension --- Akira Tajima Computing Orthogonal Drawings in a Variable Embedding Setting --- W. Didimo and G. Liotta Inapproximability results for guarding polygons without holes --- Stephan Eidenbenz Polyhedral Structure in Submodular and Posi-modular Systems --- Hiroshi Nagamochi and Toshihide Ibaraki The Edge-Disjoint Paths Problem is NP-Complete for Partial $k$-Trees --- Xiao Zhou and Takao Nishizeki Checking Programs Discretely: Demonstrating Result-Correctness Efficiently While Concealing It --- G.D. Crescenzo, K. Sakurai, , and M. Yung Dynamic Grid Embedding with Few Bends and Changes --- Ulrik Brandes and Dorothea Wagner Maximizing the Number of Connections in Optical Tree Networks --- Thomas Erlebach and Klaus Jansen A parallel algorithm for sampling matchings from an almost uniform distribution --- J. Diaz, J. Petit, P. Psycharis, and M. Serna Randomized $k$-Dimensional Binary Search Trees --- Amalia Duch, Vladimir Estivill-Castro, and Conrado Martinez On the inapproximability of non NP-hard optimization problems --- Liming Cai, David Juedes, , and Iyad Kanj Quadtree Decomposition, Steiner Triangulation, and Ray shooting --- Siu-Wing Cheng and Kam-Hing Lee Casting with Skewed Ejection Direction --- Hee kap Ahn, Siu-Wing Cheng, and Otfried Cheong An Efficient NC Algorithm for a Sparse $k$-Edge-Connectivity Certificate --- Hiroshi Nagamochi and Toru Hasunuma Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs --- Yaw-Ling Lin Space-efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs --- Philip N. Klein and Hsueh-I Lu On the Multiple Gene Duplication Problem --- Michael Fellows, Michael Hallett, and Ulrike Stege $L_\infty$ Voronoi Diagrams and Applications to VLSI Layout and Manufacturing --- Evanthia Papadopoulou Characterization of Efficiently Computable Problems on Distance-Hereditary Graphs --- Sun yuan Hsieh, Chin wen Ho, Tsan sheng Hsu, Ming tat Ko, and Gen-Huey Chen An Algorithm for Finding Geometric Automorphisms in Planar Graphs --- Seok-Hee Hong, Peter Eades, and Sang-Ho Lee Facility Location on Terrains --- Boris Aronov, Marc van Kreveld, Ren'e van Oostrum, and Kasturirangan Varadarajan A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem --- Takashi Mihara and Shao-Chin Sung Optimal Approximate Agreement with Omission Faults --- Richard Plunkett and Alan Fekete $k$-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph --- Toshimasa Ishii, Hiroshi Nagamochi, and Toshihide Ibaraki The Steiner tree problem in $\lambda_4$-geometry plane --- Guo-Hui Lin and Guoliang Xue Generalized Graph Colorability and Compressibility of Boolean Formulae --- Richard Nock, Pascal Jappy, and Jean Sallantin A Capacitated Vehicle Routing Problem on a Tree --- Shin ya Hamaguchi and Naoki Katoh Visibility Queries in Simple Polygons and Applications --- Boris Aronov, Leonidas J. Guibas, Marek Teichmann, and Li Zhang Hamiltonian decomposition of recursive circulants --- Jung-Heum Park On the Complexity of Free Monoid Morphisms --- Klaus-Joern Lange and Pierre McKenzie Testing the quality of manufactured disks and cylinders --- Prosenjit Bose and Pat Morin Random Regular Graphs with Edge Faults Expansion through Cores --- Andreas Goerdt Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles --- Joonsoo Choi, Chan-Su Shin, and Sung Kwon Kim Maximizing Agreement with a Classification by Bounded or Unbounded Number of Words --- Hiroki Arimura and Shinichi Shimozono ------------- 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 From compgeom-owner@research.bell-labs.com Tue Aug 11 00:40:26 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA13940 for ; Tue, 11 Aug 1998 00:40:25 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-9-27.research.bell-labs.com [135.104.9.27]) by post.tau.ac.il (8.9.1/8.9.1) with SMTP id AAA20573 for ; Tue, 11 Aug 1998 00:40:29 +0300 (IDT) Received: from research.research.bell-labs.com by netlib2; Wed Aug 5 16:41:16 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Aug 5 16:39:28 EDT 1998 Received: from augustus-239.cs.umn.edu ([160.94.27.171]) by dusty; Wed Aug 5 16:39:23 EDT 1998 Received: from cosmos.cs.umn.edu (janardan@cosmos.cs.umn.edu [128.101.228.58]) by augustus-239.cs.umn.edu (8.8.5/8.8.5) with ESMTP id PAA15056; Wed, 5 Aug 1998 15:32:09 -0500 (CDT) From: Ravi Janardan Received: (from janardan@localhost) by cosmos.cs.umn.edu (8.8.3/8.8.0) id UAA08864; Wed, 5 Aug 1998 20:32:08 GMT Message-Id: <199808052032.UAA08864@cosmos.cs.umn.edu> Subject: SCG '98: Pictures etc. To: compgeom-announce@research.bell-labs.com Date: Wed, 5 Aug 1998 15:32:08 -0500 (CDT) Cc: clarkson@research.bell-labs.com (Ken Clarkson), janardan@mail.cs.umn.edu (Ravi Janardan) X-Mailer: ELM [version 2.4ME+ PL32 (25)] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO A set of pictures taken at the 1998 ACM Symp. on Computational Geometry, in Minneapolis, can now be accessed by following links from the Symposium web page (http://www.cs.umn.edu/scg98). Also available there are previously-distributed items such as minutes of the Business meeting and problems presented in the Open Problems session. Ravi Janardan ------------- 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 From compgeom-owner@research.bell-labs.com Tue Aug 11 00:44:07 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA14116 for ; Tue, 11 Aug 1998 00:44:06 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com (H-135-104-9-27.research.bell-labs.com [135.104.9.27]) by post.tau.ac.il (8.9.1/8.9.1) with SMTP id AAA20782 for ; Tue, 11 Aug 1998 00:43:30 +0300 (IDT) Received: from research.research.bell-labs.com by netlib2; Thu Aug 6 16:33:03 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Aug 6 16:31:53 EDT 1998 Received: from cs.brown.edu ([128.148.32.2]) by dusty; Thu Aug 6 16:31:51 EDT 1998 Received: from cs.brown.edu (dumba.cs.brown.edu [128.148.38.23]) by cs.brown.edu (8.8.5/8.7.1) with ESMTP id QAA03268; Thu, 6 Aug 1998 16:31:52 -0400 (EDT) Sender: rt@cs.brown.edu Message-ID: <35CA12B7.641562E9@cs.brown.edu> Date: Thu, 06 Aug 1998 16:31:51 -0400 From: Roberto Tamassia Organization: Brown University X-Mailer: Mozilla 4.04 [en] (X11; U; SunOS 5.6 sun4u) MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: Call for Papers: 3rd CGC Workshop on Computational Geometry Content-Type: multipart/mixed; boundary="------------0BCBA57B28722BFDABDFE9FC" Precedence: bulk Status: RO This is a multi-part message in MIME format. --------------0BCBA57B28722BFDABDFE9FC Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit --------------0BCBA57B28722BFDABDFE9FC Content-Type: text/plain; charset=us-ascii; name="cgc98.txt" Content-Transfer-Encoding: 7bit Content-Disposition: inline; filename="cgc98.txt" 3rd CGC Workshop on Computational Geometry October 11-12, 1998 Brown University, Providence, RI Sponsored by The Center for Geometric Computing and The Department of Computer Science, Brown University We are pleased to announce the third annual fall Workshop on Computational Geometry, sponsored by the Center for Geometric Computing, continuing a tradition established by the Mathematical Sciences Institute at SUNY-Stony Brook. The Center for Geometric Computing is a collaborative center of Brown, Duke, and Johns Hopkins Universities, and is funded by the U.S. Army Research Office. Scope and Format ---------------- The aim of this workshop is to bring together researchers from academia, industry, and the Army to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to * Algorithmic methods in geometry * Experimental studies * I/O-scalable geometric algorithms * Geometric data structures * Animation of geometric algorithms * Implementation issues * Computer graphics * Robustness * Solid modeling * Computer vision * Geographic information systems * Robotics * Computational metrology * Computer-aided design * Graph drawing * Mesh generation Following the tradition of the previous MSI and CGC Workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. Registration will be on-site, and will include the abstract booklet, coffee breaks, lunches, and a reception. There will be a nominal registration fee of $35. Invited speakers ---------------- * Jadgish Chandra (U.S. Army Research Laboratory) * John Hughes (Brown University) * Joe Marks (Mitsubishi Electrical Research Laboratories) * Chee Yap (New York University) Submissions ----------- Authors are invited to submit abstracts for talks to be given at the workshop. Please send an abstract (up to 2 pages) and a draft of a paper (if you have one). E-mail submissions are encouraged; send to cgc@cs.brown.edu. Ideally, the abstract should be a PDF, PostScript, or LaTeX, file, for ease in assembling the abstract booklet. Abstracts can also be sent by regular mail to Roberto Tamassia Department of Computer Science Brown University 115 Waterman Street Providence, RI 02912-1910 Submissions should arrive by September 10, 1998. Authors will be notified of acceptance by September 18, 1997. A booklet of abstracts will be distributed at the workshop and made available electronically on the Web. There will be no formal proceedings for this workshop, but selected papers will be invited to a special issue of the journal "Computational Geometry: Theory and Applications" (edited by Michael T. Goodrich). Program Committee ----------------- * Pankaj K. Agarwal * Joseph S. B. Mitchell * Lars Arge * Franco P. Preparata * Michael T. Goodrich * Roberto Tamassia * S. Rao Kosaraju * Jeffrey S. Vitter Local Arrangements ------------------ * Mary Andrade (maa@cs.brown.edu) * Stina Bridgeman (ssb@cs.brown.edu) * Vasiliki Chatzi (vc@cs.brown.edu) For more information about the workshop, send mail to cgc@cs.brown.edu. Further information will be posted to our web site (http://www.cs.brown.edu/cgc/cgc98/) as soon as it is available. --------------0BCBA57B28722BFDABDFE9FC-- ------------- 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 From compgeom-owner@research.bell-labs.com Tue Aug 11 00:44:34 1998 Return-Path: Received: from netlib2.cs.bell-labs.com (H-135-104-9-27.research.bell-labs.com [135.104.9.27]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id AAA14150 for ; Tue, 11 Aug 1998 00:44:29 +0300 (GMT+0300) Received: from research.research.bell-labs.com by netlib2; Thu Aug 6 11:51:05 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Aug 6 11:50:00 EDT 1998 Received: from ares.cs.siena.edu ([204.168.126.36]) by dusty; Thu Aug 6 11:50:00 EDT 1998 Received: by ares.cs.siena.edu; id AA23516; Thu, 6 Aug 1998 11:50:14 -0400 Date: Thu, 6 Aug 1998 11:50:14 -0400 From: Robin Flatland Message-Id: <9808061550.AA23516@ares.cs.siena.edu> To: compgeom-discuss@research.bell-labs.com Subject: reconstructing closed curves from curve fragments Precedence: bulk Status: RO Hi all, I was wondering if anyone knew of work related to the following problem: The input is a set of piece-wise linear curves in the plane. These curves are fragments from the boundaries of some unknown regions. The output needed is a collection of closed, piece-wise linear curves of which the input curves are a subset. These closed curves should somehow capture the shape of the region boundaries. I'm aware of work on reconstructing curves from point data (such as the crust), but hadn't seen anything that considered starting from curve fragments. Thanks, Robin Flatland ********************************************************* Dr. Robin Flatland Computer Science Dept Consultant to GE-CR&D Siena College Image Understanding Group 515 Loudon Road 1400 Balltown Road Loudonville, NY 12211 Schenectady, NY 12301 (518) 782-6541 (518) 393-7379 ******************************************************** ------------- 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 From compgeom-owner@research.bell-labs.com Tue Aug 11 00:45:04 1998 Return-Path: Received: from netlib2.cs.bell-labs.com (H-135-104-9-27.research.bell-labs.com [135.104.9.27]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id AAA14175 for ; Tue, 11 Aug 1998 00:44:59 +0300 (GMT+0300) Received: from research.research.bell-labs.com by netlib2; Fri Aug 7 16:45:06 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Aug 7 16:43:59 EDT 1998 Received: from inf.ethz.ch ([129.132.10.10]) by dusty; Fri Aug 7 16:43:59 EDT 1998 Received: from yaya (yaya.inf.ethz.ch [129.132.11.138]) by inf.ethz.ch (8.8.8/8.8.8) with ESMTP id WAA08061 for ; Fri, 7 Aug 1998 22:43:56 +0200 (MET DST) Received: (will@localhost) by yaya (950413.SGI.8.6.12/8.6.9) id WAA00786 for compgeom-discuss@research.bell-labs.com; Fri, 7 Aug 1998 22:43:55 +0200 From: "Martin Will" Message-Id: <9808072243.ZM785@yaya> Date: Fri, 7 Aug 1998 22:43:54 -0700 X-Mailer: Z-Mail (3.2.3 08feb96 MediaMail) To: compgeom-discuss@research.bell-labs.com Subject: Additively weighted Voronoi diagrams Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Precedence: bulk Status: RO Dear all, I am currently preparing a comparison of algorithms for computing 3-D additively weighted Voronoi (aka Johnson-Mehl) diagrams. However, I could not find an actual implementation of F. Aurenhammer's reduction to 4-D power diagrams, as described e.g. in the textbook by Boissonnat & Yvinec. On request, F. Aurenhammer told me that he could remind some Japanese group working on an implementation. Unfortunately, he wasn't able to recall any more details. I would be very grateful to any hint or reference to either this group or any other person who has worked on this subject. Thank you very much. Hans-Martin Will --------------------------------------------------------------------------- Hans-Martin Will email: will@inf.ethz.ch ETH Zuerich phone: +41-1-632 7335 Institut fuer Theoretische Informatik fax: +41-1-632 1172 CH-8092 Zuerich Switzerland ------------- 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 From compgeom-owner@research.bell-labs.com Thu Sep 3 04:06:43 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id EAA06645; Thu, 3 Sep 1998 04:06:30 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Sep 2 21:04:06 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Tue Sep 1 16:45:01 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Sep 1 16:43:51 EDT 1998 Received: from ams.sunysb.edu ([129.49.6.2]) by dusty; Tue Sep 1 16:43:48 EDT 1998 Received: from polya (polya.ams.sunysb.edu) by amirani (4.1/25-eef) id AA01499; Tue, 1 Sep 98 16:43:45 EDT From: jsbm@ams.sunysb.edu (Joseph Mitchell) Received: (jsbm@localhost) by polya (SMI-8.6/8.6.9) id QAA02115 for compgeom-announce@research.bell-labs.com; Tue, 1 Sep 1998 16:43:43 -0400 Date: Tue, 1 Sep 1998 16:43:43 -0400 Message-Id: <199809012043.QAA02115@polya> Subject: CfP SM'99 (second call) To: compgeom-announce@research.bell-labs.com Mime-Version: 1.0 Precedence: bulk Status: RO Content-Length: 5762 Lines: 162 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ This is a reminder that the deadline for submissions to Solid Modeling '99 is approaching. Abstracts are due September 30, and full papers October 30. An updated version of the Call for Papers is appended. Wim Bronsvoort David Anderson Program Co-Chairs ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ********************* * CALL FOR PAPERS * ********************* ***************************************** * * * SOLID MODELING '99 * * * * FIFTH ACM SYMPOSIUM ON * * SOLID MODELING AND APPLICATIONS * * * ***************************************** Sheraton Inn, Ann Arbor, Michigan, June 9-11, 1999 Sponsored by ACM SIGGRAPH This symposium provides an international forum for the exchange of recent research and practical results in all areas and applications of solid modeling. Emphasis is on solid modeling in design, analysis and manufacturing. Previous symposia in this series (Austin, Texas, 1991, Montreal, Canada, 1993, Salt Lake City, Utah, 1995, and Atlanta, Georgia, 1997) brought together the most prominent researchers, key practitioners, and numerous students in the field. In 1999, the symposium will have several new features, including: * tutorials on June 8 * panel sessions * ACIS Best Paper Award, sponsored by Spatial Technology Inc. * sponsorship by ONR of undergraduate students to attend the symposium. More information on the symposium, as it becomes available, can be found on the Solid Modeling '99 WWW page at: http://www.engin.umich.edu/dept/meam/deslab/cadcam/ACMSM/ If you do not have access to the WWW, you can request a copy of this page by sending an email to dutta@engin.umich.edu. The schedule for submission of papers is as follows: September 30, 1998: Abstracts due October 30, 1998: Full papers due January 31, 1999: Notice of acceptance and reviewers' comments February 28, 1999: Final camera-ready papers and extended abstracts due For details on how to submit abstracts and papers, please consult the WWW page. Abstracts are used to facilitate the review process, and should be 150-300 words long. Papers should be at most 12 normally typeset pages, including figures and references, and should present previously unpublished original results. Papers will be peer-reviewed and can be selected for presentation at a plenary session with publication in the conference proceedings published by ACM Press, or presentation at a poster session with publication of an extended two-page abstract in the conference proceedings. A revised version of a number of selected papers will also be published in a special issue of the journal Computer-Aided Design. The ACIS Best Paper Award of $1500, sponsored by Spatial Technology Inc., will be awarded by a jury. Video and other special equipment will be available for presentations when requested. Topics for papers include, but are not limited to: 1) Geometric and topological representations 2) Multiresolution models 3) Heterogeneous models 4) Geometric interrogations and reasoning 5) Computational geometry relevant to modeling 6) Robustness of geometric computations 7) Blends, sweeps, offsets, deformations and other constructional methods 8) Procedural, constraint-based and parametric modeling 9) Modeling families of geometric objects 10) Feature-based modeling 11) Conceptual design techniques 12) Product modeling 13) Assembly modeling 14) Representation conversion 15) Product data exchange 16) User interaction techniques 17) Collaborative/distributed design 18) Virtual environments and prototypes 19) Reverse engineering 20) Engineering analysis, including FE mesh generation 21) Engineering tolerances 22) Manufacturing and assembly planning 23) Computational support for new manufacturing technologies General Chair ------------- Deba Dutta, University of Michigan Financial Chair --------------- Ming Lin, University of North Carolina Tutorials Chair --------------- Jan Vandenbrande, Boeing Program Co-Chairs ----------------- Wim Bronsvoort, Delft University of Technology David Anderson, Purdue University Program Committee ----------------- Adrian Bowyer, University of Bath Beat Bruderlin, Technical University of Ilmenau Pere Brunet, Polytechnic University of Catalonia Richard Crawford, University of Texas Gershon Elber, Technion Bianca Falcidieno, CNR Italy Mark Henderson, Arizona State University Chris Hoffmann, Purdue University Fumihiko Kimura, University of Tokyo R\"udiger Klein, Daimler Benz Kunwoo Lee, Seoul National University Remi Lequette, ILOG Dinesh Manocha, University of North Carolina Martti M\"antyl\"a, Helsinki University of Technology Jai Menon, IBM Research Jim Miller, University of Kansas Joseph Mitchell, SUNY Stony Brook Nick Patrikalakis, MIT Mike Pratt, Rensselaer/NIST Ari Rappoport, Hebrew University Jarek Rossignac, Georgia Institute of Technology Vadim Shapiro, University of Wisconsin-Madison George Turkiyyah, University of Washington Tamas Varady, Hungarian Academy of Sciences Kevin Weiler, Silicon Graphics John Woodwark, Information Geometers ------------- 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 From compgeom-owner@research.bell-labs.com Thu Sep 3 04:07:31 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id EAA06825; Thu, 3 Sep 1998 04:07:22 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Sep 2 21:04:45 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Wed Sep 2 16:23:07 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Sep 2 16:21:34 EDT 1998 Received: from brooklyn.bug.com ([198.74.12.17]) by dusty; Wed Sep 2 16:21:32 EDT 1998 Received: from bug.bug.com by brooklyn.bug.com (AIX 3.2/UCB 5.64/4.03) id AA30222; Wed, 2 Sep 1998 16:29:12 -0400 Received: from smtpgate1.bug.com by mac-risc.isg.bug.com (AIX 3.2/UCB 5.64/4.03) id AA28174; Wed, 2 Sep 1998 16:23:12 -0400 Date: Tue, 01 Sep 1998 9:18 -0500 From: cmonteir@bug.com To: compgeom-discuss@research.bell-labs.com, will@inf.ethz.ch Subject: Convex hulls Message-Id: <1998090216211722-a4ab098@bug.com> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Precedence: bulk Status: RO Content-Length: 497 Lines: 15 I'm relatively new to the field and therefore have a simple question which I would very much appreciate some assistance with. I'm trying to locate pseudo-code for an algorithm that would determine the convex hull of a set of points. Thanks in advance. Charles ------------- 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 From compgeom-owner@research.bell-labs.com Fri Sep 4 03:38:40 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id DAA18099; Fri, 4 Sep 1998 03:38:28 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Sep 3 20:36:29 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Thu Sep 3 03:27:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Sep 3 03:25:06 EDT 1998 Received: from mail.cs.uu.nl ([131.211.80.32]) by dusty; Thu Sep 3 03:25:04 EDT 1998 Received: from luffeld (luffeld.cs.uu.nl 131.211.80.92) by mail.cs.uu.nl (VMailer) via SMTP id 2F71559AD5; Thu, 3 Sep 1998 09:25:04 +0200 (MET DST) Sender: marc@cs.uu.nl Message-ID: <35EE444F.4A7B@cs.ruu.nl> Date: Thu, 03 Sep 1998 09:25:04 +0200 From: Marc van Kreveld Organization: Universiteit Utrecht, Dept. of Computer Science X-Mailer: Mozilla 3.01Gold (X11; I; IRIX 5.3 IP22) MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: CFP: special issue Algorithmica - geographical information Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 1950 Lines: 59 Call for Papers Special Issue of Algorithmica: -- Algorithms for Geographical Information -- Submission deadline: December 21, 1998 Expected publication: Early 2000 Guest editor: Marc van Kreveld Algorithmica is planning a special issue on algorithms for geographical information. Papers describing original research are solicited that deal with algorithmic issues for handling geographic information. Survey and state-of-the-art papers will also be considered; in that case, please contact the guest editor as soon as possible with the intended contents to avoid conflicts. Topics of interest include, but are not limited to, algorithmic issues in: * map overlay * map generalization * label placement * terrain models * spatial interpolation * geostatistics * spatio-temporal data * error handling and uncertainty * feature extraction * visualization, animation, and simulation * network analysis * mathematical modeling of geographic problems * optimization, parallel, distributed, geometric, graph, and evolutionary algorithms applied to geographical data Papers that extend well-known algorithms in nontrivial ways in order to be relevant to geographic data handling are also solicited. Every paper should explicitly address its relevance to geographical data handling. Theoretical and/or experimental analysis is encouraged. Manuscripts should be prepared according to the standard submission guidelines of Algorithmica. All submissions will be subject to the regular refereeing process of the journal. Submit five copies of a full paper to the guest editor (address below) by December 21, 1998. Marc van Kreveld Dept. of Computer Science Utrecht University P.O.Box 80.089 3508 TB Utrecht The Netherlands E-mail: marc@cs.uu.nl ------------- 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 From compgeom-owner@research.bell-labs.com Fri Sep 4 03:41:20 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id DAA18205; Fri, 4 Sep 1998 03:41:10 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Sep 3 20:38:07 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Thu Sep 3 08:41:04 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Sep 3 08:39:08 EDT 1998 Received: from smtp3.ny.us.ibm.com ([198.133.22.42]) by dusty; Thu Sep 3 08:39:07 EDT 1998 Received: from relay1.server.ibm.com (relay1.server.ibm.com [9.14.2.98]) by smtp3.ny.us.ibm.com (8.8.7/8.8.7) with ESMTP id IAA44184 for ; Thu, 3 Sep 1998 08:24:01 -0400 From: taubin@us.ibm.com Received: from us.ibm.com (d51mta01.pok.ibm.com [9.117.30.75]) by relay1.server.ibm.com (8.8.7/8.8.7) with SMTP id IAA42278 for ; Thu, 3 Sep 1998 08:36:05 -0400 Received: by us.ibm.com(Lotus SMTP MTA v4.6.1 (569.2 2-6-1998)) id 85256674.0044E838 ; Thu, 3 Sep 1998 08:32:38 -0400 X-Lotus-FromDomain: IBMUS To: compgeom-announce@research.bell-labs.com Message-ID: <85256674.0044D6DA.00@us.ibm.com> Date: Thu, 3 Sep 1998 08:38:21 -0400 Subject: Workshop on Progressive Transmission of Geometry Mime-Version: 1.0 Content-type: text/plain; charset=us-ascii Content-Disposition: inline Precedence: bulk Status: RO Content-Length: 3413 Lines: 90 --------------------------------------------------------------------------- ----- Workshop on Multi-Resolution Representation of 3D Geometry for Progressive Transmission --------------------------------------------------------------------------- ----- To be held prior to IEEE Visualization'98, on Saturday, October 17th, 1998 1-5 pm. Workshop Organizers: Andre Gueziec IBM T.J. Watson Research Center gueziec@watson.ibm.com Gabriel Taubin IBM T.J. Watson Research Center taubin@watson.ibm.com --------------------------------------------------------------------------- ----- Workshop description: --------------------------------------------------------------------------- ----- There has been recently considerable interest in methods for progressively delivering 3D surface geometry across a network or to a display terminal. A few techniques have been proposed in the past few years, which can be broadly classified as methods based on polygonal surfaces or wavelets. It is a particularly good time to discuss these issues now, because of the current interest in visualization of large surface datasets, e.g. geographic data sets. Also, there is considerable activity in the standardization of such techniques, for instance in VRML and MPEG. The purpose of this workshop is to bring together experts involved in approaches using polygonal surfaces as well as approaches using wavelets for visualization problems involving geometric data where the issue of progressive transmission or display is important. We will attempt to answer the questions listed below, as well as other questions that the participants feel important to address: - What is the relation between wavelet-based approaches and polygonal surface based approaches for progressive transmission of 3D geometry? Are they fundamentally the same? Is one approach superior to the other? - How can progressive transmission and view-dependent refinement of 3D geometry work together best? - How do current methods handle singular (non-manifold) input geometry? - Is it important to change the topology during progressive transmission? - How to cope with lost packets during transmission (assuming a protocol allowing that is used)? How to adapt the resolution/bitrate to the transmission bandwidth. We are planning to write a report on this workshop and publish it in a prominent journal or magazine. We may also decide to publish the proceedings. --------------------------------------------------------------------------- ----- If you wish to participate --------------------------------------------------------------------------- ----- "Viz" requires that we limit participation to 20 people. As the workshop is scheduled to last 4 hours, we will do half talks and half discussion. We would like interested people to submit a 2 page abstract if they want to give a talk, or 2 page statement if they want to participate to the discussions without giving a talk. If you wish to participate, please send your submission to gueziec@watson.ibm.com, either in postscript or pdf form. Feel free to send us e-mail for any further inquiry. --------------------------------------------------------------------------- ----- ------------- 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 From compgeom-owner@research.bell-labs.com Tue Sep 8 20:36:44 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id VAA24668; Tue, 8 Sep 1998 21:36:37 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Sep 8 14:35:07 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Mon Sep 7 16:37:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Sep 7 16:36:16 EDT 1998 Received: from cs.brown.edu ([128.148.32.2]) by dusty; Mon Sep 7 16:36:14 EDT 1998 Received: from cs.brown.edu (loki.cs.brown.edu [128.148.38.50]) by cs.brown.edu (8.8.5/8.7.1) with ESMTP id QAA01803; Mon, 7 Sep 1998 16:35:42 -0400 (EDT) Sender: map@cs.brown.edu Message-ID: <35F4439E.BBA63F4D@cs.brown.edu> Date: Mon, 07 Sep 1998 16:35:42 -0400 From: Maurizio Pizzonia Organization: Brown University X-Mailer: Mozilla 4.05 [en] (X11; I; SunOS 5.6 sun4u) MIME-Version: 1.0 To: pizzonia@dia.uniroma3.it, compgeom-announce@research.bell-labs.com Subject: GDToolkit 2.0 - new release Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 1595 Lines: 45 We are very happy to announce release 2.0 of GDToolkit, an object-oriented library for handling and drawing graphs. Main improvements to release 1.0 are: Dual-graph generation Planarizer supporting constraints Extension of min-cost flow with lower bounds Batch layout generator (BLAG) Refinement of the end-user graph-editing tool (GRID) Constraints management No crosses on the specified edge No bends / any number of bends on the specified edge Only right / only left bends along the specified edge Specified set of nodes on the same face Specified ordered set of nodes on the same face Quasi-upward drawings Slow upward layout generator (minimum number of bends over all the planar embeddings) Slow compactor (based on a min-cost-flow technique) Orthogonal drawings Slow compactor (based on a min-cost-flow technique) Compaction-refinement heuristic Extension of orthogonal algorithms for nodes with arbitrary degree For further information and for downloading the library and documentation, please visit the GDToolkit web page: http://www.dia.uniroma3.it/~gdt/ Maurizio Pizzonia ------------- 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 From compgeom-owner@research.bell-labs.com Tue Sep 8 20:38:09 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id VAA24728; Tue, 8 Sep 1998 21:38:04 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Sep 8 14:36:15 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Tue Sep 8 12:39:05 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Sep 8 12:38:38 EDT 1998 Received: from cs.Technion.AC.IL ([132.68.32.1]) by dusty; Tue Sep 8 12:38:36 EDT 1998 Received: from csd.csa (csd [132.68.32.8]) by cs.Technion.AC.IL (8.9.0/8.9.0) with SMTP id SAA16369 for ; Tue, 8 Sep 1998 18:38:38 +0200 (IST) Received: from cs.technion.ac.il by csd.csa (SMI-8.6/SMI-SVR4) id SAA28095; Tue, 8 Sep 1998 18:38:31 +0200 Message-ID: <35F56B2A.73F781C6@cs.technion.ac.il> Date: Tue, 08 Sep 1998 19:36:42 +0200 From: Igor Dozorets X-Mailer: Mozilla 4.03 [en] (WinNT; I) MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com Subject: The Nearest Neighbor problem. References: <199809081616.TAA21219@csc.csa> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 680 Lines: 27 Hi everybody ! My name is Igor, I make a M.Sc. in the Israel Institute of Technology. I need to study the basics (as well as the recent achievements) in the field of the Nearest Neighbor problem for my current research (Speaker recognition). The problem is that I'm a newcomer in Computational Geometry. Can anybody suggest something to read to get familiar (quickly) with the basics of Computational Geometry in order to be able to surf the NN topic later ? Thank you. ------------- 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 From compgeom-owner@research.bell-labs.com Tue Sep 8 20:41:54 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id VAA24861; Tue, 8 Sep 1998 21:40:56 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Sep 8 14:38:42 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Tue Sep 8 11:43:01 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Sep 8 11:42:15 EDT 1998 Received: from cs.brown.edu ([128.148.32.2]) by dusty; Tue Sep 8 11:42:12 EDT 1998 Received: from cs.brown.edu (dumba.cs.brown.edu [128.148.38.23]) by cs.brown.edu (8.8.5/8.7.1) with ESMTP id LAA29688; Tue, 8 Sep 1998 11:42:12 -0400 (EDT) Sender: rt@cs.brown.edu Message-ID: <35F55054.5E480CA@cs.brown.edu> Date: Tue, 08 Sep 1998 11:42:12 -0400 From: Roberto Tamassia Organization: Brown University X-Mailer: Mozilla 4.04 [en] (X11; U; SunOS 5.6 sun4u) MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: CFP: 3rd CGC Workshop on Computational Geometry [deadline Sept 10] Content-Type: multipart/mixed; boundary="------------B8810776CF4FCAA3FBDFAC24" Precedence: bulk Status: RO Content-Length: 5886 Lines: 168 This is a multi-part message in MIME format. --------------B8810776CF4FCAA3FBDFAC24 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit --------------B8810776CF4FCAA3FBDFAC24 Content-Type: text/plain; charset=us-ascii; name="home.txt" Content-Transfer-Encoding: 7bit Content-Disposition: inline; filename="home.txt" 3rd CGC Workshop on Computational Geometry October 11-12, 1998 Brown University, Providence, RI Sponsored by The Center for Geometric Computing and The Department of Computer Science, Brown University We are pleased to announce the third annual fall Workshop on Computational Geometry, sponsored by the Center for Geometric Computing, continuing a tradition established by the Mathematical Sciences Institute at SUNY-Stony Brook. The Center for Geometric Computing is a collaborative center of Brown, Duke, and Johns Hopkins Universities, and is funded by the U.S. Army Research Office. NEW! * registration information * hotel information * local information available at the web site (http://www.cs.brown.edu/cgc/cgc98/) Scope and Format ---------------- The aim of this workshop is to bring together researchers from academia, industry, and the Army to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to * Algorithmic methods in geometry * Experimental studies * I/O-scalable geometric algorithms * Geometric data structures * Animation of geometric algorithms * Implementation issues * Computer graphics * Robustness * Solid modeling * Computer vision * Geographic information systems * Robotics * Computational metrology * Computer-aided design * Graph drawing * Mesh generation Following the tradition of the previous MSI and CGC Workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. Registration ------------ Registration will be on-site, but please send mail to cgc@cs.brown.edu by September 18 to indicate if you are coming. There will be a nominal registration fee of $35, which includes the abstract booklet, coffee breaks, lunches, and a reception. Credit cards cannot be accepted. Invited speakers ---------------- * Jadgish Chandra (U.S. Army Research Laboratory) * John Hughes (Brown University) * Joe Marks (Mitsubishi Electrical Research Laboratories) * Chee Yap (New York University) Submissions ----------- Authors are invited to submit abstracts for talks to be given at the workshop. Please send an abstract (up to 2 pages) and a draft of a paper (if you have one). E-mail submissions are encouraged; send to cgc@cs.brown.edu. Ideally, the abstract should be a PDF, PostScript, or LaTeX, file, for ease in assembling the abstract booklet. Abstracts can also be sent by regular mail to Roberto Tamassia Department of Computer Science Brown University 115 Waterman Street Providence, RI 02912-1910 Submissions should arrive by September 10, 1998. Authors will be notified of acceptance by September 18, 1997. A booklet of abstracts will be distributed at the workshop and made available electronically on the Web. There will be no formal proceedings for this workshop, but selected papers will be invited to a special issue of the journal "Computational Geometry: Theory and Applications" (edited by Michael T. Goodrich). Program Committee ----------------- * Pankaj K. Agarwal * Joseph S. B. Mitchell * Lars Arge * Franco P. Preparata * Michael T. Goodrich * Roberto Tamassia * S. Rao Kosaraju * Jeffrey S. Vitter Accommodations ------------- Hotel space is very tight in Providence, so make your reservations as soon as possible. Rooms have been reserved at the following places until September 18: Brown Guest Rooms. 401-863-7500. Hotel-style rooms conveniently located on the Brown campus, within walking distance from the conference site. One or two people: $85 (few rooms available) Mention the "CGC Workshop" when making reservations. Providence Biltmore. Kennedy Plaza, Providence, RI 02903; 401-421-0700 or 1-800-294-7709 (phone), 401-455-3050 (fax). One person, one double bed: $120, $20 additional for second person (20 rooms) Mention the "CGC Workshop" and ask for the Brown University rate when making reservations. Additional local hotels may have discounted rates: Marriott. Charles & Orms, Providence, RI; 401-272-2400 or 1-800-228-9290. Holiday Inn. 21 Atwells Ave. (exit 21 off I-95), Providence, RI; 401-831-3900. Days Inn. 200 India St. (exit 3 off I-195), 401-272-5577. The rate for Saturday night should be lower than that for Sunday night. Additional local information (transportation, weather, restaurants, etc) can be found at our web site (http://www.cs.brown.edu/cgc/cgc98/). Further questions can be directed to cgc@cs.brown.edu. Local Arrangements ------------------ * Mary Andrade (maa@cs.brown.edu) * Stina Bridgeman (ssb@cs.brown.edu) * Vasiliki Chatzi (vc@cs.brown.edu) For more information about the workshop, send mail to cgc@cs.brown.edu. Further information will be posted to our web site (http://www.cs.brown.edu/cgc/cgc98/) as soon as it is available. --------------B8810776CF4FCAA3FBDFAC24-- ------------- 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 From compgeom-owner@research.bell-labs.com Wed Sep 9 00:22:20 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id BAA03090; Wed, 9 Sep 1998 01:22:12 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Sep 8 18:21:09 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Tue Sep 8 15:17:04 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Sep 8 15:16:28 EDT 1998 Received: from teletype.rainbo.com ([206.165.31.66]) by dusty; Tue Sep 8 15:16:26 EDT 1998 Received: by rainbo.com with Internet Mail Service (5.0.1460.8) id ; Tue, 8 Sep 1998 12:15:27 -0700 Message-ID: <8657C7FE2E1DD2118B49080036837D034006@rainbo.com> From: Veronique Lang To: "'compgeom-discuss@research.bell-labs.com'" Cc: Veronique Lang Subject: help with collision detection Date: Tue, 8 Sep 1998 12:15:25 -0700 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.0.1460.8) Content-Type: text/plain Precedence: bulk Status: RO Content-Length: 667 Lines: 21 I am trying to use the collision detection code described in the Graphics Gems IV (Fast Collision detection of Moving Convex Polyhedra, R.Rabbitz, p 83-109). Unfortunately the algorithm sometimes does not stop. Does anybody have some experience with that code ? Any hint on how to solve that problem ? (the algorithm is supposed to stop in any case, according to the paper ). Thanks in advance, Veronique Martin-Lang Rainbow Studios veronique@rainbo.com http://www.rainbo.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 From compgeom-owner@research.bell-labs.com Wed Sep 9 14:47:24 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id PAA27312; Wed, 9 Sep 1998 15:47:11 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Sep 9 08:42:36 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Wed Sep 9 04:59:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Sep 9 04:58:26 EDT 1998 Received: from wsintt09.win.tue.nl ([131.155.70.126]) by dusty; Wed Sep 9 04:58:25 EDT 1998 Received: from gino@localhost by wsintt09.win.tue.nl (8.8.7) for compgeom-announce@research.bell-labs.com id KAA25305. Wed, 9 Sep 1998 10:58:22 +0200 (MET DST) Message-ID: <19980909105821.A25301@win.tue.nl> Date: Wed, 9 Sep 1998 10:58:21 +0200 From: Gino van den Bergen To: compgeom-announce@research.bell-labs.com Subject: SOLID 2.0 collision detection library released Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Mailer: Mutt 0.93i Precedence: bulk Status: RO Content-Length: 1323 Lines: 32 I'm happy to announce the release of SOLID version 2.0. The new SOLID is a library for collision detection of three-dimensional objects undergoing rigid motion and deformation. SOLID is designed to be used in interactive 3D graphics applications, and is especially suited for collision detection of objects and worlds described in VRML. The objects can be modeled as primitives, such as boxes, cones, cylinders, and spheres, or as complex shapes composed of polytopes (line segments, convex polygons, convex polyhedra). The placement of an object is given either as a sequence of translations, rotations, and nonuniform scalings, or as a 4x4 column-major matrix, that represents an affine transformation, as used in OpenGL. The library is written in standard C++ and relies heavily on STL. Currently it compiles under GNU g++ version 2.8.1 and Visual C++ 5.0. The library has a standard C API and can be linked to both C and C++ applications. The source code and documentation is released under the terms of the GNU Library General Public License. It can be downloaded from URL: http://www.win.tue.nl/cs/tt/gino/solid/ Gino ------------- 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 From compgeom-owner@research.bell-labs.com Wed Sep 9 14:56:08 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id PAA27514; Wed, 9 Sep 1998 15:54:21 +0300 (GMT+0300) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Sep 9 08:42:18 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Wed Sep 9 04:29:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Sep 9 04:28:04 EDT 1998 Received: from ns.felk.cvut.cz ([147.32.80.9]) by dusty; Wed Sep 9 04:28:04 EDT 1998 Received: from petr.felk.cvut.cz (gr-modem2.felk.cvut.cz [147.32.80.151]) by ns.felk.cvut.cz (8.8.8/8.8.7) with SMTP id KAA20786 for ; Wed, 9 Sep 1998 10:27:53 +0200 (MET DST) Sender: pf@ns.felk.cvut.cz Message-ID: <35F63DD9.45BA4FA@sgi.felk.cvut.cz> Date: Wed, 09 Sep 1998 10:35:37 +0200 From: Petr Felkel Organization: CVUT FEL, Dept. of Comp. Science & Eng. X-Mailer: Mozilla 3.01Gold (X11; I; Linux 2.0.27 i586) MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com Subject: 2-manifold slicing Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 1687 Lines: 40 I need to construct the contours in cross-sections from the input triangular surface mesh (to slice the surface). It looks like a typical CAD problem, byt I can't find either literature about this topic either any publicly available source code. The mesh is given as an indexFaceSet (in VRML), that means by the list of points and by the list of tripples of indices, one tripple for one triangle. The triangles are counter-clockwise oriented (their normal is directed out from the surface). The created contours have to be also oriented - counter-clockwise for the surface and clockwise for the holes (the inner part of object is on the left-hand side of the contour. The original mesh has been created by contour tiling - i.e. the major number of triangles have one edge parallel to the cutting plane. But there are mesh nodes (X) between the original cross-sections also, and they complicate the slicing. Simple slicing between planes which doesn't go through the (X) points looks simple - I need to compute two intersections of two triangle edges and then connect the segments into contours. The edge is shared by exactly two triangles and the segment connectivity computation is simple. But the singular cases exist, when the cross-section goes through the (X) mesh node. More triangles complicates the intersection computations and the problem of detection of the segment connectivity. I will be grateful for any help Thank you in advance Petr Felkel felkel@sgi.felk.cvut.cz ------------- 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 From compgeom-owner@research.bell-labs.com Wed Sep 9 19:01:46 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id TAA07050; Wed, 9 Sep 1998 19:01:36 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Sep 9 12:58:34 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Wed Sep 9 11:51:03 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Sep 9 11:49:10 EDT 1998 Received: from jinai.cs.nyu.edu ([128.122.80.169]) by dusty; Wed Sep 9 11:49:09 EDT 1998 Received: by jinai.cs.nyu.edu (SMI-8.6/1.20) id LAA17410; Wed, 9 Sep 1998 11:48:48 -0400 Date: Wed, 9 Sep 1998 11:48:48 -0400 From: yap@jinai.cs.nyu.edu (Chee Yap) Message-Id: <199809091548.LAA17410@jinai.cs.nyu.edu> To: compgeom-announce@research.bell-labs.com Subject: literature on transformation of images Cc: yap@jinai.cs.nyu.edu X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 605 Lines: 20 Is there any open literature about the following basic problem? Given a raster image I, and a linear transformation T, to compute the new image T(I). Usually T is a rigid transformation, perhaps combined with a dilation. Of course, such an algorithm must be implemented in any of the software that manipulates images, but I want to know if there are non-trivial things to be said for this problem. Thanks, Chee ------------- 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 From compgeom-owner@research.bell-labs.com Thu Sep 10 14:48:02 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id OAA24804; Thu, 10 Sep 1998 14:47:36 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Sep 10 08:45:51 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Wed Sep 9 15:19:04 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Sep 9 15:17:59 EDT 1998 Received: from rs1.rrz.Uni-Koeln.DE ([134.95.100.208]) by dusty; Wed Sep 9 15:17:59 EDT 1998 Received: (from al001@localhost) by rs1.rrz.Uni-Koeln.DE (8.8.6/8.8.6) id VAA48468 for compgeom-discuss@research.bell-labs.com; Wed, 9 Sep 1998 21:17:59 +0200 Message-Id: <199809091917.VAA48468@rs1.rrz.Uni-Koeln.DE> Subject: transforms From: al001@rs1.rrz.Uni-Koeln.DE (Irwin Scollar) Date: Wed, 9 Sep 1998 21:17:57 +0200 (MST) To: compgeom-discuss@research.bell-labs.com X-Mailer: fastmail [version 2.4 PL24 PGP6] Precedence: bulk Status: RO Content-Length: 1025 Lines: 25 Concerning raster transforms, there is a working Windows 95/98/NT program called AirPhoto with full documentation and references for the algorithms used in Windows Help format for transforming scanned color or black and white images to scanned maps with various transformations (projective, second order polynomial and projective with polynomial correction) and either nearest neighbor, binlinear or bicubic spline interpoloation available for downloading and test from the following web sites: http://www.uni-koeln.de/~al001/basp.html {Univ. of Cologne, Germany} http://super3.arcl.ed.ac.uk/baspmirror/basp.html {Univ. of Edinburgh, Scotland} http://wings.buffalo.edu/anthropology/BASP {Univ. at Buffalo, USA} http://borealis.lib.uconn.edu/basp/basp.html {Univ. of Connecticut, Storrs, USA} Irwin Scollar ------------- 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 From compgeom-owner@research.bell-labs.com Thu Sep 10 14:50:09 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id OAA24864; Thu, 10 Sep 1998 14:49:48 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Sep 10 08:47:43 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Wed Sep 9 15:19:04 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Sep 9 15:17:59 EDT 1998 Received: from rs1.rrz.Uni-Koeln.DE ([134.95.100.208]) by dusty; Wed Sep 9 15:17:59 EDT 1998 Received: (from al001@localhost) by rs1.rrz.Uni-Koeln.DE (8.8.6/8.8.6) id VAA48468 for compgeom-discuss@research.bell-labs.com; Wed, 9 Sep 1998 21:17:59 +0200 Message-Id: <199809091917.VAA48468@rs1.rrz.Uni-Koeln.DE> Subject: transforms From: al001@rs1.rrz.Uni-Koeln.DE (Irwin Scollar) Date: Wed, 9 Sep 1998 21:17:57 +0200 (MST) To: compgeom-discuss@research.bell-labs.com X-Mailer: fastmail [version 2.4 PL24 PGP6] Status: RO Content-Length: 839 Lines: 19 Concerning raster transforms, there is a working Windows 95/98/NT program called AirPhoto with full documentation and references for the algorithms used in Windows Help format for transforming scanned color or black and white images to scanned maps with various transformations (projective, second order polynomial and projective with polynomial correction) and either nearest neighbor, binlinear or bicubic spline interpoloation available for downloading and test from the following web sites: http://www.uni-koeln.de/~al001/basp.html {Univ. of Cologne, Germany} http://super3.arcl.ed.ac.uk/baspmirror/basp.html {Univ. of Edinburgh, Scotland} http://wings.buffalo.edu/anthropology/BASP {Univ. at Buffalo, USA} http://borealis.lib.uconn.edu/basp/basp.html {Univ. of Connecticut, Storrs, USA} Irwin Scollar From compgeom-owner@research.bell-labs.com Fri Sep 11 22:55:20 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id WAA10757; Fri, 11 Sep 1998 22:55:03 +0200 (GMT+0200) Message-Id: <199809112055.WAA10757@taurus.math.tau.ac.il> Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Sep 11 16:52:19 EDT 1998 Date: Wed, 9 Sep 98 15:16:03 EDT From: Paul.Heckbert@HOSTESS.GRAPHICS.CS.CMU.EDU To: compgeom-announce@research.bell-labs.com Subject: Re: literature on transformation of images Precedence: bulk Status: RO Content-Length: 1925 Lines: 49 | Date: Wed, 9 Sep 1998 11:48:48 -0400 | From: yap@jinai.cs.nyu.edu (Chee Yap) | To: compgeom-announce@research.bell-labs.com | Subject: literature on transformation of images | | Is there any open literature about the following | basic problem? Given a raster image I, and a | linear transformation T, to compute the new image T(I). The geometric part of this problem has no open problems that I know of, but there are issues related to top-quality filtering (reconstruction, sampling, and antialiasing) that raise some open problems in multidimensional signal processing. One such question: What is the ideal filter to use when resampling a transformed raster image while minimizing aliasing? I addressed this question in Fundamentals of Texture Mapping and Image Warping, Paul Heckbert, Master's thesis, UCB/CSD 89/516, CS Division, U.C. Berkeley, June 1989. http://www.cs.cmu.edu/~ph and answered it, I believe, for one definition of "ideal", but I have seen surprisingly little discussion of this problem elsewhere -- most people have apparently satisfied themselves with special case solutions for the cases of downsampling and upsampling (scaling a picture down and up, respectively). There are some other interesting signal processing questions associated with the multipass algorithms for performing affine transformations on images, e.g. the 2-pass and 3-pass algorithms, respectively, of: Catmull & Smith, 3-D Transformations of Images in Scanline Order, Proc. SIGGRAPH '80, 1980 Alan W. Paeth, A Fast Algorithm for General Raster Rotation, Graphics Interface '86, May 1986 i.e. how to do the filtering in these algorithms with highest quality results. ------------- 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 From compgeom-owner@research.bell-labs.com Fri Sep 11 22:56:17 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id WAA10800; Fri, 11 Sep 1998 22:56:12 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Sep 11 16:52:47 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Fri Sep 11 14:33:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Sep 11 14:32:52 EDT 1998 Received: from mailfw1.ford.com ([136.1.1.26]) by dusty; Fri Sep 11 14:32:51 EDT 1998 Received: by mailfw1.ford.com id OAA12196 (InterLock SMTP Gateway 3.0 for compgeom-discuss@research.bell-labs.com); Fri, 11 Sep 1998 14:32:50 -0400 Message-Id: <199809111832.OAA12196@mailfw1.ford.com> Received: by mailfw1.ford.com (Internal Mail Agent-1); Fri, 11 Sep 1998 14:32:50 -0400 Date: Fri, 11 Sep 1998 14:32:50 -0400 (EDT) From: Alex Wang To: compgeom-discuss@research.bell-labs.com Cc: mewang@engin.umich.edu Subject: Literature on boolean operations for 2D objects Mime-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 501 Lines: 19 Hi, everyone, Can anyone kindly point me to literature on the boolean operations (intersection, union, difference, etc.) for 2D free-form objects? Any information on public-domain implementations in this area would be even more helpful. Thank you in advance for your help. Regards, Alex Wang Ford Motor Company ------------- 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 From compgeom-owner@research.bell-labs.com Sat Sep 12 23:16:27 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id XAA12928; Sat, 12 Sep 1998 23:16:21 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Sep 12 17:15:19 EDT 1998 To: compgeom-discuss@research.bell-labs.com Received: from research.research.bell-labs.com by netlib2; Sat Sep 12 02:37:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Sat Sep 12 02:36:48 EDT 1998 Received: from SOLAIR.EUnet.yu ([194.247.192.52]) by dusty; Sat Sep 12 02:36:47 EDT 1998 Received: from arrakis (P-198.147.EUnet.yu [194.247.198.147]) by SOLAIR.EUnet.yu (8.9.0/8.9.0) with SMTP id IAA04895; Sat, 12 Sep 1998 08:36:42 +0200 (MET DST) From: "Nebojsa Lazic" To: "Alex Wang" , Cc: Subject: RE: Literature on boolean operations for 2D objects Date: Sat, 12 Sep 1998 08:36:12 +0200 Message-ID: <000401bdde17$a23924f0$93c6f7c2@arrakis> MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook 8.5, Build 4.71.2173.0 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.2106.4 In-Reply-To: <199809111832.OAA12196@mailfw1.ford.com> Importance: Normal Precedence: bulk Status: RO Content-Length: 517 Lines: 17 > Can anyone kindly point me to literature on the boolean operations > (intersection, union, difference, etc.) for 2D free-form objects? Take a look at the http://propro.ru/leonov page. You will find a lo of usefull information there, as well as some nice source code. Nebojsa Lazic, NC Pro - CAD/CAM Solutions, nlazic@eunet.yu ------------- 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 From compgeom-owner@research.bell-labs.com Fri Sep 18 15:25:18 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id PAA23566; Fri, 18 Sep 1998 15:25:07 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Sep 18 09:23:22 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Fri Sep 18 08:03:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Sep 18 08:01:46 EDT 1998 Received: from grendel.csc.smith.edu ([131.229.222.23]) by dusty; Fri Sep 18 08:01:45 EDT 1998 Received: from localhost (orourke@localhost) by grendel.csc.smith.edu (8.8.8/8.8.8/SC-CS-1.0) with SMTP id IAA05953; Fri, 18 Sep 1998 08:01:44 -0400 (EDT) Date: Fri, 18 Sep 1998 08:01:43 -0400 (EDT) From: "Joseph O'Rourke" To: compgeom-announce@research.bell-labs.com cc: halpern@cs.cornell.edu, Ken Clarkson Subject: Annoucing A Computing Research Repository Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 2182 Lines: 42 Those who attended SoCG in June, or who read the minutes of the business meeting posted here, will remember the discussion of an impending eprint archive. It is a reality as of September 15th. See the announcement below from Joe Halpern. I encourage you all to visit http://xxx.lanl.gov/archive/cs/intro.html and start posting your papers to the archive. Note that "computational geometry" has its own subject area, just as we requested as a result of the business meeting discussion. ========================================================================== Annoucing A Computing Research Repository Researchers have made their papers available by putting them on personal web pages, departmental pages, and on various ad hoc sites known only to cognoscenti. Until now, there has not been a single repository to which researchers from the whole field of computing can submit reports. This is about to change. Through a partnership of ACM, the Los Alamos e-Print archive, and NCSTRL (Networked Computer Science Technical Reference Library), an online Computing Research Repository (CoRR) is being established. The Repository has been integrated into the collection of over 20,000 computer science research reports and other material available through NCSTRL (http://www.ncstrl.org) and will be linked with the ACM Digital Library. Most importantly, the Repository will be available to all members of the community at no charge. We encourage you to start using the Repository right away. For more details, see http://xxx.lanl.gov/archive/cs/intro.html. That site provides information on how to submit documents, browse, search, and subscribe to get notification of new articles of interest. Please spread the word among your colleagues and students. CoRR will only gain in value as more researchers use it. See http://www.acm.org/repository for a more detailed description of CoRR. ========================================================================== ------------- 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 From compgeom-owner@research.bell-labs.com Fri Sep 18 19:24:15 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id TAA28074; Fri, 18 Sep 1998 19:24:09 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Sep 18 13:23:13 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Fri Sep 18 10:31:06 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Sep 18 10:29:24 EDT 1998 Received: from engsci.engga.uwo.ca ([129.100.222.11]) by dusty; Fri Sep 18 10:29:23 EDT 1998 Received: from sgi46.engga.uwo.ca by engsci.engga.uwo.ca with SMTP id KAA28347; Fri, 18 Sep 1998 10:31:46 -0400 (EDT) Received: from localhost by sgi46.engga.uwo.ca with SMTP id KAA02181; Fri, 18 Sep 1998 10:31:17 -0400 Date: Fri, 18 Sep 1998 10:31:16 -0400 (EDT) From: "John Dickinson X-Sender: dickijk@sgi46.engga.uwo.ca To: "compgeom-discuss Subject: Numerical recipes in ????? | Graphic Gems Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 1504 Lines: 37 Dear All, I know this isn't exactly what the people on the list do but I didn't know who else to ask. Can anyone make any suggestions for books in the style of Numerical Recipes in ??? for engineers like myself who often find themselves doing computational number crunching as well as computational geometry. I have an old copy of the Numerical Recipes in C but it is time to get a new one. I would like a book that would also provide a more object orientated approach to problems where it would help and would be a little more indepth on optimization but doesn't overwhelm me with theorems of convergency etc. Basically I need a application/use orientated book which discusses strength and weeknesses of algorithms and application areas and gives me references to more advanced literature if I need to pursue the theory ion more depth. What would be the closest equivalent book for Computational Geometry? Would it be the Graphics Gems series? John -- -((Insert standard disclaimer here))-|----- Arthur Wellesley -------------- John Kenneth Dickinson | Duke of Wellington (1769-1852) Grad. Student Mech. Eng. U.W.O. | "There is no mistake; email: jkdickin@julian.uwo.ca | there has been no mistake; http://publish.uwo.ca/~jkdickin/ | and there shall be no mistake." ------------- 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 From compgeom-owner@research.bell-labs.com Fri Sep 18 20:44:08 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id UAA29256; Fri, 18 Sep 1998 20:44:01 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Sep 18 14:43:43 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Fri Sep 18 13:55:03 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Sep 18 13:53:04 EDT 1998 Received: from CSDAlpha2.sbu.ac.uk ([136.148.1.111]) by dusty; Fri Sep 18 13:53:02 EDT 1998 Received: from fire.sbu.ac.uk (fire.sbu.ac.uk [136.148.1.4]) by CSDAlpha2.sbu.ac.uk (8.8.8/8.8.8) with ESMTP id SAA07051; Fri, 18 Sep 1998 18:58:45 +0100 (BST) Message-Id: <199809181758.SAA07051@CSDAlpha2.sbu.ac.uk> Received: from frank-nt (136.148.6.197) by ice.sbu.ac.uk (MX V5.0) with SMTP; Fri, 18 Sep 1998 18:50:07 +0100 Comments: Authenticated sender is From: "Frank Devai" Organization: South Bank University, London To: "John Dickinson Date: Fri, 18 Sep 1998 19:01:53 +0000 MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7BIT Subject: Re: Numerical recipes in ????? | Graphic Gems Reply-To: fl.devai@sbu.ac.uk CC: compgeom-discuss@research.bell-labs.com X-Confirm-Reading-To: fl.devai@sbu.ac.uk X-pmrqc: 1 Return-Receipt-To: fl.devai@sbu.ac.uk Priority: normal In-Reply-To: X-mailer: Pegasus Mail for Win32 (v2.54) Precedence: bulk Status: RO Content-Length: 873 Lines: 25 On 18 Sep 98 at 10:31, John Dickinson wrote: > [...] Basically I need a application/use orientated book which > discusses strength and weeknesses of algorithms and application > areas and gives me references to more advanced literature if I > need to pursue the theory in more depth. > > What would be the closest equivalent book for Computational > Geometry? Would it be the Graphics Gems series? The Graphics Gems series is a good starting point. It continues in a journal entitled 'journal of graphics tools' published by A K Peters Ltd. I would also recommend O'Rourke, J. Computational Geometry in C. Cambridge University Press, Cambridge, UK, 1994, 368 pp. Regards, Frank ------------- 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 From compgeom-owner@research.bell-labs.com Fri Sep 18 20:46:03 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id UAA29312; Fri, 18 Sep 1998 20:45:54 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Sep 18 14:45:01 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Fri Sep 18 13:35:07 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Sep 18 13:34:42 EDT 1998 Received: from sargas.inria.fr ([138.96.16.9]) by dusty; Fri Sep 18 13:34:39 EDT 1998 Received: from sargas.inria.fr by sargas.inria.fr (8.8.8/8.8.5) with ESMTP id TAA20839 for ; Fri, 18 Sep 1998 19:34:39 +0200 (MET DST) Message-Id: <199809181734.TAA20839@sargas.inria.fr> X-Mailer: exmh version 2.0.2 2/24/98 To: compgeom-announce@research.bell-labs.com Subject: European Workshop on Computational Geometry '99 Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Date: Fri, 18 Sep 1998 19:34:38 +0200 From: Herve Bronnimann Content-Transfer-Encoding: quoted-printable X-MIME-Autoconverted: from 8bit to quoted-printable by sargas.inria.fr id TAA20839 Precedence: bulk Status: RO Content-Length: 3149 Lines: 112 #########################################################################= ### CALL FOR PARTICIPATION 15TH EUROPEAN WORKSHOP ON COMPUTATIONAL GEOMETRY March 15-16-17 1999=20 Palais des Congres, Antibes=20 #########################################################################= #### The European Workshop on Computational Geometry will be held in 1999 at t= he Palais des Congr=E8s, Antibes Juan-Les-Pins, France. The goal of the workshop is to bring together the researchers in Computational Geometry, facilitating - through an informal scheme - the diffusion of their most recent work. -------------------------------------------------------------------------= ---- INVITED SPEAKERS: [*] Bernard Chazelle, Princeton University, and Ecole Polytechnique P= aris. [*] Jeffrey S. Vitter, Duke University and INRIA Sophia-Antipolis. [*] Jean-Marie Laborde, IMAG Grenoble. -------------------------------------------------------------------------= ---- PARTICIPATION: All interested people are welcome, even if they do not intend to give a t= alk. Information about the workshop can be found on the CG'99 www home page. I= n order to receive further information by email, please subscribe to our mailing list through the www page. Further information concerning the workshop program as well as travel and accommodation will be sent to participants in January 1999 as well as on the www page. -------------------------------------------------------------------------= ---- CONTRIBUTIONS: Participants are encouraged to give a 20 minutes presentation of their work. A preliminary title and a brief abstract (1-3 pages) should be submitted (either PS files by email or camera-ready papers by regular mail) to the organizing committee before January 15th, 1999. The workshop language will be English. If the number of presentations is too large, a selection will be made by = the organizers. No proceeding will be published but the abstracts will be collected and distributed among the participants at the Workshop. -------------------------------------------------------------------------= ---- ORGANIZING COMMITTEE: Jean-Daniel Boissonnat=20 Herv=E9 Bronnimann (chair)=20 Fr=E9d=E9ric Cazals=20 Frank Da Olivier Devillers=20 Pierre-Marie Gandoin Sylvain Pion=20 Monique Teillaud=20 Fran=E7ois Rebufat Mariette Yvinec=20 -------------------------------------------------------------------------= ---- ADDRESS: CG'99 CG'99 --- Projet Prisme,=20 INRIA B.P. 93=20 2004 Route des Lucioles 06902 Sophia-Antipolis Cedex France E-mail: cg99@sophia.inria.fr Fax: +33 4.92.38.76.43 Phone: +33 4.92.38.77.38 Deadline for submissions: January 15th, 1999 #########################################################################= #### ------------- 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 From compgeom-owner@research.bell-labs.com Sun Sep 20 03:18:05 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id DAA07059; Sun, 20 Sep 1998 03:17:52 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Sep 19 18:09:11 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Fri Sep 18 20:29:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Sep 18 20:27:37 EDT 1998 Received: from grendel.csc.smith.edu ([131.229.222.23]) by dusty; Fri Sep 18 20:27:36 EDT 1998 Received: from localhost (orourke@localhost) by grendel.csc.smith.edu (8.8.8/8.8.8/SC-CS-1.0) with SMTP id UAA18117; Fri, 18 Sep 1998 20:27:17 -0400 (EDT) Date: Fri, 18 Sep 1998 20:27:16 -0400 (EDT) From: "Joseph O'Rourke" To: Frank Devai cc: "John Dickinson , compgeom-discuss@research.bell-labs.com Subject: Re: Numerical recipes in ????? | Graphic Gems In-Reply-To: <199809181758.SAA07051@CSDAlpha2.sbu.ac.uk> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 529 Lines: 20 On Fri, 18 Sep 1998, Frank Devai wrote: > > O'Rourke, J. Computational Geometry in C. Cambridge University Press, > Cambridge, UK, 1994, 368 pp. > Thanks for the recommendation. Let me mention that the Second Edition is due out any day now. The code has been available from my Web site since June. :-j http://cs.smith.edu/~orourke/ ------------- 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 From compgeom-owner@research.bell-labs.com Mon Sep 21 15:41:38 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id PAA16614; Mon, 21 Sep 1998 15:41:22 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Sep 21 09:38:51 EDT 1998 To: compgeom-announce@research.bell-labs.com Received: from research.research.bell-labs.com by netlib2; Mon Sep 21 07:51:01 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Sep 21 07:50:10 EDT 1998 Received: from ori.zcu.cz ([147.228.52.11]) by dusty; Mon Sep 21 07:50:06 EDT 1998 Received: from uk426-kiv-pc4.zcu.cz (uk426p03-kiv.fav.zcu.cz [147.228.43.54]) by ori.zcu.cz (8.9.1a/8.9.1) with SMTP id KAA07381; Mon, 21 Sep 1998 10:51:59 +0200 (MET DST) Message-ID: <002901bde53e$67d3aaa0$362be493@uk426-kiv-pc4.zcu.cz> From: "Vaclav Skala" To: Subject: WSCG CFP/0 Graphics, Visualization & Interactive Digital Media Date: Sun, 20 Sep 1998 18:38:57 +0200 MIME-Version: 1.0 Content-Type: text/plain; charset="windows-1250" Content-Transfer-Encoding: 7bit X-Priority: 1 X-MSMail-Priority: High X-Mailer: Microsoft Outlook Express 4.72.3110.5 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3 Precedence: bulk Status: RO Content-Length: 6262 Lines: 162 ---------------------------------------------------------------- >>> Sorry for duplicates - we lost all the data and just <<< >>> recovering - to be removed from the list, please <<< >>> REPLY to skala@kiv.zcu.cz subj: REMOVE <<< ---------------------------------------------------------------- You have the very last opportunity to present your paper before the year 2000 ----------------------------------------------------------- W S C G'99 The 7-th International Conference in Central Europe on Computer Graphics, Visualization and Digital Interactive Media 99 in cooperation with EUROGRAPHICS and IFIP working group 5.10 on Computer Graphics and Virtual Worlds will be held in February 8 - 12, 1999 in Plzen at the University of West Bohemia close to PRAGUE, the capital of the Czech Republic ----------------------------------------------------------------------- >> If you are willing to help us as a REVIEWER, please, << >> fill in the form at the http://wscg.zcu.cz/reviewer.htm << ----------------------------------------------------------------------- >>Spare WSCG'98 proceedings are still available - ask your librarian << >>to order one - form is available from http://wscg.zcu.cz & WSCG99 << ----------------------------------------------------------------------- Conference Chairs ================= Nadia Magnenat Thalmann, MIRALab-CUI, Univ. of Geneva, Switzerland Vaclav Skala, Univ. of West Bohemia, Czech Republic International Programme Committee ================================= Bergougnoux,P.(F) Chalmers,A.(UK) Chen,J.(USA) Fellner,D.(D) Ferko,A.(SK) Groeller,E.(A) Hubbold,R.(UK) Iones,A.(RU) Jensen,W.H.(D) Klein,R.(D) Mockrzycki,V.(PL) Peroche,B.(F) Pratt,M.(USA) Rossignac,J.(USA) Sbert, M.(ES) Seidel,H.-P.(D) Sillion,F.(F) Slavik,P.(CR) Slusalek,P.(D) Sochor, J.(CR) Strasser,W.(D) Stuerzlinger,W.(USA) Szirmay-Kalos,L.(H) Tokuta,A.(USA) Willis, P.(UK) Wuetrich,C.(D) Yagel, R.(USA) Yukita,S.(J) Zara, J.(CR) Sponsors and supporting organizations ===================================== Digital Equipment, Hewlett Packard, IBM, Silicon Graphics, Intergraph, Bentley Systems, Microsoft Information for authors ======================== Deadline for contributions: October 15, 1998 original(full affiliation) +3 copies(non-affiliated) +electronic form in CORRECT Postscript to be compressed to gz format format A4 (strictly NOT B4, properly formated), 8 pages including figures, tables etc. Posters: same format, length restricted to 2 pages including pictures, tables etc. If presented by an author will be printed in separate volume. For details, please, see http://wscg.zcu.cz select WSCG'99 Topics included --------------- Fundamental algorithms, rendering and visualization, virtual reality, animation and multimedia, medical imaging, geometric modelling and fractals, graphical interaction, object-oriented graphics, WWW technologies, standards, computer vision, parallel and distributed graphics, computational geometry, computer aided geometric design, CAD/CAM, DTP and GIS systems, educational aspects of related fields, usage of graphics within mathematical software (Maple, Mathematica, MathCAD etc.) in education The program includes international books exhibition and video show, too. --------------------------------------------- W S C G '99 International Exhibition ------------------------------------ Information for exhibitors: Please contact the organiser as soon as possible -------------------------- for detailed information and conditions. The WSCG98 Exhibition will be held in parallel. Top leading European and Czech companies active in computer graphics, visualization and computer vision, CAD/CAM and GIS systems, virtual reality, multimedia systems and others will be presenting their latest products. Special programme will be available, too. ----------------- Accepted papers will be published in the Conference proceedings with ISBN. They are reviewed by INSPEC, Cambridge Scientific Abstracts, InfoStore, IEEE , ISI , AIMS , INIST and others for citations index and other purposes. The best papers will be considered for possible publication in the Journal of Visualisation and Computer Animation, Computers&Graphics, The Visual Computer, Machine Graphics & Vision and others journals. Organizer and conference secretariat ------------------------------------ Vaclav Skala c/o Computer Science Dept., Univ.of West Bohemia Univerzitni 8, Box 314, 306 14 Plzen, Czech Republic e-mail: skala@kiv.zcu.cz Subject: INFO WSCG99 tel.:+420-19-7491-188 fax:+420-19-7491-188 fax:+420-19-7822-578 The latest information is available at: http://wscg.zcu.cz select WSCG'99 Information on all WSCG conferences: http://wscg.zcu.cz In case of any problems: http://147.228.63.9 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Prof. Ing.Vaclav Skala,CSc. University of West Bohemia, Univerzitni 8, Box 314 306 14 Plzen-Bory Czech Republic Tel.: +420-19-7491-188, Fax: +420-19-7491-213 Secretary: Tel.: +420-19-7491-212 skala@kiv.zcu.cz, http://herakles.zcu.cz/~skala >> for WSCG conferences: http://wscg.zcu.cz << Affiliated with: Multimedia Technology Research Centre, University of Bath BATH BA2 7AY, UNITED KINGDOM ---------------------------------------------------------------------------- -------------------- ------------- 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 From compgeom-owner@research.bell-labs.com Wed Sep 23 15:56:29 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id PAA02909; Wed, 23 Sep 1998 15:52:13 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Sep 23 09:50:13 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Tue Sep 22 09:13:00 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Sep 22 09:11:47 EDT 1998 Received: from augustus-239.cs.umn.edu ([160.94.148.171]) by dusty; Tue Sep 22 09:11:44 EDT 1998 Received: from cosmos.cs.umn.edu (janardan@cosmos.cs.umn.edu [128.101.228.58]) by augustus-239.cs.umn.edu (8.8.5/8.8.5) with ESMTP id IAA12487; Tue, 22 Sep 1998 08:11:42 -0500 (CDT) From: Ravi Janardan Received: (from janardan@localhost) by cosmos.cs.umn.edu (8.8.3/8.8.0) id NAA15528; Tue, 22 Sep 1998 13:11:35 GMT Message-Id: <199809221311.NAA15528@cosmos.cs.umn.edu> Subject: ICVC: 2nd Call-for-papers To: compgeom-announce@research.bell-labs.com Date: Tue, 22 Sep 1998 08:11:34 -0500 (CDT) Cc: janardan@mail.cs.umn.edu (Ravi Janardan) X-Mailer: ELM [version 2.4ME+ PL32 (25)] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 12791 Lines: 354 Please note that the submission deadline is Oct. 15 *********************************************************** 2nd CALL FOR PAPERS --------------------- ICVC99 International Conference on Visual Computing Interaction, Modeling, Rendering, Animation, and 3D environments February 23 - 26, 1999 Goa, India Organized by International Federation for Information Processing (IFIP) TC5 & WG5.10 Computer Society of India http://www.ncst.ernet.in/~icvc99 *********************************************************** CONFERENCE THEME ---------------- An unstoppable revolution is underway, made possible by the technological developments that enable computing with visuals. This new revolution is about real time access and sharing of digital information consisting not only of texts and sounds but powerful realistic or imagined visuals and explorable 3D worlds, enabling truly interactive multiparticipant, multisensory, multimodal and multimedia communication. The next generation of computers will build in audio, visual and 3D graphics processing capabilities at the core level. This international conference in India will bring together renowned world experts both from the academic and industrial fields, providing participants with the unique opportunity of acquiring exciting technological know-how. The primary theme of the conference is "Visual Computing" covering all aspects and domains -- 3D Geometry, Image-based Techniques, Animation, Virtual Environments, User-interfaces, Web-based Graphics, Hardware and Multimedia. ICVC99 is structured around a number of theme programmes, with equal emphasis on technical content in each. CONFERENCE TOPICS Papers are solicited on conference topics listed below and also on any other topics that fall within the theme of the conference. Geometry Simplification Geometry Compression Graphics and Geometric Algorithms Modeling Curves/Surfaces/Solids/Volumes Physically Based Modeling Image-based Modeling and Rendering Computer Animation Motion Simulation Special Effects Global Illumination Photorealistic Rendering Digital Story Telling 3D HCI Virtual Environments Interactive Design Ease-of-Use for 3D Design Web Based Graphics Tele-collaboration Interactive 3D on the Internet Secure Image/Video Communication Image/Video Encoding/Compression Visual Interfaces to Electronic Commerce Multimedia CAD/CAM Rapid Prototyping Computer-assisted Virtual Classrooms Visualization of Business Data Innovative Applications of Graphics Virtual Humans and Artificial Life Graphics Architectures CALL FOR PAPERS --------------- ICVC99 solicits original papers which either report new work, survey or review emerging trends, or detail innovative applications. All submitted papers will be refereed and those accepted for presentation at the conference will be included in the Conference Proceedings, to be published by Kluwer Academic Publishers (tentative). IMPORTANT DATES October 15, 1998 ... Last date for receipt of submitted papers November 25, 1998 ... Notification of acceptance/rejection December 20, 1998 ... Last date for receiving final camera-ready version of accepted paper INFORMATION TO AUTHORS Papers can be submitted by e-mail in PostScript, Microsoft Word or PDF format to "icvc99@konark.ncst.ernet.in". Papers can also be submitted in hard copy form for refereeing purposes. In that case, four copies of the full paper in English, should be received by the ICVC99 Secretariat in Mumbai (Bombay) on or before October 15, 1998. The paper size must be limited to be within 2000 to 6000 words, including a 200 word abstract. ICVC99 Secretariat National Centre for Software Technology, Gulmohar Cross Road No. 9. Juhu, Mumbai 400049, INDIA. Tel : 91 22 6201606 Fax : 91 22 6210139 Telex : 11 78260 NCST IN e-mail : icvc99@konark.ncst.ernet.in WWW : http://www.ncst.ernet.in/~icvc99 All submitted papers must include a cover sheet containing name, address, telephone numbers, FAX and e-mail address of the person to whom the correspondence regarding the paper should be addressed. Each paper must contain: * title * name(s) and affiliation(s) of all the authors * abstract of 200 words maximum * keywords indicating principal categorization of the paper with respect to the conference themes * text between 2000 and 6000 words, single or double sided limiting to a maximum of 30 double spaced A4 size pages including diagrams, figures, tables and photographs * references giving full details, including page numbers, for cited books/articles KEYNOTE ADDRESSES & INVITED TALKS --------------------------------- ICVC99 includes a number of comprehensive talks on leading edge topics in the theory and applications of Visual Computing. These are in the form of keynote addresses, invited talks, tutorials and state of the art reports, given by internationally renowned researchers in the field. INDUSTRY PRESENTATIONS ----------------------- A number of corporate level presentations by manufacturers and vendors on their latest graphics/CAD hardware and software systems are planned. These will provide an excellent opportunity to the vendors to present their systems and solutions before the conference audience. For further information, please contact the conference secretariat. CONFERENCE CHAIR ---------------- Harish Mehta, Managing Director, Onward Technologies, 62, MIDC, 13th Street, Andheri (East), Mumbai 400 093, INDIA Tel : 91 22 8342244 Fax : 91 22 8342223 e-mail: hmehta@novell.com INTERNATIONAL PROGRAMME COMMITTEE --------------------------------- PROGRAMME CHAIRS Jose L. Encarnacao, Direktor Fraunhofer-Institut fuer Graphische Datenverarbeitung Rundeturmstrasse 6 D-64283 Darmstadt, GERMANY. Tel : +49-(0)6151/155-130 Fax : +49-(0)6151/155-430 e-mail: jle@igd.fhg.de Jarek Rossignac, Director Graphics, Visualization, and Usability Center College of Computing, Room 241 Georgia Institute of Technology Atlanta, GA 30332-0280, USA. Phone : 404/894-0671, Fax : 404/894-0673 e-mail: jarek@cc.gatech.edu Sudhir P Mudur, Associate Director National Centre for Software Technology, Gulmohar Cross Road No. 9. Juhu, Mumbai 400049, INDIA. Tel : 91 22 6201606 Fax : 91 22 6210139 Telex : 11 78260 NCST IN e-mail: mudur@ncst.ernet.in CHAIRPERSONS FOR SPECIAL THEME PROGRAMMES Digital Story Telling: The next API for Visual Computing Ken Perlin 3D Geometry: Representation, Simplification, and Compression Jarek Rossignac Image based Modeling and Rendering Heinrich Mueller Web Based Graphics and Tele-collaboration Jose L. Encarnacao Industrial Applications M. Mantyla Graphics Architectures W. Strasser Digital Image/Video Communication Christoph Busch Applications in Art, Culture and Heritage Documentation Sudhir Mudur Applications in Education and Training L. Miguel Encarnacao Human Media Technology for Human Centered Computing Nahum Gershon MEMBERS OF THE INTERNATIONAL PROGRAMME COMMITTEE Ken Perlin perlin@cat.nyu.edu M. Mantyla Martti.Mantyla@hut.fi W. Strasser strasser@gris.uni-tuebingen.de Heinrich Mueller mueller@ls7.informatik.uni-dortmund.de Christoph Busch busch@igd.fhg.de L. Miguel Encarnacao mencarna@crcg.edu Nahum Gershon gershon@mitre.org Nadia Magnenat-Thalmann Nadia.Thalmann@cui.unige.ch Daniel Thalmann thalmann@lig.di.epfl.ch Alan Chalmers alan@cs.bris.ac.uk Sabine Coquillart sabine.coquillart@inria.fr Christoph M. Hoffmann cmh@cs.purdue.edu Andrew Glassner glassner@microsoft.com Hugues Hoppe nospam@microsoft.com Ravi Janardan janardan@cs.umn.edu Erik Jansen fwj@duticg.twi.tudelft.nl Arie Kaufman ari@cs.sunysb.edu Jai Menon MENON@watson.ibm.com W. Purgathofer wp@cg.tuwien.ac.at A. Rappoport arir@cs.huji.ac.il L. Rosenblum rosenblum@ait.nrl.navy.mil Ram D. Sriram sriram@cme.nist.gov M. Rui Gomes mrg@inesc.pt J. Cunha jdc@lnec.pt Amitabh Varshney varshney@cs.sunysb.edu Sumant Pattanaik sumant@graphics.cornell.edu G. Doumeingts doumeingts@lap.u-bordeaux.fr Ketil Bo ketil.bo@dynamic-imaging.no Aristides Requicha requicha@lipari.usc.edu Dinesh Shikhare dinesh@ncst.ernet.in Prem Kalra pkalra@iitd.ernet.in V. V. Kamat vvkamat@unigoa.ernet.in Sanjay G. Dhande sgd@iitk.ernet.in Swamy Manohar manohar@csa.iisc.ernet.in Norman Badler badler@central.cis.upenn.edu Aderito Marcos marcos@ccg.uc.pt Andreas Schilling schilling@uni-tuebingen.de Reinhard Klein Reinhard.Klein@uni-tuebingen.de P. S. Grover psg@giasdla.vsnl.net.in ABOUT THE LOCATION -- GOA ------------------------- Goa shines brightly on the tourist map of the world. Not only does it offer the Sun, Sea and the Sand - but gleaming whitewashed churches with Portuguese-style facades pepper the hillsides, rice paddies and dense coconut palm groves, while crumbling forts guard rocky capes and estuary entrances. Goa's 105 km coastline with it's 40 beaches, broken up with idyllic palm fringed beaches, pose a delight for swimmers, anglers, watersport buffs and sunbathers. Aside from all these - Goa is also known for the oldest church in Asia coupled with ancient Indian temples which present an amalgam of cultures seldom found anywhere else. Goa's well known for its exotic fresh spices and its cuisine is well known for it's spice and variety in every corner of the world. VENUE (tentative) Cidade de Goa Beach Resort is a luxury beach resort designed like a Portugese Hill town in a Goan setting. It is built in 5 split levels immediately overlooking the sea and an exclusive beach private in character. Bordering the beach are 22 acres of extensive lawns with nature trails, hammocks, two garden restaurants, tennis courts and an exclusive health farm. The ambience is ideal for a relaxed conference or a holiday. FURTHER DETAILS ---------------- In order to ensure that you receive all further information regarding registration and advance programme, please return this form to the ICVC99 Conference Secretariat by e-mail or air-mail; or fill in the form at the ICVC99 WWW site. ------------------------------------------------------------------ ( ) I wish to receive the registration information and advance programme. ( ) I am interested in submitting a paper for conference ( ) I am interested in participating in vendor presentation ------------------------------------------------------------------ Title (Prof/Dr/Mr/Ms/...) ------------------------------------------------------------------ Last Name First Name ------------------------------------------------------------------ Profession ------------------------------------------------------------------ Institute/Company Job Title ------------------------------------------------------------------ Mailing Address: ------------------------------------------------------------------ Tel No: Fax: ------------------------------------------------------------------ e-mail: Telex: ------------------------------------------------------------------ ICVC99 Secretariat National Centre for Software Technology, Gulmohar Cross Road No. 9. Juhu, Mumbai 400049, INDIA. Tel : 91 22 6201606 Fax : 91 22 6210139 Telex : 11 78260 NCST IN e-mail : icvc99@konark.ncst.ernet.in WWW : http://www.ncst.ernet.in/~icvc99 ------------- 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 From compgeom-owner@research.bell-labs.com Wed Sep 23 16:49:08 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id QAA04712; Wed, 23 Sep 1998 16:47:03 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Sep 23 09:56:00 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Tue Sep 22 15:19:05 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Sep 22 15:17:40 EDT 1998 Received: from cs.brown.edu ([128.148.32.2]) by dusty; Tue Sep 22 15:17:39 EDT 1998 Received: from cs.brown.edu (dumba.cs.brown.edu [128.148.38.23]) by cs.brown.edu (8.8.5/8.7.1) with ESMTP id PAA00573; Tue, 22 Sep 1998 15:17:39 -0400 (EDT) Sender: rt@cs.brown.edu Message-ID: <3607F7D3.E35EBFBC@cs.brown.edu> Date: Tue, 22 Sep 1998 15:17:39 -0400 From: Roberto Tamassia Organization: Brown University X-Mailer: Mozilla 4.06 [en] (X11; U; SunOS 5.6 sun4u) MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: 3rd CGC Workshop on Computational Geometry Content-Type: multipart/mixed; boundary="------------BBAFA5191E6CE32D822AAB7A" Precedence: bulk Status: RO Content-Length: 8721 Lines: 286 This is a multi-part message in MIME format. --------------BBAFA5191E6CE32D822AAB7A Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit --------------BBAFA5191E6CE32D822AAB7A Content-Type: text/plain; charset=us-ascii; name="home.txt" Content-Transfer-Encoding: 7bit Content-Disposition: inline; filename="home.txt" 3rd CGC Workshop on Computational Geometry October 11-12, 1998 Brown University, Providence, RI http://www.cs.brown.edu/cgc/cgc98/ Sponsored by The Center for Geometric Computing and The Department of Computer Science, Brown University We are pleased to announce the third annual fall Workshop on Computational Geometry, sponsored by the Center for Geometric Computing, continuing a tradition established by the Mathematical Sciences Institute at SUNY-Stony Brook. The Center for Geometric Computing is a collaborative center of Brown, Duke, and Johns Hopkins Universities, and is funded by the U.S. Army Research Office. NEW! * preliminary program * registration information * hotel information * local information (see http://www.cs.brown.edu/cgc/cgc98/) Scope and Format ---------------- The aim of this workshop is to bring together researchers from academia, industry, and the Army to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to * Algorithmic methods in geometry * Experimental studies * I/O-scalable geometric algorithms * Geometric data structures * Animation of geometric algorithms * Implementation issues * Computer graphics * Robustness * Solid modeling * Computer vision * Geographic information systems * Robotics * Computational metrology * Computer-aided design * Graph drawing * Mesh generation Following the tradition of the previous MSI and CGC Workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. Registration ------------ Registration will be on-site, but please send mail to cgc@cs.brown.edu as soon as possible to indicate if you are coming. There will be a nominal registration fee of $35, which includes the abstract booklet, coffee breaks, lunches, and a reception. Credit cards cannot be accepted. Invited speakers ---------------- * Jadgish Chandra (U.S. Army Research Laboratory) * John Hughes (Brown University) * Joe Marks (Mitsubishi Electrical Research Laboratories) * Chee Yap (New York University) Program Committee ----------------- * Pankaj K. Agarwal * Joseph S. B. Mitchell * Lars Arge * Franco P. Preparata * Michael T. Goodrich * Roberto Tamassia * S. Rao Kosaraju * Jeffrey S. Vitter Accommodations ------------- Hotel space is very tight in Providence, so make your reservations as soon as possible. Rooms have been reserved at the following places: Brown Guest Rooms. 401-863-7500. Hotel-style rooms conveniently located on the Brown campus, within walking distance from the conference site. One or two people: $85 (few rooms available) Mention the "CGC Workshop" when making reservations. Providence Biltmore. Kennedy Plaza, Providence, RI 02903; 401-421-0700 or 1-800-294-7709 (phone), 401-455-3050 (fax). One person, one double bed: $120, $20 additional for second person (20 rooms) Mention the "CGC Workshop" and ask for the Brown University rate when making reservations. Additional local hotels may have discounted rates: Marriott. Charles & Orms, Providence, RI; 401-272-2400 or 1-800-228-9290. Holiday Inn. 21 Atwells Ave. (exit 21 off I-95), Providence, RI; 401-831-3900. Days Inn. 200 India St. (exit 3 off I-195), 401-272-5577. The rate for Saturday night should be lower than that for Sunday night. Additional local information (transportation, weather, restaurants, etc) can be found at our web site (http://www.cs.brown.edu/cgc/cgc98/). Further questions can be directed to cgc@cs.brown.edu. Local Arrangements ------------------ * Mary Andrade (maa@cs.brown.edu) * Stina Bridgeman (ssb@cs.brown.edu) * Vasiliki Chatzi (vc@cs.brown.edu) For more information about the workshop, send mail to cgc@cs.brown.edu. Further information will be posted to our web site (http://www.cs.brown.edu/cgc/cgc98/) as soon as it is available. Preliminary Program -------------------- Sunday, October 11 -------------------- 9:00 - 10:00 Invited Talk : Chee Yap 10:00 - 10:10 Short break 10:10 - 10:30 Kasturi R. Varadarajan. A divide-and-conquer algorithm for min-cost perfect matching in the plane. 10:30 - 10:50 Christian A. Duncan, Michael T. Goodrich and Stephen Kobourov. Balanced Aspect Ratio Trees: An Introduction. 10:50 - 11:20 Coffee Break 11:20 - 11:40 Jack Snoeyink. Queries with Segments in Voronoi Diagrams. 11:40 - 12:00 Evanthia Papadopoulou and D.T. Lee. L_infinity Voronoi diagrams and applications in VLSI Layout and Manufacturing. 12:00 - 12:20 Waldir L. Roque and Howie Choset. The Green Island Formation in Forest Fire Modeling with Voronoi Diagrams. 12:20 - 1:30 Lunch 1:30 - 2:30 Invited Talk : Joe Marks Through Computational Geometry and Optimization. 2:30 - 2:40 Short break 2:40 - 3:00 Ulrike Axen. Computer Morse Functions on Triangulated Manifolds. 3:00 - 3:20 Vasiliki Chatzi. Finding Basis Functions for Pyramidal Finite Elements. 3:20 - 3:50 Coffee Break 3:50 - 4:10 Jean-Daniel Boissonnat and Franco P. Preparata. Robust plane sweep for intersecting segments. 4:10 - 4:30 Nina Amenta, Marshall Bern, David Eppstein and Shang-Hua Teng. Regression Depth and Center Points. 4:30 - 4:50 Rex A. Dwyer. Voronoi Diagrams on Random Moving Points. 4:50 - 6:00 Reception Monday, October 12 -------------------- 9:00 - 10:00 Invited Talk : Jadgish Chandra 10:00 - 10:10 Short break 10:10 - 10:30 Yi-Jen Chiang and Claudio T. Silva. External Memory Techniques for Isosurface Extraction in Scientific Visualization. 10:30 - 10:50 Subodh Kumar. Incremental PSLG Triangulation for Surface Rendering. 10:50 - 11:20 Coffee Break 11:20 - 11:40 Christian A. Duncan, Michael T. Goodrich and Stephen G. Kobourov. Balanced Aspect Ration Trees and Their Use for Drawing Very Large Graphs. 11:40 - 12:00 Stina Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia and Luca Vismara. Optimal Compaction of Orthogonal Representations. 12:00 - 12:20 Ashim Garg. Interactive Graph Drawing Algorithms. 12:20 - 1:30 Lunch 1:30 - 2:30 Invited Talk : John Hughes 2:30 - 2:40 Short break 2:40 - 3:00 Jeff Erickson, Leonidas J. Guibas, Jorge Stolfi and Li Zhang. Separation-Sensitive Collision Detection for Convex Objects. 3:00 - 3:20 Julien Basch, Jeff Erickson, Leonidas J. Guibas, John Hershberger and Li Zhang. Kinetic Collision Detection Between Two Simple Polygons. 3:20 - 3:40 Erik D. Demaine, Martin L. Demaine and Joseph S. B. Mitchell. Folding any Silhouette from a Strip. 3:40 - 4:10 Coffee Break 4:10 - 4:30 Ala Eddine Barouni and Nejib Zaguia. Drawing Algorithms for Telecommunication Networks. 4:30 - 4:50 Cao An Wang and Bo Ting Yang. On Non Proximity-Drawbility of Maximal Planar Graphs. 4:50 - 5:10 Fujio Yamaguchi. What is the Real Role of a Division Operation in a Computer-Aided Geometric Design System? ----------------------------------------------------------- --------------BBAFA5191E6CE32D822AAB7A-- ------------- 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 From compgeom-owner@research.bell-labs.com Thu Sep 24 19:54:16 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id TAA06263; Thu, 24 Sep 1998 19:54:09 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Sep 24 13:53:22 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Thu Sep 24 09:13:04 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Sep 24 09:12:12 EDT 1998 Received: from engsci.engga.uwo.ca ([129.100.222.11]) by dusty; Thu Sep 24 09:12:13 EDT 1998 Received: from sgi46.engga.uwo.ca by engsci.engga.uwo.ca with SMTP id JAA20426; Thu, 24 Sep 1998 09:14:36 -0400 (EDT) Received: from localhost by sgi46.engga.uwo.ca with SMTP id JAA05296; Thu, 24 Sep 1998 09:14:10 -0400 Date: Thu, 24 Sep 1998 09:14:09 -0400 (EDT) From: "John Dickinson To: "compgeom-discuss Subject: Numerical Recipes, Computational Gems Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 1184 Lines: 31 Dear All, I got quite a few good responses back and will try to look up the several references to: - O'Rourke, J. Computational Geometry in C. Cambridge University Press, Cambridge, UK, 1994, 368 pp. - A well designed library, rather than a loose collection of gems, is available in the form of the Computational Geometry Algorithms Library (CGAL) - The book treats the architecture, the implementation, and the use of the LEDA system http://www.mpi-sb.mpg.de/~mehlhorn/LEDAbook.html. Still no-one suggested any numerical recipes texts. Anyone have anything to say about Numerical Methods and Software by Kahauer, Moler and Nash? John -- -((Insert standard disclaimer here))-|----- Arthur Wellesley -------------- John Kenneth Dickinson | Duke of Wellington (1769-1852) Grad. Student Mech. Eng. U.W.O. | "There is no mistake; email: jkdickin@julian.uwo.ca | there has been no mistake; http://publish.uwo.ca/~jkdickin/ | and there shall be no mistake." ------------- 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 From compgeom-owner@research.bell-labs.com Thu Sep 24 19:59:23 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id TAA06479; Thu, 24 Sep 1998 19:59:18 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Sep 24 13:56:52 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Wed Sep 23 16:13:01 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Sep 23 16:11:08 EDT 1998 Received: from taumsauk.cs.wustl.edu ([128.252.165.15]) by dusty; Wed Sep 23 16:11:07 EDT 1998 Received: from [128.252.165.112] (legion.cs.wustl.edu [128.252.165.112]) by taumsauk.cs.wustl.edu (8.8.5/CTS-JEK1.2) with ESMTP id PAA18578; Wed, 23 Sep 1998 15:11:06 -0500 (CDT) X-Sender: roman@mail.cs.wustl.edu Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Wed, 23 Sep 1998 15:08:02 -0600 To: compgeom-announce@research.bell-labs.com From: Catalin Roman Subject: Washington University Faculty Positions Precedence: bulk Status: RO Content-Length: 2898 Lines: 56 Washington University in Saint Louis Department of Computer Science Applications are invited for tenure-track faculty positions at the Assistant, Associate and Full Professor levels. Applicants should hold a doctorate in Computer Science or a closely related field, have a record of accomplishment in research, and demonstrate a strong commitment to teaching. Washington University is a leading private national university recognized for its world class intellectual contributions (20 Nobel Prize Laureates have been associated with the University), its exceptional resources (an endowment of $2.8 billion, among the largest in the nation), and its location in the midst of a delightful residential community which places much value on education and culture. With annual external research funding in the range of $6 million, Computer Science is emerging as one of the preeminent departments in the University and the School of Engineering and Applied Science. Over the next several years, the Department plans to expand its size from 15 to 20 regular faculty. This aggressive growth pattern will be accompanied by commensurate increases in departmental resources. The Department seeks outstanding candidates likely to develop synergistic relationships with existing areas of excellence within the department: networking and communications; distributed computing and object-oriented software technologies; graphics, visualization, and human interfaces; artificial intelligence; computer architecture and engineering; theoretical computer science, algorithms, and programming languages; and computational science with emphasis on biomedical applications. With the strong backing of the University and the School, the Department is committed to making significant investments in promising new areas of study and to providing the kind of resources and environment that will enable new faculty members to flourish intellectually. Academic couples seeking to co-locate are strongly encouraged to apply. Research groups in search of a highly supportive institutional environment may also want to consider relocating to Washington University. For more information on our department, see our World Wide Web page at http://www.cs.wustl.edu. Qualified applicants should send a curriculum vita and the names and addresses of at least three references to Dr. Catalin Roman, Chairman, Department of Computer Science, Campus Box 1045, Washington University, One Brookings Drive, St. Louis, MO 63130-4899. Applications will be considered as they are received. Those received after February 1, 1999, may not receive full consideration. Washington University is an equal opportunity/affirmative action employer. ------------- 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 From compgeom-owner@research.bell-labs.com Fri Oct 2 02:24:27 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id CAA10425; Fri, 2 Oct 1998 02:24:21 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Oct 1 20:23:04 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Thu Oct 1 15:13:01 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Oct 1 15:11:59 EDT 1998 Received: from mail1.cern.ch ([137.138.128.19]) by dusty; Thu Oct 1 15:11:57 EDT 1998 Received: from rsplus02.cern.ch (rsplus02.cern.ch [137.138.246.94]) by mail1.cern.ch (8.8.8/8.8.8) with ESMTP id VAA05816 for ; Thu, 1 Oct 1998 21:11:56 +0200 (MET DST) Received: from localhost (fca@localhost) by rsplus02.cern.ch (8.8.5/8.8.5) with SMTP id VAA74114 for ; Thu, 1 Oct 1998 21:11:55 +0200 X-Authentication-Warning: rsplus02.cern.ch: fca owned process doing -bs Date: Thu, 1 Oct 1998 21:11:55 +0200 (METDST) From: Federico Carminati X-Sender: fca@rsplus02.cern.ch To: compgeom-discuss@research.bell-labs.com Subject: Shuttle geometry In-Reply-To: <3.0.3.32.19980219093442.007f4480@shore.net> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 1872 Lines: 36 Dear All, I am desperately trying to assemble all the geometrical and material information (composition and density) I can find on the space shuttle. Can you help me with drawings, plans, cad databases and so on? Thank you in advance for the attention and best regards, Federico Carminati ============================================================================== || || || _/_/_/_/_/_/_/ _/_/_/_/ _/ || || _/ _/ _/ _/ _/ || || _/ _/ _/ _/ || || _/_/_/_/_/_/ _/ _/ _/ || || _/ _/ _/ _/ || || _/ _/ _/ _/_/_/_/_/ || || _/ _/ _/ _/ _/ || || _/ _/_/_/_/ _/ _/ || || || ============================================================================== || Federico Carminati || Tel.: +41.22.767.4959 || || CERN-EP || Fax.: +41.22.767.9075 || || 1211 Geneva 23 || || || Switzerland || || ============================================================================== ------------- 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 From compgeom-owner@research.bell-labs.com Sun Oct 4 12:17:34 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id MAA01512; Sun, 4 Oct 1998 12:17:19 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id BAA00036; Sun, 4 Oct 1998 01:35:42 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Oct 3 19:32:19 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Fri Oct 2 15:47:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Oct 2 15:46:22 EDT 1998 Received: from polygon.cs.umd.edu ([128.8.128.64]) by dusty; Fri Oct 2 15:46:21 EDT 1998 Received: from cs.umd.edu (known localhost [127.0.0.1]) by polygon.cs.umd.edu (8.8.5/UMIACS-0.9/04-05-88) id PAA20029 for ; Fri, 2 Oct 1998 15:46:16 -0400 (EDT) Message-Id: <199810021946.PAA20029@polygon.cs.umd.edu> X-Mailer: exmh version 1.6.5 12/11/95 To: compgeom-announce@research.bell-labs.com Subject: Vision Geometry VIII: Call for Papers Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Fri, 02 Oct 1998 15:46:15 -0400 From: Dave Mount Precedence: bulk Status: RO Content-Length: 6417 Lines: 149 Vision Geometry VIII (SD90) Part of SPIE's International Symposium on Optical Science, Engineering, and Instrumentation 18-23 July 1999 * Colorado Convention Center * Denver, Colorado USA ------------------------------------------------------------------------ Conference Chairs: Longin J. Latecki, Univ. Hamburg (Germany); Robert A. Melter, Long Island Univ. (Retired); David M. Mount, Univ. of Maryland/College Park; Angela Y. Wu, American Univ. Program Committee: Gilles Bertrand, Lab. PSI (France); Ari D. Gross, CUNY/Queens College; Atsushi Imiya, Chiba Univ. (Japan); Reinhard Klette, Univ. of Auckland (New Zealand); T. Y. Kong, CUNY/Queens College; Jack Koplowitz, Clarkson Univ.; Ivan Stojmenovic, Univ. of Ottawa (Canada) Keynote Speaker: Robert M. Haralick, Univ. of Washington This conference is designed to bring together workers who use geometric theory and techniques to solve problems related to computer vision. Specific solutions as well as overviews of more general topics are welcome. Topics of interest are: * digital geometry and topology * geometry-based image segmentation * morphology related to vision * computational geometry related to vision * convexity problems in vision * shape description and similarity measures. Abstract Due Date: 21 December 1998 Manuscript Due Date: 21 June 1999 For more information on the Annual Meeting or a complete listing of all conferences please go to our SPIE Web site: www.spie.org/info/annualmeeting.html ------------------------------------------------------------------------ YOUR ABSTRACT SHOULD INCLUDE ALL OF THE FOLLOWING: 1. SUBMIT TO: CONFERENCE CODE, CONFERENCE CHAIR (Example: SD00, SMITH) 2. CONFERENCE TITLE: (submit each abstract to one conference only) 3. ABSTRACT TITLE 4. AUTHOR LISTING (principal author first) First (given) name Last (family) name, Affiliation Mailing address, telephone, fax, and email address. 5. PRESENTATION: Indicate your preference for "Oral Presentation" or "Poster Presentation." Placement is subject to chairs' discretion. 6. ABSTRACT TEXT: Approximately 250 words. 7. KEYWORDS: List a maximum of five keywords. 8. BRIEF BIOGRAPHY (of principal author): Approximately 50 words. ------------------------------------------------------------------------ INSTRUCTIONS FOR SUBMITTING AN ABSTRACT Please choose only *one* of the following options and send by the due date: 1. SPIE WEB - Complete the convenient form found on the SPIE Web site: www.spie.org/forms/sd99_submission_form.html 2. E-MAIL each abstract separately to: abstracts@spie.org in ASCII text (not encoded) format. IMPORTANT: to ensure receipt and proper processing of your abstract, the Subject line must include only the following: SUBJECT: Conference Code, Conference Chair (Example: SD00, Smith) 3. MAIL three copies of your abstract to: OPTICAL SCIENCE, ENGINEERING, AND INSTRUMENTATION SPIE, P.O. Box 10, Bellingham, WA 98227-0010 USA Shipping Address: 1000 20th St., Bellingham, WA 98225 USA Telephone 360/676-3290 4. FAX one copy to SPIE at 360/647-1445 (send each abstract separately). ------------------------------------------------------------------------ CONDITIONS OF ACCEPTANCE * Authors are expected to secure registration fees and travel and accommodation funding, independent of SPIE, through their sponsoring organizations before submitting abstracts. * Only original material should be submitted. * Commercial papers, descriptions of papers, with no research/ development content, and papers where supporting data or a technical description cannot be given for proprietary reasons will not be accepted for presentation in this symposium. * Abstracts should contain enough detail to clearly convey the approach and the results of the research. * Government and company clearance to present and publish should be final at the time of submittal. * Applicants will be notified of acceptance by mail no later than 26 April 1999. Early notification of acceptance will be placed on the SPIE Web site, the week of 26 March 1999 at: www.spie.org/info/annualmeeting.html ------------------------------------------------------------------------ PAPER REVIEW To ensure a high-quality conference, all abstracts and Proceedings of SPIE papers will be reviewed by the Conference Chairs for technical merit and content. PUBLISHING POLICY Manuscript due dates must be strictly observed. Whether the conference volume will be published before or after the meeting, late manuscripts run the risk of not being published in the Proceedings of SPIE. The objective of this policy is to better serve the conference participants and the technical community at large. Your cooperation is appreciated by all. ORAL OR POSTER PRESENTATION Instructions for Oral and Poster presentations will be included in your author kit. All Oral and Poster presentations are included in the Proceedings of SPIE and require a manuscript. PROCEEDINGS These conferences will result in volumes published in the Proceedings of SPIE that can be ordered through the Advance Technical Program. Camera-ready manuscripts are required of all accepted applicants and must be submitted in English by 21 June 1999. Copyright to the manuscript is expected to be released for publication in the Proceedings of SPIE. **Note: If an author does not attend the meeting and make a presentation, the chair may choose not to publish the author's manuscript in the conference volume. Papers published are indexed in leading scientific databases including INSPEC, Compendex Plus, Physics Abstracts, Chemical Abstracts, International Aerospace Abstracts, and Index to Scientific and Technical Proceedings. PARTICIPANT REGISTRATION FEE Authors and coauthors are accorded a reduced symposium registration fee. Participants who attend the symposium and pay the author fee may also apply for a six-month, nonvoting membership in SPIE if never before a member (membership includes OE Reports and choice of SPIE's journals). Details are available at the on-site registration desk or by contacting SPIE Member Services: membership@spie.org; or call 360/676-3290. ------------- 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 From compgeom-owner@research.bell-labs.com Thu Oct 8 21:05:49 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id VAA24192; Thu, 8 Oct 1998 21:04:55 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Oct 8 15:02:34 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Thu Oct 8 09:23:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Oct 8 09:21:13 EDT 1998 Received: from jupiter.kaist.ac.kr ([143.248.174.81]) by dusty; Thu Oct 8 09:21:11 EDT 1998 Received: (from isaac98@localhost) by jupiter.kaist.ac.kr (8.8.8Ha/8.8.8-NOSPAM) id WAA08233 for compgeom-announce@research.bell-labs.com; Thu, 8 Oct 1998 22:20:54 +0900 (KST) Message-ID: <19981008222053.A8226@jupiter.kaist.ac.kr> Date: Thu, 8 Oct 1998 22:20:53 +0900 From: "ISAAC '98" To: compgeom-announce@research.bell-labs.com Subject: [ISAAC98] Call for Participation Mime-Version: 1.0 Content-Type: text/plain; charset=EUC-KR X-Mailer: Mutt 0.93.2i Content-Transfer-Encoding: 8bit Precedence: bulk Status: RO Content-Length: 18026 Lines: 477 ============================================================================ Ninth Annual International Symposium on Algorithms and Computation ============================================================================ December 14-16, 1998 Riviera Hotel, Taejon, Korea Hosted by KAIST(Korea Advanced Institute of Science and Technology) and KISS(Korea Information Science Society) Sponsored by MIC (Ministry of Information and Communication) and KOSEF (Korea Science and Engineering Foundation) This symposium is intended to provide a forum for researchers working in algorithms and theory of computation. It will be held in Taejon which is famous with hot spring resort and historical landmarks of the ancient(18 B.C-A.D.660) civilization. Taejon is also surrounded by beautiful mountains - Kyeryoung, Daedoon and Pomun. Co-host KISS has been the professional organization in Korea for those in computer and information sciences since 1973. The symposium is hosted in celebration of KISS's 25th anniversary. Organization ------------ o Program Committee Chair * Kyung-Yong Chwa (Co-Chair; KAIST, Korea) * Oscar Ibara (Co-Chair; UC Santa Barbara, USA) o Program Committee * Takao Asano (Chuo U., Japan) * Ding-Zhu Du (U. of Minnesota, USA) * Susanne Hambrusch (Purdue U., USA) * Hiroshi Imai (U. of Tokyo, Japan) * Tao Jiang (McMaster U., Canada) * Sam Kim (Kyungpook Nat. U., Korea) * D.T. Lee (Northwestern U., USA) * Ming Li (U. of Waterloo, Canada) * Pandu Rangan (IIT, Madras, India) * Sartaj Sahni (U. of Florida, USA) * P. Spirakis (Comp. Tech. Inst., Patras, Greece) * Roberto Tamassia (Brown U., USA) * Shanghua Teng (U. of Illinois, USA) * Osamu Watanabe (Tokyo Inst. Tech., Japan) * Peter Widmayer (ETH, Zurich, Switzerland) * Chee K. Yap (Courant Inst. NYU, USA) * Hsu-Chun Yen (National Taiwan U., Taiwan) o Organizing Committee Chair * Jik Hyun Chang (Sogang U., Korea) o Organizing Committee * Hee-Chul Kim (Hankuk U. of Foreign Studies, Korea) * Sang-Ho Lee (Ewha Womans U., Korea) * Kunsoo Park (Seoul National U., Korea) Invited Speaker --------------- o Bernard Chazelle(Princeton University and Ecole Polytechnique) "The Discrepancy Method" o Roberto Tamassia(Brown University) "Implementing Algorithms and Data Structures: an Educational and Research Perspective" Preliminary Program ------------------- Sunday, December 13, 1998 6:00 Early Registration 8:00 Welcome Reception Monday, December 14, 1998 8:30 Registration 9:20 Opening Address Invited Presentation 9:30 The Discrepancy Method - Abstract Bernard Chazelle (Princeton and Ecole Polytechnique) Coffee Break: 10:30 -- 11:00 Session 1A: Geometry I 11:00 $L_\infty$ Voronoi Diagrams and Applications to VLSI Layout and Manufacturing Evanthia Papadopoulou 11:30 Facility Location on Terrains Boris Aronov, Marc van Kreveld, René van Oostrum, Kasturirangan Varadarajan 12:00 Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles Joonsoo Choi, Chan-Su Shin, Sung Kwon Kim Session 1B: Complexity I 11:00 Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words Hiroki Arimura, Shinichi Shimozono 11:30 Disjunctions of Horn Theories and their Cores Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino 12:00 Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung Lunch: 12:30 --- 2:00 Session 2A: Graph Drawing 2:00 Two-Layer Planarization in Graph Drawing Petra Mutzel, René Weiskircher 2:30 Computing Orthogonal Drawings in a Variable Embedding Setting Walter Didimo, Giuseppe Liotta 3:00 Dynamic Grid Embedding with Few Bends and Changes Ulrik Brandes, Dorothea Wagner Session 2B: On-line Algorithm and Scheduling 2:00 Two New Families of List Update Algorithms Frank Schulz 2:30 An Optimal Algorithm for On-line Palletizing at Delivery Industry J. Rethmann, E. Wanke 3:00 On-Line Scheduling of Parallel Jobs with Runtime Restrictions Stefan Bischof, Ernst W. Mayr Coffee Break: 3:30 -- 4:00 Session 3A: CAD/CAM and Graphics 4:00 Testing the Quality of Manufactured Disks and Cylinders Prosenjit Bose, Pat Morin 4:30 Casting with Skewed Ejection Direction Hee-kap Ahn, Siu-Wing Cheng, Otfried Cheong 5:00 Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu Session 3B: Graph Algorithm I 4:00 k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki 4:30 Polyhedral Structure of Submodular and Posi-modular Systems Hiroshi Nagamochi, Toshihide Ibaraki 5:00 Maximizing the Number of Connections in Optical Tree Networks Thomas Erlebach, Klaus Jansen Tuesday, December 15, 1998 Invited Presentation 9:00 Implementing Algorithms and Data Structures: an Educational and Research Perspective - Abstract Roberto Tamassia (Brown) Session 4: Best Paper Presentation 10:00 Selecting the k Largest Elements with Parity Tests Tak Wah Lam, Hing Fung Ting Coffee Break: 10:30 -- 11:00 Session 5A: Randomized Algorithm 11:00 Randomized K-Dimensional Binary Search Trees Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez 11:30 Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks Koji Nakano, Stephan Olariu 12:00 Random Regular Graphs with Edge Faults: Expansion through Cores Andreas Goerdt Session 5B: Complexity II 11:00 A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem Takashi Mihara, Shao Chin Sung 11:30 Generalized Graph Colorability and Compressibility of Boolean Formulae Richard Nock, Pascal Jappy, Jean Sallantin 12:00 On the Complexity of Free Monoid Morphisms Klaus-Jörn Lange, Pierre McKenzie Lunch: 12:30 --- 2:00 Session 6A: Graph Algorithm II 2:00 Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-Sheng Hsu, Ming-Tat Ko, Gen-Huey Chen 2:30 Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs Yaw-Ling Lin 3:00 Finding Planar Geometric Automorphisms in Planar Graphs Seok-Hee Hong, Peter Eades, Sang-Ho Lee Session 6B: Combinatorial Problem 2:00 A New Approach for Speeding Up Enumeration Algorithms Takeaki Uno 2:30 Hamiltonian Decomposition of Recursive Circulants Jung-Heum Park 3:00 Convertibility among Grid Filling Curves Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama Coffee Break: 3:30 -- 4:00 Session 7A: Geometry II 4:00 Generalized Self-Approaching Curves Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote 4:30 The Steiner Tree Problem in $\lambda_4$-geometry Plane Guo-Hui Lin, Guoliang Xue Session 7B: Computational Biology 4:00 Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-free Languages Tatsuya Akutsu 4:30 On the Multiple Gene Duplication Problem Michael Fellows, Michael Hallett, Ulrike Stege 7:00 Conference Banquet Wednesday, December 16, 1998 Session 8A: Geometry III 9:00 Visibility Queries in Simple Polygons and Applications Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang 9:30 Quadtree Decomposition, Steiner Triangulation, and Ray shooting Siu-Wing Cheng, Kam-Hing Lee 10:00 Optimality and Integer Programming Formulations of Triangulations in General Dimension Akira Tajima Session 8B: Approximation Algorithm 9:00 Space-efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs Philip N. Klein, Hsueh-I Lu 9:30 A Capacitated Vehicle Routing Problem on a Tree Shin-ya Hamaguchi, Naoki Katoh 10:00 Approximation Algorithms for Some Optimum Communication Spanning Tree Problems Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang Coffee Break: 10:30 -- 11:00 Session 9A: Complexity III 11:00 The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees Xiao Zhou, Takao Nishizeki 11:30 Inapproximability Results for Guarding Polygons without Holes Stephan Eidenbenz 12:00 The Inapproximability of Non NP-hard Optimization Problems Liming Cai, David Juedes, Iyad Kanj Session 9B: Parallel and Distributed Algorithm 11:00 An Efficient NC Algorithm for a Sparse $k$-Edge-Connectivity Certificate Hiroshi Nagamochi, Toru Hasunuma 11:30 A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution J. Diaz, J. Petit, P. Psycharis, M. Serna 12:00 Optimal Approximate Agreement with Omission Faults Richard Plunkett, Alan Fekete 12:30: Lunch Proceedings ----------- Accepted papers will be published in the proceedings of the symposium(Lecture Notes in Computer Science, Springer-Verlag). Some selected papers will appear in Theoretical Computer Science as special issues. Further Information ------------------- If you have any question and request, do not hesitate to ask us. Fax number is +82-42-869-3510 and e-mail address is isaac98@jupiter.kaist.ac.kr. The detailed information for transportation(including time tables for buses and trains), conference site map, and tourist attractions can be found at our web site: http://jupiter.kaist.ac.kr/~isaac98/ General Information ------------------- * Location ISAAC'98 will be held at Riviera Hotel in Taejon. Taejon city is situated in the geographical center of South Korea. The city of 1.3 million is also surrounded by historical landmarks of the ancient Paekche civilization(18B.C - A.D.660) Mt.Daedoon Provincial Park, Mt.Kyeryoung National Park, Mt.Pomun Park and Yusung, Korea's famous hot spring resort are all within a 30 minute drive. * Weather Weather in December is mostly cold with occasional snows. Temperature ranges between -5 degrees Centigrade and -2.5 degrees Centigrade(23F - 27.5F). * Currency Exchange US $1 is about 1350 won. But nowadays, the exchange rate is fluctuating very much. You can get the current exchange rate from internet. (http://www.koexbank.co.kr/exchange_rating/newexchange2.html) The unit of Korean currency is the "won". Coin denominations are 10 won, 50 won, 100 won, 500 won. Bank notes are 1,000 won, 5,000 won, 10,000 won. Foreign bank notes and traveler's checks can be converted into Korean won at foreign exchange banks and other authorized money changers. Credit cards, including VISA and Master Cards are accepted at hotels, department stores and restaurants. * Passport and Visa Every foreign visitor entering Korea must present a valid passport. Delegates from countries requiring visas should apply at the Korean consular offices of diplomatic missions in their respective countries before their departure. Visitors from some countries may stay 15 days without VISA. For the details, participants are advised to contact their local travel agent, carrier or Korean diplomats. Accommodation ------------- Two hotels have been chosen as standard lodging for the conference. One is Riviera hotel(the conference venue), and the other is Top hotel (within easy walking distance to Riviera Hotel). We have arranged for special conference rates at these hotels. You can find more detailed information in the registration/accommodation form below. Transportation -------------- o Conference Location The conference location, Taejon city, is located at the center of Korea's transportation network - about 100 miles south from Seoul and 200 miles north from Pusan. Seoul(Kimpo) airport and Pusan(Kimhae) airport are two major airports, but there is no direct public transportation to the conference venue. o How to get there Refer to the Web page at http://jupiter.kaist.ac.kr/~isaac98/ In the Web page, you can obtain the detail information about the tranportation. Registration ------------ You can register ISAAC'98 early by FAX or postal mail. There is also Hotel reservation form in this registration form. * Pre-registration Deadline: November 6, 1998 * Hotel information -- here * Registration fee ------------------------------------------------------------------ Before November 6,1998 After November 6, 1998/On-site ------------------------------------------------------------------ Regular US $300 US $360 Student US $200 US $240 ------------------------------------------------------------------ Please, complete the form(with the payment) and send it to the following address(FAX or postal mail only): Fax: +82-2-360-2306 Address:Ms. Cho, Tae-Nam Dept. of Computer Science and Engineering College of Engineering, Ewha Womans University 11-1 Daehyun-dong, Seodaemun-ku, Seoul, Korea 120-750 (E-Mail:isaac98@mm.ewha.ac.kr) ------------------------------ cut here ----------------------------------- ======================================================================= ISAAC'98 REGISTRATION/ACCOMMODATION FORM ======================================================================= Mail or fax to: Ms. Cho, Tae-Nam, Dept. of Computer Science and Engineering College of Engineering, Ewha Womans University, 11-1 Daehyun-dong, Seodaemun-ku, Seoul, Korea 120-750 Fax: +82-2-360-2306 __ Male __ Female __ Dr. __ Prof. __ Researcher & Engineer __ Student __ Other (please specify)_________________ Family name:_________________ Given name:_________________ Affiliation:_________________________________________ Address:_____________________________________________ _____________________________________________________ _____________________________________________________ Phone:_________________ Fax:________________________ Email:_______________________________________________ ------------------------------------------------------ Registration Before Nov. 6 After Nov. 6 ====================================================== Regular US $300 ___ US $360 ___ Student US $200 ___ US $240 ___ ------------------------------------------------------ Registration covers a copy of proceedings, reception on Dec. 13, 3 lunches, coffee and banquet on Dec. 15. The student fee does not include the banquet. ----------------------------------------------------- Additional Tickets Number Amount ===================================================== Banquet(US $50 each) ______ ______ ----------------------------------------------------- ----------------------------------------------------------- Hotel Rates(Daily rates in US dollars per room (incl.tax).) =========================================================== Category Riviera (4 star) Top =========================================================== Single(1) 95,000 won ___ 39,000 won ___ Double(2) 105,000 won ___ 48,000 won ___ Ondol(2) 95,000 won ___ 39,000 won ___ ----------------------------------------------------------- (Ondol means a Korean traditional room which is heated by Korean under-floor heating system. There are no beds in the Ondol room. US $1 is about 1350 won. The exchange rate is fluctuating very much.) Arrival Date:_____________ Departure Date:_____________ I wish to share my room with:____________________________ (We will make a hotel reservation for you. To guarantee your reservation, a nonrefundable deposit(US $50) is required. The remaining hotel charge should be paid directly to the hotel.) Grand Total ============ Registration fee + Room deposit + Banquet tickets (optional) = _______________ Payment ======== All payments should be made in US dollar through one of the following means. Bank transfer is highly recommended. * Bank transfer ---------------- Name of the bank: Korea Exchange Bank Pangbaidong branch, Seoul, Korea Account number: 099-JSD-100740 Name of Account holder : KISS Please enclose a copy of the bank transfer when sending the registration form. * By credit card. Please complete ----------------- ___ VISA ___ MASTER Card Number:_____________________________________________ Card Holder Name:________________________________________ Card Holder Address:_____________________________________ _________________________________________________________ Expires:_____________ Signature:________________________ Registration/reservation will be confirmed only after payment has been received. Cancellation ============= In case of the cancellation, written notification should be sent to Ms. Cho, Tae-Nam. Registration fee, excluding 20% of the fee, will be refunded only for cancellations made before November 6, 1998. No refunds will be given for cancellations made after this date. ------------- 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 From compgeom-owner@research.bell-labs.com Thu Oct 8 21:12:07 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id VAA24463; Thu, 8 Oct 1998 21:11:56 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Oct 8 15:03:36 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Thu Oct 8 09:51:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Oct 8 09:50:34 EDT 1998 Received: from burdell.cc.gatech.edu ([130.207.3.207]) by dusty; Thu Oct 8 09:50:33 EDT 1998 Received: from gvu1.cc.gatech.edu (root@gvu1.cc.gatech.edu [130.207.119.241]) by burdell.cc.gatech.edu (8.9.1/8.9.1) with ESMTP id JAA07477 for ; Thu, 8 Oct 1998 09:50:32 -0400 (EDT) Received: from [130.207.3.99] (rossignac.cc.gatech.edu [130.207.3.99]) by gvu1.cc.gatech.edu (8.9.1/8.9.1) with ESMTP id JAA10070 for ; Thu, 8 Oct 1998 09:50:26 -0400 (EDT) X-Sender: jarek@gvu1.cc.gatech.edu Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Wed, 7 Oct 1998 17:36:58 -0400 To: compgeom-announce@research.bell-labs.com From: Jarek Rossignac Subject: October 29 submission deadline for ACM I3DG Precedence: bulk Status: RO Content-Length: 1895 Lines: 46 Every two years, the ACM Symposium on Interactive 3D Graphics (I3DG) brings together students, young researchers, pioneers, and industry decision makers in interactive 3D graphics technologies and applications. It gives you the opportunity to present your work, check on the latest trends, to recruit, to find jobs, and to establish new collaborations. The I3DG'99 Symposium will take on April 26-28, 1999 in Atlanta and will be hosted by the GVU Center. Further information is available at http://www.gvu.gatech.edu/i3dg/. Please note that the deadline for paper submission is October 29, 1998 with en Email abstract requested by October 15. Please do the effort now to submit your best work in this area and be so kind as to remind your colleagues of this opportunity. Thank you - Jarek Rossignac, Chair __________________________________________ Jarek Rossignac, Professor and Director GVUCenter College of Computing, Room 241 Georgia Institute of Technology 801 Atlantic Drive, NW Atlanta, GA 30332-0280 Phone: 404/894-0671, Fax: 404/894-0673 mailto:jarek@cc.gatech.edu http://www.gvu.gatech.edu/people/faculty/jarek.rossignac/ For schedule related issues, please ontact and CC: Vicky Skelton, 404/894-0075, mailto:vskelton@cc.gatech.edu Note that GVU will host the 1999 ACM Symposium on Interactive 3D Graphics: http://www.gvu.gatech.edu/i3dg/ Papers should be submitted before October 29, 1998. Also note that the International Conference on Visual Computing (ICVC99) will be held in Goa, India, February 23-26, 1999: http://www.ncst.ernet.in/~icvc99 Papers should be submitted before October 15, 1998. ------------- 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 From compgeom-owner@research.bell-labs.com Fri Oct 9 17:05:35 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id RAA02556; Fri, 9 Oct 1998 17:04:41 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Oct 9 10:58:18 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Thu Oct 8 15:13:04 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Oct 8 15:11:47 EDT 1998 Received: from alpha.xerox.com ([13.1.64.93]) by dusty; Thu Oct 8 15:11:44 EDT 1998 Received: from redstart.parc.xerox.com ([13.2.116.100]) by alpha.xerox.com with SMTP id <54137(1)>; Thu, 8 Oct 1998 12:11:39 PDT Received: by redstart.parc.xerox.com id <12184>; Thu, 8 Oct 1998 12:11:27 PDT From: Marshall Bern To: compgeom-announce@research.bell-labs.com Subject: Call for Papers - ACM Symp. on Computational Geometry Message-Id: <98Oct8.121127pdt."12184"@redstart.parc.xerox.com> Date: Thu, 8 Oct 1998 12:11:27 PDT Precedence: bulk Status: RO Content-Length: 7690 Lines: 204 CALL FOR PAPERS Fifteenth Annual ACM Symposium on COMPUTATIONAL GEOMETRY June 13--16, 1999 Miami Beach, Florida http://www.cs.miami.edu/events/SCG99/ Sponsored by ACM SIGACT & SIGGRAPH The 1999 ACM Symposium on Computational Geometry, featuring an applied track, a theoretical track, and a video review, will be held at the Radisson Deauville Resort in Miami Beach, Florida. We invite submissions that address applications of geometric computing, for the applied track, or fundamental problems of geometric computing, for the theoretical track. During the conference, sessions of presentations will alternate between the two tracks, rather than being in parallel. The proceedings, with the papers of both tracks, will be distributed at the symposium and will subsequently be available for purchase from ACM. A selection of papers will be invited to special issues of journals. The conference will accept electronic submissions of postscript files; guidelines will be available via the conference homepage, given above. Topics for the applied track include, but are not limited to experimental analysis of algorithms and data structures; robotics and virtual worlds; computer graphics, simulation and visualization; image processing; geometric and solid modeling; computer aided geometric design; manufacturing; geographical information systems. Electronic submissions are preferred, but authors may instead mail 14 copies of an extended abstract to arrive by December 4, 1998 to: John Canny Computer Science Division 529 Soda Hall Berkeley, CA 94720-1776 Phone: (510) 642-9955 jfc@cs.berkeley.edu Topics for the theoretical track include, but are not limited to: theoretical analysis of geometric algorithms and data structures; discrete and combinatorial geometry; mathematical and numerical issues arising from implementations. Electronic submissions are preferred, but authors may instead mail 8 copies of an extended abstract to arrive by December 4, 1998 to: Marshall Bern Xerox PARC 3333 Coyote Hill Road Palo Alto, CA 94304-1314 Phone: (650) 812-4443 bern@parc.xerox.com Important Dates December 4, 1998: Extended abstract due, both tracks February 13, 1999: Video submissions due February 15, 1999: Notification of acceptance or rejection of papers March 1, 1999: Notification of acceptance or rejection of videos March 15, 1999: Camera-ready papers due April 15, 1999: Final versions of videos due June 13-16, 1999: Symposium Papers that primarily address practical issues and implementation experience, even if not tied to a particular application domain, should be submitted to the applied track. Papers that primarily prove theorems should be submitted to the theoretical track. Most experimental work should be submitted to the applied track; an exception would be experiments in support of mathematical investigations. Submissions to one track may be forwarded to the other for consideration, unless the authors have explicitly stated interest in one track only. An extended abstract sent to a program committee should begin with a succinct statement of the problems and goals of the paper, the main results, and the significance of the work in the context of previous research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages at a reasonable font size. An optional appendix may be included, but this will be used at the program committee's discretion. Abstracts in hard copy must be received by December 4, 1998, or postmarked by November 27 and sent airmail. Electronic submissions are also due December 4. These are firm deadlines: late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 1999. A full version of each contribution in final form will be due by March 15, 1999 for inclusion in the proceedings. Conference Chair: Victor Milenkovic (U Miami) vjm@cs.miami.edu Applied Track Program Committee: Pankaj Agarwal (Duke) Nina Amenta (U Texas) Amy Briggs (Middlebury College) John Canny, Chair (Berkeley) David Dobkin (Princeton) Dan Halperin (Tel Aviv) Yan-Bin Jia (Carnegie-Mellon) Lydia Kavraki (Rice) Jean-Claude Latombe (Stanford) Dinesh Pai (U British Columbia) Jonathan Shewchuk (Berkeley) Jack Snoeyink (U British Columbia) Frank van der Stappen (Utrecht) Theoretical track Program Committee: Marshall Bern, Chair (Xerox PARC) Herve Bronnimann (INRIA Sophia-Antipolis) Timothy Chan (U Miami) David Eppstein (UC-Irvine) Bernd Gaertner (ETH Zuerich) Jacob E. Goodman (City College, CUNY) Anna Lubiw (U Waterloo) CALL FOR VIDEOS 8th Annual Video Review of Computational Geometry Background: This video review showcases the use of visualization in computational geometry for exposition and education, as an interface and a debugging tool in software development, and for the visual exploration of geometry in research. Algorithm animations, visual explanations of structural theorems, descriptions of applications of computational geometry, and demonstrations of software systems are all appropriate. Videos that accompany papers or communications submitted to the technical program committee are encouraged. Submissions: Authors should send one preview copy of a videotape to the address below by February 13, 1999. The videotape should be at most eight minutes long (three to five minutes, preferred), and be in VHS NTSC or VHS PAL format. Each video tape must be accompanied by a one- or two-page description of the material shown in the video, and where applicable, the techniques used in the implementation. Please format descriptions following the guidelines for ACM proceedings. Additional material describing the contents of the videos, such as the full text of accompanying papers, may also be included. Textual material may be submitted electronically by e-mailing either the URL of a PostScript file (preferred) or the PostScript file itself to jeffe@cs.uiuc.edu. If electronic submission is impossible, authors should include 5 hardcopies of the accompanying text with their video. Videotapes and accompanying text should be sent to: Jeff Erickson Department of Computer Science University of Illinois 1304 W. Springfield Ave. Urbana, IL 61801 Phone: (217) 333-6769 For customs purposes, it is best to declare a value of $5. If you have questions, please contact the committee chair at jeffe@cs.uiuc.edu or (217) 333-6769. Notification: Authors will be notified of acceptance or rejection, and given reviewers' comments by March 1, 1999. For each accepted video, the final version of the textual description will be due by March 15, 1999 for inclusion in the proceedings. Final versions of accepted videos will be due April 15, 1999 in the best format available. The accepted videos will be edited onto one tape, which will be shown at the conference, distributed to the participants, and available from ACM after the conference. Video Program Committee: Danny Chen (Notre Dame) Jeff Erickson, Chair (U Illinois) John Sullivan (U Illinois) Subhash Suri (Washington U) Shang-Hua Teng (U Illinois) ------------- 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 From compgeom-owner@research.bell-labs.com Fri Oct 9 17:13:22 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id RAA02817; Fri, 9 Oct 1998 17:12:11 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Oct 9 11:01:03 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Thu Oct 8 15:17:03 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Oct 8 15:16:19 EDT 1998 Received: from alpha.xerox.com ([13.1.64.93]) by dusty; Thu Oct 8 15:16:15 EDT 1998 Received: from redstart.parc.xerox.com ([13.2.116.100]) by alpha.xerox.com with SMTP id <54166(3)>; Thu, 8 Oct 1998 12:16:10 PDT Received: by redstart.parc.xerox.com id <12184>; Thu, 8 Oct 1998 12:15:56 PDT From: Marshall Bern To: compgeom-announce@research.bell-labs.com Subject: Call for Papers -- ACM Symp. Comp. Geometry (LaTeX version) Message-Id: <98Oct8.121556pdt."12184"@redstart.parc.xerox.com> Date: Thu, 8 Oct 1998 12:15:56 PDT Precedence: bulk Status: RO Content-Length: 9547 Lines: 289 \documentclass{article} \usepackage{multicol} \pagestyle{empty} \textwidth=6.5in \textheight=9in \oddsidemargin=0in \evensidemargin=0in \topmargin -.5in \begin{document} \vskip 1.5cm \begin{center} {\large \bf CALL FOR PAPERS} \\[4mm] {\Large \bf Fifteenth Annual ACM Symposium on} \\[2mm] {\Large \bf COMPUTATIONAL GEOMETRY} \\[7mm] {\large \bf June 13--16, 1999}\\ {\large \bf Miami Beach, Florida}\\ {\large \tt http://www.cs.miami.edu/events/SCG99/}\\[4mm] {\large Sponsored by ACM SIGACT \& SIGGRAPH} \end{center} \noindent The 1999 ACM Symposium on Computational Geometry, featuring an applied track, a theoretical track, and a video review, will be held at the Radisson Deauville Resort in Miami Beach, Florida. We invite submissions that address \begin{itemize} \setlength{\parskip}{0pt} \setlength{\parsep}{0pt} \setlength{\itemsep}{0pt} \item applications of geometric computing, for the applied track, or \item fundamental problems of geometric computing, for the theoretical track. \end{itemize} During the conference, sessions of presentations will alternate between the two tracks, rather than being in parallel. The proceedings, with the papers of both tracks, will be distributed at the symposium and will subsequently be available for purchase from ACM. A selection of papers will be invited to special issues of journals. %\smallskip \noindent The conference will accept electronic submissions of postscript files; guidelines will be available via the conference homepage, given above. \noindent \setlength{\columnseprule}{0.5pt} \begin{multicols}{2} \raggedcolumns Topics for the applied track include, but are not limited to: % {\em experimental analysis of algorithms and data structures; robotics and virtual worlds; computer graphics, simulation and visualization; image processing; geometric and solid modeling; computer aided geometric design; manufacturing; geographical information systems. } Electronic submissions are preferred for the applied track, but authors may instead mail 14 copies of an extended abstract to arrive by {\bf December 4, 1998} to: \begin{center} John Canny \\* Computer Science Division \\* 529 Soda Hall \\* Berkeley, CA 94720-1776\\* Phone: (510) 642-9955 \\* {\tt jfc@cs.berkeley.edu}\\* \end{center} Topics for the theoretical track include, but are not limited to: % {\em theoretical analysis of geometric algorithms and data structures; discrete and combinatorial geometry; mathematical and numerical issues arising from implementations. } Electronic submissions are preferred for the theoretical track, but authors may instead mail 8 copies of an extended abstract to arrive by {\bf December 4, 1998} to: \begin{center} Marshall Bern\\ Xerox PARC \\ 3333 Coyote Hill Road\\ Palo Alto, CA 94304-1314\\ Phone: (650) 812-4443\\ {\tt bern@parc.xerox.com} \end{center} \end{multicols} \vfill \medskip\noindent {\sc Important Dates}\\ {\bf December 4, 1998:} Extended abstract due, both tracks\\ {\bf February 13, 1999:} Video submissions due\\ {\bf February 15, 1999:} Notification of acceptance or rejection of papers \\ {\bf March 1, 1999:} Notification of acceptance or rejection of videos \\ {\bf March 15, 1999:} Camera-ready papers due\\ {\bf April 15, 1999:} Final versions of videos due\\ {\bf June 13--16, 1999:} Symposium \newpage% in 10pt \medskip\noindent Papers that primarily address practical issues and implementation experience, even if not tied to a particular application domain, should be submitted to the applied track. Papers that primarily prove theorems should be submitted to the theoretical track. Most experimental work should be submitted to the applied track; an exception would be experiments in support of mathematical investigations. Submissions to one track may be forwarded to the other for consideration, unless the authors have explicitly stated interest in one track only. An extended abstract sent to a program committee should begin with a succinct statement of the problems and goals of the paper, the main results, and the significance of the work in the context of previous research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages at a reasonable font size. An optional appendix may be included, but this will be used at the program committee's discretion. Abstracts in hard copy must be received by December 4, 1998, or postmarked by November 27 and sent airmail. Electronic submissions are also due December 4. These are firm deadlines: late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 1999. A full version of each contribution in final form will be due by March 15, 1999 for inclusion in the proceedings. \\[1mm] %\newpage % for 11point % \begin{tabbing} \noindent{\bf Conference Chair:} \=Victor Milenkovic (U Miami)\+\\ {\tt vjm@cs.miami.edu}\\[2mm] \end{tabbing} % {\bf Program Committees:} \setlength{\columnseprule}{0pt} \begin{multicols}{2} \raggedcolumns \noindent {\bf Applied track:}\\[2mm] {%\small Pankaj Agarwal (Duke)\\* Nina Amenta (U Texas)\\* Amy Briggs (Middlebury College)\\* John Canny, Chair (Berkeley)\\* David Dobkin (Princeton)\\* Dan Halperin (Tel Aviv)\\* Yan-Bin Jia (Carnegie-Mellon)\\* Lydia Kavraki (Rice)\\* Jean-Claude Latombe (Stanford)\\* Dinesh Pai (U British Columbia)\\* Jonathan Shewchuk (Berkeley)\\* Jack Snoeyink (U British Columbia)\\* Frank van der Stappen (Utrecht)\\ } \noindent {\bf Theoretical track:}\\[2mm] {%\small Marshall Bern, Chair (Xerox PARC)\\ Herv\'e Br\"onnimann (INRIA Sophia-Antipolis)\\ Timothy Chan (U Miami)\\ David Eppstein (UC-Irvine)\\ Bernd G\"artner (ETH Z\"urich)\\ Jacob E. Goodman (City College, CUNY)\\ Anna Lubiw (U Waterloo)\\ } \setcounter{unbalance}{2} \end{multicols} \newpage%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% \begin{center}{\bf CALL FOR VIDEOS\\ \vskip 8pt {\sc 8th Annual Video Review of Computational Geometry}\\ \vskip 8pt to be presented at the\\ \vskip 8pt Fifteenth Annual ACM Symposium on Computational Geometry\\ June 13--16, 1999\\ Miami Beach, Florida } \end{center} \vskip 9pt \noindent Videos are sought for a video review of computational geometry. \smallskip\noindent {\bf Background:} This video review showcases the use of visualization in computational geometry for exposition and education, as an interface and a debugging tool in software development, and for the visual exploration of geometry in research. Algorithm animations, visual explanations of structural theorems, descriptions of applications of computational geometry, and demonstrations of software systems are all appropriate. Videos that accompany papers or communications submitted to the technical program committee are encouraged. \smallskip\noindent {\bf Submissions:} Authors should send one preview copy of a videotape to the address below by {\bf February 13, 1999}. The videotape should be at most eight minutes long (three to five minutes, preferred), and be in VHS NTSC or VHS PAL format. Each video tape must be accompanied by a one- or two-page description of the material shown in the video, and where applicable, the techniques used in the implementation. Please format descriptions following the guidelines for ACM proceedings. Additional material describing the contents of the videos, such as the full text of accompanying papers, may also be included. Textual material may be submitted electronically by e-mailing either the URL of a PostScript file (preferred) or the PostScript file itself to {\tt jeffe@cs.uiuc.edu}. If electronic submission is impossible, authors should include 5 hardcopies of the accompanying text with their video. \smallskip\noindent Videotapes and accompanying text should be sent to: \begin{center} Jeff Erickson\\ Department of Computer Science\\ University of Illinois\\ 1304 W. Springfield Ave.\\ Urbana, IL 61801\\ Phone: (217) 333-6769 \end{center} \smallskip\noindent For customs purposes, it is best to declare a value of \$5. If you have questions, please contact the committee chair at {\tt jeffe@cs.uiuc.edu} or (217) 333-6769. \smallskip\noindent {\bf Notification:} Authors will be notified of acceptance or rejection, and given reviewers' comments by March 1, 1999. For each accepted video, the final version of the textual description will be due by March 15, 1999 for inclusion in the proceedings. Final versions of accepted videos will be due April 15, 1999 in the best format available. The accepted videos will be edited onto one tape, which will be shown at the conference, distributed to the participants, and available from ACM after the conference. \medskip\noindent \begin{multicols}{2}[{\noindent {\bf Video Program Committee:}}] \raggedcolumns \noindent Danny Chen (Notre Dame)\\ Jeff Erickson, Chair (U Illinois)\\ John Sullivan (U Illinois)\\ Subhash Suri (Washington U)\\ Shang-Hua Teng (U Illinois)\\ %\setcounter{unbalance}{2} \end{multicols} \end{document} ------------- 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 From compgeom-owner@research.bell-labs.com Fri Oct 9 17:16:02 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id RAA02918; Fri, 9 Oct 1998 17:15:52 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Oct 9 11:02:18 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Thu Oct 8 15:25:01 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Oct 8 15:24:51 EDT 1998 Received: from ntadminexc.ansys.com ([192.104.24.222]) by dusty; Thu Oct 8 15:24:48 EDT 1998 Received: by ntadminexc.ansys.com with Internet Mail Service (5.0.1458.49) id <43KLFKS8>; Thu, 8 Oct 1998 15:24:39 -0400 Message-ID: <7D70697C0E38D111B4FF080036B39A03894773@ntdevexc.ansys.com> From: Steve Owen To: compgeom-announce@research.bell-labs.com Subject: Symposium on Trends in Unstructured Mesh Generation Date: Thu, 8 Oct 1998 15:24:51 -0400 X-Priority: 3 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.0.1458.49) Content-Type: text/plain Precedence: bulk Status: RO Content-Length: 2740 Lines: 64 =========================================================== Fifth US National Congress on Computational Mechanics 2nd Symposium on Unstructured Mesh Generation University of Colorado, Boulder August 4-6, 1999 =========================================================== Abstracts and papers are invited dealing with all aspects of unstructured mesh generation, including, but not limited to: all-hex or hex-dominant meshing, mesh sweeping, tet meshing, tri or quad surface meshing, mesh strategies for shape optimization, mesh control schemes, adaptive meshing algorithms, a priori mesh quality improvement, geometry decomposition, repair and/or simplification techniques for CAD geometry, parallel implementations, p-element (coarse) meshing, mesh smoothing, and large mesh manipulation and storage. Additional information on the symposium can be found at: http://www.andrew.cmu.edu/user/sowen/usccm99/ Information on the Fifth US National Congress on Computational Mechanics can be found at: http://bechtel.colorado.edu/usccm99/ Abstracts are required for the conference and will be included in the conference proceedings. For format information, see: http://bechtel.colorado.edu/usccm99/Abstracts.d/Instructions.html Submit a one page electronic version of your abstract by JANUARY 5, 1999 to Dr. Scott A. Canann, scott.canann@ansys.com. Feel free to call (724) 514-2981, if you have any questions. You can also ftp them to anonymous ftp: ftp.ansys.com (login: anonymous password: email address Place the file in /pub/mesh) and send an email to Dr. Scott Canann to let know him that it is there. For inclusion in this symposia, full length papers (in addition to the one page abstract) are requested, but not required. A collection of the final papers are planned to be combined into a special edition of the International Journal for Numerical Methods in Engineering (IJNME). Papers should all be submitted using the formatting and submission guidelines given in that journal. Instructions for authors and information about IJNME may be found at: http://www.interscience.wiley.com/jpages/0029-5981/ All papers must be submitted to Dr. Cannan by email or anonymous ftp by MARCH 29, 1999. EMAIL OR FTP SUBMISSION OF A POSTSCRIPT FILE IS REQUIRED FOR BOTH THE ABSTRACT AND THE PAPER. Symposium Co-Chairs Scott A. Canann, Ansys, Inc. scott.canann@ansys.com Sunil Saigal, Carnegie Mellon University saigal+@andrew.cmu.edu Steven J. Owen, Ansys, Inc. steve.owen@ansys.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 From compgeom-owner@research.bell-labs.com Thu Oct 15 18:01:31 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id RAA10281; Thu, 15 Oct 1998 17:58:41 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Oct 15 11:48:25 EDT 1998 To: compgeom-announce@research.bell-labs.com Received: from research.research.bell-labs.com by netlib2; Sat Oct 10 02:31:01 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Sat Oct 10 02:30:29 EDT 1998 Received: from ori.zcu.cz ([147.228.52.11]) by dusty; Sat Oct 10 02:30:28 EDT 1998 Received: from uk426-kiv-pc4.zcu.cz (uk426p03-kiv.fav.zcu.cz [147.228.43.54]) by ori.zcu.cz (8.9.1a/8.9.1) with SMTP id IAA17521 for ; Sat, 10 Oct 1998 08:30:27 +0200 (MET DST) Message-ID: <004701bdf41f$da334ac0$362be493@uk426-kiv-pc4.zcu.cz> From: "Vaclav Skala" To: Subject: REMINDER WSCG99 Deadline 15.10.98 Int.Conf.in Plzen, Close Prague, Czech Republic Date: Sat, 10 Oct 1998 08:30:26 +0100 MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="----=_NextPart_000_0044_01BDF428.3B8234A0" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 4.72.3110.5 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3 Precedence: bulk Status: RO Content-Length: 15782 Lines: 438 This is a multi-part message in MIME format. ------=_NextPart_000_0044_01BDF428.3B8234A0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable X-MIME-Autoconverted: from 8bit to quoted-printable by ori.zcu.cz id IAA17521 Dear friends, please, find enclosed information on 7-th WSCG Int.Conf. in Plzen close t= o Prague Czech Republic Fundamental algorithms Rendering and visualization Virtual reality Parallel and distributed graphics Viewing dynamic worlds Surface meshing Geometric modelling Animation Computer aided geometric design Morphing and warping Computational geometry = WWW technologies Medical imaging Graphical interaction and standards Multimedia Object-oriented graphics Image processing&computer vision Fractals CAD/CAM, DTP and GIS systems Deadline October 15, 1998 Venue: February 8-12, 1999, Plzen, Czech Republic More info http://wscg.zcu.cz select WSCG99 Vaclav Skala ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Prof. Ing.Vaclav Skala,CSc. University of West Bohemia, Univerzitni 8, Box 314 306 14 Plzen-Bory Czech Republic Tel.: +420-19-7491-188, Fax: +420-19-7491-213 Secretary: Tel.: +420-19-7491-212 skala@kiv.zcu.cz, http://iason.zcu.cz/~skala >> for WSCG conferences: http://wscg.zcu.cz << Affiliated with: Multimedia Technology Research Centre, University of Bath BATH BA2 7AY, UNITED KINGDOM -------------------------------------------------------------------------= --- -------------------- -----Original Message----- From: Marshall Bern To: compgeom-announce@research.bell-labs.com Date: p=E1tek, =F8=EDjen 09, 1998 4:13 Subject: Call for Papers - ACM Symp. on Computational Geometry > > CALL FOR PAPERS > > Fifteenth Annual ACM Symposium on > COMPUTATIONAL GEOMETRY > > June 13--16, 1999 > Miami Beach, Florida > > http://www.cs.miami.edu/events/SCG99/ > > Sponsored by ACM SIGACT & SIGGRAPH > > >The 1999 ACM Symposium on Computational Geometry, featuring >an applied track, a theoretical track, and a video review, >will be held at the Radisson Deauville Resort in Miami Beach, Florida. >We invite submissions that address > applications of geometric computing, for the applied track, or > fundamental problems of geometric computing, for the theoretical track. >During the conference, sessions of presentations will alternate between >the two tracks, rather than being in parallel. The proceedings, >with the papers of both tracks, will be distributed at the symposium >and will subsequently be available for purchase from ACM. A selection >of papers will be invited to special issues of journals. >The conference will accept electronic submissions of postscript files; >guidelines will be available via the conference homepage, given above. > > >Topics for the applied track include, but are not limited to > experimental analysis of algorithms and data structures; > robotics and virtual worlds; > computer graphics, simulation and visualization; > image processing; > geometric and solid modeling; > computer aided geometric design; > manufacturing; > geographical information systems. >Electronic submissions are preferred, but authors may instead >mail 14 copies of an extended abstract to arrive by December 4, 1998 to: > > John Canny > Computer Science Division > 529 Soda Hall > Berkeley, CA 94720-1776 > Phone: (510) 642-9955 > jfc@cs.berkeley.edu > >Topics for the theoretical track include, but are not limited to: > theoretical analysis of geometric algorithms and data structures; > discrete and combinatorial geometry; > mathematical and numerical issues arising from implementations. >Electronic submissions are preferred, but authors may instead >mail 8 copies of an extended abstract to arrive by December 4, 1998 to: > > Marshall Bern > Xerox PARC > 3333 Coyote Hill Road > Palo Alto, CA 94304-1314 > Phone: (650) 812-4443 > bern@parc.xerox.com > > >Important Dates > > December 4, 1998: Extended abstract due, both tracks > February 13, 1999: Video submissions due > February 15, 1999: Notification of acceptance or rejection of papers > March 1, 1999: Notification of acceptance or rejection of videos > March 15, 1999: Camera-ready papers due > April 15, 1999: Final versions of videos due > June 13-16, 1999: Symposium > > >Papers that primarily address practical issues >and implementation experience, even if not tied to >a particular application domain, should be submitted to >the applied track. Papers that primarily prove theorems >should be submitted to the theoretical track. >Most experimental work should be submitted to the >applied track; an exception would be experiments >in support of mathematical investigations. >Submissions to one track may be forwarded >to the other for consideration, unless the authors have explicitly >stated interest in one track only. > >An extended abstract sent to a program committee >should begin with a succinct statement of the problems and goals of >the paper, the main results, and the significance of the work in the >context of previous research. The abstract should provide sufficient det= ail to >allow the program committee to evaluate the validity, quality, and >relevance of the contribution. The entire extended abstract should not >exceed 10 pages at a reasonable font size. >An optional appendix may be included, but this >will be used at the program committee's discretion. > >Abstracts in hard copy must be received by December 4, 1998, or >postmarked by November 27 and sent airmail. Electronic submissions are >also due December 4. These are firm deadlines: late submissions will >not be considered. Authors will be notified of acceptance or rejection >by February 15, 1999. A full version of each contribution in final >form will be due by March 15, 1999 for inclusion in the proceedings. > > > Conference Chair: Victor Milenkovic (U Miami) > vjm@cs.miami.edu > >Applied Track Program Committee: > > Pankaj Agarwal (Duke) > Nina Amenta (U Texas) > Amy Briggs (Middlebury College) > John Canny, Chair (Berkeley) > David Dobkin (Princeton) > Dan Halperin (Tel Aviv) > Yan-Bin Jia (Carnegie-Mellon) > Lydia Kavraki (Rice) > Jean-Claude Latombe (Stanford) > Dinesh Pai (U British Columbia) > Jonathan Shewchuk (Berkeley) > Jack Snoeyink (U British Columbia) > Frank van der Stappen (Utrecht) > >Theoretical track Program Committee: > > Marshall Bern, Chair (Xerox PARC) > Herve Bronnimann (INRIA Sophia-Antipolis) > Timothy Chan (U Miami) > David Eppstein (UC-Irvine) > Bernd Gaertner (ETH Zuerich) > Jacob E. Goodman (City College, CUNY) > Anna Lubiw (U Waterloo) > > > > CALL FOR VIDEOS > > 8th Annual Video Review of Computational Geometry > >Background: This video review showcases the use of visualization in >computational geometry for exposition and education, as an interface >and a debugging tool in software development, and for the visual >exploration of geometry in research. Algorithm animations, visual >explanations of structural theorems, descriptions of applications of >computational geometry, and demonstrations of software systems are all >appropriate. Videos that accompany papers or communications submitted >to the technical program committee are encouraged. > >Submissions: Authors should send one preview copy of a videotape to the >address below by February 13, 1999. The videotape should be at most eigh= t >minutes long (three to five minutes, preferred), and be in VHS NTSC >or VHS PAL format. > >Each video tape must be accompanied by >a one- or two-page description of the material >shown in the video, and where applicable, the techniques used >in the implementation. >Please format >descriptions following the guidelines for ACM proceedings. >Additional material describing the contents of the videos, such as the f= ull >text of accompanying papers, may also be included. > >Textual material may be submitted electronically by e-mailing either >the URL of a PostScript file (preferred) or the PostScript file >itself to jeffe@cs.uiuc.edu. >If electronic submission is impossible, authors should include >5 hardcopies of the accompanying text with their video. > >Videotapes and accompanying text should be sent to: > > Jeff Erickson > Department of Computer Science > University of Illinois > 1304 W. Springfield Ave. > Urbana, IL 61801 > Phone: (217) 333-6769 > >For customs purposes, it is best to declare a value of $5. If you have >questions, please contact the committee chair at >jeffe@cs.uiuc.edu or (217) 333-6769. > >Notification: Authors will be notified of acceptance or rejection, and >given reviewers' comments by March 1, 1999. For each accepted >video, the final version of the textual description will be due by >March 15, 1999 for inclusion in the proceedings. Final versions of >accepted videos will be due April 15, 1999 in the best format >available. The accepted videos will be edited onto one tape, which >will be shown at the conference, distributed to the participants, and >available from ACM after the conference. > >Video Program Committee: > > Danny Chen (Notre Dame) > Jeff Erickson, Chair (U Illinois) > John Sullivan (U Illinois) > Subhash Suri (Washington U) > Shang-Hua Teng (U Illinois) > > >------------- >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 > ------=_NextPart_000_0044_01BDF428.3B8234A0 Content-Type: text/plain; name="Call_99.txt" Content-Disposition: attachment; filename="Call_99.txt" Content-Transfer-Encoding: quoted-printable You have the very last opportunity to present your paper=20 before the year 2000 ----------------------------------------------------------- W S C G'99=20 The 7-th International Conference in Central Europe=20 on Computer Graphics, Visualization and Digital Interactive Media 99=20 in cooperation with=20 EUROGRAPHICS and IFIP working group 5.10 on Computer Graphics and Virtual Worlds will be held in February 8 - 12, 1999=20 in Plzen at the University of West Bohemia close to PRAGUE, the capital of the Czech Republic=20 ----------------------------------------------------------------------- >> If you are willing to help us as a REVIEWER, please, << >> fill in the form at the http://wscg.zcu.cz/reviewer.htm <<=20 ----------------------------------------------------------------------- >>Spare WSCG'98 proceedings are still available - ask your librarian << >>to order one - form is available from http://wscg.zcu.cz & WSCG99 << ----------------------------------------------------------------------- Conference Chairs = =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D Nadia Magnenat Thalmann, MIRALab-CUI, Univ. of Geneva, Switzerland Vaclav Skala, Univ. of West Bohemia, Czech Republic International Programme Committee = =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D Bergougnoux,P.(F) Chalmers,A.(UK) Chen,J.(USA) = Fellner,D.(D)=20 Ferko,A.(SK) Groeller,E.(A) Hubbold,R.(UK) Iones,A.(RU) = Jensen,W.H.(D) Klein,R.(D) Mockrzycki,V.(PL) = Peroche,B.(F)=20 Pratt,M.(USA) Rossignac,J.(USA) Sbert, M.(ES) = Seidel,H.-P.(D)=20 Sillion,F.(F) Slavik,P.(CR) Slusalek,P.(D) Sochor, = J.(CR) =20 Strasser,W.(D) Stuerzlinger,W.(USA) Szirmay-Kalos,L.(H) = Tokuta,A.(USA)=20 Willis, P.(UK) Wuetrich,C.(D) Yagel, R.(USA) Yukita,S.(J) Zara, J.(CR)=20 =20 =20 Sponsors and supporting organizations = =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D Digital Equipment, Hewlett Packard, IBM,=20 Silicon Graphics, Intergraph, Bentley Systems, Microsoft Information for authors = =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D Deadline for contributions: October 15, 1998=20 original(full affiliation) +3 copies(non-affiliated)=20 +electronic form in CORRECT Postscript=20 to be compressed to gz format format A4 (strictly NOT B4, properly formated),=20 8 pages including figures, tables etc.=20 Posters: same format, length restricted to 2 pages including pictures, = tables etc. If presented by an author will be printed in separate volume. For details, please, see http://wscg.zcu.cz select WSCG'99 Topics included --------------- Fundamental algorithms, rendering and visualization, virtual reality,=20 animation and multimedia, medical imaging, geometric modelling and = fractals,=20 graphical interaction, object-oriented graphics, WWW technologies, = standards,=20 computer vision, parallel and distributed graphics, computational = geometry,=20 computer aided geometric design, CAD/CAM, DTP and GIS systems,=20 educational aspects of related fields, usage of graphics within = mathematical=20 software (Maple, Mathematica, MathCAD etc.) in education The program includes international books exhibition and video show, too. --------------------------------------------- W S C G '99 International Exhibition ------------------------------------ Information for exhibitors: Please contact the organiser as soon as = possible -------------------------- for detailed information and conditions. The WSCG98 Exhibition will be held in parallel. Top leading European and = Czech=20 companies active in computer graphics, visualization and computer = vision,=20 CAD/CAM and GIS systems, virtual reality, multimedia systems and others = will be presenting their latest products. Special programme will be available, too. ----------------- Accepted papers will be published in the Conference proceedings with = ISBN.=20 They are reviewed by INSPEC, Cambridge Scientific Abstracts, InfoStore,=20 IEEE , ISI , AIMS , INIST and others for citations index and other = purposes.=20 =20 The best papers will be considered for possible publication in the = Journal of=20 Visualisation and Computer Animation, Computers&Graphics, The Visual = Computer,=20 Machine Graphics & Vision and others journals.=20 =09 Organizer and conference secretariat ------------------------------------ Vaclav Skala c/o Computer Science Dept., Univ.of West Bohemia Univerzitni 8, Box 314, 306 14 Plzen, Czech Republic e-mail: skala@kiv.zcu.cz Subject: INFO WSCG99 tel.:+420-19-7491-188 fax:+420-19-7491-188 fax:+420-19-7822-578 The latest information is available at:=20 http://wscg.zcu.cz select WSCG'99 Information on all WSCG conferences: http://wscg.zcu.cz=09 In case of any problems: http://147.228.63.9 ------=_NextPart_000_0044_01BDF428.3B8234A0-- ------------- 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 From compgeom-owner@research.bell-labs.com Thu Oct 15 18:06:24 1998 Return-Path: Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with SMTP id SAA10596; Thu, 15 Oct 1998 18:05:58 +0200 (GMT+0200) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Oct 15 11:49:22 EDT 1998 Received: from research.research.bell-labs.com by netlib2; Mon Oct 12 22:17:02 EDT 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Oct 12 22:15:07 EDT 1998 Received: from grendel.csc.smith.edu ([131.229.222.23]) by dusty; Mon Oct 12 22:15:05 EDT 1998 Received: from localhost (orourke@localhost) by grendel.csc.smith.edu (8.8.8/8.8.8/SC-CS-1.0) with SMTP id WAA10444 for ; Mon, 12 Oct 1998 22:14:57 -0400 (EDT) Date: Mon, 12 Oct 1998 22:14:57 -0400 (EDT) From: "Joseph O'Rourke" To: compgeom-announce@research.bell-labs.com Subject: Book Announcement: Computational Geometry in C (2nd Ed.) Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 2599 Lines: 69 COMPUTATIONAL GEOMETRY IN C (SECOND EDITION) Joseph O'Rourke Cambridge University Press. Printed 28 September 1998; shipping as of 2 October 1998. Hardback: ISBN 0521640105, $69.95 (55.00 PST) Paperback: ISBN 0521649765, $29.95 (19.95 PST) Some highlights: 1. 376+xiii pages, 270 exercises, 210 figures, 259 references. 2. Although I've retained the title "...in C," all code has been translated to Java, and both C and Java code is available via links from http://cs.smith.edu/~orourke. 3. A Java Applet permits interactive use of the code. See previous URL. 4. First Edition code improved: Postscript output, more efficient, more robust. 5. New code (see below). 6. Expanded coverage of randomized algorithms, ray-triangle intersection, and other topics (see below). Basic statistics: 1. approx. 50 pages longer 2. 31 new figures. 3. 49 new exercises. 4. 74 new references 5. 4 new programs. New code: 1. To compute the Delaunay triangulation from the 3D hull in O(n^2). 2. To intersect a ray with a triangle. 3. To decide if a point is inside a polyhedron. 4. To compute the convolution (Minkowski sum) of a convex polygon with a general polygon. 5. To generate regularly distributed points on the surface of a sphere. Significant code improvements: 1. Triangulation code now O(n^2) rather than n^3. Uses lists rather than arrays. 2. Graham scan handles collinear points more cleanly. 3. Convex hull in 3D starts with double-covered triangle. Volume determinant computations much faster. Overflow handled better. 4. Segment-segment intersection code handles special cases cleanly. 5. Point-in-polygon code classifies all boundary points correctly. 6. Intersection of convex polygons handles special cases more uniformly. 7. Robot arm configuration more robust. New coverage of these topics: 1. Partition into monotone mountains (for triangulation). 2. Randomized trapezoid decomoposition. 3. Randomized triangulation. 4. The ultimate convex hull algorithm. 5. Randomized 3D hull construction. 6. Twin edge data structure. 7. Furthest-point Voronoi diagram figure. 8. Red-blue matching. 9. Intersection of segment and triangle. 10. Point-in-polyhedron. 11. The Bentley-Ottmann algorithm for intersecting segments. 12. Boolean operations between two polygons. 13. Segment search tree. 14. Sources and further reading: annotated bibliography. ------------- 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 From compgeom-owner@research.bell-labs.com Mon Nov 2 16:31:31 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA04512; Mon, 2 Nov 1998 16:31:29 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA19556; Mon, 2 Nov 1998 16:30:57 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Nov 2 09:18:52 EST 1998 Received: from research.research.bell-labs.com by netlib2; Sat Oct 31 17:01:02 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Sat Oct 31 17:00:37 EST 1998 To: compgeom-announce@research.bell-labs.com Received: from louie.scs.carleton.ca ([134.117.5.2]) by dusty; Sat Oct 31 17:00:35 EST 1998 Received: from turing (turing [134.117.5.10]) by louie.scs.carleton.ca (96/30.01.97) with SMTP id QAA06429 for ; Sat, 31 Oct 1998 16:59:58 -0500 (EST) Received: by turing (5.x/SMI-SVR4) id AA11216; Sat, 31 Oct 1998 16:59:37 -0500 Date: Sat, 31 Oct 1998 16:59:37 -0500 From: wads@turing.scs.carleton.ca (Workshop on Algorithms and Data Structures) Message-Id: <9810312159.AA11216@turing> Subject: WADS'99 call for papers Content-Type: text Apparently-To: compgeom-announce@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2658 Lines: 57 CALL FOR PAPERS 1999 Workshop on Algorithms And Data Structures (WADS'99) August 12-14, 1999 Vancouver, Britich Columbia, Canada http://www.scs.carleton.ca/~wads/ Sponsored by The Pacific Institute for the Mathematical Sciences 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) by e-mail to "wads@scs.carleton.ca". Detailed submission instructions are located at http://www.scs.carleton.ca/~dehne/proj/wads/99/instr.html. Submissions must arrive on or before March 1, 1999. Authors will be notified of acceptance or rejection by April 30, 1999. 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 21, 1999 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 (tentative): Charles Leiserson, Marc Snir, Nadia Magnenat Thalman, Umesh Vazirani, and Jeff Vitter Conference Co-Chairs: B. Bhattacharya and A. Gupta, Computer Science, Simon Fraser University, wads_local@cs.sfu.ca, http://www.cs.sfu.ca/~wads Program Committee: Co-Chairs: F. Dehne (Carleton), A. Gupta (SFU), J.-R. Sack (Carleton) and R. Tamassia (Brown). PC-Members (tentative): A. Andersson (Lund), A. Apostolico (Purdue and Padova), G. Ausiello (Rome), K. Clarkson (Lucent), R. Cleve (Calgary), M. Cosnard (Lille), L. Devroye (McGill), M. Goodrich (Johns Hopkins) A. Grama (Purdue), M. Keil (Saskatchewan), D. Kirkpatrick (UBC), R. Krishnamurti (SFU), D.T. Lee (Northwestern), F. Luccio (Pisa), A. Maheshwari (Carleton), G. Plaxton (Univ. of Texas at Austin), J. Reif (Duke), F. Ruskey (U. Vic), P.G. Spirakis (Patras), L. Stewart (Alberta), H. Sudborough (U. Texas Dallas), P. Vitanyi (CWI), P. Widmayer (ETH), C.K. Wong (Chinese U. Hong Kong) ------------- 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 From compgeom-owner@research.bell-labs.com Tue Nov 3 22:14:53 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id WAA13112; Tue, 3 Nov 1998 22:14:51 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id WAA29529; Tue, 3 Nov 1998 22:14:20 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Nov 3 15:08:21 EST 1998 Received: from research.research.bell-labs.com by netlib2; Tue Nov 3 11:35:01 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Nov 3 11:33:21 EST 1998 Received: from mail.mpi-sb.mpg.de ([139.19.1.1]) by dusty; Tue Nov 3 11:33:18 EST 1998 Received: from mpii01802.ag1.mpi-sb.mpg.de (mpii01802.ag1.mpi-sb.mpg.de [139.19.11.33]) by mail.mpi-sb.mpg.de (8.8.7/8.8.8) with ESMTP id RAA20589; Tue, 3 Nov 1998 17:32:56 +0100 Received: (from sanders@localhost) by mpii01802.ag1.mpi-sb.mpg.de (8.8.8/8.8.8) id RAA16296; Tue, 3 Nov 1998 17:32:51 +0100 (MET) Date: Tue, 3 Nov 1998 17:32:51 +0100 (MET) Message-Id: <199811031632.RAA16296@mpii01802.ag1.mpi-sb.mpg.de> From: Peter Sanders To: compgeom-announce@research.bell-labs.com Subject: Postdoc at MPI for Computer Science - Algorithms Group Precedence: bulk Status: RO Content-Length: 2213 Lines: 62 P O S T - D O C T O R A L F E L L O W S H I P S at the M A X - P L A N C K - I N S T I T U T E for C O M P U T E R S C I E N C E The Max-Planck-Institute for Computer Science is located on the campus of the Universit"at des Saarlandes in Saarbr"ucken, Germany. The institute was founded in 1990 and consists, at present, of two research units: Algorithms and Complexity, and Logic of Programming. Two new units: Hybrid Systems, and Computer Graphics will be added in the first half of 1999. The research group ALGORITHMS AND COMPLEXITY offers a number of postdoctoral fellowships for the year 1999/2000. Fellowships are available for one or two years and amount to DM 3,400 per month, taxfree (approximately USD 2000). There is generous travel support available and the group collaborates with several of the major research institutions in Europe and USA. The interests of the research group members includes data structures, graph and network algorithms, computational geometry, parallel algorithms, computational complexity, combinatorial optimization, graph drawing, on-line algorithms, randomized algorithms, computational biology and implementation of algorithms and program libraries. The group consists mainly of young researchers of several nationalities. The postdoctoral fellows are expected to interact with group members and are encouraged to initiate research in their individual areas of specialization. More information is available on WWW at http://www.mpi-sb.mpg.de Applications (including curriculum vitae, list of publications, research plan, names of references with their e-mail addresses, and intended period of stay) should be sent by FEBRUARY 28, 1998 to Kurt Mehlhorn or Peter Sanders. Further information can be also obtained from Peter Sanders (sanders@mpi-sb.mpg.de). Max-Planck-Institut f"ur Informatik Im Stadtwald D-66123 Saarbr"ucken Germany ------------- 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 From compgeom-owner@research.bell-labs.com Wed Nov 4 23:36:39 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id XAA15556; Wed, 4 Nov 1998 23:36:36 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id XAA04844; Wed, 4 Nov 1998 23:36:15 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Nov 4 16:30:48 EST 1998 Received: from research.research.bell-labs.com by netlib2; Tue Nov 3 18:43:05 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Nov 3 18:42:39 EST 1998 Received: from graphics.lcs.mit.edu ([18.24.2.30]) by dusty; Tue Nov 3 18:42:38 EST 1998 Received: from graphics.lcs.mit.edu (line.lcs.mit.edu [18.24.2.81]) by graphics.lcs.mit.edu (8.9.0/8.9.0) with ESMTP id SAA22867 for ; Tue, 3 Nov 1998 18:43:49 -0500 (EST) Sender: seth@graphics.lcs.mit.edu Message-ID: <363F9534.DDE94D41@graphics.lcs.mit.edu> Date: Tue, 03 Nov 1998 18:43:48 -0500 From: Seth Teller Reply-To: James McCarthy Organization: MIT Computer Graphics Group X-Mailer: Mozilla 4.5b2 [en] (X11; I; IRIX 6.3 IP32) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-announce Subject: MIT Computer Graphics Group seeks Technical Staff Member Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 1622 Lines: 41 Position Summary: The MIT Computer Graphics Group, affiliated with the MIT Laboratory for Computer Science, seeks a self= motivated GRAPHICS SYSTEM MANAGER to support and contribute to a wide variety of research efforts, including the develop- ment of cutting-edge prototype software and instrumentation. Responsibilities: The position involves managing a mix of PC and SGI servers and workstations, and an interesting collec- tion of high-end input devices, instrumentation, and software packages. The candidate should have some familiarity with graphics platforms and practice, traditional and/or digital photography, and video equipment. The candidate should be capable of independent pursuit of complex system administra- tion tasks, and contribute to ongoing research and engineer- ing projects. The position will involve considerable interac- tion with faculty, students, and other technical support staff at MIT. Requirements: BS in computer science or related field. Ability to work with others on technically oriented projects. Experience with networks of PC and SGI machines, and fast distributed file systems. Good written, oral, and people skills. To apply, send a resume and letter describing relevant experience to: Mr. James McCarthy Massachusetts Institute of Technology 77 Massachusetts Avenue E19-238 Cambridge, MA 02139 Resumes may also be sent electronically (as plain text) to jimhmc@mit.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 From compgeom-owner@research.bell-labs.com Tue Nov 10 18:05:28 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id SAA24566; Tue, 10 Nov 1998 18:05:24 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id SAA21798; Tue, 10 Nov 1998 18:04:43 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Nov 10 11:00:10 EST 1998 Received: from research.research.bell-labs.com by netlib2; Fri Nov 6 17:31:03 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Nov 6 17:29:45 EST 1998 Received: from smtp3.ny.us.ibm.com ([198.133.22.42]) by dusty; Fri Nov 6 17:29:43 EST 1998 Received: from relay1.server.ibm.com (relay1.server.ibm.com [9.14.2.98]) by smtp3.ny.us.ibm.com (8.8.7/8.8.7) with ESMTP id RAA29020 for ; Fri, 6 Nov 1998 17:12:14 -0500 From: taubin@us.ibm.com Received: from us.ibm.com (d51mta01.pok.ibm.com [9.117.30.75]) by relay1.server.ibm.com (8.8.7/8.8.7) with SMTP id RAA38096 for ; Fri, 6 Nov 1998 17:25:58 -0500 Received: by us.ibm.com(Lotus SMTP MTA Internal build v4.6.2 (651.2 6-10-1998)) id 852566B4.007AD46A ; Fri, 6 Nov 1998 17:21:37 -0500 X-Lotus-FromDomain: IBMUS To: compgeom-announce@research.bell-labs.com Message-ID: <852566B4.007AD334.00@us.ibm.com> Date: Fri, 6 Nov 1998 17:28:40 -0500 Subject: Call For Papers Mime-Version: 1.0 Content-type: text/plain; charset=us-ascii Content-Disposition: inline Precedence: bulk Status: RO Content-Length: 2766 Lines: 93 Call for Papers Special Issue of the Journal Computational Geometry: Theory and Applications on Multi-Resolution 3D Modeling, Encoding and Transmitting Submission due: December 15, l998 There has been recently considerable interest in building and managing multi-resolution 3D models, especially triangular/polygonal and tetrahedral meshes (e.g. through Levels of Detail or LODs), as well as in efficiently encoding 3D models for transmission and compact storage. One particularly promising application is progressive delivery of 3D geometry across a network (e.g. the Internet) or to a display terminal. Many of the fundamental issues involved in this process center around Computational Geometry and Topology. This special issue is dedicated to applications of Computational Geometry to generate, compress, encode and efficiently use multi-resolution representations of 3-D (or 2-D) geometry, for progressive, and parameter dependent visualization (and more generally, utilization). Topics include, but are not limited to: * Progressive transmission and/or display and view-dependent refinement of 3-D geometry * Automated generation of levels of detail of 3D models * Wavelet-based multi-resolution representation of 3-D geometry * Compression of 3-D geometry * Representations and algorithms for handling topological changes and/or non-manifold topology * Multi-resolution methods and algorithms exploiting levels of detail in Geographic Information Systems (GIS) * Methods For handling very large data sets, and low memory footprint methods * Frameworks for progressively delivering 3-D geometry on the World Wide Web Schedule: Paper submission: December 15, l998 Acceptance/rejection notification: April 1st, l999 Final manuscript submission: May 15, l999 Publication: Fall/Winter 1999 or earlier The guest editors for this issue are: Dr. Andre Gueziec Dr. Gabriel Taubin IBM T.J.Watson Research Center 30 Sawmill River Road Hawthorne, NY 10532 email: {gueziec, taubin}@watson.ibm.com SUBMISSION INSTRUCTIONS: All submission will be refereed in accordance with the Journal guidelines. Manuscripts will not be accepted if they have been previously published. Please submit 5 copies of your article to either guest editor at the address above. Please attempt to limit the length of the article to 35 pages. JOURAL GUIDELINES: Please refer to the following Web page: http://www.elsevier.nl/locate/compgeo Electronic submissions of Latex documents are possible once the paper has been accepted. ------------- 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 From compgeom-owner@research.bell-labs.com Fri Nov 13 19:52:40 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id TAA22541; Fri, 13 Nov 1998 19:52:38 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id TAA08734; Fri, 13 Nov 1998 19:52:55 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Nov 13 12:40:46 EST 1998 Received: from research.research.bell-labs.com by netlib2; Fri Nov 13 11:05:03 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Nov 13 11:03:11 EST 1998 Received: from edwards.af.mil ([129.198.6.4]) by dusty; Fri Nov 13 11:03:10 EST 1998 Received: from EDW-Message_Server by edwards.af.mil with Novell_GroupWise; Fri, 13 Nov 1998 08:03:10 -0800 Message-Id: X-Mailer: Novell GroupWise 5.2 Date: Fri, 13 Nov 1998 08:03:01 -0800 From: "Charles Jones" To: compgeom-announce@research.bell-labs.com Subject: Dynamic Spectrum Allocation Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: quoted-printable Content-Disposition: inline Precedence: bulk Status: RO Content-Length: 1043 Lines: 27 Dynamic Spectrum Allocation I am looking for someone to research appropriate algorithms for dynamically allocating telemetry spectrum. This appears to be similar to other dynamic bin packing problems. There is a limited amount of bandwidth for which multiple aircraft are vying. Further, the bandwidth required for each aircraft may change at unknown intervals. A central controller must inform each aircraft what frequency (and spectrum width) each aircraft may use. The time duration for each allocation may or may not be known. The problem is therefore 2 dimensional in that there are both spectrum and time dimensions. Although there are certainly no guarantees, there is some potential for a grant to research this topic.=20 Further queries may be made to: Charles H. Jones Edwards AFB, CA, USA charles.jones@edwards.af.mil=20 805-275-4492 ------------- 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 From compgeom-owner@research.bell-labs.com Tue Nov 17 18:30:41 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id SAA11915; Tue, 17 Nov 1998 18:30:39 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id SAA07879; Tue, 17 Nov 1998 18:29:21 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Nov 17 11:16:41 EST 1998 Received: from research.research.bell-labs.com by netlib2; Mon Nov 16 17:37:02 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Nov 16 17:36:03 EST 1998 Received: from alpha.xerox.com ([13.1.64.93]) by dusty; Mon Nov 16 17:36:00 EST 1998 Received: from redstart.parc.xerox.com ([13.2.116.100]) by alpha.xerox.com with SMTP id <53599(4)>; Mon, 16 Nov 1998 14:35:56 PST Received: by redstart.parc.xerox.com id <12184>; Mon, 16 Nov 1998 14:35:48 PST From: Marshall Bern To: compgeom-announce@research.bell-labs.com, theorynt@listserv.nodak.edu Subject: CFP-- ACM Symp. Computational Geometry Message-Id: <98Nov16.143548pst."12184"@redstart.parc.xerox.com> Date: Mon, 16 Nov 1998 14:35:48 PST Precedence: bulk Status: RO Content-Length: 7690 Lines: 204 CALL FOR PAPERS Fifteenth Annual ACM Symposium on COMPUTATIONAL GEOMETRY June 13--16, 1999 Miami Beach, Florida http://www.cs.miami.edu/events/SCG99/ Sponsored by ACM SIGACT & SIGGRAPH The 1999 ACM Symposium on Computational Geometry, featuring an applied track, a theoretical track, and a video review, will be held at the Radisson Deauville Resort in Miami Beach, Florida. We invite submissions that address applications of geometric computing, for the applied track, or fundamental problems of geometric computing, for the theoretical track. During the conference, sessions of presentations will alternate between the two tracks, rather than being in parallel. The proceedings, with the papers of both tracks, will be distributed at the symposium and will subsequently be available for purchase from ACM. A selection of papers will be invited to special issues of journals. The conference will accept electronic submissions of postscript files; guidelines will be available via the conference homepage, given above. Topics for the applied track include, but are not limited to experimental analysis of algorithms and data structures; robotics and virtual worlds; computer graphics, simulation and visualization; image processing; geometric and solid modeling; computer aided geometric design; manufacturing; geographical information systems. Electronic submissions are preferred, but authors may instead mail 14 copies of an extended abstract to arrive by December 4, 1998 to: John Canny Computer Science Division 529 Soda Hall Berkeley, CA 94720-1776 Phone: (510) 642-9955 jfc@cs.berkeley.edu Topics for the theoretical track include, but are not limited to: theoretical analysis of geometric algorithms and data structures; discrete and combinatorial geometry; mathematical and numerical issues arising from implementations. Electronic submissions are preferred, but authors may instead mail 8 copies of an extended abstract to arrive by December 4, 1998 to: Marshall Bern Xerox PARC 3333 Coyote Hill Road Palo Alto, CA 94304-1314 Phone: (650) 812-4443 bern@parc.xerox.com Important Dates December 4, 1998: Extended abstract due, both tracks February 13, 1999: Video submissions due February 15, 1999: Notification of acceptance or rejection of papers March 1, 1999: Notification of acceptance or rejection of videos March 15, 1999: Camera-ready papers due April 15, 1999: Final versions of videos due June 13-16, 1999: Symposium Papers that primarily address practical issues and implementation experience, even if not tied to a particular application domain, should be submitted to the applied track. Papers that primarily prove theorems should be submitted to the theoretical track. Most experimental work should be submitted to the applied track; an exception would be experiments in support of mathematical investigations. Submissions to one track may be forwarded to the other for consideration, unless the authors have explicitly stated interest in one track only. An extended abstract sent to a program committee should begin with a succinct statement of the problems and goals of the paper, the main results, and the significance of the work in the context of previous research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages at a reasonable font size. An optional appendix may be included, but this will be used at the program committee's discretion. Abstracts in hard copy must be received by December 4, 1998, or postmarked by November 27 and sent airmail. Electronic submissions are also due December 4. These are firm deadlines: late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 1999. A full version of each contribution in final form will be due by March 15, 1999 for inclusion in the proceedings. Conference Chair: Victor Milenkovic (U Miami) vjm@cs.miami.edu Applied Track Program Committee: Pankaj Agarwal (Duke) Nina Amenta (U Texas) Amy Briggs (Middlebury College) John Canny, Chair (Berkeley) David Dobkin (Princeton) Dan Halperin (Tel Aviv) Yan-Bin Jia (Carnegie-Mellon) Lydia Kavraki (Rice) Jean-Claude Latombe (Stanford) Dinesh Pai (U British Columbia) Jonathan Shewchuk (Berkeley) Jack Snoeyink (U British Columbia) Frank van der Stappen (Utrecht) Theoretical track Program Committee: Marshall Bern, Chair (Xerox PARC) Herve Bronnimann (INRIA Sophia-Antipolis) Timothy Chan (U Miami) David Eppstein (UC-Irvine) Bernd Gaertner (ETH Zuerich) Jacob E. Goodman (City College, CUNY) Anna Lubiw (U Waterloo) CALL FOR VIDEOS 8th Annual Video Review of Computational Geometry Background: This video review showcases the use of visualization in computational geometry for exposition and education, as an interface and a debugging tool in software development, and for the visual exploration of geometry in research. Algorithm animations, visual explanations of structural theorems, descriptions of applications of computational geometry, and demonstrations of software systems are all appropriate. Videos that accompany papers or communications submitted to the technical program committee are encouraged. Submissions: Authors should send one preview copy of a videotape to the address below by February 13, 1999. The videotape should be at most eight minutes long (three to five minutes, preferred), and be in VHS NTSC or VHS PAL format. Each video tape must be accompanied by a one- or two-page description of the material shown in the video, and where applicable, the techniques used in the implementation. Please format descriptions following the guidelines for ACM proceedings. Additional material describing the contents of the videos, such as the full text of accompanying papers, may also be included. Textual material may be submitted electronically by e-mailing either the URL of a PostScript file (preferred) or the PostScript file itself to jeffe@cs.uiuc.edu. If electronic submission is impossible, authors should include 5 hardcopies of the accompanying text with their video. Videotapes and accompanying text should be sent to: Jeff Erickson Department of Computer Science University of Illinois 1304 W. Springfield Ave. Urbana, IL 61801 Phone: (217) 333-6769 For customs purposes, it is best to declare a value of $5. If you have questions, please contact the committee chair at jeffe@cs.uiuc.edu or (217) 333-6769. Notification: Authors will be notified of acceptance or rejection, and given reviewers' comments by March 1, 1999. For each accepted video, the final version of the textual description will be due by March 15, 1999 for inclusion in the proceedings. Final versions of accepted videos will be due April 15, 1999 in the best format available. The accepted videos will be edited onto one tape, which will be shown at the conference, distributed to the participants, and available from ACM after the conference. Video Program Committee: Danny Chen (Notre Dame) Jeff Erickson, Chair (U Illinois) John Sullivan (U Illinois) Subhash Suri (Washington U) Shang-Hua Teng (U Illinois) ------------- 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 From compgeom-owner@research.bell-labs.com Thu Nov 19 17:19:48 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id RAA12324; Thu, 19 Nov 1998 17:19:46 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id RAA18380; Thu, 19 Nov 1998 17:19:34 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Nov 19 10:07:05 EST 1998 Received: from research.research.bell-labs.com by netlib2; Wed Nov 18 10:07:03 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Nov 18 10:05:04 EST 1998 Received: from inf.ethz.ch ([129.132.10.10]) by dusty; Wed Nov 18 10:05:02 EST 1998 Received: from blabla.inf.ethz.ch (emo@blabla.inf.ethz.ch [129.132.11.130]) by inf.ethz.ch (8.8.8/8.8.8) with ESMTP id QAA03271; Wed, 18 Nov 1998 16:04:44 +0100 (MET) Received: (from emo@localhost) by blabla.inf.ethz.ch (8.8.8/8.8.8) id QAA05264; Wed, 18 Nov 1998 16:04:43 +0100 (MET) Date: Wed, 18 Nov 1998 16:04:43 +0100 (MET) From: Emo Welzl Message-Id: <199811181504.QAA05264@blabla.inf.ethz.ch> To: compgeom-announce@research.bell-labs.com Subject: Ph.D. Positions, ETH Zurich Cc: emo@inf.ethz.ch X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 1052 Lines: 32 The Institute for Theoretical Computer Science, ETH Zurich, Switzerland offers several Ph.D. positions with obligations in teaching support. Selected research topics which should be understood in the spectrum from theoretical to experimental and application-oriented investigations: Cryptography, combinatorial algorithms and data structures, discrete and computational geometry, optimization, algorithmic number theory. Advisors: J. Bloemer, R. Cramer, B. Gaertner, U. Maurer, J. Nievergelt, J. Richter-Gebert, T. Roos, P. Widmayer und E. Welzl. Applications with a short letter of reference and some ideas about the Ph.D. topic should be directed to Emo Welzl Theoretische Informatik, ETH Zentrum CH-8092 Zurich, Switzerland, (e-mail: emo@inf.ethz.ch) as soon as possible. _____________________________________ http://www.inf.ethz.ch/department/TI/ ------------- 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 From compgeom-owner@research.bell-labs.com Fri Nov 20 00:15:26 1998 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA21448; Fri, 20 Nov 1998 00:15:21 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id AAA20138; Fri, 20 Nov 1998 00:14:57 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Nov 19 16:36:54 EST 1998 Received: from research.research.bell-labs.com by netlib2; Thu Nov 19 11:45:01 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Nov 19 11:43:39 EST 1998 Received: from fmatbds02.tu-graz.ac.at ([129.27.179.102]) by dusty; Thu Nov 19 11:43:35 EST 1998 Received: from opt.math.tu-graz.ac.at (fmatbpc03.tu-graz.ac.at) by fmatbds02.tu-graz.ac.at with SMTP id AA21619 (5.67a/IDA-1.5t for ); Thu, 19 Nov 1998 17:44:14 +0100 Message-Id: <36544C29.A143966B@opt.math.tu-graz.ac.at> Date: Thu, 19 Nov 1998 17:49:45 +0100 From: "=?iso-8859-1?Q?G=FCnter?= Rote" Organization: TU Graz X-Mailer: Mozilla 4.06 [de] (WinNT; I) Mime-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: COCOON'99: call for papers (LaTeX version) X-Priority: 5 (Lowest) Content-Type: multipart/mixed; boundary="------------6793F8CCC7592C98617DEEB1" Precedence: bulk Status: RO Content-Length: 5003 Lines: 149 Dies ist eine mehrteilige Nachricht im MIME-Format. --------------6793F8CCC7592C98617DEEB1 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit --------------6793F8CCC7592C98617DEEB1 Content-Type: application/x-tex; name="COCOON99-call-for-papers.tex" Content-Transfer-Encoding: 7bit Content-Disposition: inline; filename="COCOON99-call-for-papers.tex" \documentstyle[12pt]{article} \pagestyle{empty} \textwidth=17.5cm \textheight=26cm \topmargin=-10mm \headsep=0cm \headheight=0cm \oddsidemargin=-1cm \evensidemargin=-1cm \marginparwidth=0cm \itemsep=0.1pt \parindent=12pt \begin{document} \begin{center} {\Large\bf --- First Call for Papers ---\\[10pt]} {\Large\bf COCOON '99}\\ {\bf Fifth Annual International Computing and Combinatorics Conference }\\ {\bf July 26--28, 1999, Tokyo, Japan }\\ {\small Supported by Chuo University, in cooporation with SIGAL IPSJ and COMP IEICE} \end{center} The Fifth Annual International Computing and Combinatorics Conference will be held in Tokyo, Japan, July 26--28, 1999. The conference is intended to provide a forum for researchers in theoretical computer science. Papers presenting original research in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are sought. In addition to theoretical results, we are interested in submissions which report on experimental and applied research. Typical, but not exclusive, topics of interest include: \begin{tabbing} \hskip5mm\=\+$\bullet$ xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx AAA\=\kill - algorithms and data structures \> - automata, languages and logic \\ - complexity and computability \> - computational biology and chemistry \\ - computational geometry and algebra \> - cryptography and computational number theory \\ - learning theory and knowledge discovery \> - optimization and network theory \\ - parallel and distributed computing \> - graph drawing and information visualization \\ - combinatorics related to algorithms and complexity \end{tabbing} % Authors should send a PostScript file of an extended abstract (in English) by {\bf February 8, 1999}. A submission guideline including e-submission address will be given in our homepage {\bf http://www.ecei.tohoku.ac.jp/COCOON99/}. Alternatively, authors can send 24 hard copies. An abstract should start with the title of the paper, each author's name, affiliation and e-mail address, and a short summary of the main results. The extended abstract should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance to the symposium. The length of the extended abstract should not exceed 10 pages (using 11 point or larger font, with ample margins all around). Authors will be notified of acceptance or rejection by March 30, 1999. A camera-ready copy of each accepted paper is required by April 26, 1999. The proceedings of the conference will be published by Springer-Verlag in the Lecture Notes in Computer Science series, and will be available for distribution at the conference. Selected papers will be also published in special issues in journals. The Hao Wang award will be given to the best paper (details will be given in our homepage). \small \vskip3mm\noindent {\bf Invited Speakers:} \ \ Prabhakar Raghavan (IBM Almaden) and Seinosuke Toda (Nihon University) \vskip3mm\noindent {\bf Program Committee:} \ \ % Jean-Daniel Boissonnat (INRIA, France), Zhi-Zhong Chen (Tokyo Denki U., Japan), Xiaotie Deng (HKCU, Hong Kong), David Eppstein (UC Irvine, USA), Uriel Feige (Weitzmann, Israel), Harold Gabow (Colorado, USA), Ronald Graham (AT\&T Bell, USA), Frank Hwang (Chiao Tung U., Taiwan), Tao Jiang (McMaster, Canada), Howard Karloff (Georgia Tech., USA), Samir Khuller (Maryland, USA), Rao Kosaraju (Johns Hopkins, USA), D. T. Lee (Co-Chair, Academia Sinica, Taiwan), Xuemin Lin (NSW, Australia), Bruce Maggs (CMU, USA), Kurt Mehlhorn (MPI Saarbr\"{u}cken, Germany), Satoru Miyano (U. Tokyo, Japan), Seffi Naor (Technion, Israel), G\"unter Rote (Graz, Austria), Madhu Sudan (MIT, USA), Roberto Tamassia (Brown, USA), Takeshi Tokuyama (Co-Chair, IBM, Japan), Jeff Vitter (INRIA, France and Duke, USA), Guoliang Xue (Vermont, USA) \noindent {\bf Conference Committee:} \ \ Takao Asano (Co-Chair, Chuo University), Hiroshi Imai (Co-Chair, University of Tokyo) and Shin-ichi Nakano (Publicity, Tohoku University) \vskip3mm\noindent {\bf Important dates:} \\ Submission deadline : February 8, 1999. \ \ Notification: March 30, 1999. \ \ Conference: July 26--28, 1999. \\ {\bf Hard-copy submission address:} Takeshi Tokuyama, IBM Tokyo Research Laboratory, \\ 1623-14, Shimo Tsuruma, Yamato, 242-0001, Kanagawa, Japan. (email: ttoku@trl.ibm.co.jp) \end{document} --------------6793F8CCC7592C98617DEEB1-- ------------- 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 From compgeom-owner@research.bell-labs.com Mon Nov 30 16:59:38 1998 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA27273; Mon, 30 Nov 1998 16:59:35 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA20460; Mon, 30 Nov 1998 16:57:07 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Nov 30 09:54:48 EST 1998 Received: from research.research.bell-labs.com by netlib2; Mon Nov 30 09:33:01 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Nov 30 09:32:30 EST 1998 Received: from cuimail.unige.ch ([129.194.69.50]) by dusty; Mon Nov 30 09:32:28 EST 1998 Received: from pcmira127 by cuimail.unige.ch (PMDF V5.1-10 #U3242) with SMTP id <0F38002MEOE3DJ@cuimail.unige.ch> for compgeom-announce@research.bell-labs.com; Mon, 30 Nov 1998 15:32:27 +0100 (MET) Date: Mon, 30 Nov 1998 15:32:08 +0100 From: Laurent Moccozet Subject: [CFP] Computational Geometry journal - Special Issue X-Sender: moccozet@cuimail.unige.ch To: compgeom-announce@research.bell-labs.com Cc: Laurent.Moccozet@cui.unige.ch Message-id: <3.0.3.32.19981130153208.009db560@cuimail.unige.ch> MIME-version: 1.0 X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.3 (32) Content-type: text/plain; charset=us-ascii Precedence: bulk Status: RO Content-Length: 3125 Lines: 100 Call for Papers Special Issue of the Computational Geometry Journal on Computational Geometry in Virtual Reality Submission due: February 15th, 99 Computational Geometry provides a wide range of efficient and original solutions to problems faced by researchers in Virtual Reality. This special issue is dedicated all applications of Computational Geometry to build, control, animate and display Virtual Worlds. Original, research, practice, and experience papers are sought that address Computational Geometry aspects and applications in Virtual Reality. Topics include, but are not limited to: * 3D Geometric Shape Modeling. * 3D Shape Morphing and Warping. * Rendering Virtual Worlds. * Visualization of Virtual Worlds. * Realistic Textures Simulation and Texture Mapping. * Virtual Landscape Modeling. * Natural Phenomenons Simulation. * Articulated Characters Animation. * Motion Control and Capture. * Collision Detection in Virtual Worlds. * Path and Route Planning in Virtual Worlds. * Level of Details Management in Virtual Worlds. * 3D Shape Simplification for Virtual Worlds. Schedule: Paper submission: February 15, l999 Acceptance/rejection notification: May 1, l999 Final manuscript submission: June 15, l999 Publication: late l999/early 2000 The guest editors of this issue are: Prof. Nadia Magnenat-Thalmann, thalmann@cui.unige.ch and Dr. Laurent Moccozet moccozet@cui.unige.ch MIRALab, University of Geneva, 24 Rue du General Dufour CH 1211 Geneva 4, Switzerland, Submission guidelines: Authors should carefuly check the guide for authors available from http://www.elsevier.nl/locate/comgeo - Paper manuscript submission: Send five copies of the full manuscript to: Laurent Moccozet MIRALab, University of Geneva, 24 Rue du General Dufour CH 1211 Geneva 4, Switzerland FAX: +41 22 705 77 80 phone: +41 22 705 76 19 - Electronic submission: Authors may submit their paper by ftp. The electronic version of your manuscript should be submitted in PDF (preferred) or Postscript using anonymous ftp to cuisg34.unige.ch. The paper should be submitted as one file. The file name should be first author's name. Please follow the procedure: ftp cuisg34.unige.ch username: anonymous password: cd cgta put In any case, you should send an email to the editors with the title of the paper, the authors with affiliation, the contact author, the abstract and eventually the filename used for ftp. ---------- Laurent Moccozet Laurent.Moccozet@cui.unige.ch MIRALab/CUI, Universite de Geneve tel:+41 22 705 76 66 24 Rue du General Dufour fax:+41 22 705 77 80 CH 12111 Geneve 4 http://www.miralab.unige.ch/~moccozet/ ------------- 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 From compgeom-owner@research.bell-labs.com Wed Dec 2 18:43:38 1998 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id SAA05154; Wed, 2 Dec 1998 18:43:29 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id SAA16092; Wed, 2 Dec 1998 18:42:55 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Dec 2 11:29:01 EST 1998 Received: from research.research.bell-labs.com by netlib2; Tue Dec 1 19:45:07 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Dec 1 19:43:08 EST 1998 Received: from dept.cs.nyu.edu ([128.122.80.31]) by dusty; Tue Dec 1 19:43:06 EST 1998 Received: (from golin@localhost) by dept.cs.nyu.edu (8.9.1/8.9.1) id TAA18236; Tue, 1 Dec 1998 19:42:11 -0500 (EST) Date: Tue, 1 Dec 1998 19:42:11 -0500 (EST) From: Mordecai Golin Message-Id: <199812020042.TAA18236@dept.cs.nyu.edu> To: theorynt@vm1.nodak.edu, compgeom-announce@research.bell-labs.com Subject: Accomodations for DIMACS/HKUST workshop this month Cc: golin@dept.cs.nyu.edu X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 4143 Lines: 106 We would like to remind you that on-campus accomodation at the DIMACS-HKUST Far-East Workshop on Algorithms and Combinatorics have to be reserved in the next few days, preferably before December 4th. Please consult our workshop webpage at http://www.cs.ust.hk/tcsc/dimacs.html for details on registering and reserving accomodation. For your convenience, the workshop announcement is reproduced below. Our apologies to those who receive this message more than once. Best wishes, The organizing committee at HKUST (dimacswac@cs.ust.hk) ----------------------------------------------------------- DIMACS-HKUST Far-East Workshop on Algorithms and Combinatorics http://www.cs.ust.hk/tcsc/dimacs.html As part of their recent cooperation agreement, DIMACS and the Theoretical Computer Science Center at the Hong Kong University of Science and Technology are co-sponsoring a workshop from December 18-20, 1998 at HKUST. The goal of this workshop is to foster greater communication and collaboration between DIMACS and algorithm researchers in Asia. Its focus will be on algorithms, combinatorics and the interplay between them. Two types of talks are planned; extended surveys by seven distinguished invited speakers and shorter presentations by the attendees describing their current research. In addition, there will be open problem sessions. The workshop is deliberately planned in such a way that participants can combine it with ISAAC'98 in Korea. List of Invited Speakers Ding-Zhu Du, University of Minnesota Wen-Lian Hsu, Academia Sinica Frank Hwang, Chiao-Tung University Ricky Pollack, New York University (Courant Institute) Robert Sedgewick, Princeton University Micha Sharir, University of Tel Aviv Neil Sloane, AT&T Labs CONTRIBUTED PAPER SUBMISSIONS: A one-page abstract should be submitted, if at all possible in electronic form using Postscript. Authors are responsible to make sure that their submission can be printed. Please send your submission, with author's names and affiliations, to dimacswac@cs.ust.hk. If you are unable to submit electronically please send email to dimacswac@cs.ust.hk for further instructions. REGISTRATION: There is a nominal registration fee of HK$250 (about US$30) to cover the costs of the communal coffee breaks. To register, please print out the registration form (Postscript format) available at the conference web site http://www.cs.ust.hk/tcsc/dimacs.html and mail or fax the completed form to Ms. Vanessa Kwok at the address given on the form. ACCOMMODATION: HKUST is able to provide accommodation in serviced apartments on the HKUST campus, a few minutes walking from the workshop venue. Each apartment consists of three rooms that share a small living room, toilet and bathroom, and a small kitchen area. The cost is HK$400 (about US$50) per room per night. The cost of accommodation will be charged to your credit card together with the registration fee. The number of apartments is limited, and requests will be honored on a first-come-first-serve basis. You can request such a room on campus on the registration form. The apartments are available from December 17 to December 23, in case you wish to spend extra days in Hong Kong. CANCELLATIONS: Please note that for cancellations after December 1, 1998, we will not be able to reimburse the registration fee and the room rate for the first night. CONTACT: If there are any other questions, please contact the organization committee at dimacswac@cs.ust.hk. ORGANIZING COMMITTEE Siu-Wing Cheng, Hong Kong UST Otfried Cheong, Hong Kong UST XiaoTie Deng, City University of Hong Kong Mordecai Golin, Hong Kong UST Ron Graham, AT&T Labs and Rutgers Fred Roberts, Rutgers ----- End Included Message ----- ------------- 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 From compgeom-owner@research.bell-labs.com Fri Dec 4 13:31:22 1998 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id NAA02108; Fri, 4 Dec 1998 13:31:19 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA06323; Thu, 3 Dec 1998 16:30:56 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Dec 3 08:54:51 EST 1998 Received: from research.research.bell-labs.com by netlib2; Thu Dec 3 03:23:02 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Dec 3 03:21:46 EST 1998 Received: from jupiter.kaist.ac.kr ([143.248.135.80]) by dusty; Thu Dec 3 03:21:40 EST 1998 Received: (from isaac98@localhost) by jupiter.kaist.ac.kr (8.8.8Ha/8.8.8-NOSPAM) id RAA16814 for compgeom-announce@research.bell-labs.com; Thu, 3 Dec 1998 17:21:28 +0900 (KST) Message-ID: <19981203172128.A16808@jupiter.kaist.ac.kr> Date: Thu, 3 Dec 1998 17:21:28 +0900 From: "ISAAC '98" To: compgeom-announce@research.bell-labs.com Subject: [ISAAC98] Final Call for Participation Mime-Version: 1.0 Content-Type: text/plain; charset=EUC-KR X-Mailer: Mutt 0.93.2i Content-Transfer-Encoding: 8bit Precedence: bulk Status: RO Content-Length: 15479 Lines: 422 ============================================================================ FINAL CALL-FOR-PARTICIPATION ---------------------------- Ninth Annual International Symposium on Algorithms and Computation ============================================================================ December 14-16, 1998 Riviera Hotel, Taejon, Korea Hosted by KAIST(Korea Advanced Institute of Science and Technology) KISS(Korea Information Science Society) Sponsored by Ministry of Information and Communication Korea Science and Engineering Foundation Information Processing Society of Japan Korea Information Society Development Institute This symposium is intended to provide a forum for researchers working in algorithms and theory of computation. It will be held in Taejon which is famous with hot spring resort, and is surrounded by historical landmarks of the ancient(18 B.C-A.D.660) civilization and beautiful mountains - Kyeryoung, Daedoon and Pomun. Co-host KISS has been the professional organization in Korea for those in computer and information sciences since 1973. The symposium is hosted in celebration of KISS's 25th anniversary. Organization ------------ o Program Committee Chair * Kyung-Yong Chwa (Co-Chair; KAIST, Korea) * Oscar Ibarra (Co-Chair; UC Santa Barbara, USA) o Program Committee * Takao Asano (Chuo U., Japan) * Ding-Zhu Du (U. of Minnesota, USA) * Susanne Hambrusch (Purdue U., USA) * Hiroshi Imai (U. of Tokyo, Japan) * Tao Jiang (McMaster U., Canada) * Sam Kim (Kyungpook Nat. U., Korea) * D.T. Lee (Northwestern U., USA) * Ming Li (U. of Waterloo, Canada) * Pandu Rangan (IIT, Madras, India) * Sartaj Sahni (U. of Florida, USA) * P. Spirakis (Comp. Tech. Inst., Patras, Greece) * Roberto Tamassia (Brown U., USA) * Shanghua Teng (U. of Illinois, USA) * Osamu Watanabe (Tokyo Inst. Tech., Japan) * Peter Widmayer (ETH, Zurich, Switzerland) * Chee K. Yap (Courant Inst. NYU, USA) * Hsu-Chun Yen (National Taiwan U., Taiwan) o Organizing Committee Chair * Jik Hyun Chang (Sogang U., Korea) o Organizing Committee * Hee-Chul Kim (Hankuk U. of Foreign Studies, Korea) * Sang-Ho Lee (Ewha Womans U., Korea) * Kunsoo Park (Seoul National U., Korea) Invited Speaker --------------- o Bernard Chazelle(Princeton University and Ecole Polytechnique) "The Discrepancy Method" o Roberto Tamassia(Brown University) "Implementing Algorithms and Data Structures: An Educational and Research Perspective" Program ---------- Sunday, December 13, 1998 6:00 Early Registration and Welcome Reception Monday, December 14, 1998 8:30 Registration 9:20 Opening Address Invited Presentation 9:30 The Discrepancy Method - Abstract Bernard Chazelle (Princeton and Ecole Polytechnique) Coffee Break: 10:30 -- 11:00 Session 1A: Geometry I 11:00 $L_\infty$ Voronoi Diagrams and Applications to VLSI Layout and Manufacturing Evanthia Papadopoulou 11:30 Facility Location on Terrains Boris Aronov, Marc van Kreveld, René van Oostrum, Kasturirangan Varadarajan 12:00 Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles Joonsoo Choi, Chan-Su Shin, Sung Kwon Kim Session 1B: Complexity I 11:00 Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words Hiroki Arimura, Shinichi Shimozono 11:30 Disjunctions of Horn Theories and Their Cores Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino 12:00 Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung Lunch: 12:30 --- 2:00 Session 2A: Graph Drawing 2:00 Two-Layer Planarization in Graph Drawing Petra Mutzel, René Weiskircher 2:30 Computing Orthogonal Drawings in a Variable Embedding Setting Walter Didimo, Giuseppe Liotta 3:00 Dynamic Grid Embedding with Few Bends and Changes Ulrik Brandes, Dorothea Wagner Session 2B: On-Line Algorithm and Scheduling 2:00 Two New Families of List Update Algorithms Frank Schulz 2:30 An Optimal Algorithm for On-Line Palletizing at Delivery Industry J. Rethmann, E. Wanke 3:00 On-Line Scheduling of Parallel Jobs with Runtime Restrictions Stefan Bischof, Ernst W. Mayr Coffee Break: 3:30 -- 4:00 Session 3A: CAD/CAM and Graphics 4:00 Testing the Quality of Manufactured Disks and Cylinders Prosenjit Bose, Pat Morin 4:30 Casting with Skewed Ejection Direction Hee-Kap Ahn, Siu-Wing Cheng, Otfried Cheong 5:00 Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image Tetsuo Asano, Hiro Ito, Souichi Kimura, Shigeaki Shimazu Session 3B: Graph Algorithm I 4:00 k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki 4:30 Polyhedral Structure of Submodular and Posi-modular Systems Hiroshi Nagamochi, Toshihide Ibaraki 5:00 Maximizing the Number of Connections in Optical Tree Networks Thomas Erlebach, Klaus Jansen Tuesday, December 15, 1998 Invited Presentation 9:00 Implementing Algorithms and Data Structures: an Educational and Research Perspective - Abstract Roberto Tamassia (Brown) Session 4: Best Paper Presentation 10:00 Selecting the k Largest Elements with Parity Tests Tak Wah Lam, Hing Fung Ting Coffee Break: 10:30 -- 11:00 Session 5A: Randomized Algorithm 11:00 Randomized K-Dimensional Binary Search Trees Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez 11:30 Randomized O(log log n)-Round Leader Election Protocols in Packet Radio Networks Koji Nakano, Stephan Olariu 12:00 Random Regular Graphs with Edge Faults: Expansion through Cores Andreas Goerdt Session 5B: Complexity II 11:00 A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem Takashi Mihara, Shao Chin Sung 11:30 Generalized Graph Colorability and Compressibility of Boolean Formulae Richard Nock, Pascal Jappy, Jean Sallantin 12:00 On the Complexity of Free Monoid Morphisms Klaus-Jörn Lange, Pierre McKenzie Lunch: 12:30 --- 2:00 Session 6A: Graph Algorithm II 2:00 Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs Sun-Yuan Hsieh, Chin-Wen Ho, Tsan-Sheng Hsu, Ming-Tat Ko, Gen-Huey Chen 2:30 Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs Yaw-Ling Lin 3:00 Finding Planar Geometric Automorphisms in Planar Graphs Seok-Hee Hong, Peter Eades, Sang-Ho Lee Session 6B: Combinatorial Problem 2:00 A New Approach for Speeding Up Enumeration Algorithms Takeaki Uno 2:30 Hamiltonian Decomposition of Recursive Circulants Jung-Heum Park 3:00 Convertibility among Grid Filling Curves Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama Coffee Break: 3:30 -- 4:00 Session 7A: Geometry II 4:00 Generalized Self-Approaching Curves Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Gunter Rote 4:30 The Steiner Tree Problem in $\lambda_4$-geometry Plane Guo-Hui Lin, Guoliang Xue Session 7B: Computational Biology 4:00 Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages Tatsuya Akutsu 4:30 On the Multiple Gene Duplication Problem Michael Fellows, Michael Hallett, Ulrike Stege 6:00 Conference Banquet Wednesday, December 16, 1998 Session 8A: Geometry III 9:00 Visibility Queries in Simple Polygons and Applications Boris Aronov, Leonidas J. Guibas, Marek Teichmann, Li Zhang 9:30 Quadtree Decomposition, Steiner Triangulation, and Ray Shooting Siu-Wing Cheng, Kam-Hing Lee 10:00 Optimality and Integer Programming Formulations of Triangulations in General Dimension Akira Tajima Session 8B: Approximation Algorithm 9:00 Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs Philip N. Klein, Hsueh-I Lu 9:30 A Capacitated Vehicle Routing Problem on a Tree Shin-ya Hamaguchi, Naoki Katoh 10:00 Approximation Algorithms for Some Optimum Communication Spanning Tree Problems Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang Coffee Break: 10:30 -- 11:00 Session 9A: Complexity III 11:00 The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees Xiao Zhou, Takao Nishizeki 11:30 Inapproximability Results for Guarding Polygons without Holes Stephan Eidenbenz 12:00 The Inapproximability of Non NP-hard Optimization Problems Liming Cai, David Juedes, Iyad Kanj Session 9B: Parallel and Distributed Algorithm 11:00 An Efficient NC Algorithm for a Sparse $k$-Edge-Connectivity Certificate Hiroshi Nagamochi, Toru Hasunuma 11:30 A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution J. Diaz, J. Petit, P. Psycharis, M. Serna 12:00 Optimal Approximate Agreement with Omission Faults Richard Plunkett, Alan Fekete Proceedings ----------- Accepted papers will be published in the proceedings of the symposium(Lecture Notes in Computer Science, Volume 1533, Springer-Verlag). Some selected papers will appear in Theoretical Computer Science as special issues. Further Information ------------------- If you have any question and request, do not hesitate to ask us. Fax number is +82-42-869-3510 and e-mail address is isaac98@jupiter.kaist.ac.kr. The detailed information for transportation(including time tables for buses and trains), conference site map, and tourist attractions can be found at our web site: http://jupiter.kaist.ac.kr/~isaac98/ General Information ------------------- * Weather Weather in December is mostly cold with occasional snows. Temperature ranges between -5 degrees Centigrade and -2.5 degrees Centigrade(23F - 27.5F). * Currency Exchange US $1 is about 1270 won. But nowadays, the exchange rate is fluctuating very much. You can get the current exchange rate from internet. (http://www.koexbank.co.kr/exchange_rating/newexchange2.html) Credit cards, including VISA and Master Cards are accepted at hotels, department stores and restaurants. Accommodation ------------- Two hotels have been chosen as standard lodging for the conference. One is Riviera hotel(the conference venue), and the other is Top hotel (within easy walking distance to Riviera Hotel). All rooms in Top hotel have been already reserved by pre-registers. Thus you can get a room only in Riviera hotel, but the room is still served by special conference rates. If you want rooms in hotels other than Riviera, we can check it instead of you. Registration ------------ Please, complete the form(with the payment) and send it to the following address(FAX or postal mail only): Fax: +82-2-360-2306 Address:Ms. Cho, Tae-Nam Dept. of Computer Science and Engineering College of Engineering, Ewha Womans University 11-1 Daehyun-dong, Seodaemun-ku, Seoul, Korea 120-750 (E-Mail:isaac98@mm.ewha.ac.kr) ------------------------------ cut here ----------------------------------- ======================================================================= ISAAC'98 REGISTRATION/ACCOMMODATION FORM ======================================================================= Mail or fax to: Ms. Cho, Tae-Nam, Dept. of Computer Science and Engineering College of Engineering, Ewha Womans University, 11-1 Daehyun-dong, Seodaemun-ku, Seoul, Korea 120-750 Fax: +82-2-360-2306 __ Male __ Female __ Dr. __ Prof. __ Researcher & Engineer __ Student __ Other (please specify)_________________ Family name:_________________ Given name:_________________ Affiliation:_________________________________________ Address:_____________________________________________ _____________________________________________________ _____________________________________________________ Phone:_________________ Fax:________________________ Email:_______________________________________________ Registration fee ================================================ Regular US $360 ___ Student US $240 ___ ------------------------------------------------ Registration covers a copy of proceedings, reception on Dec. 13, 2 lunches, coffee and banquet on Dec. 15. The student fee does not include the banquet. ----------------------------------------------------- Additional Tickets Number Amount ===================================================== Banquet(US $50 each) ______ ______ ----------------------------------------------------- ----------------------------------------------------------- Hotel Rates(Daily rates in US dollars per room (incl.tax).) =========================================================== Category Riviera (5 star) =========================================================== Single(1) 95,000 won ___ Double(2) 105,000 won ___ Ondol(2) 95,000 won ___ ----------------------------------------------------------- (Ondol means a Korean traditional room which is heated by Korean under-floor heating system. There are no beds in the Ondol room. US $1 is about 1350 won. The exchange rate is fluctuating very much.) Arrival Date:_____________ Departure Date:_____________ I wish to share my room with:____________________________ (We will make a hotel reservation for you. To guarantee your reservation, a nonrefundable deposit(US $50) is required. The remaining hotel charge should be paid directly to the hotel.) Grand Total ============ Registration fee + Room deposit + Banquet tickets (optional) = _______________ Payment ======== All payments should be made in US dollar through one of the following means. Bank transfer is highly recommended. * Bank transfer ---------------- Name of the bank: Korea Exchange Bank Pangbaidong branch, Seoul, Korea Account number: 099-JSD-100740 Name of Account holder : KISS Please enclose a copy of the bank transfer when sending the registration form. * By credit card. Please complete ----------------- ___ VISA ___ MASTER Card Number:_____________________________________________ Card Holder Name:________________________________________ Card Holder Address:_____________________________________ _________________________________________________________ Expires:_____________ Signature:________________________ Registration/reservation will be confirmed only after payment has been received. ------------- 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 From compgeom-owner@research.bell-labs.com Thu Dec 10 17:48:34 1998 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id RAA00112; Thu, 10 Dec 1998 17:48:29 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id RAA00366; Thu, 10 Dec 1998 17:47:38 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Dec 10 10:38:23 EST 1998 Received: from research.research.bell-labs.com by netlib2; Mon Dec 7 12:51:05 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Dec 7 12:50:22 EST 1998 To: compgeom-announce@research.bell-labs.com Received: from louie.scs.carleton.ca ([134.117.5.2]) by dusty; Mon Dec 7 12:50:20 EST 1998 Received: from leo.scs.carleton.ca (dehne@leo [134.117.5.3]) by louie.scs.carleton.ca (96/30.01.97) with ESMTP id MAA21698 for ; Mon, 7 Dec 1998 12:49:14 -0500 (EST) From: Frank Dehne Received: (from dehne@localhost) by leo.scs.carleton.ca (96/96.1) id MAA25321 for compgeom-announce@research.bell-labs.com; Mon, 7 Dec 1998 12:40:10 -0500 (EST) Date: Mon, 7 Dec 1998 12:40:10 -0500 (EST) Message-Id: <199812071740.MAA25321@leo.scs.carleton.ca> Subject: Euro-Par'99 Content-Type: text Precedence: bulk Status: RO Content-Length: 2879 Lines: 89 Call for papers Euro-Par'99 Toulouse, France August 31 - September 3, 1999 =========== Topic 07: Theory and models for parallel Computation --------- Topic Committee : ----------------- Global chair : Michel Cosnard (LORIA-INRIA, France) Vice-chair : Sajal Das (University of North Texas, USA) Vice-chair : Frank Dehne (Carleton University, Canada) Local chair : Afonso Ferreira (CNRS - I3S - INRIA, Sophia-Antipolis, France) Description : ------------- This topic intends to discuss the current state of parallel computational and cost models, algorithms and complexity. An emphasis is on research that takes into account properties of real machines like communication cost and asynchrony. Famous examples are BSP, CGM, LogP, and PRAM. Developments, comparisons of, and algorithms for such models as well as studies of complexity issues are welcome. Special consideration will be given to scalable, practical algorithms. Algorithmic strategies for abstract parallel models are encouraged, as well as algorithmic tuning for specific architectures, and experimental analysis which provides insight into algorithmic choice. Topics of interest include : ---------------------------- cost models modelling architectures algorithms and data structures complexity theory applications and implementations experimental analysis Euro-Par conference series : ---------------------------- Euro-Par is the annual European conference on parallel computing. It is dedicated to the promotion and advancement of all aspects of parallel computing. Euro-Par'99 is organized as a day of tutorials, two half-day plenary sessions, and a number of parallel sessions. Paper submission : ------------------ Authors are requested to use the electronic form on the web site to submit their paper to the topic they judge most appropriate. Official Address and Organization: ----------------------------------- For any questions related to Euro-Par'99 please refer to our web site: http://www.enseeiht.fr/europar99/ or e-mail to: europar99@enseeiht.fr. The key dates are: ------------------ - January 31st 1999 : Final Date for Submissions - May 1st 1999 : Acceptances Notified - June 1st 1999 : Final Copy and Author Registration due - June 30th 1999 : Early Registration Deadline - August 1st 1999 : Late Registration Deadline ------------- 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 From compgeom-owner@research.bell-labs.com Thu Dec 10 18:08:06 1998 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id SAA00715; Thu, 10 Dec 1998 18:08:03 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id SAA02246; Thu, 10 Dec 1998 18:07:37 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Dec 10 10:43:18 EST 1998 Received: from research.research.bell-labs.com by netlib2; Tue Dec 8 09:43:02 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Dec 8 09:42:21 EST 1998 Received: from mail.cs.uu.nl ([131.211.80.32]) by dusty; Tue Dec 8 09:42:18 EST 1998 Received: from ezinge (ezinge.cs.uu.nl 131.211.80.170) by mail.cs.uu.nl (Postfix) via SMTP id 2F719615EB; Tue, 8 Dec 1998 15:37:34 +0100 (MET) Message-ID: <366D3946.7DF3@cs.uu.nl> Date: Tue, 08 Dec 1998 15:35:50 +0100 From: Marc van Kreveld X-Mailer: Mozilla 3.04Gold (WinNT; I) MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: CFP: Special issue Algorithmica, geographic information Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 1950 Lines: 60 Call for Papers Special Issue of Algorithmica: -- Algorithms for Geographical Information -- Submission deadline: December 21, 1998 Expected publication: Early 2000 Guest editor: Marc van Kreveld Algorithmica is planning a special issue on algorithms for geographical information. Papers describing original research are solicited that deal with algorithmic issues for handling geographic information. Survey and state-of-the-art papers will also be considered; in that case, please contact the guest editor as soon as possible with the intended contents to avoid conflicts. Topics of interest include, but are not limited to, algorithmic issues in: * map overlay * map generalization * label placement * terrain models * spatial interpolation * geostatistics * spatio-temporal data * error handling and uncertainty * feature extraction * visualization, animation, and simulation * network analysis * mathematical modeling of geographic problems * optimization, parallel, distributed, geometric, graph, and evolutionary algorithms applied to geographical data Papers that extend well-known algorithms in nontrivial ways in order to be relevant to geographic data handling are also solicited. Every paper should explicitly address its relevance to geographical data handling. Theoretical and/or experimental analysis is encouraged. Manuscripts should be prepared according to the standard submission guidelines of Algorithmica. All submissions will be subject to the regular refereeing process of the journal. Submit five copies of a full paper to the guest editor (address below) by December 21, 1998. Marc van Kreveld Dept. of Computer Science Utrecht University P.O.Box 80.089 3508 TB Utrecht The Netherlands E-mail: marc@cs.uu.nl ------------- 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 From compgeom-owner@research.bell-labs.com Thu Dec 10 18:13:23 1998 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id SAA00864; Thu, 10 Dec 1998 18:13:20 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id SAA02715; Thu, 10 Dec 1998 18:13:15 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Dec 10 10:46:35 EST 1998 Received: from research.research.bell-labs.com by netlib2; Wed Dec 9 18:11:02 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Dec 9 18:10:16 EST 1998 Received: from louie.scs.carleton.ca ([134.117.5.2]) by dusty; Wed Dec 9 18:10:15 EST 1998 Received: from bach (sack@bach [134.117.5.119]) by louie.scs.carleton.ca (96/30.01.97) with SMTP id SAA05352; Wed, 9 Dec 1998 18:08:55 -0500 (EST) From: Jorg-Rudiger Sack Received: by bach (5.x/Scs-1.0-client) id AA05968; Wed, 9 Dec 1998 18:13:12 -0500 Date: Wed, 9 Dec 1998 18:13:12 -0500 Message-Id: <9812092313.AA05968@bach> To: compgeom-announce@research.bell-labs.com Subject: CGTA: new editor in-chief; special issues Cc: sack@scs.carleton.ca Precedence: bulk Status: RO Content-Length: 1766 Lines: 55 It is our pleasure to inform you that Professor Kurt Mehlhorn, Max-Planck Institut fuer Informatik, Saarbruecken, Germany has accepted our invitation to join as co-editor in-chief of the journal Computational Geometry: theory and applications. We anticipate that this addition will prove to be very positive for CGTA and its readership. Please note that authors can submit to any of the three co-editors in-chief (as well as directly to one of the editors). We would like to encourage authors to submit papers electronically (in post-script ) to one of the following addresses: horn@mpi-sb.mpg.de [for K. Mehlhorn] sack@scs.carleton.ca [for J.-R. Sack] jorge@site.uottawa.ca [for J. Urrutia] This is just one of our efforts designed to reduce reviewing delays. We would also like to draw your attention to the following web-site relevant to the journal: http://www.elsevier.nl/locate/comgeo with many pointers e.g., to Instructions for authors. ********************************************************************* Special issues on new and exciting areas are planned; topics include: Multi-Resolution 3D Modeling, Encoding and Transmitting guest editors: Dr. Andre Gueziec Dr. Gabriel Taubin IBM T.J.Watson Research Center 30 Sawmill River Road Hawthorne, NY 10532 {gueziec, taubin}@watson.ibm.com _ Computational Geometry in Virtual Reality (guest) editors: Dr. Laurent Moccozet moccozet@cui.unige.ch and Prof. Nadia Magnenat-Thalmann, MIRALab, University of Geneva, 24 Rue du General Dufour CH 1211 Geneva 4, Switzerland, email: thalmann@cui.unige.ch ------------- 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 From compgeom-owner@research.bell-labs.com Thu Dec 10 18:31:44 1998 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id SAA01363; Thu, 10 Dec 1998 18:31:41 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id SAA04370; Thu, 10 Dec 1998 18:30:53 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Dec 10 10:44:49 EST 1998 Received: from research.research.bell-labs.com by netlib2; Wed Dec 9 06:25:02 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Dec 9 06:24:46 EST 1998 Received: from mail.cs.uu.nl ([131.211.80.32]) by dusty; Wed Dec 9 06:24:44 EST 1998 Received: from ezinge (ezinge.cs.uu.nl 131.211.80.170) by mail.cs.uu.nl (Postfix) via SMTP id 2F716D03E2; Wed, 9 Dec 1998 12:23:36 +0100 (MET) Message-ID: <366E5D50.47B5@cs.uu.nl> Date: Wed, 09 Dec 1998 12:21:52 +0100 From: Marc van Kreveld X-Mailer: Mozilla 3.04Gold (WinNT; I) MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: CFP: Integrated Spatial Databases: Digital Images and GIS Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 4336 Lines: 121 Below is the CFP for a workshop. Please note that it overlaps with the Symposium on Computational Geometry in Miami Beach, June 1999. Marc van Kreveld ----------------------------------------------------------- International Workshop on Integrated Spatial Databases: Digital Images and GIS June 14 - 15, 1999 Portland, Maine, USA -------------------------------------------------------- Announcement and Call for Papers -------------------------------------------------------- This intensive workshop is sponsored by the Information and Data Management Program of the Directorate for Computer and Information Sciences of the National Science Foundation (NSF). Its scope is to bring together specialists from a variety of overlapping but not always interacting scientific communities. Original, quality contributions are solicited on issues related (but not limited) to the following list of topics: * Spatial and Spatio-Temporal Databases * Database-Driven Information Extraction from Digital Imagery * Queries and Content-Based Information Retrieval Methods * Automated Extraction of GIS Objects from Digital Imagery * Change Detection and Representation * Uncertainty Estimation and Modelling in GIS * Spatio-Temporal Reasoning * Scale in GIS and Digital Image Processing * Very Large Spatial and Image Databases * Multimedia in Integrated GIS * Digital Libraries * Multiple Representations This is a fully refereed workshop. The proceedings will be published by Springer Verlag as a "Lecture Notes in Computer Science" volume. To ensure the constructive interaction between participants and the high quality level of the workshop, the number of participants will be limited. For more details on submission procedures, the conference venue, and registration information, please refer to the workshop web page at http://www.spatial.maine.edu/~peggy/nsfWS.html. ------------------------------------------------------------------------ Workshop Chair: Peggy Agouris, University of Maine Program Committee Chair: Anthony Stefanidis, University of Maine Program Committee: Kate Beard, University of Maine Panos Chrysanthis, University of Pittsburgh Max Egenhofer, University of Maine Wolfgang Foerstner, University of Bonn, Germany Andrew Frank, Technical University of Vienna, Austria Dieter Fritsch, University of Stuttgart, Germany Mike Goodchild, University of California - Santa Barbara Armin Gruen, Swiss Federal Institute of Technology, Switzerland Thanasis Hadzilacos, Computer Technology Institute, Greece Marinos Kavouras, National Technical University of Athens, Greece David Mark, State University of New York at Buffalo Dave McKeown, Carnegie Mellon University Martien Molenaar, International Institute for Aerospace Survey and Earth Sciences (ITC), The Netherlands Dimitris Papadias, University of Science and Technology, Hong Kong, China Hanan Samet, University of Maryland - College Park Tapani Sarjakoski, Finnish Geodetic Institute, Finland Timos Sellis, National Technical University of Athens, Greece Shashi Shekhar, University of Minnesota Nektaria Tryfona, Aalborg University, Denmark Vassilis Tsotras, University of California - Riverside Marc van Kreveld, Utrecht University, The Netherlands ----------------------------------------------------------------------- Important Dates Presentation Proposals (3-Page Extended Abstracts) Due: Feb. 1, 1999 Acceptance Notification: Feb. 22, 1999 Full Papers Due: May 21, 1999 Workshop Dates: June 14 - 15, 1999 Full Paper Acceptance Notification: June 25, 1999 Submission of Revised, Camera-Ready Papers Due: July 23, 1999 ----------------------------------------------------------------------- Contact Information For further details or more up-to-date information please visit the workshop WWW page at http://www.spatial.maine.edu/~peggy/nsfWS.html or contact the organizers at: ISD Workshop '99 Secretariat Dept. of Spatial Information Engineering University of Maine 348 Boardman Hall Orono, ME 04469-5711, USA Phone: +(207) 581 2180 or +(207) 581 2127 Fax: +(207) 581 2206 E-Mail: nsfWS99@spatial.maine.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 From compgeom-owner@research.bell-labs.com Fri Dec 18 17:27:13 1998 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id RAA25501; Fri, 18 Dec 1998 17:27:11 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id RAA27751; Fri, 18 Dec 1998 17:26:37 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Dec 18 10:14:54 EST 1998 Received: from research.research.bell-labs.com by netlib2; Tue Dec 15 12:37:05 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Dec 15 12:35:59 EST 1998 Received: from sargas.inria.fr ([138.96.16.9]) by dusty; Tue Dec 15 12:35:59 EST 1998 Received: by sargas.inria.fr (8.8.8/8.8.5) id SAA03913 for compgeom-announce@research.bell-labs.com; Tue, 15 Dec 1998 18:35:59 +0100 (MET) Date: Tue, 15 Dec 1998 18:35:59 +0100 (MET) From: Herve Bronnimann Message-Id: <199812151735.SAA03913@sargas.inria.fr> To: compgeom-announce@research.bell-labs.com Subject: CG'99 (15th European Workshop on Computational Geometry) MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: quoted-printable X-MIME-Autoconverted: from 8bit to quoted-printable by sargas.inria.fr id SAA03913 Precedence: bulk Status: RO Content-Length: 4051 Lines: 132 #########################################################################= ### CALL FOR PARTICIPATION 15TH EUROPEAN WORKSHOP ON COMPUTATIONAL GEOMETRY March 15-16-17 1999=20 Palais des Congres, Antibes Juan-Les-Pins =09 http://www.inria.fr/prisme/cg99/ Sponsored by INRIA, Matra Datavision, Matra Marconi Space #########################################################################= #### NEWS : YOU CAN REGISTER FROM THE WEB PAGES CREDIT CARDS NOT ACCEPTED, SO DO NOT WAIT #########################################################################= #### The European Workshop on Computational Geometry will be held on March 15-16-17 1999, at the Palais des Congr=E8s, Antibes Juan-Les-Pins, France. The goal of the workshop is to bring together the researchers in Computational Geometry, facilitating - through an informal scheme - the diffusion of their most recent work. -------------------------------------------------------------------------= ---- INVITED SPEAKERS: [*] Bernard Chazelle, Princeton University, and Ecole Polytechnique P= aris. [*] Jeffrey S. Vitter, Duke University and INRIA Sophia-Antipolis. [*] Jean-Marie Laborde, IMAG Grenoble. -------------------------------------------------------------------------= ---- PARTICIPATION: All interested people are welcome, even if they do not intend to give a t= alk. Information about the workshop can be found on the CG'99 www home page. To register on-line, please consult the CG'99 www home page. To register by standard mail, send a copy of the registration form by mai= l to the address below. (You can obtain the registration form from the CG'99 w= ww home page or from the organizers.) Deadline for registration : February 28th, 1999=20 Deadline for hotel registration : February 10th, 1999=20 -------------------------------------------------------------------------= ---- CONTRIBUTIONS: Participants are encouraged to give a 20 minutes presentation of their wo= rk. A preliminary title and a brief abstract (1-3 pages) should be submitted = (either PS files by email to cg99@sophia.inria.fr or camera-ready papers by regul= ar mail to the address below) before January 15th, 1999. The workshop language will be English. If the number of presentations is too large, a selection will be made by = the organizers. No proceeding will be published but the abstracts will be collected and distributed among the participants at the Workshop. Deadline for submissions : January 15th, 1999 -------------------------------------------------------------------------= ---- ORGANIZING COMMITTEE: Jean-Daniel Boissonnat=20 Herve Bronnimann (chair)=20 Frederic Cazals=20 Frank Da Olivier Devillers=20 Pierre-Marie Gandoin Sylvain Pion=20 Francois Rebufat Monique Simonetti (secretary) Monique Teillaud=20 Mariette Yvinec=20 -------------------------------------------------------------------------= ---- ADDRESS: CG'99 Monique Simonetti 15th European Workshop on Computational Geometry INRIA Sophia-Antipolis, B.P. 93=20 2004 Route des Lucioles 06902 Sophia-Antipolis Cedex, FRANCE E-mail: cg99@sophia.inria.fr Phone: +33 4.92.38.78.64 Fax: +33 4.92.38.79.55 -------------------------------------------------------------------------= ---- IMPORTANT DATES January 15th, 1999: Deadline for submissions=20 January 25th, 1999: Program available from this web page=20 February 10th, 1999: Deadline for hotel registration February 28th, 1999: Deadline for registrations=20 March 15th, 1999: Beginning of the conference=20 #########################################################################= #### ------------- 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 From compgeom-owner@research.bell-labs.com Fri Dec 18 17:38:39 1998 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id RAA25739; Fri, 18 Dec 1998 17:38:36 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id RAA28434; Fri, 18 Dec 1998 17:38:28 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Dec 18 10:16:43 EST 1998 Received: from research.research.bell-labs.com by netlib2; Wed Dec 16 09:49:02 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Dec 16 09:47:29 EST 1998 Received: from ardeal.cs.jhu.edu ([128.220.13.20]) by dusty; Wed Dec 16 09:47:27 EST 1998 Received: from michigan.cs.jhu.edu (really [128.220.13.18]) by ardeal.cs.jhu.edu via in.smtpd with smtp (ident root using rfc1413) id (Debian Smail3.2.0.101) for ; Wed, 16 Dec 1998 09:46:31 -0500 (EST) Received: from geom.cs.jhu.edu ([127.0.0.1]) by michigan.cs.jhu.edu with smtp (ident goodrich using rfc1413) id m0zqIDd-0004ssC (Debian /oo/ Smail3.1.29.1 #29.37); Wed, 16 Dec 98 09:46 EST Message-Id: To: compgeom-announce@research.bell-labs.com, theory-local@umiacs.umd.edu Subject: ALENEX '99 Reminder Date: Wed, 16 Dec 1998 09:46:29 -0500 From: "Michael T. Goodrich" Precedence: bulk Status: RO Content-Length: 670 Lines: 21 This is a quick reminder that the registration deadline for 1999 Workshop on Algorithm Engineering and Experimentation (ALENEX '99) is this weekend. This workshop will be held in Baltimore, MD on January 15 and 16 at the same location and immediately before SODA '99. Please see the workshop web site for the registration form and other details: http://www.cs.jhu.edu/Conferences/ALENEX99/ Thanks, Michael Goodrich, Johns Hopkins University Cathy McGeoch, Amherst College ------------- 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 From compgeom-owner@research.bell-labs.com Thu Dec 24 19:24:34 1998 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id TAA15197; Thu, 24 Dec 1998 19:24:32 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id TAA27708; Thu, 24 Dec 1998 19:24:01 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Dec 24 12:19:53 EST 1998 Received: from research.research.bell-labs.com by netlib2; Fri Dec 18 18:03:02 EST 1998 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Dec 18 18:01:12 EST 1998 Received: from austin.cs.unc.edu ([152.2.128.87]) by dusty; Fri Dec 18 18:01:12 EST 1998 Received: from modeling3-cs.cs.unc.edu (culver@modeling3-cs.cs.unc.edu [152.2.142.118]) by austin.cs.unc.edu (8.8.8/8.8.8) with ESMTP id SAA29137; Fri, 18 Dec 1998 18:00:34 -0500 (EST) Received: (from culver@localhost) by modeling3-cs.cs.unc.edu (8.8.8/8.8.8) id SAA27222; Fri, 18 Dec 1998 18:00:33 -0500 MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Date: Fri, 18 Dec 1998 18:00:28 -0500 (EST) From: culver@cs.unc.edu To: compgeom-announce@research.bell-labs.com CC: geom@cs.unc.edu, Sylvain.Pion@sophia.inria.fr Subject: MAPC: an efficient library for algebraic points & curves, v. 1.0 X-Mailer: VM 6.43 under 20.4 "Emerald" XEmacs Lucid Message-ID: <13946.56706.90476.671442@modeling3-cs.cs.unc.edu> X-Attribution: tdc Precedence: bulk Status: RO Content-Length: 1028 Lines: 29 The Department of Computer Science at the University of North Carolina, Chapel Hill announces the release of MAPC: a library for efficient and exact manipulation of algebraic points and curves in the plane. MAPC is a collection of C++ classes which allow programmers to easily define and work with: - Multivariate polynomials with floating-point, multiprecision integer, or multiprecision rational coefficients. - Algebraic numbers represented as the roots of polynomials within an interval. - One and two dimensional points whose coordinates are defined as either algebraic numbers or as rational numbers. - Segments of algebraic plane curves. For further information and downloading instructions, please see the MAPC web page: http://www.cs.unc.edu/~geom/MAPC/ Questions or comments can be directed to: geom@cs.unc.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 From compgeom-owner@research.bell-labs.com Tue Jan 12 20:06:32 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id UAA05848; Tue, 12 Jan 1999 20:06:29 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id UAA08945; Tue, 12 Jan 1999 20:03:51 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jan 12 13:00:01 EST 1999 Received: from research.research.bell-labs.com by netlib2; Sat Jan 2 16:59:00 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Sat Jan 2 16:57:39 EST 1999 Received: from Hydro.CAM.ORG ([198.168.100.7]) by dusty; Sat Jan 2 16:57:37 EST 1999 Received: from [199.84.44.201] (Dialup-453.HIP.CAM.ORG [199.84.44.201]) by Hydro.CAM.ORG (8.8.8/8.8.4) with SMTP id QAA14104 for ; Sat, 2 Jan 1999 16:57:24 -0500 (EST) X-Sender: Eden@Lisa.Cs.McGill.Ca Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Sat, 2 Jan 1999 16:57:38 -0500 To: compgeom-announce@research.bell-labs.com From: Eden@Cs.McGill.Ca (Eden) Subject: Java Polygon & Point Editors Precedence: bulk Status: RO Content-Length: 1196 Lines: 23 JeoEdit: Java Polygon & Point Editors created by Mark Grundland for Godfried Toussaint Computational Geometry Lab School of Computer Science at McGill University Montreal, Canada The JeoEdit package, consisting of the JeoEditPoints applet and the JeoEditPolygon applet, is a set of Java visual editors for computational geometry. Their mission is to help the computational geometry community to realize its algorithms and theorems on the internet, by providing a flexible and easy interface for drawing a set of points or a polygon as well as the means to communicate this geometric information to any applet. These ready-to-use editors focus on user interaction while your applet can concentrate on algorithmic calculation. The advantage of using the JeoEdit editors is that, by providing a self-contained user interface for manipulating geometric structures, they leave you free to create the applet of your dreams without having to worry about how that interface works. ------------- 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 From compgeom-owner@research.bell-labs.com Tue Jan 12 20:14:37 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id UAA06006; Tue, 12 Jan 1999 20:14:35 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id UAA09550; Tue, 12 Jan 1999 20:12:10 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jan 12 13:02:26 EST 1999 To: compgeom-announce@research.bell-labs.com Received: from research.research.bell-labs.com by netlib2; Mon Jan 11 22:23:02 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Jan 11 22:21:30 EST 1999 Received: from polytope.cs.princeton.edu ([128.122.175.30]) by dusty; Mon Jan 11 22:21:28 EST 1999 Received: by polytope.cs.princeton.edu via sendmail from stdin id (Debian Smail3.2.0.101) for compgeom-announce@research.bell-labs.com; Mon, 11 Jan 1999 21:41:23 -0500 (EST) Message-ID: <19990111214123.A3943@polytope.nj.nec.com> Date: Mon, 11 Jan 1999 21:41:23 -0500 From: Herve Bronnimann To: undisclosed-recipients: ; Subject: CG99 [REMINDER] *** Deadline is January 15th 1999 *** Reply-To: Herve.Bronnimann@sophia.inria.fr Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Mailer: Mutt 0.91.2 Precedence: bulk Status: RO Content-Length: 2583 Lines: 75 ################################################################### 15TH EUROPEAN WORKSHOP ON COMPUTATIONAL GEOMETRY March 15-16-17 1999 Palais des Congres, Antibes Juan-Les-Pins http://www.inria.fr/prisme/cg99/ Sponsored by INRIA, Matra Datavision, Matra Marconi Space ################################################################### REMINDER: DEADLINE FOR SUBMISSIONS IS *** January 15, 1999 *** ################################################################### The European Workshop on Computational Geometry will be held on March 15-16-17 1999, at the Palais des Congres, Antibes Juan-Les-Pins, France. The goal of the workshop is to bring together the researchers in Computational Geometry, facilitating - through an informal scheme - the diffusion of their most recent work. ------------------------------------------------------------------- INVITED SPEAKERS: [*] Bernard Chazelle, Princeton Univ. and Ecole Polytechnique. [*] Jeffrey S. Vitter, Duke Univ. and INRIA Sophia-Antipolis. [*] Jean-Marie Laborde, IMAG Grenoble. ------------------------------------------------------------------- PARTICIPATION: Participants are encouraged to give a 20 minutes presentation of their work. A title and a brief abstract (2-4 pages) should be submitted (either PS files by email to cg99@sophia.inria.fr or camera-ready papers by regular mail to the address below) before January 15th, 1999. Numbered pages are OK as they will be overwritten. The workshop language will be English. If the number of presentations is too large, a selection will be made by the organizers. No proceeding will be published but the abstracts will be collected and distributed among the participants at the Workshop. DEADLINE FOR SUBMISSIONS : January 15th, 1999 -------------------------------------------------------------- E-mail: cg99@sophia.inria.fr URL: http://www.inria.fr/prisme/cg99/ -------------------------------------------------------------- IMPORTANT DATES January 15th, 1999: Deadline for submissions January 25th, 1999: Program available from the web page February 10th, 1999: Deadline for hotel registration February 28th, 1999: Deadline for registrations March 15th, 1999: Beginning of the conference ############################################################## ------------- 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 From compgeom-owner@research.bell-labs.com Wed Jan 20 02:21:50 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id CAA22260; Wed, 20 Jan 1999 02:21:49 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id CAA13695; Wed, 20 Jan 1999 02:17:55 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jan 19 19:10:13 EST 1999 Received: from research.research.bell-labs.com by netlib2; Sat Jan 16 18:45:02 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Sat Jan 16 18:44:45 EST 1999 Received: from Hydro.CAM.ORG ([198.168.100.7]) by dusty; Sat Jan 16 18:44:45 EST 1999 Received: from [199.84.45.14] (Dialup-519.HIP.CAM.ORG [199.84.45.14]) by Hydro.CAM.ORG (8.8.8/8.8.4) with SMTP id SAA28881 for ; Sat, 16 Jan 1999 18:44:43 -0500 (EST) X-Sender: Eden@Lisa.Cs.McGill.Ca Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Sat, 16 Jan 1999 18:44:44 -0500 To: compgeom-announce@research.bell-labs.com From: Eden@Cs.McGill.Ca (Eden) Subject: RE: Java Polygon & Point Editors Precedence: bulk Status: RO Content-Length: 2177 Lines: 50 Apparently my message about JeoEdit Java Polygon & Point Editors got cut off in the middle on its way to the mailing list, so I am reposting it. Here is all the information, including the URL. ----------------------------------------------------------------------------- JeoEdit: Java Polygon & Point Editors created by Mark Grundland for Godfried Toussaint Computational Geometry Lab School of Computer Science at McGill University Montreal, Canada The JeoEdit package, consisting of the JeoEditPoints applet and the JeoEditPolygon applet, is a set of Java visual editors for computational geometry. Their mission is to help the computational geometry community to realize its algorithms and theorems on the internet, by providing a flexible and easy interface for drawing a set of points or a polygon as well as the means to communicate this geometric information to any applet. These ready-to-use editors focus on user interaction while your applet can concentrate on algorithmic calculation. The advantage of using the JeoEdit editors is that, by providing a self-contained user interface for manipulating geometric structures, they leave you free to create the applet of your dreams without having to worry about how that interface works. As a measure of its quality, the JeoEdit package has been awarded the "Top 5% of the Web" rating by the Java Applet Rating Service (JARS). The JeoEdit applets have been thoroughly tested on Windows NT, Solaris, Linux, and Mac platforms. They are currently free for non-commercial, educational use. Web Site: http://cgm.cs.mcgill.ca/~godfried/jeoedit/ Includes on-line manuals, development guide, and working examples. Questions? Contact me at MGrund@PO-Box.McGill.Ca - Mark Grundland A student of the art of computing & a freelance software developer. ------------------------------------------------------------------------------- ------------- 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 From compgeom-owner@research.bell-labs.com Wed Jan 20 02:32:43 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id CAA22433; Wed, 20 Jan 1999 02:32:42 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id CAA14655; Wed, 20 Jan 1999 02:28:51 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jan 19 19:14:57 EST 1999 Received: from research.research.bell-labs.com by netlib2; Sat Jan 16 18:59:02 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Sat Jan 16 18:57:05 EST 1999 Received: from Hydro.CAM.ORG ([198.168.100.7]) by dusty; Sat Jan 16 18:57:05 EST 1999 Received: from [199.84.45.14] (Dialup-519.HIP.CAM.ORG [199.84.45.14]) by Hydro.CAM.ORG (8.8.8/8.8.4) with SMTP id SAA00529 for ; Sat, 16 Jan 1999 18:57:03 -0500 (EST) X-Sender: Eden@Lisa.Cs.McGill.Ca Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Sat, 16 Jan 1999 18:57:04 -0500 To: compgeom-announce@research.bell-labs.com From: Eden@Cs.McGill.Ca (Eden) Subject: The Virtual Stained Glass Workshop Precedence: bulk Status: RO Content-Length: 1277 Lines: 35 VoronoImage: The Virtual Stained Glass Workshop created by Mark Grundland School of Computer Science at McGill University Montreal, Canada VoronoImage is Macintosh program that transforms any ordinary photograph into an image of a stained glass panel. The magic is performed by fractal Voronoi diagrams. The technique works through generating a partition tree representing a fractal arrangement of discreet Voronoi diagrams, where each Voronoi polygon is recursively subdivided into a Voronoi diagram. The Voronoi diagrams are calculated using a fast Euclidean distance mapping algorithm. Web Site: http://www.cs.mcgill.ca/~eden/VoronoImage/WebSite.html Includes on-line manual, technical guide, as well as a gallery of artwork created with VoronoImage. Questions? Contact me at MGrund@PO-Box.McGill.Ca - Mark Grundland A student of the art of computing & a freelance software developer. ----------------------------------------------------------------------------- ------------- 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 From compgeom-owner@research.bell-labs.com Wed Jan 20 02:41:53 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id CAA22599; Wed, 20 Jan 1999 02:41:52 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id CAA15108; Wed, 20 Jan 1999 02:38:01 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jan 19 19:13:38 EST 1999 Received: from research.research.bell-labs.com by netlib2; Mon Jan 18 05:25:03 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Jan 18 05:24:56 EST 1999 Received: from avalon.informatik.uni-freiburg.de ([132.230.150.1]) by dusty; Mon Jan 18 05:24:56 EST 1999 Received: from metropolis.informatik.uni-freiburg.de (metropolis.informatik.uni-freiburg.de [132.230.152.60]) by avalon.informatik.uni-freiburg.de (8.9.0/8.9.0) with ESMTP id LAA21745 for ; Mon, 18 Jan 1999 11:24:52 +0100 (MET) Received: (from hipke@localhost) by metropolis.informatik.uni-freiburg.de (8.9.0/8.9.0) id LAA12228; Mon, 18 Jan 1999 11:24:20 +0100 (MET) Date: Mon, 18 Jan 1999 11:24:20 +0100 (MET) Message-Id: <199901181024.LAA12228@metropolis.informatik.uni-freiburg.de> From: Christoph Hipke MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit To: compgeom-announce@research.bell-labs.com Subject: Vega 1.0 Release X-Mailer: VM 6.34 under Emacs 20.2.1 Precedence: bulk Status: RO Content-Length: 1483 Lines: 41 Vega - Visualization Environment for Geometric Algorithms Created by Christoph A. Hipke and Sven Schuierer Institut fuer Informatik, Universitaet Freiburg, Germany Vega is a new distributed and flexible environment for the visualization of geometric algorithms. It is based on a client/server architecture where the algorithms run on UNIX servers making use of algorithm libraries such as LEDA and CGAL and the client runs on any Java Virtual Machine. Features: - User interface for interactively editing hierarchically structured scenes of geometric objects, starting algorithms, and viewing the results - Easy adaption of existing algorithms, support for LEDA and CGAL - Flexible adjustment of the visualization output through view attributes - Distributed asynchronous narrow-bandwidth protocol, on-line and off-line visualization Information about Vega is available at the following URL. For non-commercial purposes the Vega Client, Server, and Library can be downloaded. http://ad.informatik.uni-freiburg.de/Vega A Technical Report that provides an overview of the Vega system and its concepts is also available: http://www.informatik.uni-freiburg.de/tr/1998/Report117/ Please direct comments and questions to Christoph A. Hipke ------------- 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 From compgeom-owner@research.bell-labs.com Thu Jan 21 16:38:53 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA04942; Thu, 21 Jan 1999 16:38:51 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA06441; Thu, 21 Jan 1999 16:34:25 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Jan 21 09:25:54 EST 1999 Received: from research.research.bell-labs.com by netlib2; Thu Jan 21 04:17:01 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Jan 21 04:16:27 EST 1999 Received: from mail.cs.uu.nl ([131.211.80.32]) by dusty; Thu Jan 21 04:16:25 EST 1999 Received: from club.cs.uu.nl (club.cs.uu.nl [131.211.80.91]) by mail.cs.uu.nl (Postfix) with SMTP for id 9784C452D; Thu, 21 Jan 1999 10:16:19 +0100 (MET) Date: Thu, 21 Jan 1999 10:16:16 +0100 (MET) From: Mark de Berg X-Sender: markdb@club.cs.uu.nl To: compgeom-announce@research.bell-labs.com Subject: PhD positions at Utrecht University Message-ID: X-Org: Department of Computer Science; Utrecht University X-Org: P.O. Box 80.089; 3508 TB Utrecht; The Netherlands. X-Org: phone: +31-30-2531454; telefax: +31-30-2513791 MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 4604 Lines: 102 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % % % OPENINGS FOR PhD STUDENTS % % in the area of % % COMPUTATIONAL GEOMETRY AND ITS APPLICATION % % at % % UTRECHT UNIVERSITY (the Netherlands) % %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% The Applied Algorithms group at the Department of Computer Science at Utrecht University is one of the world's largest research groups in the area of computational geometry. Currently the group has several openings for PhD students. We seek both students who want to do experimental research as well as students who are interested in theoretical research. Possible projects include, but are not limited to: * MOCCAM: Moving Objects in Complex CAD Models The goal of the MOCCAM project is to develop algorithmic techniques for motion support in CAD models, that is, the CAD system should be able to answer questions about the feasibility of motions of objects through the model. Such functionality is important for, for example, maintenance and replacement operations. The approach will be based on the probabilistic path planner, a technique developed for robot motion planning. Depending on the applicant, research in this project can be more theoretical or more experimental. * Algorithmic Techniques for Computer-Generated Forces. This is a joint project with TNO-FEL, one of the laboratories of the Netherlands Organization for Applied Scientific Research (TNO). The goal of the project is to develop, analyze, and implement and test algorithms to support computer-generated forces, that is, computer simulations of real forces to be used for the training of military personnel. The project will focus on algorithms for geometric problems such as path planning, visibility computations, and collision detection. This project has a clear experimental component. * Fundamental Problems in Computational Geometry Besides the two project above, there are also possibilities for PhD students interested in `pure' computational geometry. Possible topics are: kinetic data structures (where one studies geometric data structures for moving objects), realistic input models (where one studies computational geometry problems under certain restrictive assumptions on the input), or visibility problems. Candidates should preferably have an MSc in computer science, and a firm background in algorithms. Students with an MSc in mathematics will also be considered if they have sufficient background in computer science. ADDITIONAL INFORMATION ====================== THE APPLIED ALGORITHMS GROUP The Applied Algorithms group is headed by prof. Mark Overmars. The other staff members of the group are: dr Mark de Berg, dr Marc van Kreveld, dr Twan Maintz, dr Frank van der Stappen, dr Dirk Thierens, and dr Remco Veltkamp. In addition, there are currently eight PhD students, two postdocs, and two scientific programmers. The main theme of the group is computational geometry and its application to areas like robotics, geographical information systems, computer vision, and computer graphics and virtual reality. Besides that, research is performed on medical image analysis and on evolutionary computing. BEING A PhD STUDENT IN THE NETHERLANDS In the Netherlands, every PhD student gets paid a salary; no additional grants are needed. Moreover, although PhD students sometimes take courses, there is no minimum requirement. Hence, PhD students are more like employees than like students. Indeed, the Dutch word for PhD student translates to "research trainee". The work of a PhD student includes assisting in courses of the undergaduate program of the department. This amounts to at most 20% of the time; the remaining time is spent on research and research-related activities. INTERESTED? =========== If you want to know more about the possibilities of becoming a PhD student in the Applied Algorithms group at Utrecht University, please contact dr Mark de Berg (markdb@cs.uu.nl). More information is also available on our web-page: http://www.cs.uu.nl/groups/AA/ ------------- 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 From compgeom-owner@research.bell-labs.com Sun Jan 24 00:41:11 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA13672; Sun, 24 Jan 1999 00:41:09 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id AAA21865; Sun, 24 Jan 1999 00:36:27 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Jan 23 17:34:32 EST 1999 Received: from research.research.bell-labs.com by netlib2; Fri Jan 22 09:55:03 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Jan 22 09:54:46 EST 1999 Received: from mail.cs.uu.nl ([131.211.80.32]) by dusty; Fri Jan 22 09:54:46 EST 1999 Received: from otterlo (otterlo.cs.uu.nl [131.211.80.180]) by mail.cs.uu.nl (Postfix) with SMTP for id 9DD6E4530; Fri, 22 Jan 1999 15:54:41 +0100 (MET) Message-Id: <3.0.5.32.19990122145119.009d3d90@pop.cs.uu.nl> X-Sender: remcov@pop.cs.uu.nl X-Mailer: QUALCOMM Windows Eudora Pro Version 3.0.5 (32) Date: Fri, 22 Jan 1999 14:51:19 +0100 To: compgeom-announce@research.bell-labs.com From: Remco Veltkamp Subject: CGAL 1.2 available Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Precedence: bulk Status: RO Content-Length: 1808 Lines: 44 We are pleased to announce release 1.2 of CGAL, the Computational Geometry Algorithms Library. Additions to release 1.1 include - topological map - planar map overlay - constrained and regular triangulations The CGAL project is a collaborative effort to develop a robust, easy to use, and efficient C++ software library of geometric data structures and algorithms. The CGAL library contains: - Basic geometric primitives such as points, vectors, lines, predicates such as for relative positions of points, and operations such as intersections and distance calculation. - A collection of standard data structures and geometric algorithms, such as convex hull, (Delaunay) triangulation, planar map, polyhedron, smallest enclosing sphere, and multidimensional query structures. - Interfaces to other packages, e.g. for visualisation, and I/O, and other support facilities. For further information and for downloading the library and its documentation, please visit the CGAL web page: http://www.cs.uu.nl/CGAL/ Should you have any questions or comments, please send a message to cgal@cs.uu.nl -------------------------------------------------------------------- Remco Veltkamp | email: Remco.Veltkamp@cs.uu.nl | phone: +31-30-2534091 Dept. Computer Science | fax: +31-30-2513791 Utrecht University | Padualaan 14 | P.O. Box 80089 3584 CH Utrecht | 3508 TB Utrecht The Netherlands | The Netherlands -------------------------------------------------------------------- ------------- 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 From compgeom-owner@research.bell-labs.com Sun Jan 24 00:52:10 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA13889; Sun, 24 Jan 1999 00:52:08 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id AAA22553; Sun, 24 Jan 1999 00:47:17 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Jan 23 17:39:23 EST 1999 Received: from research.research.bell-labs.com by netlib2; Sat Jan 23 10:27:01 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Sat Jan 23 10:26:41 EST 1999 Received: from ori.zcu.cz ([147.228.52.11]) by dusty; Sat Jan 23 10:26:40 EST 1999 Received: from nymph-h (ul405p06-kiv.fav.zcu.cz [147.228.63.65]) by ori.zcu.cz (8.9.1a/8.9.1) with SMTP id QAA06842 for ; Sat, 23 Jan 1999 16:26:35 +0100 (MET) Received: by localhost with Microsoft MAPI; Sat, 23 Jan 1999 16:26:05 +0100 Message-ID: <01BE46ED.12EE1960.kvetono2@students.zcu.cz> From: Kvetonova Ilona Reply-To: "kvetono2@students.zcu.cz" To: "'compgeom-announce@research.bell-labs.com'" Subject: WSCG'2000 Call for Papers, WSCG'99 Call for Participation Date: Sat, 23 Jan 1999 16:22:54 +0100 X-Mailer: Microsoft Internet E-mail/MAPI - 8.0.0.4211 MIME-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 5432 Lines: 128 To be REMOVED from the mailing list, please, send an EMPTY message to the sender with the subject REMOVE To be INSERTED to the mailing list , please, send an EMPTY message to the sender with the subject INSERT WSCG'2000 Call for Papers ========================= The First Announcement Deadline for papers: October 10, 1999 Conference dates: February 7. - 11., 2000 Information: http://wscg.zcu.cz WSCG'99 Call for Participation ============================== You have the very last opportunity to present your paper before the year 2000 and visit Prague - "The Golden City of the Europe" Plzen (Pilsen) is the city of the best beer - Pilsner Urquell Rich tourist program is available ----------------------------------------------------------- W S C G'99 The 7-th International Conference in Central Europe on Computer Graphics, Visualization and Digital Interactive Media 99 in cooperation with EUROGRAPHICS and IFIP working group 5.10 on Computer Graphics and Virtual Worlds will be held in February 8 - 12, 1999 in Plzen at the University of West Bohemia close to PRAGUE, the capital of the Czech Republic ----------------------------------------------------------------------- >> If you are willing to help us as a REVIEWER, please, << >> fill in the form at the http://wscg.zcu.cz/reviewer.htm << ----------------------------------------------------------------------- Conference Chairs ================= Nadia Magnenat Thalmann, MIRALab-CUI, Univ. of Geneva, Switzerland Vaclav Skala, Univ. of West Bohemia, Czech Republic International Programme Committee ================================= Bergougnoux,P.(F) Chalmers,A.(UK) Chen,J.(USA) Fellner,D.(D) Ferko,A.(SK) Groeller,E.(A) Hubbold,R.(UK) Iones,A.(RU) Jensen,W.H.(D) Klein,R.(D) Mockrzycki,V.(PL) Peroche,B.(F) Pratt,M.(USA) Rossignac,J.(USA) Sbert, M.(ES) Seidel,H.-P.(D) Sillion,F.(F) Slavik,P.(CR) Slusalek,P.(D) Sochor, J.(CR) Strasser,W.(D) Stuerzlinger,W.(USA) Szirmay-Kalos,L.(H) Tokuta,A.(USA) Willis, P.(UK) Wuetrich,C.(D) Yagel, R.(USA) Yukita,S.(J) Zara, J.(CR) Sponsors and supporting organizations ===================================== Digital Equipment, Hewlett Packard, IBM, Silicon Graphics, Intergraph, Bentley Systems, Microsoft Topics included --------------- Fundamental algorithms, rendering and visualization, virtual reality, animation and multimedia, medical imaging, geometric modelling and fractals, graphical interaction, object-oriented graphics, WWW technologies, standards, computer vision, parallel and distributed graphics, computational geometry, computer aided geometric design, CAD/CAM, DTP and GIS systems, educational aspects of related fields, usage of graphics within mathematical software (Maple, Mathematica, MathCAD etc.) in education The program includes international books exhibition and video show, too. --------------------------------------------- W S C G '99 International Exhibition ------------------------------------ Information for exhibitors: Please contact the organiser as soon as possible -------------------------- for detailed information and conditions. The WSCG98 Exhibition will be held in parallel. Top leading European and Czech companies active in computer graphics, visualization and computer vision, CAD/CAM and GIS systems, virtual reality, multimedia systems and others will be presenting their latest products. Special programme will be available, too. ----------------- Accepted papers will be published in the Conference proceedings with ISBN. They are reviewed by INSPEC, Cambridge Scientific Abstracts, InfoStore, IEEE , ISI , AIMS , INIST and others for citations index and other purposes. The best papers will be considered for possible publication in the Journal of Visualisation and Computer Animation, Computers&Graphics, The Visual Computer, Machine Graphics & Vision and others journals. Organizer and conference secretariat ------------------------------------ Vaclav Skala c/o Computer Science Dept., Univ.of West Bohemia Univerzitni 8, Box 314, 306 14 Plzen, Czech Republic e-mail: skala@kiv.zcu.cz Subject: INFO WSCG99 tel.:+420-19-7491-188 fax:+420-19-7491-188, 213 fax:+420-19-7822-578 The latest information is available at: http://wscg.zcu.cz select WSCG'99 Information on all WSCG conferences: http://wscg.zcu.cz In case of any problems use: http://147.228.63.9 ------------- 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 From compgeom-owner@research.bell-labs.com Thu Jan 28 22:03:04 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id WAA09939; Thu, 28 Jan 1999 22:03:03 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id VAA19179; Thu, 28 Jan 1999 21:56:58 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Jan 28 14:44:42 EST 1999 Received: from research.research.bell-labs.com by netlib2; Wed Jan 27 09:01:04 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Jan 27 09:00:41 EST 1999 Received: from cuimail.unige.ch ([129.194.69.50]) by dusty; Wed Jan 27 09:00:39 EST 1999 Received: from pcmira127 (pcmira127.unige.ch [129.194.139.127]) by cuimail.unige.ch (PMDF V5.2-31 #32426) with SMTP id <0F68004FB1L0AM@cuimail.unige.ch> for compgeom-announce@research.bell-labs.com; Wed, 27 Jan 1999 15:00:36 +0100 (MET) Date: Wed, 27 Jan 1999 15:00:02 +0100 From: Laurent Moccozet Subject: [2nd CFP] Computational Geometry journal - Special Issue on Virtual Reality X-Sender: moccozet@cuimail.unige.ch To: compgeom-announce@research.bell-labs.com Message-id: <3.0.3.32.19990127150002.00a1f780@cuimail.unige.ch> MIME-version: 1.0 X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.3 (32) Content-type: text/plain; charset=us-ascii Precedence: bulk Status: RO Content-Length: 3085 Lines: 99 Call for Papers Special Issue of the Computational Geometry Journal on Computational Geometry in Virtual Reality Submission due: February 15th, 99 Computational Geometry provides a wide range of efficient and original solutions to problems faced by researchers in Virtual Reality. This special issue is dedicated to applications of Computational Geometry to build, control, animate and display Virtual Worlds. Original, research, practice, and experience papers are sought that address Computational Geometry aspects and applications in Virtual Reality. Topics include, but are not limited to: * 3D Geometric Shape Modeling. * 3D Shape Morphing and Warping. * Rendering Virtual Worlds. * Visualization of Virtual Worlds. * Realistic Textures Simulation and Texture Mapping. * Virtual Landscape Modeling. * Natural Phenomenons Simulation. * Articulated Characters Animation. * Motion Control and Capture. * Collision Detection in Virtual Worlds. * Path and Route Planning in Virtual Worlds. * Level of Details Management in Virtual Worlds. * 3D Shape Simplification for Virtual Worlds. Schedule: Paper submission: February 15, l999 Acceptance/rejection notification: May 1, l999 Final manuscript submission: June 15, l999 Publication: late l999/early 2000 The guest editors of this issue are: Prof. Nadia Magnenat-Thalmann, thalmann@cui.unige.ch and Dr. Laurent Moccozet moccozet@cui.unige.ch MIRALab, University of Geneva, 24 Rue du General Dufour CH 1211 Geneva 4, Switzerland, Submission guidelines: Authors should carefuly check the guide for authors available from http://www.elsevier.nl/locate/comgeo - Paper manuscript submission: Send five copies of the full manuscript to: Laurent Moccozet MIRALab, University of Geneva, 24 Rue du General Dufour CH 1211 Geneva 4, Switzerland FAX: +41 22 705 77 80 phone: +41 22 705 76 19 - Electronic submission: Authors may submit their paper by ftp. The electronic version of your manuscript should be submitted in PDF (preferred) or Postscript using anonymous ftp to cuisg34.unige.ch. The paper should be submitted as one file. The file name should be first author's name. Please follow the procedure: ftp cuisg34.unige.ch username: anonymous password: cd cgta put In any case, you should send an email to the editors with the title of the paper, the authors with affiliation, the contact author, the abstract and eventually the filename used for ftp. ---------- Laurent Moccozet Laurent.Moccozet@cui.unige.ch MIRALab/CUI, Universite de Geneve tel:+41 22 705 76 66 24 Rue du General Dufour fax:+41 22 705 77 80 CH 12111 Geneve 4 http://www.miralab.unige.ch/~moccozet/ ------------- 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 From compgeom-owner@research.bell-labs.com Thu Jan 28 22:15:53 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id WAA10173; Thu, 28 Jan 1999 22:15:52 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id WAA20211; Thu, 28 Jan 1999 22:09:28 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Jan 28 14:46:33 EST 1999 Received: from research.research.bell-labs.com by netlib2; Wed Jan 27 17:25:10 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Jan 27 17:24:42 EST 1999 Received: from granmapa.cs.uiuc.edu ([128.174.244.52]) by dusty; Wed Jan 27 17:24:41 EST 1999 Received: from cs.uiuc.edu (localhost [127.0.0.1]) by granmapa.cs.uiuc.edu (8.9.1/8.9.1) with ESMTP id QAA22167; Wed, 27 Jan 1999 16:24:40 -0600 (CST) Sender: jeffe@cs.uiuc.edu Message-ID: <36AF9226.93340114@cs.uiuc.edu> Date: Wed, 27 Jan 1999 16:24:38 -0600 From: Jeff Erickson Organization: Dept. of Computer Science, Univ. of Illinois, Urbana-Champaign X-Mailer: Mozilla 4.5 [en] (X11; U; SunOS 5.6 sun4u) X-Accept-Language: en MIME-Version: 1.0 Newsgroups: comp.theory,comp.graphics.algorithms,sci.math To: compgeom-announce@research.bell-labs.com, dmanet@math.utwente.nl, theory-a@listserv.nodak.edu Subject: Reminder: Computational Geometry Video Review Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 3216 Lines: 77 CALL FOR VIDEOS 8th Annual Video Review of Computational Geometry Background: This video review showcases the use of visualization in computational geometry for exposition and education, as an interface and a debugging tool in software development, and for the visual exploration of geometry in research. Algorithm animations, visual explanations of structural theorems, descriptions of applications of computational geometry, and demonstrations of software systems are all appropriate. Videos that accompany papers or communications submitted to the technical program committee are encouraged. The Video Review will be shown and distributed at the 15th Annual ACM Symposium on Computational Geometry, to be held June 13-16, 1999 in Miami Beach, Florida. For more information about SCG, please see the symposium web page at http://www.cs.miami.edu/events/SCG99/ . Submissions: Authors should send one preview copy of a videotape to the address below by February 13, 1999. The videotape should be at most eight minutes long (three to five minutes, preferred), and be in VHS NTSC or VHS PAL format. Each video tape must be accompanied by a one- or two-page description of the material shown in the video, and where applicable, the techniques used in the implementation. Please format descriptions following the guidelines for ACM proceedings. Additional material describing the contents of the videos, such as the full text of accompanying papers, may also be included. Textual material may be submitted electronically by e-mailing either the URL of a PostScript file (preferred) or the PostScript file itself to jeffe@cs.uiuc.edu. If electronic submission is impossible, authors should include 5 hard copies of the accompanying text with their video. Videotapes and accompanying text should be sent to: Jeff Erickson Department of Computer Science University of Illinois 1304 W. Springfield Ave. Urbana, IL 61801 Phone: (217) 333-6769 For customs purposes, it is best to declare a value of $5. If you have questions, please contact the committee chair at jeffe@cs.uiuc.edu or (217) 333-6769. Notification: Authors will be notified of acceptance or rejection, and given reviewers' comments by March 1, 1999. For each accepted video, the final version of the textual description will be due by March 15, 1999 for inclusion in the proceedings. Final versions of accepted videos will be due April 15, 1999 in the best format available. The accepted videos will be edited onto one tape, which will be shown at the conference, distributed to the participants, and available from ACM after the conference. Video Program Committee: Danny Chen (Notre Dame) Jeff Erickson, Chair (U Illinois) John Sullivan (U Illinois) Subhash Suri (Washington U) Shang-Hua Teng (U Illinois) -- Jeff Erickson mailto:jeffe@cs.uiuc.edu Computer Science Department http://www.uiuc.edu/ph/www/jeffe University of Illinois, 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 From compgeom-owner@research.bell-labs.com Sat Jan 30 00:14:13 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA11387; Sat, 30 Jan 1999 00:14:11 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id AAA16610; Sat, 30 Jan 1999 00:08:18 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Jan 29 17:07:33 EST 1999 Received: from research.research.bell-labs.com by netlib2; Fri Jan 29 15:33:01 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Jan 29 15:32:55 EST 1999 Received: from lie.inf.ethz.ch ([129.132.11.160]) by dusty; Fri Jan 29 15:32:54 EST 1999 Received: (from kortenka@localhost) by lie.inf.ethz.ch (8.8.7/8.8.7) id VAA05176; Fri, 29 Jan 1999 21:32:54 +0100 From: Ulli Kortenkamp MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Date: Fri, 29 Jan 1999 21:32:54 +0100 (CET) To: compgeom-announce@research.bell-labs.com Subject: Resend: The Interactive Geometry Software Cinderella In-Reply-To: <199901291613.RAA04886@lie.inf.ethz.ch> References: <199901291613.RAA04886@lie.inf.ethz.ch> X-Mailer: VM 6.43 under 20.4 "Emerald" XEmacs Lucid Message-ID: <14002.6689.930042.48681@lie.inf.ethz.ch> Precedence: bulk Status: RO Content-Length: 948 Lines: 35 ####################################################### Announcement: The Interactive Geometry Software C I N D E R E L L A ####################################################### We would like to announce that the new software for doing interactive geometry on a computer is available for demo-download at http://www.cinderella.de/demo/download.html The software is published by Springer-Verlag, Heidelberg and New York, and will be shipped in March 1999. It includes a 150pp manual and a CD-ROM. Please see our web pages at http://www.cinderella.de for details (in english and german language). Thank you for your attention, Juergen Richter-Gebert Ulli Kortenkamp ETH Zuerich ETH Zuerich ------------- 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 From compgeom-owner@research.bell-labs.com Tue Feb 2 20:28:58 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id UAA23060; Tue, 2 Feb 1999 20:28:55 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id UAA06099; Tue, 2 Feb 1999 20:23:16 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Feb 2 13:21:38 EST 1999 Received: from research.research.bell-labs.com by netlib2; Sat Jan 30 13:45:07 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Sat Jan 30 13:43:19 EST 1999 To: compgeom-announce@research.bell-labs.com Received: from louie.scs.carleton.ca ([134.117.5.2]) by dusty; Sat Jan 30 13:43:18 EST 1999 Received: from leo.scs.carleton.ca (dehne@leo [134.117.5.3]) by louie.scs.carleton.ca (96/30.01.97) with ESMTP id NAA23653 for ; Sat, 30 Jan 1999 13:41:55 -0500 (EST) From: Frank Dehne Received: (from dehne@localhost) by leo.scs.carleton.ca (96/96.1) id NAA23528 for compgeom-announce@research.bell-labs.com; Sat, 30 Jan 1999 13:32:37 -0500 (EST) Date: Sat, 30 Jan 1999 13:32:37 -0500 (EST) Message-Id: <199901301832.NAA23528@leo.scs.carleton.ca> Subject: WADS'99 Content-Type: text Precedence: bulk Status: RO Content-Length: 2783 Lines: 57 CALL FOR PAPERS 1999 Workshop on Algorithms And Data Structures (WADS'99) August 12-14, 1999 Vancouver, Britich Columbia, Canada http://www.scs.carleton.ca/~wads/ Sponsored by The Pacific Institute for the Mathematical Sciences 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) by e-mail to "wads@scs.carleton.ca". Detailed submission instructions are located at http://www.scs.carleton.ca/~dehne/proj/wads/99/instr.html. Submissions must arrive on or before March 1, 1999. Authors will be notified of acceptance or rejection by April 30, 1999. 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 21, 1999 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 (tentative): Charles Leiserson, Marc Snir, Nadia Magnenat Thalman, Umesh Vazirani, and Jeff Vitter Conference Co-Chairs: B. Bhattacharya and A. Gupta, Computer Science, Simon Fraser University, wads_local@cs.sfu.ca, http://www.cs.sfu.ca/~wads Program Committee: Co-Chairs: F. Dehne (Carleton), A. Gupta (SFU), J.-R. Sack (Carleton) and R. Tamassia (Brown). PC-Members: A. Andersson (Uppsala), A. Apostolico (Purdue and Padova), G. Ausiello (Rome), G. Bilardi (Padova) , K. Clarkson (Lucent), R. Cleve (Calgary), M. Cosnard (INRIA-LORIA, France), L. Devroye (McGill), P. Dymond (York), M. Farach-Colton (Rutgers), P. Fraigniaud (Paris), M. Goodrich (Johns Hopkins) A. Grama (Purdue), M. Keil (Saskatchewan), D. Kirkpatrick (UBC), R. Krishnamurti (SFU), D.T. Lee (Northwestern), F. Luccio (Pisa), A. Maheshwari (Carleton), G. Plaxton (Univ. of Texas at Austin), A. Rau-Chaplin (Dalhousie), J. Reif (Duke), F. Ruskey (U. Vic), P.G. Spirakis (Patras), L. Stewart (Alberta), H. Sudborough (U. Texas Dallas), P. Vitanyi (CWI), P. Widmayer (ETH), C.K. Wong (Chinese U. Hong Kong). ------------- 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 From compgeom-owner@research.bell-labs.com Tue Feb 2 20:38:14 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id UAA23282; Tue, 2 Feb 1999 20:38:11 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id UAA06961; Tue, 2 Feb 1999 20:32:32 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Feb 2 13:24:03 EST 1999 Received: from research.research.bell-labs.com by netlib2; Tue Feb 2 10:31:03 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Feb 2 10:30:58 EST 1999 Received: from mail.mpi-sb.mpg.de ([139.19.1.1]) by dusty; Tue Feb 2 10:30:57 EST 1999 Received: from mpii01802.ag1.mpi-sb.mpg.de (mpii01802.ag1.mpi-sb.mpg.de [139.19.11.33]) by mail.mpi-sb.mpg.de (8.8.7/8.8.8) with ESMTP id QAA03025; Tue, 2 Feb 1999 16:30:51 +0100 Received: (from sanders@localhost) by mpii01802.ag1.mpi-sb.mpg.de (8.8.8/8.8.8) id QAA08662; Tue, 2 Feb 1999 16:30:49 +0100 (MET) Message-Id: <199902021530.QAA08662@mpii01802.ag1.mpi-sb.mpg.de> MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit From: Peter Sanders To: compgeom-announce@research.bell-labs.com Subject: Reminder: Postdoc at MPI for Computer Science - Algorithms Group Date: Tue, 3 Nov 1998 17:32:51 +0100 (MET) Precedence: bulk Status: RO Content-Length: 2264 Lines: 64 P O S T - D O C T O R A L F E L L O W S H I P S at the M A X - P L A N C K - I N S T I T U T E for C O M P U T E R S C I E N C E The Max-Planck-Institute for Computer Science is located on the campus of the Universit"at des Saarlandes in Saarbr"ucken, Germany. The institute was founded in 1990 and consists, at present, of two research units: Algorithms and Complexity, and Logic of Programming. Two new units: Hybrid Systems, and Computer Graphics will be added in the first half of 1999. The research group ALGORITHMS AND COMPLEXITY offers a number of postdoctoral fellowships for the year 1999/2000. Fellowships are available for one or two years and amount to DM 3,400 per month, taxfree (approximately USD 2000). There is generous travel support available and the group collaborates with several of the major research institutions in Europe and USA. The interests of the research group members includes data structures, graph and network algorithms, computational geometry, parallel algorithms, computational complexity, combinatorial optimization, graph drawing, on-line algorithms, randomized algorithms, computational biology and implementation of algorithms and program libraries. The group consists mainly of young researchers of several nationalities. The postdoctoral fellows are expected to interact with group members and are encouraged to initiate research in their individual areas of specialization. More information is available on WWW at http://www.mpi-sb.mpg.de Applications (including curriculum vitae, list of publications, research plan, names of references with their e-mail addresses, and intended period of stay) should be sent by FEBRUARY 28, 1998 to Kurt Mehlhorn or Peter Sanders. Further information can be also obtained from Peter Sanders (sanders@mpi-sb.mpg.de). Max-Planck-Institut f"ur Informatik Im Stadtwald D-66123 Saarbr"ucken Germany P.S. The working language in our group is English ------------- 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 From compgeom-owner@research.bell-labs.com Wed Feb 3 18:22:16 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id SAA02205; Wed, 3 Feb 1999 18:22:12 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id SAA02684; Wed, 3 Feb 1999 18:16:10 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Feb 3 11:05:30 EST 1999 To: compgeom-announce@research.bell-labs.com Received: from research.research.bell-labs.com by netlib2; Wed Feb 3 01:13:01 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Feb 3 01:12:44 EST 1999 Received: from sargas.inria.fr ([138.96.16.9]) by dusty; Wed Feb 3 01:12:42 EST 1999 Received: by sargas.inria.fr (8.8.8/8.8.5) id HAA04515; Wed, 3 Feb 1999 07:12:08 +0100 (MET) Date: Wed, 3 Feb 1999 07:12:04 +0100 From: Herve Bronnimann To: undisclosed-recipients: ; Subject: CG'99 [accepted papers] Message-ID: <19990203071203.A4492@sargas.inria.fr> Mime-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 X-Mailer: Mutt 0.95us Content-Transfer-Encoding: quoted-printable X-MIME-Autoconverted: from 8bit to quoted-printable by sargas.inria.fr id HAA04515 Precedence: bulk Status: RO Content-Length: 4558 Lines: 154 [Apologies if you get this message twice] This is a list of accepted papers to CG'99, which will take place in Anti= bes in March 15-16-17 1999. For more information and registration, see http://www.inria.fr/prisme/cg99/ February 10th, 1999: Deadline for hotel registration=20 February 28th, 1999: Deadline for registration=20 See you in Antibes, --=20 Herv=E9 Br=F6nnimann Organizer CG'99 Two problems on separability with lines and polygonals Ferran Hurtado, Merce Mora, Pedro A. Ramos, Carlos Seara Efficient algorithm for finding 2 largest empty circles=20 Sergei Bespamyatnikh Improved algorithms for placing undesirable facilities Matthew J. Katz, Klara Kedem, Michael Segal Geometric Solution concepts for planar ordered Weber Problems Stefan Nickel, Justo Puerto, Ansgar Weissler Dynamic Geometry I: the Problem of Continuity Ulrich H. Kortenkamp, Juergen Richter-Gebert Dynamic geometry II: Application Ulrich H. Kortenkamp, Juergen Richter-Gebert Constrained approximate pattern matching and its applications Frank Nielsen Implementing main-memory point-enclosure algorithms Ulf Erikson A simple and efficient sequential encoding for triangle meshes Leila de Floriani, Paola Magillo, Enrico Puppo Arrangement of curves in the plane: what does ``equivalence'' mean? Manuela Neagu Polygonal decompositions into singular and regular regions Jairo Rocha On some polyhedra covering problems Cao An Wang, Bo-Ting Yang Computations with tight bounding volumes for general parametric surfaces Wilhelm Barth and Ernst Huber Optimal illumination of points with restricted flood-light A. Calatayud, J. Garcia, F. Gomez Exact L_infinity nearest neighbor search in high dimensions Helmut alt, Ulrich Hoffmann A simple and efficient algorithm for high-quality line labeling Pankaj K. Agarwal, Lars Knipping, Marc van Kreveld, Tycho Strijk, Alexander Wolff The Minkowski sum of a convex polyhedron and a polyhderal terrain Antonio Hernandez-Barrerra, Subhas Chandra Nandy, Tetsuo Asano Flipping edges in triangulations on the cylinder Carmen Cortes, Clara I. Grima, Alberto Marquez Parallel flips on planar triangulations Jerome Galtier, Stephane Perennes Delaunay graph on a prescribed graph Manual Abellanas, Frank Harary The design and implementation of planar maps in CGAL Eyal Flato, Dan Halperin, Iddo Hanniel, Oren Nechushtan 3D Triangulations in CGAL Monique Teillaud A geometric approach to protein identification in 2D electrophoretic gel images Frank Hoffmann, Klaus Kriegel, Carola Wenk Further results on arithmetic filters for geometric predicates Olivier Devillers, Franco Preparata Smooth shape reconstruction Jean-Daniel Boissonnat, Fr=E9d=E9ric Cazals, Stephane Nullans Matching shapes with respect to the symmetric difference Helmut Alt, Christian Knauer Computing the shape of a planar point set Mahmoud Melkemi, Mourad Djebali Searching a goal on m rays within a fixed distance Christian Icking, Rolf Klein, Elmar Langetepe On the zookeeper's problem Haakan Jonsson Polar diagrams of geometric objects Clara I. Grima, Alberto Marquez, Lidia Ortega Sweeping along a polygonal line to construct a Delaunay diagram Pierre Kauffmann, Jean-Claude Spehner Non-degeneracy properties of 3D longest-edge algorithms for the quality refinement of triangulations Maria-Cecilia Rivara An algorithm for drawing a ring cover Ala Eddine Barouni, Ali Jaoua, Nejib Zaguia Turn regularity and optimal drawings of orthogonal representations Stina Bridgeman, Giuseppe Di Battista, Walter Didimo, Giuseppe Liotta, Roberto Tamassia, Luca Vismara Orthogonal triangles in the plane M.A. Garrido, Alberto Marquez, J.R. Portillo, P. Reyes Graphs of non-crossing matchings Maria del Carmen Hernando, Ferran Hurtado, Marc Noy Space complexity of sectoral neighborhood spanners Matthias Fischer, Tamas Lukovski, Martin Ziegler On the topological walk method Pierre Angelier, Michel Pocchiola, Stephane Riviere Using train trascks to show that a trivial knot may require exponential-size spanning disks Joel Hass, Jack Snoeyink, William P. Thurston The periodicity of integral convex hulls for conics in $\E^2$ Helymar Balza-Gomez Rectangular duals and box-representation in the cylinder Natalia de Castro, Francisco Javier Cobos, Juan Carlos Dana, Alberto Marq= uez An aperiodic tiles machine Jos=E9 Caceres, Alberto Marquez ------------- 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 From compgeom-owner@research.bell-labs.com Wed Feb 3 18:29:45 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id SAA02440; Wed, 3 Feb 1999 18:29:36 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id SAA03472; Wed, 3 Feb 1999 18:23:39 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Feb 3 11:07:48 EST 1999 Received: from research.research.bell-labs.com by netlib2; Wed Feb 3 04:25:07 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Feb 3 04:24:53 EST 1999 Received: from gemma.inria.fr ([138.96.16.98]) by dusty; Wed Feb 3 04:24:53 EST 1999 Received: by gemma.inria.fr (8.8.8/8.8.5) id KAA05854; Wed, 3 Feb 1999 10:24:48 +0100 (MET) From: Jeff Vitter MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Date: Wed, 3 Feb 1999 10:24:39 +0100 (MET) To: compgeom-announce@research.bell-labs.com Subject: Postdoc opportunity at Duke University X-Mailer: VM 6.43 under 20.4 "Emerald" XEmacs Lucid Message-ID: <14008.5430.139966.629396@gemma.inria.fr> Content-Transfer-Encoding: quoted-printable X-MIME-Autoconverted: from 8bit to quoted-printable by gemma.inria.fr id KAA05854 Precedence: bulk Status: RO Content-Length: 3101 Lines: 69 VISITING ASSISTANT PROFESSOR POSITION AVAILABLE Department of Computer Science Duke University A postdoctoral position at the level of Visiting Assistant Professor of Computer Science is available in the Department of Computer Science at Duke University, under the supervision of Prof. Jeff Vitter. Duke is an equal opportunity employer. The position is for one year and can be extended for additional years by mutual consent. Applicants must have clearly demonstrated experience and skills in systems development. Familiarity with external memory algorithms and database algorithms is a definite plus. Teaching responsibilities include one research seminar per year if desired.=20 The position will include membership in the Center for Geometric Computing, a collaborative effort funded by the Army Research Office with participation from researchers at Brown, Duke, and Johns Hopkins Universities. The problems of interest center around high-performance geometric computations. They include development of efficient methods for spatial databases and geographic information systems, especially those dealing with massive amounts of data. The candidate is expected to play a vital role in the development and/or use of the TPIE programming environment for external memory computation (http://www.cs.duke.edu/TPIE/). Issues involving memory hierarchies and parallel communication will also be considered. Additional responsibilities will be to interact with agency scientists and to help prepare contract, technical, and other reports. The candidate will interact closely with geometric computing=20 groups at Brown, Johns Hopkins, and the Army Research Laboratories. Please send a letter of interest and your CV, and ask three evaluators to send letters of reference, by US Mail or email, to Mr. Keith Hurka-Owen Department of Computer Science Duke University Box 90129 Durham, NC 27708-0129 Email: hurka@cs.duke.edu=20 Tel : (919) 660-6535 To be assured of full consideration, all material including reference letters must arrive by February 15, 1999. Applications will continue to be accepted until the position is filled. -- Jeffrey S. Vitter Email: jsv@cs.duke.edu =20 Lehrman Professor and Chair Phone: (919) 660-6548 =20 Department of Computer Science FAX: (919) 660-6502 =20 Duke University, Box 90129 Home: (919) 382-8724=20 Durham, N.C. 27708-0129 Web: http://www.cs.duke.edu/~jsv/=20 Jusqu'=E0 fin juin 1999: Jeffrey S. VITTER Projet PRISME Phone: +33 4.92.38.77.49 I.N.R.I.A. Sophia Antipolis Secr: +33 4.92.38.77.38 (Agn=E8s) 2004, route des Lucioles FAX: +33 4.92.38.76.43 B. P. 93 Email: Jeff.Vitter@sophia.inria.fr 06902 Sophia Antipolis Cedex Web: http://www.cs.duke.edu/~jsv/ FRANCE =20 ------------- 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 From compgeom-owner@research.bell-labs.com Mon Feb 8 16:05:10 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA09805; Mon, 8 Feb 1999 16:05:08 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id PAA04071; Mon, 8 Feb 1999 15:58:41 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Feb 8 08:55:16 EST 1999 Received: from research.research.bell-labs.com by netlib2; Mon Feb 8 00:39:02 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Feb 8 00:38:06 EST 1999 Received: from icarus.idirect.com ([207.136.80.7]) by dusty; Mon Feb 8 00:38:06 EST 1999 Received: from terminus.idirect.com (terminus.idirect.com [207.136.80.70]) by icarus.idirect.com (8.9.3/8.9.3) with ESMTP id AAA09507 for ; Mon, 8 Feb 1999 00:38:06 -0500 (EST) Received: from ns.idirect.com (ntsvr1-104.tor.idirect.com [209.161.217.104]) by terminus.idirect.com (8.9.3/8.9.3) with SMTP id AAA18310 for ; Mon, 8 Feb 1999 00:37:44 -0500 (EST) Message-Id: <3.0.1.32.19990208003727.006c6a5c@idirect.com> X-Sender: lgl@idirect.com (Unverified) Disposition-Notification-To: X-Mailer: Windows Eudora Pro Version 3.0.1 (32) Date: Mon, 08 Feb 1999 00:37:27 -0500 To: compgeom-discuss@research.bell-labs.com From: LGL Limited Subject: B-Splines: computational formulae and interpolation Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Precedence: bulk Status: RO Content-Length: 928 Lines: 22 Hello, I would like to calculate B-spline curves that fit a series of nodes along a polyline in the GIS I use. After calculating the curve I would like to be able to interpolate points along that curve at an approximate frequency of 10 new nodes to 1 old node. Optionally I would like to calculate these new nodes at set distances along the curve - perhaps calculated by intersecting a curve with the B-spline. Does anyone have an algorithm to do this without resorting to calculus - I would like some simple code to achieve this. Is this the correct list to ask such a question? Ideally I want to write a stand alone module in VisualBASIC to achieve this without having to resort to other numerical libraries. Thank you, Ted Elliott ------------- 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 From compgeom-owner@research.bell-labs.com Tue Sep 7 09:34 EDT 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id JAA17127 for ; Tue, 7 Sep 1999 09:34:03 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Sep 7 09:24:08 EDT 1999 To: compgeom-announce@research.bell-labs.com Received: from grubby.research.bell-labs.com by netlib2; Sun Sep 5 11:53:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Sun Sep 5 11:51:17 EDT 1999 Received: from ori.zcu.cz ([147.228.52.11]) by dusty; Sun Sep 5 11:51:13 EDT 1999 Received: from uk426pc04-kiv.fav.zcu.cz (uk426p03-kiv.fav.zcu.cz [147.228.43.54]) by ori.zcu.cz (8.9.3/8.9.3) with SMTP id RAA23614; Sun, 5 Sep 1999 17:39:39 +0200 (MET DST) Message-ID: <006101bef7b4$8141ce20$362be493@uk426pc04-kiv.fav.zcu.cz> From: "Vaclav Skala" To: Subject: WSCG'2000 Call for papers - Int.Conf on Graphics, Visulization & Ineractive Digital Media, close Prague, Czech Republic Date: Sun, 5 Sep 1999 11:27:30 +0200 MIME-Version: 1.0 Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 4.72.3110.5 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3 Precedence: bulk Content-Type: text/plain; charset="iso-8859-1" Status: RO Content-Length: 4975 Lines: 138 WSCG'2000 ========================= Sorry for duplicates --------------------- Call for Papers & Participation Deadline for papers: October 13, 1999 Conference dates: February 7. - 11., 2000 Information: http://wscg.zcu.cz -------------------------------------------------------- W S C G ' 2000 The 8-th International Conference in Central Europe on Computer Graphics, Visualization and Digital Interactive Media 2000 in cooperation with EUROGRAPHICS, IFIP working group 5.10 Computer Graphics International - CGI on Computer Graphics and Virtual Worlds will be held in February 7 - 11, 2000 in Plzen close to PRAGUE, the capital of the Czech Republic ----------------------------------------------------------------------- >> If you are willing to help us as a REVIEWER, please, << >> fill in the form at the http://wscg.zcu.cz/reviewer.htm << ----------------------------------------------------------------------- Conference Chairs ================= Nadia Magnenat Thalmann, MIRALab-CUI, Univ. of Geneva, Switzerland Vaclav Skala, Univ. of West Bohemia, Czech Republic Keynote speakers ================ (preliminary) Carl Machover, Machover Associates Corp., USA Ben Delaney, CyberEdge Information Services, USA Philip J.Willis, Univ.of Bath, UK Andrej Iones, Univ.of St.Peterburg, Russia Sponsors and supporting organizations ===================================== (Preliminary) Compaq Computers, Hewlett Packard, IBM, Silicon Graphics, Intergraph, Bentley Systems, Microsoft, Autodesk, CyberEdge Information Services (USA) Topics included --------------- Fundamental algorithms, rendering and visualization, virtual reality, animation and multimedia, medical imaging, geometric modelling and fractals, graphical interaction, object-oriented graphics, WWW technologies, standards, computer vision, parallel and distributed graphics, computational geometry, computer aided geometric design, CAD/CAM, DTP and GIS systems, educational aspects of related fields, usage of graphics within mathematical software (Maple, Mathematica, MathCAD etc.) in education. >>> Papers on all aspects of computer graphics are encouraged <<< The program includes international books exhibition and video show, too. --------------------------------------------- W S C G '2000 International Exhibition ------------------------------------ Information for exhibitors: Please contact the organiser as soon as possible -------------------------- for detailed information and conditions. The WSCG Exhibition will be held in parallel. Top leading European and Czech companies active in computer graphics, visualization and computer vision, CAD/CAM and GIS systems, virtual reality, multimedia systems and others will be presenting their latest products. Special programme will be available, too. ----------------- Accepted papers will be published in the Conference proceedings with ISBN. They are reviewed by INSPEC, Cambridge Scientific Abstracts, InfoStore, IEE, ISI, AIMS, INIST and others for citations index and other purposes. The best papers will be considered for possible publication in the Journal of Visualisation and Computer Animation, Computers&Graphics, The Visual Computer, Machine Graphics & Vision and others journals. Organizer and Conference secretariat ------------------------------------ Prof.Ing.Vaclav Skala, CSc. c/o Computer Science Dept., Univ.of West Bohemia Univerzitni 8, Box 314, 306 14 Plzen, Czech Republic e-mail: skala@kiv.zcu.cz Subject: INFO WSCG tel.:+420-19-7491-188 fax:+420-19-7822-578, 799 include your e-mail!!! The latest information is available at: http://wscg.zcu.cz select WSCG'2000 Information on all WSCG conferences: http://wscg.zcu.cz In case of any problems use: http://147.228.63.9 or send a mail to maxvs@bath.ac.uk ~~~~~~~~~~~~~~~~~~~~~ Prof.Ing.Vaclav Skala, CSc. University of West Bohemia Univerzitni 8, Box 314 306 14 Plzen Czech Republic http://herakles.zcu.cz/~skala Tel./record: +420-19-78 22 188 direct Secretariat: tel: +420-19-78 22 212, fax +420-19-78 22 213 ------------- 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 compgeom-owner@research.bell-labs.com Tue Sep 7 09:34 EDT 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id JAA17136 for ; Tue, 7 Sep 1999 09:34:05 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Sep 7 09:25:44 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Mon Sep 6 09:43:02 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Sep 6 09:41:42 EDT 1999 Received: from mail.mpi-sb.mpg.de ([139.19.1.1]) by dusty; Mon Sep 6 09:41:41 EDT 1999 Received: from mpii01807.ag1.mpi-sb.mpg.de (mpii01807.ag1.mpi-sb.mpg.de [139.19.10.5]) by mail.mpi-sb.mpg.de (8.8.7/8.8.8) with ESMTP id PAA25827 for ; Mon, 6 Sep 1999 15:41:32 +0200 Received: from mpii01807 (localhost.mpi-sb.mpg.de [127.0.0.1]) by mpii01807.ag1.mpi-sb.mpg.de (8.8.8/8.8.8) with ESMTP id PAA21803 for ; Mon, 6 Sep 1999 15:41:25 +0200 (MET DST) Message-Id: <199909061341.PAA21803@mpii01807.ag1.mpi-sb.mpg.de> X-Mailer: exmh version 2.0.3 2/24/98 To: compgeom-announce@research.bell-labs.com Subject: CGAL open user discussion list Mime-Version: 1.0 Date: Mon, 06 Sep 1999 15:41:25 +0200 From: Stefan Schirra Precedence: bulk Content-Type: text/plain; charset=us-ascii Status: RO Content-Length: 624 Lines: 20 Dear Geometer CGAL now also provides a discussion forum for users to communicate with other CGAL users and CGAL developers. To subscribe, please send a mail to lyris@postino.mpi-sb.mpg.de with content 'subscribe cgal-discuss-l' or subscribe on http://postino.mpi-sb.mpg.de/cgi-bin/lyris.pl?enter=cgal-discuss-l &text_mode=0 Best regards Stefan Schirra ------------- 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 compgeom-owner@research.bell-labs.com Tue Sep 7 09:33 EDT 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id JAA17103 for ; Tue, 7 Sep 1999 09:33:38 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Sep 7 09:26:08 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Mon Sep 6 16:49:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Sep 6 16:48:14 EDT 1999 Received: from gremlin.ics.uci.edu ([128.195.1.70]) by dusty; Mon Sep 6 16:48:13 EDT 1999 Received: from euclid.ics.uci.edu ( eppstein@euclid.ics.uci.edu [128.195.4.82] ) by gremlin-relay.ics.uci.edu id aa12737 ; 6 Sep 1999 13:48 PDT MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Message-ID: <14292.10373.467627.562711@euclid.ics.uci.edu> Date: Mon, 6 Sep 1999 13:48:05 -0700 (PDT) From: David Eppstein To: compgeom-announce@research.bell-labs.com Subject: report on computational topology available X-Mailer: VM 6.61 under Emacs 19.34.3 Precedence: bulk Content-Type: text/plain; charset=us-ascii Status: RO Content-Length: 1131 Lines: 22 The report from the ACM Worksh. on Computational Topology, held last June in Miami Beach in conjunction with SoCG, is now available in the ACM Computing Research Repository, at http://xxx.lanl.gov/abs/cs.CG/9909001 It provides an overview of current problems in areas related to topological computation, shape representation and reconstruction, meshing, etc, and outlines some goals and recommendations for the area. Incidentally, those of you on this mailing list who don't get the announcements of papers in the CoRR should probably subscribe -- see http://xxx.lanl.gov/list/cs.CG/recent for a list of recently uploaded geometry papers and http://xxx.lanl.gov/help/subscribe for instructions on how to add yourself to the mailing list. -- David Eppstein UC Irvine Dept. of Information & Computer Science eppstein@ics.uci.edu http://www.ics.uci.edu/~eppstein/ ------------- 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 compgeom-owner@research.bell-labs.com Mon Sep 20 21:56:54 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id VAA26448 for ; Mon, 20 Sep 1999 21:56:52 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Sep 20 21:51:16 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Thu Sep 9 05:25:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Sep 9 05:23:25 EDT 1999 Received: from luxator.cs.uni-magdeburg.de ([141.44.23.1]) by dusty; Thu Sep 9 05:23:24 EDT 1999 Received: from latrappe.cs.uni-magdeburg.de (latrappe [141.44.23.18]) by luxator.cs.uni-magdeburg.de (8.9.2/8.9.3) with ESMTP id LAA27616 for ; Thu, 9 Sep 1999 11:19:10 +0200 (MET DST) From: Michiel Smid Received: (from michiel@localhost) by latrappe.cs.uni-magdeburg.de (8.9.2/8.9.3) id LAA20082 for compgeom-announce@research.bell-labs.com; Thu, 9 Sep 1999 11:19:10 +0200 (MET DST) Date: Thu, 9 Sep 1999 11:19:10 +0200 (MET DST) Message-Id: <199909090919.LAA20082@latrappe.cs.uni-magdeburg.de> To: compgeom-announce@research.bell-labs.com Subject: PhD position in Magdeburg Precedence: bulk Status: RO Content-Length: 1622 Lines: 59 PhD POSITION in the Department of Computer Science, University of Magdeburg We seek a PhD student for the research project Quantification of fractures using techniques from Computational Geometry, which is funded by the German Science Foundation (DFG). This is a joint project with the Department of Material Sciences in Magdeburg. The goal of the project is to design, analyze, implement and test algorithms to support the quantification of fractures in materials, starting from three-dimensional images obtained using a confocal lasermicroscope. There will be a close collaboration with faculty and PhD students in the Department of Material Sciences. Qualifications: Candidates should have a master degree in computer science or mathematics, and have a thorough background in algorithms, data structures, discrete mathematics, and possibly some experience in software development. The position is available for a period of two years, with a possible extension of one more year. For further information, contact Michiel Smid Department of Computer Science University of Magdeburg Universit"atsplatz 2 D-39106 Magdeburg Germany Phone: +49 (0)391 67 18557 Fax: +49 (0)391 67 11164 E-mail: michiel@isg.cs.uni-magdeburg.de WWW: http://isgwww.cs.uni-magdeburg.de/~michiel/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://uiuc.edu/~sariel/CG/compgeom/threads.html. From compgeom-owner@research.bell-labs.com Mon Sep 20 21:57:44 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id VAA26537 for ; Mon, 20 Sep 1999 21:57:41 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Sep 20 21:57:37 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Thu Sep 9 16:57:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Sep 9 16:56:24 EDT 1999 Received: from wizard.cse.nd.edu ([129.74.25.101]) by dusty; Thu Sep 9 16:56:22 EDT 1999 Received: from euclid.cse.nd.edu (root@euclid.cse.nd.edu [129.74.25.125]) by wizard.cse.nd.edu (8.9.3/8.9.3) with ESMTP id PAA18358; Thu, 9 Sep 1999 15:56:20 -0500 (EST) Received: from localhost (dchen@localhost [127.0.0.1]) by euclid.cse.nd.edu (8.9.3/8.9.2) with ESMTP id PAA29694; Thu, 9 Sep 1999 15:56:20 -0500 (EST) Message-Id: <199909092056.PAA29694@euclid.cse.nd.edu> To: compgeom-announce@research.bell-labs.com cc: chen@euclid.cse.nd.edu Subject: Chair position opening Date: Thu, 09 Sep 1999 15:56:18 -0500 From: danny chen Precedence: bulk Status: RO Content-Length: 2875 Lines: 68 UNIVERSITY OF NOTRE DAME Chair of Computer Science & Engineering The University of Notre Dame invites applications and nominations for the position of Department Chair and Schubmehl/Prein Chair of Computer Science & Engineering in the College of Engineering, effective August 22, 2000. The CSE Department provides a center of scholarship in the areas of information and computing technologies. We see a continuing need for education and discovery in these fields to meet the demands of an expanding world population in areas such as medicine, food production, shelter, transportation, communication and commerce. The University of Notre Dame undergraduate program consistently ranks in the top 20 among national universities. The CSE Department, established in 1990, conducts undergraduate degree programs in Computer Engineering and in Computer Science, and a graduate program leading to the M.S. and Ph.D. degrees. A full- time faculty of 14, with scheduled growth to 18, develops curricula and directs research for multi-disciplinary collaborative programs in information technology, with particular focus on parallel distributed systems for high-performance computing, and the interactions among hardware, software, algorithms and VLSI technology. Strong research programs achieve national recognition for technical contributions and growth. The chair has a unique opportunity with support from a new Dean of Engineering to substantially advance the role of computing and information technologies within the University. Candidates must be eligible for appointment as a tenured full professor, and have appreciation, breadth and involvement in the range of disciplines embodying departmental growth. The chair must share the Department's vision for academic excellence and foster productive academic relationships with other departments, especially in the College of Engineering. The chair must have a personal research program with demonstrated experience in establishing standards for graduate scholarship and forming active relationships with industry, government agencies, and other universities. For further information, visit our web site at http://www.cse.nd.edu/ Applicants should send a complete resume with names of five references to: Prof. Eugene W. Henry CSE Chair Search Committee 384 Fitzpatrick Hall University of Notre Dame Notre Dame, IN 46556 Phone: 219-631-6408, FAX: 219-631-9260 E-mail: ewh@cse.nd.edu The University of Notre Dame is an equal opportunity, affirmative action employer. ------------- 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 compgeom-owner@research.bell-labs.com Mon Sep 20 22:02:38 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id WAA26741 for ; Mon, 20 Sep 1999 22:02:36 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Sep 20 21:59:36 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Fri Sep 10 03:41:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Sep 10 03:40:31 EDT 1999 Received: from cssu46.cs.ust.hk ([143.89.40.46]) by dusty; Fri Sep 10 03:40:30 EDT 1999 Received: from cssu100.cs.ust.hk (cssu100.cs.ust.hk [143.89.40.100]) by cssu46.cs.ust.hk (8.9.2/8.9.2) with ESMTP id PAA16911; Fri, 10 Sep 1999 15:38:34 +0800 (HKT) From: "DR. CHENG SIU WING" Received: (from scheng@localhost) by cssu100.cs.ust.hk (8.9.3/8.7.3) id PAA16120; Fri, 10 Sep 1999 15:38:31 +0800 (HKT) Date: Fri, 10 Sep 1999 15:38:31 +0800 (HKT) Message-Id: <199909100738.PAA16120@cssu100.cs.ust.hk> To: compgeom-announce@research.bell-labs.com Subject: position Cc: scheng@cs.ust.hk Precedence: bulk Status: RO Content-Length: 2662 Lines: 51 The Department of Computer Science in the Hong Kong University of Science and Technology will have a number of faculty positions open at all levels for the 2000/2001 academic year. Current faculty members come from major universities and research institutions around the world. There are roughly 590 undergraduate and 150 postgraduate students enrolled in our programs. The medium of instructions is English. More information about the Department can be found in our WWW page. (http://www.cs.ust.hk). The Department is looking for faculty with research interests in all areas. In particular, there will be a permanent position available in theoretical computer science; applicants for all levels are encouraged to apply At the same time, we also welcome applications for visiting positions by senior theoretical computer scientists. These visiting positions can run from five months through two years. The theory group currently comprises five members whose research focus on computational geometry, combinatorics, analysis of algorithms, data structures, and formal languages. More information about the theory group can be found in the URL http://www.cs.ust.hk/tcsc. Ample research funding is available through government agencies and industry sponsored research institutes at the University. Applicants should have a Ph.D. degree and demonstrated potential in teaching and research. Senior applicants must have excellent teaching and research records. Salary and benefits are very competitive. Generous fringe benefits including medical and dental benefits, annual leave, and children's education allowance are provided. Housing benefits will also be provided where applicable. Initial appointments will normally be on a three-year contract which is renewable subject to mutual agreement. Applications, together with a curriculum vitae and the names of at least three referees, should be sent to our head: Professor Roland T. Chin, Head Department of Computer Science The Hong Kong University of Science & Technology Clear Water Bay, Kowloon HONG KONG Fax No.: (852)2358-2679 E-mail: Roland_Chin@cs.ust.hk Internet: http://www.cs.ust.hk Postscript format is preferred for applications sent through E-mail. Applications will be evaluated immediately on receipt. Priority will be given to applications received by January 31, 2000. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From compgeom-owner@research.bell-labs.com Mon Sep 20 22:06:41 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id WAA26865 for ; Mon, 20 Sep 1999 22:06:39 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Sep 20 22:01:29 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Wed Sep 15 10:17:02 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Sep 15 10:15:06 EDT 1999 Received: from blaze.cs.jhu.edu ([128.220.13.50]) by dusty; Wed Sep 15 10:15:05 EDT 1999 Received: from condor.cs.jhu.edu (subodh@condor.cs.jhu.edu [128.220.13.86]) by blaze.cs.jhu.edu (8.8.5/8.8.7) with ESMTP id KAA23894; Wed, 15 Sep 1999 10:15:04 -0400 (EDT) From: Subodh Kumar Received: (from subodh@localhost) by condor.cs.jhu.edu (8.8.5/8.8.5) id KAA17305; Wed, 15 Sep 1999 10:15:03 -0400 (EDT) Message-Id: <199909151415.KAA17305@condor.cs.jhu.edu> Subject: Re: CGC Workshop on Computational Geometry, 2nd call To: subodh@blaze.cs.jhu.edu (subodh) Date: Wed, 15 Sep 1999 10:15:03 -0400 (EDT) Cc: compgeom-announce@research.bell-labs.com In-Reply-To: from "subodh" at Sep 2, 99 01:46:54 pm X-Mailer: ELM [version 2.4 PL13] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 4137 Lines: 118 In response to several requests for extension, the deadline for submission to the workshop is hereby extended to 5pm on Friday, Sep 17. - Subodh ######################################################################## Computer Sc., JHU, Baltimore MD 21218 Tel: (410)516-0060, Fax: 6134 http://www.cs.jhu.edu/~subodh > > Call for Papers > 4th CGC Workshop on > Computational Geometry > > Johns Hopkins University, Baltimore, MD, October 15-16, 1999 > > > > We are pleased to announce the fourth annual fall Workshop on > Computational Geometry, sponsored by the Center for Geometric > Computing, continuing a tradition established by the Mathematical > Sciences Institute at SUNY-Stony Brook. The Center for Geometric > Computing is a collaborative center of Brown, Duke, and Johns Hopkins > Universities, and is funded by the U.S. Army Research Office. > > > Scope and Format > > The aim of this workshop is to bring together researchers from > academia, industry, and the Army to stimulate collaboration on > problems of common interest arising in geometric computations. Topics > to be covered include, but are not limited to: > > Algorithmic methods in geometry > I/O-scalable geometric algorithms > Animation of geometric algorithms > Computer graphics > Solid modeling > Geographic information systems > Computational metrology > Graph drawing > Experimental studies > Geometric data structures > Implementation issues > Robustness > Computer vision > Robotics > Computer-aided design > Mesh generation > > Following the tradition of the previous MSI and CGC Workshops on > Computational Geometry, the format of the workshop will be informal, > extending over 2 days, with several breaks scheduled for discussions. > > Registration will be on-site, and will include the abstract booklet, > coffee breaks, lunches, and a reception. There will be a registration > fee of $75. > > > Invited speakers > > To be Announced > > > Submissions > > Authors are invited to submit abstracts for talks to be given at the > workshop. Please send an abstract (up to 2 pages) and a draft of a > paper (if you have one). E-mail submissions are encouraged; send to > cgc@cs.jhu.edu. Ideally, the abstract should be a PDF, PostScript, > or LaTeX, file, for ease in assembling the abstract booklet. Abstracts > can also be sent by regular mail to: > > Subodh Kumar > Department of Computer Science > Johns Hopkins University > 224 NEB, 3400 N. Charles St. > Baltimore, MD 21218 > > > Submissions should arrive by September 10, 1999. Authors will be > notified of acceptance by September 20, 1999. > > A booklet of abstracts will be distributed at the workshop and made > available electronically on the Web. There will be no formal > proceedings for this workshop, but selected papers will be invited to > a special issue of the journal "Computational Geometry: Theory and > Applications". > > Program Committee > > Pankaj K. Agarwal (Duke University), Lars Arge (Duke University), Michael > T. Goodrich (Johns Hopkins University), S. Rao Kosaraju (Johns Hopkins > University), Subodh Kumar (Johns Hopkins University), Joseph S. B. Mitchell > (State University of New York at Stony > Brook), Franco P. Preparata (Brown University), Roberto Tamassia (Brown > University), Jeffrey S. Vitter (Duke University). > > Note: > > For more information about the workshop, send mail to > cgc@cs.jhu.edu . Further information will be posted to our web site: > http://www.cs.jhu.edu/labs/cgc/cgc99 > as soon as it is available. > > Important Dates > > Deadline for submission Sep 10 --> EXTENDED TO SEP 17. > Notification of acceptance Sep 20 > Conference Oct 15-16 > ------------- 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 compgeom-owner@research.bell-labs.com Mon Sep 20 22:06:43 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id WAA26868 for ; Mon, 20 Sep 1999 22:06:40 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Sep 20 22:01:10 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Mon Sep 13 18:13:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Sep 13 18:12:27 EDT 1999 Received: from duke.cs.duke.edu ([152.3.140.1]) by dusty; Mon Sep 13 18:12:26 EDT 1999 Received: from polya.cs.duke.edu (polya.cs.duke.edu [152.3.140.71]) by duke.cs.duke.edu (8.9.1/8.9.1) with ESMTP id SAA09301 for ; Mon, 13 Sep 1999 18:12:25 -0400 (EDT) From: Pankaj Kumar Agarwal Received: (pankaj@localhost) by polya.cs.duke.edu (8.8.5/8.6.9) id SAA11142 for compgeom-announce@research.bell-labs.com; Mon, 13 Sep 1999 18:12:24 -0400 (EDT) Date: Mon, 13 Sep 1999 18:12:24 -0400 (EDT) Message-Id: <199909132212.SAA11142@polya.cs.duke.edu> To: compgeom-announce@research.bell-labs.com Subject: SCG'00: Call for Papers Precedence: bulk Status: RO Content-Length: 6239 Lines: 138 CALL FOR PAPERS Sixteenth Annual Symposium on COMPUTATIONAL GEOMETRY June 12-14, 2000 Hong Kong University of Science and Technology http://www.cs.ust.hk/tcsc/scg00.html Sponsored by ACM SIGACT and SIGGRAPH The Sixteenth Annual Symposium on Computational Geometry, featuring an applied track, a theoretical track, and a video review, will be held at Hong Kong University of Science and Technology, Hong Kong. We invite high-quality submissions in the following areas: * geometric algorithms or combinatorial geometry, for the theoretical track, or * implementation issues or applications of computational geometry, for the applied track. The proceedings, with the papers of both tracks, will be distributed at the symposium and will subsequently be available for purchase from ACM. A selection of papers will be invited to special issues of journals. During the conference, sessions of presentations will alternate between the two tracks, rather than being in parallel. Topics for the theoretical track include, but are not limited to design and theoretical analysis of geometric algorithms and data structures; lower bounds for geometric problems; and discrete and combinatorial geometry. Topics for the applied track include, but are not limited to experimental analysis of algorithms and data structures; mathematical and numerical issues arising from implementations; and novel uses of computational geometry in other disciplines, such as robotics, computer graphics, geometric and solid modeling, manufacturing, and geographical information systems. See below for additional information on the two tracks. Theoretical Track Submission Electronic submissions are preferred for the theoretical track (see web page above for instructions), but authors may instead mail 8 copies of an extended abstract to arrive by December 6, 1999 to Pankaj K. Agarwal Department of Computer Science LSRC Building, Rm D207 Duke University Durham, NC 27706 Phone: (919) 660-6540 pankaj@cs.duke.edu Applied Track Submission Electronic submissions are preferred for the applied track (see web page above for instructions), but authors may instead mail 11 copies of an extended abstract to arrive by December 6, 1999 to Steven Fortune Room 2c459 Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 Phone: (908) 582-7042 sjf@research.bell-labs.com Important Dates December 6, 1999: Papers due, both tracks February 13, 2000: Video submissions due February 15, 2000: Notification of acceptance or rejection of papers March 1, 2000: Notification of acceptance or rejection of videos March 15, 2000: Camera-ready papers due April 15, 2000: Final versions of videos due June 12-14, 2000: Symposium Papers that primarily address practical issues and implementation experience, even if not tied to a particular application domain, should be submitted to the applied track. Papers that primarily prove theorems should be submitted to the theoretical track. Most experimental work should be submitted to the applied track; an exception would be experiments in support of mathematical investigations. Submissions to one track may be forwarded to the other for consideration, unless the authors have explicitly stated interest in one track only. Papers should be submitted in the form of an extended abstract. Papers should begin with the title of the paper, each author's name, affiliation, and e-mail address, followed by a succinct statement of the problems and goals that are considered in the paper, the main results achieved, the significance of the work in the context of previous research, and a comparison to past research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages, using 11 point or larger font and with at least one-inch margins all around. For cases in which the authors consider it absolutely essential to include additional technical details that do not fit into 10 pages, these details may be added in a clearly marked appendix that should appear after the body of the paper and the references; this appendix will not be regarded as a part of the submission and will be considered only at the program committee's discretion. Abstracts in hard copy must be received by December 6, 1999, or postmarked by November 29 and sent airmail. Abstracts in electronic form are due by December 6, 5:00 PM EST. These are firm deadlines: late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 2000. A full version of each contribution in final form will be due by March 15, 2000 for inclusion in the proceedings. Conference Chairs Siu-Wing Cheng Otfried Cheong scheng@cs.ust.hk otfried@cs.ust.hk Theoretical Track Program Committee Pankaj K. Agarwal, Chair (Duke) Franz Aurenhammer (Graz) Mark de Berg (Utrecht) Herbert Edelsbrunner (Duke) Jeff Erickson (UIUC) Hazel Everett (Montreal) Klara Kedem (Ben Gurion) Applied Track Program Committee Gill Barequet (Technion) Steven Fortune, Chair (Bell Labs) Chris Gold (Laval U.) Ken Goldberg (Berkeley) Scott Mitchell (Sandia Labs) Tom Peters (U. Conn.) Jean Ponce (UIUC) Stefan Schirra (MPI) Subhash Suri (Wash. U.) ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From compgeom-owner@research.bell-labs.com Mon Sep 20 22:06:45 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id WAA26876 for ; Mon, 20 Sep 1999 22:06:42 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Sep 20 22:00:41 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Mon Sep 13 18:15:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Sep 13 18:13:04 EDT 1999 Received: from duke.cs.duke.edu ([152.3.140.1]) by dusty; Mon Sep 13 18:13:02 EDT 1999 Received: from polya.cs.duke.edu (polya.cs.duke.edu [152.3.140.71]) by duke.cs.duke.edu (8.9.1/8.9.1) with ESMTP id SAA09338 for ; Mon, 13 Sep 1999 18:13:01 -0400 (EDT) From: Pankaj Kumar Agarwal Received: (pankaj@localhost) by polya.cs.duke.edu (8.8.5/8.6.9) id SAA11152 for compgeom-announce@research.bell-labs.com; Mon, 13 Sep 1999 18:13:00 -0400 (EDT) Date: Mon, 13 Sep 1999 18:13:00 -0400 (EDT) Message-Id: <199909132213.SAA11152@polya.cs.duke.edu> To: compgeom-announce@research.bell-labs.com Subject: SCG'00: Call for Videos Precedence: bulk Status: RO Content-Length: 3467 Lines: 82 CALL FOR VIDEOS 9th Annual Video Review of Computational Geometry to be presented at the Sixteenth Annual Symposium on Computational Geometry http://www.cs.ust.hk/tcsc/scg00.html June 12-14, 2000 Hong Kong University of Science and Technology Sponsored by ACM SIGACT and SIGGRAPH Videos are sought for a video review of computational geometry. Background This video review showcases the use of visualization in computational geometry for exposition and education, as an interface and a debugging tool in software development, and for the visual exploration of geometry in research. Algorithm animations, visual explanations of structural theorems, descriptions of applications of computational geometry, and demonstrations of software systems are all appropriate. Videos that accompany papers or communications submitted to the technical program committee are encouraged. Submissions Authors should send one preview copy of a videotape to the address below by February 13, 2000. The videotape should be at most eight minutes long (three to five minutes, preferred), and be in VHS NTSC or VHS PAL format. Each video tape must be accompanied by a one- or two-page description of the material shown in the video, and where applicable, the techniques used in the implementation. Please format descriptions following the guidelines for ACM proceedings. Additional material describing the contents of the videos, such as the full text of accompanying papers, may also be included. Textual material may be submitted electronically by e-mailing either the URL of a PostScript file (preferred) or the PostScript file itself to rudolf@mpi-sb.mpg.de. If electronic submission is impossible, authors should include five hardcopies of the accompanying text with their video. Videotapes and accompanying text should be sent to Rudolf Fleischer Department of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1 Canada Tel: (519) 888-4567 ext 2103 FAX: (519) 885-1208 For customs purposes, it is best to declare a value of $5. If you have questions, please contact the committee chair at rudolf@mpi-sb.mpg.de or (519) 888-4567 ext 2103. Notification Authors will be notified of acceptance or rejection, and given reviewers' comments by March 1, 2000. For each accepted video, the final version of the textual description will be due by March 15, 2000 for inclusion in the proceedings. Final versions of accepted videos will be due April 10, 2000 in the best format available. The accepted videos will be edited onto one tape, which will be shown at the conference and will be distributed to the participants. Video Program Committee Therese Biedl (U. Waterloo) Timothy Chan (U. Waterloo) Erik Demaine (U. Waterloo) Martin Demaine (U. Waterloo) Rudolf Fleischer, Chair (U. Waterloo) Anna Lubiw (U. Waterloo) Jack Snoeyink (UNC) ------------- 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 compgeom-owner@research.bell-labs.com Mon Sep 20 22:06:46 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id WAA26882 for ; Mon, 20 Sep 1999 22:06:43 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Sep 20 22:00:37 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Wed Sep 15 00:53:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Sep 15 00:52:53 EDT 1999 Received: from CE.SHARIF.AC.IR ([194.225.40.100]) by dusty; Wed Sep 15 00:52:50 EDT 1999 Received: by ce.sharif.ac.ir (MX V4.1 VAX) id 41; Wed, 15 Sep 1999 09:22:24 EDT Date: Wed, 15 Sep 1999 09:22:23 EDT From: Ramtin Khosravi To: compgeom-discuss@research.bell-labs.com Message-ID: <009DE2E4.48392B20.41@ce.sharif.ac.ir> Subject: Chen and Han's address Precedence: bulk Status: RO Content-Length: 536 Lines: 17 Hi everybody, Does anybody know the e-mail address or the URL of the hompage of Jindong Chen or Yijie Han? (The designers of the quadratic algorithm for the shortest path problem on polyhedral surfaces). Please reply to raamtin@ce.sharif.ac.ir. Thanks, --Ramtin Khosravi ------------- 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 compgeom-owner@research.bell-labs.com Sat Oct 2 19:39:41 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id TAA06710 for ; Sat, 2 Oct 1999 19:39:38 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sat Oct 2 19:37:44 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Mon Sep 27 10:21:02 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Sep 27 10:19:22 EDT 1999 Received: from cic.aku.ac.ir ([194.165.0.14]) by dusty; Mon Sep 27 10:19:11 EDT 1999 Received: from mohades ([192.168.13.95]) by cic.aku.ac.ir (8.8.5/SCO5) with SMTP id OAA14841 for ; Mon, 27 Sep 1999 14:18:28 GMT Message-ID: <001a01bf08ea$6aef4b60$5f0da8c0@aku.ac.ir> From: "Ali Mohades" To: "geometry" Subject: Help Date: Mon, 27 Sep 1999 17:45:28 +0430 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_0017_01BF0910.1627D860" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2314.1300 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300 Precedence: bulk Status: RO Content-Length: 1976 Lines: 63 This is a multi-part message in MIME format. ------=_NextPart_000_0017_01BF0910.1627D860 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable hi everybody, I would be very thankful to anyone who could provide me with e-mail = address or any Webster which can help me to find the papers about a = given subject in computational geometry. Best wishes=20 --------------------------- Ali Mohades Amir kabir University of Technology Tehran, Iran mohades@cic.aku.ac.ir Tel: 98-21-640-6322 Fax: 1-603-925-7150 --------------------------- ------=_NextPart_000_0017_01BF0910.1627D860 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable

hi everybody,

I would be very thankful to anyone who could provide = me with=20 e-mail address or any Webster which can help me to find the papers = about a=20 given subject in computational geometry.

Best wishes =
---------------------------
Ali=20 Mohades
Amir kabir University of Technology
Tehran, Iran
mohades@cic.aku.ac.ir
Tel:=20 98-21-640-6322
Fax:=20 1-603-925-7150
---------------------------
------=_NextPart_000_0017_01BF0910.1627D860-- ------------- 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 compgeom-owner@research.bell-labs.com Sat Oct 2 19:42:25 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id TAA06782 for ; Sat, 2 Oct 1999 19:42:23 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Oct 2 19:41:04 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Thu Sep 30 12:31:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Sep 30 12:30:50 EDT 1999 Received: from mail.or.uni-bonn.de ([131.220.140.11]) by dusty; Thu Sep 30 12:30:48 EDT 1999 Received: from mailserv.or.uni-bonn.de (root@r53aix01-tr0.or.uni-bonn.de [131.220.57.10]) by mail.or.uni-bonn.de (8.9.3/8.7) with ESMTP id SAA37330 for ; Thu, 30 Sep 1999 18:30:39 +0200 Received: from or.uni-bonn.de (simex-tr0.or.uni-bonn.de [131.220.57.42]) by mailserv.or.uni-bonn.de (8.8.8/8.7) with ESMTP id SAA05818 for ; Thu, 30 Sep 1999 18:31:28 +0200 Sender: peyer@or.uni-bonn.de Message-ID: <37F39028.9BACA747@or.uni-bonn.de> Date: Thu, 30 Sep 1999 18:30:32 +0200 From: Sven Peyer X-Mailer: Mozilla 4.04 [en] (X11; I; AIX 4.2) MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com Subject: Delaunay Triangulation / Voronoi Diagram in L1 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 2282 Lines: 57 Dear All, I'm interested in Delaunay-Triangulation with respect to L1-norm. The input consists of general, pairwise disjoint objects (e.g. lines, axis parallel boxes, polygons, segments). Shute, Deneen, Thomborson (Algorithmica (1991) 6: 207-221) gave an O(n logn) Plane-Sweep Algorithm for Delaunay Triangulations for L_max-norm for single points. Since there exists an isometric between L1 and L_max (equivalence under 45 rotation), this algorithm solves the problem for single points in L1 as well. This algorithm does not apply for more general objects. Recently, Papadopoulou and Lee gave an algorithm for determing the L_max-Voronoi diagram for arbitrary segments which could be applied to the L1 case. Although their algorithm is very elegant, it has two disadvantages for my purposes, unfortuntely: 1. It calculates the Voronoi diagram instead of Delaunay Triangulation (which could be retrieved afterwards from the Voronoi diagram). So I hope there is a DIRECT way to get a triangulation (e.g. see algorithm by Shute, Deneen, Thomborson for single points). 2. The algorithm is rather difficult and probably too slow in practice. (Practice means here: Input of about 100000 or more objects) So I've implemented a heuristic which discretizes all objects into a set of single points (depending on a given parameter) and applies the algorithm by Shute, Deneen, Thomborson to these points. The better (smaller) the parameter (width) is the better is the result. Nevertheless, it is a heuristic and the triangulation depends largely upon the choosen parameter. If the number of objects is very large and the width is choosen to be very small, memory problems occur because of the large number of discretized points. Therefore, I'm looking for an algorithm which gives an L1-Delaunay Triangulation for general objects. Suggestions and references are very welcome. Thank you in advance. Sven Peyer -------- Sven Peyer Research Institute for Discrete Mathematics University of Bonn Lennestr. 2 53113 Bonn ------------- 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 compgeom-owner@research.bell-labs.com Sat Oct 2 19:55:22 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id TAA07004 for ; Sat, 2 Oct 1999 19:55:20 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sat Oct 2 19:51:52 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Fri Oct 1 04:39:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Oct 1 04:38:30 EDT 1999 Received: from core.inf.ethz.ch ([129.132.178.196]) by dusty; Fri Oct 1 04:38:29 EDT 1999 Received: from shadow.inf.ethz.ch (emo@shadow-medoc.inf.ethz.ch [129.132.11.67]) by core.inf.ethz.ch (8.9.3/8.9.3) with ESMTP id KAA23010; Fri, 1 Oct 1999 10:38:27 +0200 (MET DST) Received: (from emo@localhost) by shadow.inf.ethz.ch (8.8.8/8.8.8) id KAA17570; Fri, 1 Oct 1999 10:38:26 +0200 (MET DST) Date: Fri, 1 Oct 1999 10:38:26 +0200 (MET DST) From: Emo Welzl Message-Id: <199910010838.KAA17570@shadow.inf.ethz.ch> To: compgeom-announce@research.bell-labs.com Subject: European Graduate Program, Berlin & Zurich Cc: emo@inf.ethz.ch X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 2992 Lines: 65 ---------------------------------------------------------------------------- European Graduate Program Berlin ------------------------------------------ Zurich Combinatorics, Geometry, and Computation ---------------------------------------------------------------------------- In the newly established graduate program two-year scholarships for Ph.d.students are available in Berlin and Zurich starting January 1st, 2000. Applicants should have a degree in mathematics, computer science, or a related area equivalent to the German or Swiss university diploma (e.g. M.S.) with grades significantly above average. Furthermore at each location a postdoctoral position is available for at most two years. The program is a joint initiative of the ETH Zurich, the three universities of Berlin - Free University, Technical University, Humboldt-University - and the Konrad-Zuse-Research Center. The German partners are financially suppor- ted by the German Research association (Deutsche Forschungsgemeinschaft, DFG). The amount of the scholarships in Berlin is calculated according to the guidelines of the DFG and is up to DM 2690 per month, tax free (family supplement DM 400). The scientific program ranges from theoretical fundamentals to applications. The areas of research are combinatorics, geometry, optimization, algorithms and computation, computer graphics, and vision. In Berlin the students are supervised by the professors Aigner, Alt, Rote, Schulz (FU), Moehring, Zieg- ler (TU), Proemel (HU) and Groetschel (ZIB). The participating professors at ETH Zurich are Fukuda, Van Gool, M. Gross, Luethi, Nievergelt, Richter-Ge- bert, Schiele, Welzl and Widmayer. Applications with curriculum vitae, copies of certificates, theses, a letter of recommendation of the last advisor, a brief description of the proposed research and, especially for applicants for the postdoctoral position, re- prints of publications should be sent in until October 23, 1999 to one of the speakers of the program: in Berlin in Zurich Prof. Dr. Helmut Alt Prof. Dr. Emo Welzl Institut fuer Informatik Institut fuer Theoretische Informatik Freie Universitaet Berlin ETH Zentrum Takustrasse 9 CH-8092 Zurich D-14195 Berlin Further Information can be obtained from Bettina Felsner Emo Welzl Tel. ++49-30-838 75 104 Tel. ++41-1-63 273 92 bfelsner@inf.fu-berlin.de emo@inf.ethz.ch --------------------------------------------------------------------------- ------------- 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 compgeom-owner@research.bell-labs.com Sat Oct 2 19:55:24 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id TAA07008 for ; Sat, 2 Oct 1999 19:55:21 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sat Oct 2 19:51:44 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Thu Sep 30 17:15:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Sep 30 17:14:28 EDT 1999 Received: from jinai.cs.nyu.edu ([128.122.80.169]) by dusty; Thu Sep 30 17:14:27 EDT 1999 Received: (from yap@localhost) by jinai.cs.nyu.edu (8.9.1/8.9.1) id RAA29975 for compgeom-announce@research.bell-labs.com; Thu, 30 Sep 1999 17:14:25 -0400 (EDT) Date: Thu, 30 Sep 1999 17:14:25 -0400 (EDT) From: Chee Yap Message-Id: <199909302114.RAA29975@jinai.cs.nyu.edu> To: compgeom-announce@research.bell-labs.com Subject: Announcement of Core Library, Version 1.2 X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 1010 Lines: 33 ============== SOFTWARE RELEASE ANNOUNCEMENT =================== The CORE Library, Version 1.2, is now available for free download at http://cs.nyu.edu/exact/core The CORE library is a collection of C/C++ classes for exact computation with constructible real numbers. Some Features: -- ease of use: most existing C/C++ programs can be converted into robust programs with minimal effort -- precision-driven approach to exact computation -- expanded set of sample programs -- library is small (0.75 MB compressed, including documentation) -- tested on Sparc, SGI and Linux platforms. We welcome your comments and input. -- Chee Yap (yap@cs.nyu.edu) Chen Li (chenli@cs.nyu.edu) September 30, 1999 ------------- 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 compgeom-owner@research.bell-labs.com Sat Oct 2 19:57:58 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id TAA07042 for ; Sat, 2 Oct 1999 19:57:56 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Oct 2 19:50:01 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Mon Sep 27 08:05:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Sep 27 08:03:55 EDT 1999 Received: from concave.cs.wits.ac.za ([146.141.27.66]) by dusty; Mon Sep 27 08:03:44 EDT 1999 Received: from [146.141.27.215] (oconee.cs.wits.ac.za [146.141.27.215]) by concave.cs.wits.ac.za (8.8.8/8.8.8) with ESMTP id OAA26971 for ; Mon, 27 Sep 1999 14:03:27 +0200 (SAT) X-Sender: ian@mail.cs.wits.ac.za Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Mon, 27 Sep 1999 14:05:28 +0200 To: compgeom-announce@research.bell-labs.com From: Ian Sanders Subject: vacant posts Precedence: bulk Status: RO Content-Length: 8832 Lines: 172 Posts in the Computer Science Department University of the Witwatersrand, Johannesburg, South Africa Lecturer / Senior Lecturer Senior Tutor Tutor / Junior Lecturer The Computer Science Department at the University of the Witwatersrand is one of Africa's leading computer science departments. We are committed to educating graduates and producing research to meet South Africa's challenging needs in information technology. South Africa is in the process of political change. The government is re-evaluating tertiary education, and initial reports indicate tertiary education is regarded as a high priority. With a changing South Africa the department sees a need to look ahead. We are looking for staff who can help us develop the research aspect of our department. In exchange we offer a vibrant environment and an opportunity to contribute to a country at an important stage of its development. We now have 10 academic staff members, and we wish to appoint up to 3 new staff members, in order to expand our research and teaching roles. We would like new appointees at senior level to add strength of leadership to existing research areas, but applicants from all areas of computer science are welcomed and this could provide an opportunity for a motivated researcher to develop their own research interests. Applicants could be appointed at any one of the levels described below. Which and how many posts are filled will depend on the applicants and the seniority at which they are appointed. Please indicate which position/s you would like to be considered for when applying. We are committed to equal opportunities, and for all posts, we encourage black, women and disabled applicants. Senior Lecturer/Lecturer: ======================== These are tenure-track positions and successful applicants will be expected to teach at undergraduate and postgraduate levels, undertake research and perform departmental administration. Applicants for the senior lectureship should hold a PhD in computer science, have completed some post-doctoral research and have teaching experience. Applicants for the lectureship should hold a PhD in computer science (or be able to provide objective evidence that they will complete their PhD by the time they take up the post). Applicants should also be able to demonstrate ability to teach a range of computer science courses. A lectureship is a suitable entry-level position for a new PhD. Senior Tutor: ============ This is a tenure track position, and a successful applicant will be expected to teach undergraduate courses, and play an important role in academic and curriculum development. The successful applicant should have an honours degree in computer science. A higher degree and/or a teaching qualification and/or experience will be a recommendation. The successful applicant will be encouraged to undertake research in computer science or computer science education. Tutor/Junior Lecturer: ===================== This is an affirmative action/development position, and we will favour applicants from under-represented groups in the field. The successful applicant will have an honours degree in computer science. This person will be expected to participate in the teaching of the department, and an important objective of the post is to give a person with potential the opportunity to pursue a higher degree and gain teaching and research experience. This is a three-year contract post. For senior lecturer or lecturer posts, we would prefer someone who will strengthen one of our current research interests (see below), but the primary criteria will be the quality and potential of the applicant. The tutor/junior lecturer must be prepared to pursue their higher degree in one of the research areas of the department. Please direct any inquiries about any aspects of these posts, or the department, to Conrad Mueller --- conrad@cs.wits.ac.za Further information about the department can be found at http://www.cs.wits.ac.za/ ======================================================================== Context: ------- The University of the Witwatersrand is one of the top universities in South Africa. It prides itself on its standards and is internationally recognized. The University is located in Johannesburg, the biggest city in Southern Africa, and is thus strategically positioned in the industrial heartland of South Africa. This makes it an exciting and stimulating situation in which to work. The Department of Computer Science is in the Mathematical Sciences subject area. We are also presently involved in building an umbrella body with the other IT departments at Wits -- the Department of Electrical Engineering and the Department of Information Systems. The Department has a governing committee consisting of three members of the Department which reports directly to the Dean of the Science Faculty. There are 10 academic posts in the department, with three technical support officers, an administrator and a secretary. The department is well equipped with both PC and Mac labs for undergraduates which are networked to the internet and a UNIX server, and an SGI lab for postgraduate students. We see teaching as an important function of the department and all academic members of staff are expected to be able to teach a range of mainstream computer science topics. The department has a strong undergraduate programme, teaching only courses directed at students majoring in computer science. The undergraduate curriculum is based on the ACM/IEEE guidelines for computer science, and regularly undergoes re-evaluation. Many of our students have gone on to become respected members of the academic and business communities worldwide. The department teaches: a first year course of 200 students, a second year course of 80 students, a third year course of 70 students, an honours course of 15-25 students, and 3 to 5 higher degree students start each year. Undergraduate students register for a Bachelor of Science Degree, which has a flexible course structure. The department has always been very conscious of its role in South African society. A challenge the department is faced with is teaching students with widely differing school qualifications, which includes students from deprived educational backgrounds; empathy for these students is important. We are very proud of our achievements in developing what we believe is an outstanding undergraduate and honours degree course. The emphasis has been on trying to address the racial imbalances resulting from the historical problems in our society and at the same time maintaining excellence. The department has been innovative in this aspect; we consider ourselves to be leaders in the country in this regard and have received international recognition. As one of the leading universities in South Africa we feel that we are in an ideal position to develop our research. In addition, our location in the industrial heartland provides largely untapped opportunities to develop valuable research partnerships with industry and commerce. The Department would benefit greatly from such partnership: experience in setting up joint research projects will be one of the criteria used in selecting the candidates. We are currently initiating programmes to coordinate joint research and to support higher degree students. Recently we have put increased effort into developing our postgraduate programme. We have a thriving research programme focused on aspects of dependable computing. Staff members are also involved in a number of other areas of research -- machine learning, computational geometry, robotics, computer science education, formal methods, verification, concurrency, process algebras, image processing, pattern recognition, etc. Please direct any informal inquiries to Conrad Mueller, conrad@cs.wits.ac.za who is the current chair of the governing committee. More information about the department can be found at http://www.cs.wits.ac.za/ and more information about the University can be found at http://www.wits.ac.za/ ---------------------------------------------------------------- Ian Sanders Telephone: (2711) 716-3269 Department of Computer Science Fax: (2711) 339-3513 University of the Witwatersrand 403-9317 Private Bag 3 ian@cs.wits.ac.za 2050 WITS SOUTH AFRICA http://www.cs.wits.ac.za/~ian ------------- 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 compgeom-owner@research.bell-labs.com Sat Oct 2 19:58:02 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id TAA07053 for ; Sat, 2 Oct 1999 19:58:00 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Oct 2 19:51:07 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Thu Sep 23 20:41:02 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Sep 23 20:39:08 EDT 1999 Received: from benvolio.ecse.rpi.edu ([128.113.61.53]) by dusty; Thu Sep 23 20:39:07 EDT 1999 Received: from benvolio.ecse.rpi.edu (localhost [127.0.0.1]) by benvolio.ecse.rpi.edu (8.9.3/8.9.3) with ESMTP id UAA02142 for ; Thu, 23 Sep 1999 20:38:30 -0400 Message-Id: <199909240038.UAA02142@benvolio.ecse.rpi.edu> To: compgeom-announce@research.bell-labs.com Subject: Announce: 3D connected components program From: wrf@ecse.rpi.edu (Wm. Randolph Franklin) Date: Thu, 23 Sep 1999 20:38:29 -0400 Sender: wrf@benvolio.ecse.rpi.edu Precedence: bulk Status: RO Content-Length: 2310 Lines: 61 This is to announce my latest program, CONNECT, which finds the connected components in a 3-D rectangular volume of binary voxels (the universe). For each component, CONNECT writes its volume, surface area, and voxels (grouped into runs). CONNECT can do both 6-connectivity and 26-connectivity. CONNECT is very space- and time-efficient. E.g., processing one test volume of size 544x544x512, which has 151,519,232 voxels, about 1/2 empty, to find the 534,723 6-connected components, takes only 50 seconds of CPU and 45MB of virtual memory on a 233MHz Pentium with Linux and g++. The time for any particular case depends on the data complexity, e.g., number of input runs and output components. The worst 6-connectivity case would be to have alternating voxels full and empty. CONNECT could easily be extended to 4D volumes, if there was an application. It does 2D areas as a trivial subcase. A 1x1024x1024 input is processed in under 1 second, with setup overhead being most of that time. I predict that CONNECT could process a 1024x1024x1024 universe in 10 CPU minutes, depending its complexity, tho the virtual memory might page badly. Does anyone have any real test data? My confidence in CONNECT's correctness is based upon rotating the large test case around the grand diagonal, rerunning CONNECT, and sorting and comparing the output statistics of the components' volumes and areas. The results are identical. I am the author of CONNECT. You may use it for non-profit research and education. You must make appropriate acknowledgements. For more info, including detailed usage and algorithm descriptions, and a source tarball, go to http://www.ecse.rpi.edu/Homepages/wrf/research/connect/ Comments are welcome. ------------------------ Wm. Randolph Franklin Associate Professor rfranklin@altavista.net http://www.ecse.rpi.edu/Homepages/wrf/ +1 (518) 276-6077; Fax: -6261 ECSE Dept., 6026 JEC, Rensselaer Polytechnic Inst, Troy NY, 12180 USA (PGP key available) ------------- 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 compgeom-owner@research.bell-labs.com Sun Oct 17 22:09:05 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id WAA12937 for ; Sun, 17 Oct 1999 22:09:03 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sun Oct 17 22:03:42 EDT 1999 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Mon Oct 11 12:45:02 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Oct 11 12:43:46 EDT 1999 Received: from indigo.cs.bgu.ac.il ([132.72.42.23]) by dusty; Mon Oct 11 12:43:44 EDT 1999 Received: from cyan.cs.bgu.ac.il (cyan.cs.bgu.ac.il [132.72.42.12]) by indigo.cs.bgu.ac.il (8.9.2/8.9.2) with ESMTP id SAA19141; Mon, 11 Oct 1999 18:43:34 +0200 (IST) From: Computational Geometry workshop Received: (cg2000@localhost) by cyan.cs.bgu.ac.il (8.9.0/8.6.9) id SAA12372; Mon, 11 Oct 1999 18:43:33 +0200 (IST) Date: Mon, 11 Oct 1999 18:43:33 +0200 (IST) Message-Id: <199910111643.SAA12372@cyan.cs.bgu.ac.il> To: compgeom-announce@research.bell-labs.com Subject: Euro-CG-2000 new web page Cc: cg2000@CS.bgu.ac.il, klara@CS.bgu.ac.il Precedence: bulk Status: RO Content-Length: 910 Lines: 31 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ C A L L F O R P A P E R S 16TH EUROPEAN WORKSHOP ON COMPUTATIONAL GEOMETRY March 13-14-15 2000 Eilat Club Hotel, Eilat, Israel +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ For more details please check our new web page http://www.cs.bgu.ac.il/~cg2000 or its mirror site http://www.cs.cornell.edu/kedem/Euro_CG_2000/euro.htm +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ------------- 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 compgeom-owner@research.bell-labs.com Mon Oct 18 04:10:44 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id EAA17653 for ; Mon, 18 Oct 1999 04:10:39 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Oct 17 21:56:33 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Mon Oct 4 15:05:02 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Oct 4 15:03:18 EDT 1999 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.38]) by dusty; Mon Oct 4 15:03:17 EDT 1999 Received: by NRCLONEX1 with Internet Mail Service (5.5.2448.0) id ; Mon, 4 Oct 1999 15:03:10 -0400 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C70A47EF@NRCLONEX1> From: "Dickinson, John" To: compgeom-discuss@research.bell-labs.com Subject: Looking for 3D of ND alpha-hull code. Date: Mon, 4 Oct 1999 15:03:09 -0400 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2448.0) Content-Type: text/plain; charset="iso-8859-1" Precedence: bulk Status: RO Content-Length: 1114 Lines: 29 Dear All, Anyone know of a good open code implementation of weighted alpha-hulls for 3D point clouds? Or even just an alpha-hull generating algorithm for 3D point clouds? I would like to avoid rebuilding the wheel. I have located the work on alpha shapes at: http://fiaker.ncsa.uiuc.edu/alpha but the web site is inaccessible There is also one algorithm implementation at http://www.netlib.org/voronoi/index.html but this code doesn't do weight alpha-hulls and I always try to find out if other code samples exist before settling on one previos implementation. John -- -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859)- John Kenneth Dickinson | "A sharp tongue is the only Research Council Officer IMTI-NRC | edge tool that grows keener email: john.dickinson@nrc.ca | with constant use." ------------- 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 compgeom-owner@research.bell-labs.com Mon Oct 18 04:10:46 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id EAA17671 for ; Mon, 18 Oct 1999 04:10:43 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Oct 17 22:02:19 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Sat Oct 9 07:21:01 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Sat Oct 9 07:20:57 EDT 1999 Received: from austin.cs.unc.edu ([152.2.128.87]) by dusty; Sat Oct 9 07:20:56 EDT 1999 Received: from [152.2.132.166] (xylog-port6.cs.unc.edu [152.2.132.166]) by austin.cs.unc.edu (8.8.8/8.8.8) with ESMTP id HAA12113; Sat, 9 Oct 1999 07:20:35 -0400 (EDT) Message-Id: <199910091120.HAA12113@austin.cs.unc.edu> X-Mailer: Microsoft Outlook Express Macintosh Edition - 4.5 (0410) Date: Sat, 09 Oct 1999 06:58:49 -0400 Subject: Funding opportunity in the US (international collaboration is also encouraged) From: "Jack Snoeyink" To: "compgeom-announce" CC: jean-daniel.boissonnat@sophia.inria.fr, jsbm@ams.sunysb.edu, goodrich@cs.jhu.edu, pankaj@cs.duke.edu Mime-version: 1.0 X-Priority: 3 Content-type: text/plain; charset="US-ASCII" Content-transfer-encoding: 7bit Precedence: bulk Status: RO Content-Length: 1396 Lines: 30 I was speaking with Kamal Abdali at NSF yesterday, and he wanted to make sure that the US computational geometry community knows about the following funding opportunity > Title: Information Technology Research (ITR) > Type: Program Announcements & Information > Subtype: NSF-wide > http://www.nsf.gov/cgi-bin/getpub?nsf99167 Apparently the funding approval for $100M has just gone through congress, which essentially increases the total computer science budget by 50% this year. The increase is to meet the goals of the PITAC report. Letters of intent for $3M centers and proposals over $500K are due Nov 15. (The ITR program document also says that international collaboration is encouraged. Since NSF funds are spent in the US, what this usually means that coordinated submissions to two or more different national granting agencies will increase the chances of both.) On behalf of the CG steering committee, Jack Snoeyink@cs.unc.edu UNC Chapel Hill, Computer Science CB 3175, Sitterson Hall, Chapel Hill, NC 27599-3175 USA http://www.cs.unc.edu/~snoeyink ph+1(919)962-1969 fax+1(919)962-1799 ------------- 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 compgeom-owner@research.bell-labs.com Mon Oct 18 04:10:49 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id EAA17680 for ; Mon, 18 Oct 1999 04:10:46 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Oct 17 21:57:42 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Mon Oct 4 00:57:01 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Oct 4 00:56:51 EDT 1999 Received: from penguin.wise.edt.ericsson.se ([194.237.142.110]) by dusty; Mon Oct 4 00:56:50 EDT 1999 Received: from godzilla.kiere.ericsson.se (root@godzilla.kiere.ericsson.se [172.17.65.8]) by penguin.wise.edt.ericsson.se (8.9.3/8.9.3/WIREfire-1.3) with ESMTP id GAA05059 for ; Mon, 4 Oct 1999 06:56:48 +0200 (MET DST) Received: from esavionics.se (gulliver.kiere.ericsson.se [172.17.64.36]) by godzilla.kiere.ericsson.se (8.8.5/8.8.5) with ESMTP id GAA28801 for ; Mon, 4 Oct 1999 06:56:48 +0200 (MET DST) Sender: esbandr@esavionics.se Message-ID: <37F83296.7F7CFE77@esavionics.se> Date: Mon, 04 Oct 1999 06:52:38 +0200 From: Andreas Ogren Organization: Ericsson Saab Avionics AB X-Mailer: Mozilla 4.5 [en] (X11; I; IRIX 6.3 IP32) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com Subject: Re: Help References: <001a01bf08ea$6aef4b60$5f0da8c0@aku.ac.ir> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 898 Lines: 33 Try the homepage of "Computational Geometry: Algoriths and Applications". http://www.cs.uu.nl/geobook/ It links to a database containing 10,000 papers written on computational geometry. /Andreas > Ali Mohades wrote: > > hi everybody, > > I would be very thankful to anyone who could provide me with e-mail > address or any Webster which can help me to find the papers about a > given subject in computational geometry. > > Best wishes > --------------------------- > Ali Mohades > Amir kabir University of Technology > Tehran, Iran > mohades@cic.aku.ac.ir > Tel: 98-21-640-6322 > Fax: 1-603-925-7150 > --------------------------- ------------- 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 compgeom-owner@research.bell-labs.com Mon Oct 18 04:10:52 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id EAA17688 for ; Mon, 18 Oct 1999 04:10:48 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Oct 17 22:02:28 EDT 1999 From: info@golfuniverse.com Received: from scummy.research.bell-labs.com by netlib2; Sat Oct 9 00:55:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sat Oct 9 00:54:15 EDT 1999 To: compgeom-announce@research.bell-labs.com Received: from mammoth.cyberrealm.net ([206.132.47.119]) by dusty; Sat Oct 9 00:54:13 EDT 1999 Received: from golfuniverse.com (slip166-72-152-227.fl.us.prserv.net [166.72.152.227]) by mammoth.cyberrealm.net (8.9.3/8.9.3) with SMTP id AAA24495; Sat, 9 Oct 1999 00:53:24 -0400 (EDT) From: Subject: Turnstile's Golf & Travel Online Newsletter Date: Sat, 9 Oct 1999 00:37:43 Message-Id: <438.144102.330233@golfuniverse.com> Mime-Version: 1.0 Content-Type: text/html; charset="us-ascii" Precedence: bulk Status: RO Content-Length: 13614 Lines: 175 Turnstile's Golf & Travel Online Newsletter TXT
Turnstile's
Golf & Travel
MAGAZINE


Turnstile's
Golf & Travel
NEWSLETTER

First Name
Last Name
Email Address


NextCard Visa!


NextCard Visa!

SUITE SPOT

Palm Springs Eternal Golfers Get Romanced at the Willows Historic Inn

By Amy DiadAmo

So inviting is the Willows Historic Palm Springs Inn in the heart of Old Palm Springs Village that guests find only one reason—golf on the area's more than 80 courses—to venture outside its Italianate walls. The 1926 villa, once the winter estate of New York attorney and sometime horticulturist Samuel Untermyer, is both grand and intimate and so thoroughly Mediterranean that you half expect to walk out onto the Italian Riviera. It's that romantic.

Continue >>>

STARTER: Gold Finger

Though James Bond preferred a round of shaken martinis to a round of golf, he did enjoy the game. His most-famous match was against the fiendish Goldfinger in the 1964 movie of the same name. They played at Stoke Poges Golf Club, outside London, and 007 won when he caught the arch villain and his bowler-hurling caddie, Odd Job, cheating on the 18th hole.

Continue >>>

STARTER: YIKES!

News reports about a pair of prominent California courses have left golfers wondering if they should go ahead with plans to play those layouts in the coming months. First came word that Pebble Beach has been sold to a group of investors that includes Arnold Palmer, Clint Eastwood, former Major League Baseball commissioner Peter Ueberroth and one-time United Airlines chief executive Richard Ferris for $820 million—close to the all-time-high price paid for the property. Then, one of the state’s most-talked-about new courses, Ocean Trails, on the Palos Verdes peninsula in Los Angeles, lost a chunk of its 18th hole in a landslide just weeks before the Pete Dye track was set to open. It could be months before golfers will be able to tee it up there. The most immediate concern about the sale of the Pebble Beach Company, which includes 2,200 acres, five courses, two resorts and one inn on the Monterey Peninsula, as well as 10 restaurant! s and 14 retail shops, is what the new deal will mean to green fees and room rates. Pebble Beach Golf Links is already the most expensive public golf course in America ($275 for resort guests; $305 for all others), and the cost of a room at the Lodge at Pebble Beach is equally stratospheric ($395 to $525 for a double, and $675 to nearly $2,000 for a suite).

Continue >>>

STARTER: Y2K Bug: Extinct?

Forget the rumors about airlines not flying on New Year’s Eve and New Year’s Day. Though there has been some understandable concern about whether older computers will misread the coming year as "1900" and malfunction as a result, domestic air-traffic-control systems and airlines have made sure they can weather the changeover without any trouble. Flights will operate as scheduled. "The Federal Aviation Administration has been working diligently on [the Y2K bug] and is confident there will not be any problems," says Don Meyer, an aide with the Senate Y2K Committee. "Domestically, the only troubles we expect with air travel have to do with inconveniences at individual airports that will involve ticketing and baggage." Most foreign carriers and air traffic systems are Y2K compliant as well. But Meyer cautions travelers about going to less technologically developed countries that may not have worked out p! otential problems. If you have questions, contact the U.S. State Department (202/647-4000; http://travel.state.gov/travel_warnings.html), which is issuing Y2K travel advisories on a country-by-country basis.

STARTER: BOOK NOW FOR NEW YEAR'S EVE

Believe it or not, Golf & Travel has uncovered some special places where there are still rooms and tee times available for millennium celebrations.

To be among the first to ring in the new year, try New Zealand; given its location near the International Date Line, it will be one of the first major countries to see January 1. There, the golf lodging of choice is the 20-suite Huka Lodge (see photo), which is set on a crystalline river and has access to nearby Wairakei International Golf Course, one of the nation’s best layouts. This private retreat has an exhaustive recreation program that includes—in addition to golf—trout fishing, horseback riding, white-water river rafting, bungee jumping and wine tasting. A sumptuous New Year’s Eve dinner will be followed by a mountaintop breakfast at dawn. The price, $11,750 per couple for five nights, includes everything but airfare; 011-64-7/378-5791.

Continue >>>

STARTER: GOLF SCHOOLS KEEP PACE AT RESORTS

Golf schools opening at resorts is a trend that’s remaining strong. Fourteen years ago, the Cloister’s Sea Island Golf Club, in Georgia, became one of the first resorts to open its own academy, a Golf Digest school. Last year, more than 1,000 students went through the seven-year-old Jim McLean program at the Doral Golf Resort & Spa, in Miami. Now, the Ritz-Carlton in Naples, Florida, has gotten in on the act, debuting a Rick Smith golf academy last November. And the Greenbrier in West Virginia opened a school in June that combines the teaching of its longtime resident pro, Sam Snead, with that of the John Jacobs’ Golf School. And Marriott will be opening two more golf schools in 2000.

Continue >>>

ROAD & DRIVER: FIND YOUR KEYS

Play Miami, then head south on Florida's quirky Route 1

by Ken Baron

Miami draws two kinds of golfers: The fanatic—who wants 72 holes and expects 18 of them to be monstrous—goes to Doral, while the hip—the type itching to juggle two Trent Jones classics with a happening nightclub—heads to Turnberry. To both we recommend a twist: Round out a Miami getaway with a road trip. The city is less than 30 miles from the start of one of America’s most engaging drives, the 126 miles of U.S. Route 1 between Florida City and Key West.

Continue >>>

URBAN OUTINGS: BOSTON TEE PARTY

Live it up on the city’s restored courses

by John Steinbreder

If you think September’s Ryder Cup Matches is the talk of Boston, then you haven’t played golf there recently. Most tee-time conversation is about Quarry Hills, a clever golf course development south of the city that’s being shaped with 7.7 million cubic yards of dirt unearthed during the "Big Dig," a highway redevelopment project in downtown Boston. Not only will Quarry Hills save the state $30 million in dirt disposal costs, the course—with its views of Boston’s harbor and skyline—will be open to the public.

Continue >>>




©1999 - Turnstile's Golf & Travel

------------- 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 compgeom-owner@research.bell-labs.com Mon Oct 18 04:10:53 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id EAA17692 for ; Mon, 18 Oct 1999 04:10:49 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Oct 17 22:02:46 EDT 1999 To: compgeom-announce@research.bell-labs.com Received: from scummy.research.bell-labs.com by netlib2; Mon Oct 11 01:49:02 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Oct 11 01:48:52 EDT 1999 Received: from ori.zcu.cz ([147.228.52.11]) by dusty; Mon Oct 11 01:48:50 EDT 1999 Received: from uk426p02-kiv.fav.zcu.cz (uk426p01-kiv.fav.zcu.cz [147.228.63.55]) by ori.zcu.cz (8.9.3/8.9.3) with SMTP id HAA14400; Mon, 11 Oct 1999 07:42:27 +0200 (MET DST) Message-ID: <00c701bf13a9$670a6b00$373fe493@uk426p02-kiv.fav.zcu.cz> From: "Vaclav Skala" To: Cc: "Vaclav Skala" Subject: WSCG'2000 - deadline changed to October 21,1999/L1 Date: Mon, 11 Oct 1999 07:23:52 +0200 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 4.72.3110.5 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3 Precedence: bulk Status: RO Content-Length: 1202 Lines: 42 Dear friend, due to the low number of correct submissions (not filled Copyright transfer form, problems with FTP, network etc.) I extended the deadine for paper submission for WSCG'2000 exceptionally to: October 21, 1999 - files must be uploaded (exceptionally can be send as attached binary files if copressed and if they do not exceed 700KB together) and the copyright trasfer form must obtained (fax is O.K. if originl included to the original. Paper version must be obtained by October 27. Please, register your paper via WEB if you haven't done it yet. Please, remind the deadline colleagues of yours. Sorry for duplicates and inconveniences I caused. Yours vaclav ~~~~~~~~~~~~~~~~~~~~~ Prof.Ing.Vaclav Skala, CSc. University of West Bohemia Univerzitni 8, Box 314 306 14 Plzen Czech Republic http://herakles.zcu.cz/~skala Tel./record: +420-19-78 22 188 direct Secretariat: tel: +420-19-78 22 212, fax +420-19-78 22 213 ------------- 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 compgeom-owner@research.bell-labs.com Mon Oct 18 04:10:50 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id EAA17683 for ; Mon, 18 Oct 1999 04:10:47 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Oct 17 21:57:42 EDT 1999 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Wed Oct 6 23:29:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Oct 6 23:27:45 EDT 1999 Received: from paul.rutgers.edu ([128.6.5.53]) by dusty; Wed Oct 6 23:27:43 EDT 1999 Received: (from rhoads@localhost) by paul.rutgers.edu (8.8.8/8.8.8) id XAA09538; Wed, 6 Oct 1999 23:27:38 -0400 (EDT) Date: Wed, 6 Oct 1999 23:27:38 -0400 (EDT) Message-Id: <199910070327.XAA09538@paul.rutgers.edu> X-Authentication-Warning: paul.rutgers.edu: rhoads set sender to rhoads@paul.rutgers.edu using -f To: compgeom-discuss@research.bell-labs.com From: "Glenn C. Rhoads" Subject: Problem: Polygon Representation Precedence: bulk Status: RO Content-Length: 881 Lines: 25 Hi everybody, I've written a program where polygons are represented as a sequence of edges and I need to generalize my representation to handle polygons where both the angles and edge lengths could be *irrational*. At the moment, I'm stuck on how to do this. I would really appreciate it if somebody would give me an idea, suggestion, or a useful reference on representing polygons with irrational angles and edge lengths. Regards, Glenn --- Glenn C. Rhoads email: rhoads@paul.rutgers.edu Comp. Science Dept. web: http://remus.rutgers.edu/~rhoads/ Rutgers University phone: (732) 445-4869 ------------- 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 compgeom-owner@research.bell-labs.com Mon Oct 18 04:10:54 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id EAA17696 for ; Mon, 18 Oct 1999 04:10:50 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Oct 17 22:03:06 EDT 1999 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Tue Oct 12 19:23:02 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Tue Oct 12 19:21:34 EDT 1999 Received: from olive.newcastle.edu.au ([134.148.96.123]) by dusty; Tue Oct 12 19:21:31 EDT 1999 Received: (from vlad@localhost) by olive.newcastle.edu.au (8.8.7/8.6.9) id JAA27018 for compgeom-announce@research.bell-labs.com; Wed, 13 Oct 1999 09:21:27 +1000 (EST) Date: Wed, 13 Oct 1999 09:21:27 +1000 (EST) From: Vladimir Estivill-Castro Message-Id: <199910122321.JAA27018@olive.newcastle.edu.au> To: compgeom-announce@research.bell-labs.com Subject: COCOON 2000 CFP Precedence: bulk Status: RO Content-Length: 5294 Lines: 96 COCOON'2OOO --- Preliminary Call for Papers --- Sixth Annual International Computing and Combinatorics Conference July 26-28, 2000, Bondi Beach , Sydney , Australia The Sixth Annual International Computing and Combinatorics Conference, COCOON'2000, will be held in Bondi Beach , Sydney , Australia July 26--28, 2000 (a few weeks before the XXVII Olympics, September 15 -- October 1 ). The conference aims to provide a forum for researchers in theoretical computer science. Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In additional to theoretical results, submissions that report substantial results in experimental and applied research are encouraged. Typical, but not exclusive, topics of interest include: -- algorithms and data structures -- automata, languages and logic -- combinatorics related to algorithms and complexity -- complexity theory -- computational algebra, biology, geometry, and number theory -- computational learning theory and knowledge discovery -- cryptography and database theory -- graph drawing and information visualization -- graph theory, communication networks, and optimization -- parallel and distributed computing Submissions to the conference this year will again be conducted electronically. Authors should send a PostScript file of a paper (in English) to cocoon2000@cse.unsw.edu.au by February 8, 2000. A submission guideline will be given on our home page: http://www.cs.newcastle.edu.au/~cocoon2000 Alternatively, authors unable to access e-mail may send 6 hard copies of their papers to: Xuemin Lin - COCOON'2000 School of Computer Science and Engineering University of New South Wales Sydney, NSW 2052, Australia. e-mail: lxue@cse.unsw.edu.au A paper should start with the title of the paper, each author's name, affiliation, e-mail address, and a short summary of the main results. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance to the conference. The length of the paper should not exceed 10 pages (using 11 point or larger font, with ample margins all around). If necessary, authors may include a clearly marked appendix that will be read at the discretion of the Program Committee. An abstract of the paper must be submitted electronically by February 1, 2000. Authors will be notified of acceptance or rejection by March 30, 2000. A camera-ready copy of each accepted paper will be required by April 26, 2000. The proceedings of the conference will be published by Springer-Verlag in the Lecture Notes in Computer Science series, and will be available for distribution at the conference. The Hao Wang award will be given to the best paper (details will be given on our home page). We also introduce an award for the best paper from a young researcher (at most 3 years since PhD). Program Committee Co-Chairs =========================== Ding-Zhu Du (U. of Minnesota, USA) Peter Eades (Newcastle, Australia) Xuemin Lin (New South Wales, Australia) Conference Co-Chairs ==================== Vladimir Estivill-Castro (Newcastle, Australia) Arun Sharma (New South Wales, Australia) Program Committee ================= David Avis (McGill, Canada), Jianer Chen (Texas A&M, USA), Francis Chin (Hong Kong U, Hong Kong), Vladimir Estivill-Castro (Newcastle, Australia), George Havas (UQ, Australia), Hiroshi Imai (Tokyo, Japan), Tao Jiang (UC Riverside, USA), Richard Karp (UC Berkeley, USA), Michael Juenger (Cologne, Germany), D. T. Lee (Academia Sinica, Taiwan), Bernard Mans (Macquarie U., Australia), Brendan McKay (ANU, Australia), Maurice Nivat (Universitie de Paris VII, France), Takeshi Tokuyama (Tohoku, Japan), Roberto Tamassia (Brown, USA), Jie Wang (UNC Greensboro, USA), Shmuel Zaks (Technion, Israel), Louxin Zhang (NUS, Singapore), Shuzhong Zhang (CUHK, Hong Kong), Binhai Zhu (City U Hong Kong, Hong Kong) Invited Speakers ================ - Christos H. Papadimitriou (University of California, Berkeley) - Richard Brent (Oxford University Computing Laboratory) Important Dates ============== -- Submission of Abstracts: February 1, 2000 -- Submission of Papers: February 8, 2000. -- Notification of Acceptance: March 30, 2000. -- Final Version: April 26, 2000. -- Conference: July 26-28, 2000 . Location ======== The conference will be held at the Swiss-Grand Hotel in Bondi Beach , Sydney , Australia . Further Information =================== Please contact cocoon2000@cse.unsw.edu.au for further information. Sponsors ======== - University of New South Wales - University of Newcastle - Computer Science Association of Australasia ------------- 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 compgeom-owner@research.bell-labs.com Tue Oct 19 21:07:49 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id VAA07543 for ; Tue, 19 Oct 1999 21:07:47 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Oct 19 20:59:58 EDT 1999 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Mon Oct 18 06:15:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Oct 18 06:14:39 EDT 1999 Received: from CE.SHARIF.AC.IR ([194.225.40.100]) by dusty; Mon Oct 18 06:14:26 EDT 1999 Received: by ce.sharif.ac.ir (MX V4.1 VAX) id 23; Mon, 18 Oct 1999 13:41:32 EDT Date: Mon, 18 Oct 1999 13:41:32 EDT From: Ramtin Khosravi To: compgeom-discuss@research.bell-labs.com Message-ID: <009DFCF6.F378AF20.23@ce.sharif.ac.ir> Subject: Visibility map Precedence: bulk Status: RO Content-Length: 566 Lines: 18 Dear all, Where can I find an algorithm for constructing the visibility map of a point lying on the surface of a 3D polyhedron (not a terrain)? I would be thankful if someone tell me the running time of the best algorithm known for the problem. Please reply to raamtin@ce.sharif.ac.ir Thanks --Ramtin ------------- 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 compgeom-owner@research.bell-labs.com Tue Oct 19 21:07:53 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id VAA07547 for ; Tue, 19 Oct 1999 21:07:48 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Oct 19 20:59:04 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Mon Oct 18 09:50:41 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Oct 18 10:19:21 EDT 1999 Received: from beta.nsf.gov ([206.2.78.5]) by dusty; Mon Oct 18 10:19:20 EDT 1999 Received: by beta.nsf.gov; id JAA07912; Mon, 18 Oct 1999 09:44:00 -0400 (EDT) Received: from note1.nsf.gov( 128.150.11.1) by beta.nsf.gov via smap (3.2) id xma007631; Mon, 18 Oct 99 09:43:43 -0400 Received: from kabdali (h080110.f08.nsf.gov [128.150.80.110]) by note1.nsf.gov (8.8.8/8.8.8) with SMTP id JAA31426; Mon, 18 Oct 1999 09:43:41 -0400 Message-Id: <4.1.19991018094100.00999940@popsrvr.nsf.gov> X-Sender: kabdali@popsrvr.nsf.gov X-Mailer: QUALCOMM Windows Eudora Pro Version 4.1 Date: Mon, 18 Oct 1999 09:42:50 -0400 To: "Jack Snoeyink" , "compgeom-announce" From: Kamal Abdali Subject: Re: Funding opportunity in the US (international collaboration is also encouraged) Cc: jean-daniel.boissonnat@sophia.inria.fr, jsbm@ams.sunysb.edu, goodrich@cs.jhu.edu, pankaj@cs.duke.edu In-Reply-To: <199910091120.HAA12113@austin.cs.unc.edu> Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Precedence: bulk Status: RO Content-Length: 1826 Lines: 44 For more information and a FAQ, please also visit http://www.itr.nsf.gov Kamal Abdali At 10/9/99 06:58 AM -0400, Jack Snoeyink wrote: >I was speaking with Kamal Abdali at NSF yesterday, and he wanted to make >sure that the US computational geometry community knows about the following >funding opportunity >> Title: Information Technology Research (ITR) >> Type: Program Announcements & Information >> Subtype: NSF-wide >> http://www.nsf.gov/cgi-bin/getpub?nsf99167 > >Apparently the funding approval for $100M has just gone through congress, >which essentially increases the total computer science budget by 50% this >year. The increase is to meet the goals of the PITAC report. >Letters of intent for $3M centers and proposals over $500K are due Nov 15. > >(The ITR program document also says that international collaboration is >encouraged. Since NSF funds are spent in the US, what this usually means >that coordinated submissions to two or more different national granting >agencies will increase the chances of both.) > >On behalf of the CG steering committee, > >Jack Snoeyink@cs.unc.edu UNC Chapel Hill, Computer Science > CB 3175, Sitterson Hall, Chapel Hill, NC 27599-3175 USA >http://www.cs.unc.edu/~snoeyink ph+1(919)962-1969 fax+1(919)962-1799 > >------------- >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 compgeom-owner@research.bell-labs.com Tue Oct 19 21:08:49 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id VAA07624 for ; Tue, 19 Oct 1999 21:08:46 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Oct 19 21:00:01 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Mon Oct 18 08:34:40 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Oct 18 09:04:55 EDT 1999 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.37]) by dusty; Mon Oct 18 09:04:55 EDT 1999 Received: by nrclonex1.imti.nrc.ca with Internet Mail Service (5.5.2448.0) id ; Mon, 18 Oct 1999 09:04:53 -0400 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C70A4809@nrclonex1.imti.nrc.ca> From: "Dickinson, John" To: "'Oliver Fleig'" Cc: compgeom-discuss@research.bell-labs.com Subject: FW: Looking for 3D of ND alpha-hull code. Date: Mon, 18 Oct 1999 09:04:52 -0400 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2448.0) Content-Type: text/plain; charset="iso-8859-1" Precedence: bulk Status: RO Content-Length: 996 Lines: 32 Thanks to all who provided links for me to explore. I would have thnaked you all earlier but I only just now received (Mon 18th) three responses with different starting dates so I think me email has been partially crippled for a while. To answer requests for me to forward the responses I got here is the only response I got directly that did not appear on the mailing list (so far). I would have sent John -----Original Message----- From: Steve Fortune [mailto:sjf@research.bell-labs.com] Sent: October 17, 1999 10:46 PM To: Dickinson, John Subject: Re: Looking for 3D of ND alpha-hull code. Browse through http://www.geom.umn.edu/software/cglist/welcome.html most available cg software is listed there. --Steve Fortune ------------- 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 compgeom-owner@research.bell-labs.com Tue Oct 19 21:08:50 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id VAA07630 for ; Tue, 19 Oct 1999 21:08:47 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Oct 19 21:00:04 EDT 1999 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Mon Oct 18 15:46:39 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Oct 18 16:15:39 EDT 1999 Received: from jinai.cs.nyu.edu ([128.122.80.169]) by dusty; Mon Oct 18 16:15:37 EDT 1999 Received: (from yap@localhost) by jinai.cs.nyu.edu (8.9.1/8.9.1) id QAA11830; Mon, 18 Oct 1999 16:15:33 -0400 (EDT) Date: Mon, 18 Oct 1999 16:15:33 -0400 (EDT) From: Chee Yap Message-Id: <199910182015.QAA11830@jinai.cs.nyu.edu> To: compgeom-discuss@research.bell-labs.com, rhoads@paul.rutgers.edu Subject: Re: Problem: Polygon Representation X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 2671 Lines: 77 Glenn, Irrationalities that are only algebraic can be handled. If the irrationalities are non-algebraic, this is impossible (in the sense of being undecidable) in general. Mixing (algebraic) angles and, say, (algebraic) lengths in the same setting is also generally impossible. The best way out of this is to assume angles as computed values and they are implicitly represented. Two current libraries can handle nested square-roots, which is the kind of irrationality that suffices for many basic applications: (1) LEDA Library: I think what you want is their underlying arithmetic called leda_reals. Leda offers many other useful algorithms and data structures besides leda_reals. http://www.mpi-sb.mpg.de/LEDA/ (2) The Core Library http://cs.nyu.edu/exact/core/ Speed may be an issue if your application has high algebraic degree, but at least in principle, these systems can do it. These are current topics of research. Both systems are described in papers in the proceedings of the 15th ACM Symp.on Computational Geometry (June 1999) (and can be found in the respective sites). --Chee Yap > From compgeom-owner@research.bell-labs.com Sun Oct 17 22:01 EDT 1999 > Date: Wed, 6 Oct 1999 23:27:38 -0400 (EDT) > X-Authentication-Warning: paul.rutgers.edu: rhoads set sender to rhoads@paul.rutgers.edu using -f > To: compgeom-discuss@research.bell-labs.com > From: "Glenn C. Rhoads" > Subject: Problem: Polygon Representation > > > Hi everybody, > > I've written a program where polygons are represented as a sequence > of edges and I need to generalize my representation to handle polygons > where both the angles and edge lengths could be *irrational*. At the > moment, I'm stuck on how to do this. I would really appreciate it if > somebody would give me an idea, suggestion, or a useful reference on > representing polygons with irrational angles and edge lengths. > > Regards, > > Glenn > > --- > Glenn C. Rhoads email: rhoads@paul.rutgers.edu > Comp. Science Dept. web: http://remus.rutgers.edu/~rhoads/ > Rutgers University phone: (732) 445-4869 > > ------------- > 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 compgeom-owner@research.bell-labs.com Mon Oct 25 16:22:12 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id QAA29276 for ; Mon, 25 Oct 1999 16:22:10 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Oct 25 16:16:14 EDT 1999 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Thu Oct 21 05:29:05 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Oct 21 05:28:56 EDT 1999 Received: from core.inf.ethz.ch ([129.132.178.196]) by dusty; Thu Oct 21 05:28:55 EDT 1999 Received: from shadow.inf.ethz.ch (emo@shadow-byebye.inf.ethz.ch [129.132.11.131]) by core.inf.ethz.ch (8.9.3/8.9.3) with ESMTP id LAA02904; Thu, 21 Oct 1999 11:28:48 +0200 (MET DST) Received: (from emo@localhost) by shadow.inf.ethz.ch (8.8.8/8.8.8) id LAA25243; Thu, 21 Oct 1999 11:28:47 +0200 (MET DST) Date: Thu, 21 Oct 1999 11:28:47 +0200 (MET DST) From: Emo Welzl Message-Id: <199910210928.LAA25243@shadow.inf.ethz.ch> To: compgeom-announce@research.bell-labs.com Subject: ICALP 2000, Call for Papers Cc: Jose.Rolim@cui.unige.ch, emo@inf.ethz.ch X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 6133 Lines: 183 Call for Papers ICALP'00 27-th International Colloquium on Automata, Languages and Programming July 9-15, 2000, Geneva, Switzerland The 27-th annual meeting of the European Association of Theoretical Computer Science will be held in Geneva, Switzerland. As is the case with the two tracks of the journal Theoretical Computer Science, the scientific program of the colloquium is split into two parts: Track A of the meeting will correspond to Algorithms, Automata, Complexity, and Games, while Track B to Logic, Semantics, and Theory of Programming. Original contributions to theory of computer science, to be presented either in Track A or in Track B, are being sought. Authors are invited to submit extended abstracts of their papers, not exceeding 12 pages in the standard Springer Verlag LNCS style. Instructions for paper submissions can be found at the conference webpage. Authors from countries where access to Internet is difficult may mail a single copy of their paper directly to the address of the conference chairman. Submissions should consist of: a cover page, with the author's full name, address, fax number, e-mail address, a 100-word abstract, keywords and to which track (A or B) the paper is being submitted and an extended abstract describing original research in no more than 12 pages. It is expected that accepted papers will be presented at the conference. Simultaneous submission to other conferences with published proceedings is not allowed. In addition, one page proposals for workshops, to be sent to the conference chair until November 10, 1999, are welcome. Conference Chair: Jose D. P. Rolim Centre Universitaire d'Informatique University of Geneva 24 rue du General Dufour 1211 Geneva 4 Switzerland e-mail: icalp@cui.unige.ch ICALP'00 Program Committee Track A: Emo Welzl, Chair, ETH Zuerich Harry Buhrman, CWI Amsterdam Peter Bro Miltersen, Univ. Aarhus Martin Dietzfelbinger, Techn Univ. Ilmenau Afonso Ferreira, CNRS-I3S-INRIA Sophia Antipolis Marcos Kiwi, Univ. de Chile Jens Lagergren, KTH Stockholm Gheorghe Paun, Romanian Acad. Guenter Rote, Techn. Univ. Graz & FU Berlin Ronitt Rubinfeld, Cornell Univ. Amin Shokrollahi, Bell Labs Luca Trevisan, Columbia Univ. Serge Vaudenay, ENS Paris & EPF Lausanne Uri Zwick, Tel Aviv Univ. Track B: Ugo Montanari, Chair, Univ. of Pisa Rajeev Alur, Univ. Pennsylvania, Philadelphia Rance Cleaveland, SUNY at Stony Brook Pierpaolo Degano, Univ. of Pisa Jose Fiadeiro, Univ. of Lisbon Andy Gordon, Microsoft Research, Cambridge, Orna Grumberg, Technion, Haifa Claude Kirchner, Inria, Nancy Mogens Nielsen, Univ. of Aarhus Catuscia Palamidessi, Penn. State Univ, Univ. Park Joachim Parrow, KTH, Stockholm Edmund Robinson, QMW, London Jan Rutten, CWI, Amsterdam Jan Vitek, Univ. of Geneva Martin Wirsing, Ludwig-Maximilians-University, Munich Pierre Wolper, Univ. of Liege. Invited Speakers Track A: Andrei Broder, Altavista and Compaq Oded Goldreich, MIT and Weizman Inst. Johan Hastad, KTH Stockholm Kurt Mehlhorn, Max Plank Institute Track B: Samsom Abramsky, Edinburgh Univ. Gregor Engels, Paderborn Univ. Roberto Gorrieri, Univ. Bologna Zohar Manna, Stanford Univ. General Information Geneva is situated along the banks of Lac Leman and Le Rhone. The lake showcases the plumed fountain Jet d'Eau, and various districts of Geneva are connected by bridges across the waterways. The University of Geneva where ICALP '00 will convene is located on the `Left Bank' off Place Neuve and along the Promenade des Bastions near the Old Town section of Geneva. Geneva is a city of water parks and gardens and welcoming walkways which encourage exploration of the historical sites, museums, and international business and shopping districts. The University of Geneva is located near `Old Town' an area dotted with sidewalk cafes, student life, and building antiquities dating back to the 5th century. Geneva is a crossroads situated in the heart of Europe and linked to the world by a vast network of motorways, airlines and railways. For those planning to attend ICALP '00 in Geneva, it is an excellent opportunity to organize short trips into the countryside of charming villages and vineyards. Tours to please all ages and interests are available including afternoon train excursions, shopping cruises on Lake Geneva and The Rhone, and bus and cablecar trips in the Alps. For some, the most inviting attraction will be mouintain climbing. Mont Blanc, one of the highest points in Europe and the city of Chamonix are less than an hour away. Accomodations at a very special ICALP rate have been reserved in a couple of hotels and very inexpensive rooms will be available at the Student Housing. Lunch will be served daily on campus and there will be morning and afternoon refreshment breaks. Note that the specially priced hotel accommodations reserved for ICALP participants are located only a 5-10 minute walk to the campus. Important Dates Workshop Proposals: November 10,1999 Submissions: January 17, 2000 Notification: March 21, 2000 Final Copies: April 18, 2000 Further Information Further information related to ICALP'00, with instructions for paper submissions and conference registration, as well as with details on conference site, registration fee, accommodation, social program, and payments, will appear at the conference webpage at http://cuiwww.unige.ch/~icalp and in forthcoming issues of EATCS Bulletin. The conference is organized by the Centre Universitaire d'Informatique of the University of Geneva. ------------- 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 compgeom-owner@research.bell-labs.com Mon Oct 25 16:23:28 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id QAA29336 for ; Mon, 25 Oct 1999 16:23:26 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Oct 25 16:10:40 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Fri Oct 22 10:35:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Oct 22 10:34:41 EDT 1999 Received: from junior.lgc.com ([134.132.72.99]) by dusty; Fri Oct 22 10:34:40 EDT 1999 Received: from oasis.zycor.lgc.com by junior.lgc.com (8.8.8/lgc.1.26) id JAA01371; Fri, 22 Oct 1999 09:33:02 -0500 (CDT) Received: from dusty (dusty.zycor.lgc.com [134.132.112.56]) by oasis.zycor.lgc.com (8.9.1a/8.9.1) with SMTP id JAA01976; Fri, 22 Oct 1999 09:34:34 -0500 (CDT) From: Steve Zoraster Received: by dusty (SMI-8.6/lgc.1.9) id JAA00912; Fri, 22 Oct 1999 09:34:35 -0500 Date: Fri, 22 Oct 1999 09:34:35 -0500 Message-Id: <199910221434.JAA00912@dusty> To: compgeom-discuss@research.bell-labs.com Subject: Intersections of triangulated surfaces? Cc: szz@zycor.lgc.com Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Content-MD5: nwQNP2qNanbGdfDjY5nB+w== Precedence: bulk Status: RO Content-Length: 706 Lines: 25 I am looking for papers or algorithms which provide efficient solutions to the problem of cutting one triangulated surface model by another triangulated surface model. The desired output would be the two separated sections of the original surface, re-triangulated along the cut line.... Thanks. Responses I get through direct e-mail will be posted back to this list. Steven Zoraster szz@zycor.lgc.com www.lgc.com www.szoraster.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 compgeom-owner@research.bell-labs.com Mon Oct 25 16:23:38 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id QAA29376 for ; Mon, 25 Oct 1999 16:23:36 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Oct 25 16:16:18 EDT 1999 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Mon Oct 25 08:57:05 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Oct 25 08:56:10 EDT 1999 Received: from olive.newcastle.edu.au ([134.148.96.123]) by dusty; Mon Oct 25 08:55:15 EDT 1999 Received: (from vlad@localhost) by olive.newcastle.edu.au (8.8.7/8.6.9) id WAA25112 for compgeom-announce@research.bell-labs.com; Mon, 25 Oct 1999 22:56:04 +1000 (EST) Date: Mon, 25 Oct 1999 22:56:04 +1000 (EST) From: Vladimir Estivill-Castro Message-Id: <199910251256.WAA25112@olive.newcastle.edu.au> To: compgeom-announce@research.bell-labs.com Subject: COCOON-2000 Precedence: bulk Status: RO Content-Length: 5432 Lines: 114 Apologies if you receive multiple copies of this message. COCOON'2OOO --- Preliminary Call for Papers --- Sixth Annual International Computing and Combinatorics Conference July 26-28, 2000, Bondi Beach , Sydney , Australia The Sixth Annual International Computing and Combinatorics Conference, COCOON'2000, will be held in Bondi Beach , Sydney , Australia July 26--28, 2000 (a few weeks before the XXVII Olympics, September 15 -- October 1 ). The conference aims to provide a forum for researchers in theoretical computer science. Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In additional to theoretical results, submissions that report substantial results in experimental and applied research are encouraged. Typical, but not exclusive, topics of interest include: -- algorithms and data structures -- automata, languages and logic -- combinatorics related to algorithms and complexity -- complexity theory -- computational algebra, biology, geometry, and number theory -- computational learning theory and knowledge discovery -- cryptography and database theory -- graph drawing and information visualization -- graph theory, communication networks, and optimization -- parallel and distributed computing Submissions to the conference this year will again be conducted electronically. Authors should send a PostScript file of a paper (in English) to cocoon2000@cse.unsw.edu.au by February 8, 2000. A submission guideline will be given on our home page: http://www.cs.newcastle.edu.au/~cocoon2000 Alternatively, authors unable to access e-mail may send 6(six) hard copies of their papers to: Xuemin Lin - COCOON'2000 School of Computer Science and Engineering University of New South Wales Sydney, NSW 2052, Australia. e-mail: lxue@cse.unsw.edu.au A paper should start with the title of the paper, each author's name, affiliation, e-mail address, and a short summary of the main results. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance to the conference. The length of the paper should not exceed 10 pages (using 11 point or larger font, with ample margins all around). If necessary, authors may include a clearly marked appendix that will be read at the discretion of the Program Committee. An abstract of the paper must be submitted electronically by February 1, 2000. Authors will be notified of acceptance or rejection by March 30, 2000. A camera-ready copy of each accepted paper will be required by April 26, 2000. The proceedings of the conference will be published by Springer-Verlag in the Lecture Notes in Computer Science series, and will be available for distribution at the conference. The Hao Wang award will be given to the best paper (details will be given on our home page). We also introduce an award for the best paper from a young researcher (at most 3 years since PhD). Program Committee Co-Chairs =========================== Ding-Zhu Du (U. of Minnesota, USA) Peter Eades (Newcastle, Australia) Xuemin Lin (New South Wales, Australia) Conference Co-Chairs ==================== Vladimir Estivill-Castro (Newcastle, Australia) Arun Sharma (New South Wales, Australia) Program Committee ================= David Avis (McGill, Canada), Jianer Chen (Texas A&M, USA), Francis Chin (Hong Kong U, Hong Kong), Vladimir Estivill-Castro (Newcastle, Australia), George Havas (UQ, Australia), Hiroshi Imai (Tokyo, Japan), Tao Jiang (UC Riverside, USA), Richard Karp (UC Berkeley, USA), Michael Juenger (Cologne, Germany), D. T. Lee (Academia Sinica, Taiwan), Bernard Mans (Macquarie U., Australia), Brendan McKay (ANU, Australia), Maurice Nivat (Universitie de Paris VII, France), Takeshi Tokuyama (Tohoku, Japan), Roberto Tamassia (Brown, USA), Jie Wang (UNC Greensboro, USA), Shmuel Zaks (Technion, Israel), Louxin Zhang (NUS, Singapore), Shuzhong Zhang (CUHK, Hong Kong), Binhai Zhu (City U Hong Kong, Hong Kong) Invited Speakers ================ - Christos H. Papadimitriou (University of California, Berkeley) - Richard Brent (Oxford University Computing Laboratory) Important Dates ============== -- Submission of Abstracts: February 1, 2000 -- Submission of Papers: February 8, 2000. -- Notification of Acceptance: March 30, 2000. -- Final Version: April 26, 2000. -- Conference: July 26-28, 2000 . Location ======== The conference will be held at the Swiss-Grand Hotel in Bondi Beach, Sydney, Australia. Further Information =================== Please contact cocoon2000@cse.unsw.edu.au for further information. Sponsors ======== - University of New South Wales - University of Newcastle - Computer Science Association of Australasia ------------- 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 compgeom-owner@research.bell-labs.com Wed Oct 27 17:57:33 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id RAA06042 for ; Wed, 27 Oct 1999 17:57:31 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Oct 27 17:46:52 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Mon Oct 25 18:03:05 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Oct 25 18:02:15 EDT 1999 Received: from mail.arc.nasa.gov ([143.232.48.201]) by dusty; Mon Oct 25 18:01:21 EDT 1999 Received: from nas.nasa.gov (octane35.nas.nasa.gov [129.99.71.95]) by mail.arc.nasa.gov (8.8.7/8.8.7) with ESMTP id PAA15344; Mon, 25 Oct 1999 15:00:49 -0700 (PDT) Sender: aftosmis@mail.arc.nasa.gov Message-ID: <3814D310.6CCD0E5B@nas.nasa.gov> Date: Mon, 25 Oct 1999 15:00:48 -0700 From: Michael Aftosmis Organization: NASA Ames X-Mailer: Mozilla 4.5 [en] (X11; U; IRIX64 6.5 IP30) X-Accept-Language: en MIME-Version: 1.0 To: Steve Zoraster CC: compgeom-discuss@research.bell-labs.com Subject: Re: Intersections of triangulated surfaces? References: <199910221434.JAA00912@dusty> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 1601 Lines: 50 Steve, take a look at http://george.arc.nasa.gov/~aftosmis/cart3d/#intersect See if its close to what you want. If the inputs are simplicial polyhedra, I think that "intersect" will do what you want. You can get this package from NASA Ames. The algorithm is written up in: http://george.arc.nasa.gov/~aftosmis/publications/publications.html (click "AIAA 97-0196") or in more detail at: http://george.arc.nasa.gov/~aftosmis/vki/vki97.html Take a look at http://george.arc.nasa.gov/~aftosmis/cart3d/recentInfo.html to see about getting a copy of the software. -Michael Steve Zoraster wrote: > > I am looking for papers or algorithms which provide > efficient solutions to the problem of cutting one > triangulated surface model by another triangulated > surface model. The desired output would be the two > separated sections of the original surface, > re-triangulated along the cut line.... > > Thanks. Responses I get through direct e-mail will > be posted back to this list. > > Steven Zoraster > szz@zycor.lgc.com > www.lgc.com > www.szoraster.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. ------------- 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 compgeom-owner@research.bell-labs.com Wed Oct 27 17:57:54 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id RAA06050 for ; Wed, 27 Oct 1999 17:57:52 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Oct 27 17:48:48 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Wed Oct 27 04:35:06 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Oct 27 04:34:15 EDT 1999 Received: from helium.dcs.kcl.ac.uk ([137.73.8.10]) by dusty; Wed Oct 27 04:33:21 EDT 1999 Received: from echidna (remote391.dialup.kcl.ac.uk [137.73.77.237]) by helium.dcs.kcl.ac.uk (8.9.1a/8.9.1) with ESMTP id JAA18865 for ; Wed, 27 Oct 1999 09:34:11 +0100 (BST) Message-Id: <199910270834.JAA18865@helium.dcs.kcl.ac.uk> From: "Costas S. Iliopoulos" Organization: King's College London To: compgeom-announce@research.bell-labs.com Date: Wed, 27 Oct 1999 09:33:44 +0100 MIME-Version: 1.0 Content-type: text/plain; charset=ISO-8859-1 Subject: Journal Of Discrete Algorithms: Call For Papers Reply-to: csi@dcs.kcl.ac.uk Priority: normal X-mailer: Pegasus Mail for Win32 (v3.12a) Precedence: bulk Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from Quoted-printable to 8bit by duke.cs.duke.edu id RAA06050 Status: RO Content-Length: 3308 Lines: 93 Hermes Science Publications Paris and Oxford JOURNAL OF DISCRETE ALGORITHMS JDA aims to facilitate communication between researchers in theoretical computer science who are concerned with the design and analysis of discrete algorithms. JDA welcomes original papers in all areas of discrete algorithm design and analysis. The purpose of this journal is to feature new algorithms and data structures, new analyses or comparisons of known algorithms, complexity studies and well-focussed review articles of currently-active subject areas. Articles in other areas of theoretical computer science will also be considered when there is a clear connection to computational issues. The JOURNAL OF DISCRETE ALGORITHMS is pledged to maintain an openness to all approaches to the subject, a transparent reviewing policy, and a minimal delay between submission and publication. Editors-in-chief D. Gabbay (King's College), C .S. Iliopoulos (King's College), G. F. Italiano (Universita di Roma), M.Smid (Universitat Magdeburg), E. Upfal (Brown University), D. Wagner (Universitat Konstanz) Editorial Board J. Abello, S. Albers, A. Andersson, A. Broder, M. de Berg, P. Dunne, M. Dyer, A. Frieze, R. Giancarlo, G. Gottlob, M. Grohe, R.Hariharan, R. Janardan, M. Kaufmann, T. Lecroq, B. Levcopoulos, S. Naeher, H. Nagamochi, G. Narasimhan, K. Park, M-F. Sagot, S. Schirra, I. Stewart, M. Szegedy, M. Thorup, S. Vorobyov, G . Woeginger, M. Yvinec. Submissions Submissions should be made to one of the editors-in-chief depending on the subject area. Further information about submission arrangements including instructions for authors is available on: www.dcs.kcl.ac.uk/journals/jda jda@dcs.kcl.ac.uk Special Issues Special issues are a feature of the journal and the following are planned for the first volume: * Matching patterns Editors: M. Crochemore and L. Gasieniec * Advances in Data Structures Editors: R. Hariharan and R. Raman * Combinatorial Algorithms Editors: C.S.Iliopoulos and T. Radzik Subscriptions The subscription rates including postage, packaging and online access for Volume 1, Issues 1-3 2000, ISSN 1468-0904 are: Individual rate: Euro 195 (Europe) Euro 215 (rest of world) Institutional rate: Euro 300 (Europe) Euro 330 (rest of world) Hermes Science Publications, 8 quai du March‚-Neuf, 75004 Paris, France. Fax: +33 1 53 10 15 21. Tel: +33 1 53 10 15 20 E-Mail: hermes@iway.fr ______________________________________________________________________ Costas S. Iliopoulos Algorithm Design Group Tel: +44 20 7848 2809 Dept of Computer Science Fax: +44 20 7848 2851 King's College London Sec: +44 20 7848 2588 Strand London WC2R 2LS England http://www.dcs.kcl.ac.uk/staff/csi ______________________________________________________________________ ------------- 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 compgeom-owner@research.bell-labs.com Wed Oct 27 17:58:15 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id RAA06064 for ; Wed, 27 Oct 1999 17:58:13 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Oct 27 17:48:34 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Wed Oct 27 04:13:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Oct 27 04:12:08 EDT 1999 Received: from mail.mpi-sb.mpg.de ([139.19.1.1]) by dusty; Wed Oct 27 04:11:15 EDT 1999 Received: from mpii01802.ag1.mpi-sb.mpg.de (mpii01802.ag1.mpi-sb.mpg.de [139.19.11.33]) by mail.mpi-sb.mpg.de (8.8.7/8.8.8) with ESMTP id KAA19295; Wed, 27 Oct 1999 10:12:25 +0200 Received: (from sanders@localhost) by mpii01802.ag1.mpi-sb.mpg.de (8.9.3/8.9.3) id KAA06912; Wed, 27 Oct 1999 10:09:52 +0200 (MET DST) From: Peter Sanders MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <14358.45904.444382.9867@gargle.gargle.HOWL> Date: Wed, 27 Oct 1999 10:09:52 +0200 (MET DST) To: compgeom-announce@research.bell-labs.com Subject: Postdoc at MPI for Computer Science - Algorithms Group X-Mailer: VM 6.72 under 21.1 (patch 7) "Biscayne" XEmacs Lucid Precedence: bulk Status: RO Content-Length: 2271 Lines: 61 P O S T - D O C T O R A L F E L L O W S H I P S at the M A X - P L A N C K - I N S T I T U T E for C O M P U T E R S C I E N C E The Max-Planck-Institute for Computer Science is located on the campus of the Universit"at des Saarlandes in Saarbr"ucken, Germany. The institute was founded in 1990 and consists, at present, of four research units: Algorithms and Complexity, Logic of Programming, Hybrid Systems and Computer Graphics. The research group ALGORITHMS AND COMPLEXITY offers a number of postdoctoral fellowships for the year 2000/2001. Fellowships are available for one or two years and amount to DM 3,600 per month tax free (approximately 1840 Euro or 2000 US$). There is generous travel support available and the group collaborates with several of the major research institutions in Europe and USA. The interests of the research group members includes data structures, graph and network algorithms, computational geometry, parallel and external algorithms, computational complexity, combinatorial optimization, graph drawing, on-line algorithms, randomized algorithms, computational biology and implementation of algorithms and program libraries. The group consists mainly of young researchers of several nationalities. The working language is English. The postdoctoral fellows are expected to interact with group members and are encouraged to initiate research in their individual areas of specialization. More information is available on WWW at http://www.mpi-sb.mpg.de Applications (including curriculum vitae, list of publications, research plan, names of references with their e-mail addresses, and intended period of stay) should be sent by January 31, 2000 to Peter Sanders. Further information can also be obtained from Peter Sanders (sanders@mpi-sb.mpg.de). Max-Planck-Institut f"ur Informatik Im Stadtwald D-66123 Saarbr"ucken Germany ------------- 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 compgeom-owner@research.bell-labs.com Sat Oct 30 22:13:04 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id WAA27246 for ; Sat, 30 Oct 1999 22:13:02 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sat Oct 30 15:34:50 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Fri Oct 29 18:07:07 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Oct 29 18:05:19 EDT 1999 Received: from cae.wisc.edu ([144.92.240.30]) by dusty; Fri Oct 29 18:04:23 EDT 1999 Received: from sun-6.cae.wisc.edu (sun-6.cae.wisc.edu [144.92.241.190]) by cae.wisc.edu (8.9.1/8.9.0) with ESMTP id RAA27775 for ; Fri, 29 Oct 1999 17:05:18 -0500 (CDT) Received: (from yong@localhost) by sun-6.cae.wisc.edu (8.9.3/8.9.3) id RAA05131 for compgeom-discuss@research.bell-labs.com; Fri, 29 Oct 1999 17:05:17 -0500 (CDT) From: Yong Lu Message-Id: <199910292205.RAA05131@sun-6.cae.wisc.edu> Subject: generate patches to cover a chain of arbitrary bounding edges To: compgeom-discuss@research.bell-labs.com (compgeom compgeom) Date: Fri, 29 Oct 1999 17:05:17 -0500 (CDT) X-Mailer: ELM [version 2.5 PL1] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 537 Lines: 18 Dear sirs: I am looking for references on covering a chain of arbitrary edges with patches (preferable not to be NURBS). I wonder if I could get some help for you if you know some work related. Thanks. Yong Mechanical Engineering, University of Wisconsin-Madison ------------- 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 dmanet-owner@Octopussy.MI.Uni-Koeln.DE Wed Nov 3 11:47:31 1999 Received: from Octopussy.MI.Uni-Koeln.DE (Octopussy.MI.Uni-Koeln.DE [134.95.166.20]) by duke.cs.duke.edu (8.9.1/8.9.1) with ESMTP id LAA07858; Wed, 3 Nov 1999 11:47:28 -0500 (EST) Received: (from majordom@localhost) by Octopussy.MI.Uni-Koeln.DE (8.9.1/8.9.1) id RAA25151 for dmanet-outgoing; Wed, 3 Nov 1999 17:05:46 +0100 (MET) Date: Wed, 03 Nov 1999 15:57:47 +0100 From: POWELL Olivier Subject: [DMANET] ICALP'00:call for papers To: "Rolim Jose D. P." Message-id: <38204D6A.915697D8@cui.unige.ch> MIME-version: 1.0 X-Mailer: Mozilla 4.5 [en] (X11; I; SunOS 5.6 sun4u) Content-type: text/plain; charset=iso-8859-1 Content-transfer-encoding: 8BIT X-Accept-Language: en Sender: owner-dmanet@zpr.uni-koeln.de Precedence: bulk Status: RO Content-Length: 2094 Lines: 77 Call for Papers ICALP'00 27-th International Colloquium on Automata, Languages and Programming July 9-15, 2000, Geneva, Switzerland The 27-th annual meeting of the European Association of Theoretical Computer Science will be held in Geneva, Switzerland. Track A of the meeting will correspond to Algorithms, Automata, Complexity, and Games, while Track B to Logic, Semantics, and Theory of Programming. Instructions for paper submissions can be found at the conference webpage. Authors from countries where access to Internet is difficult may mail a single copy of their paper directly to the address of the conference chairman. It is expected that accepted papers will be presented at the conference. Simultaneous submission to other conferences with published proceedings is not allowed. In addition, one page proposals for workshops, to be sent to the conference chair until November 10, 1999, are welcomed. Conference Chair: Jose D. P. Rolim Centre Universitaire d'Informatique University of Geneva 24 rue du General Dufour 1211 Geneva 4 Switzerland e-mail: icalp@cui.unige.ch Important Dates Workshop Proposals: November 10,1999 Submissions: January 17, 2000 Notification: March 21, 2000 Final Copies: April 18, 2000 Further Information http://cuiwww.unige.ch/~icalp ********************************************************** * * 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 compgeom-owner@research.bell-labs.com Tue Nov 9 17:02:14 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id RAA27148 for ; Tue, 9 Nov 1999 17:02:08 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Nov 9 16:59:02 EST 1999 Received: from scummy.research.bell-labs.com by netlib2; Mon Nov 8 09:19:06 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Nov 8 09:17:23 EST 1999 Received: from ppp.wh.hb.cn ([202.103.24.118]) by dusty; Mon Nov 8 09:16:20 EST 1999 Received: from pwuhy (ppp265.wuhan.net.cn [202.103.28.25]) by ppp.wh.hb.cn (8.9.3/8.9.3) with SMTP id WAA27404 for ; Mon, 8 Nov 1999 22:15:24 +0800 (GMT) Message-ID: <007501bf29f3$093f5340$191c67ca@pwuhy> Reply-To: "Wu Huayi" From: "Wu Huayi" To: "=?iso-8859-1?B?vMbL47y4us4gzNbC29fp?=" Subject: Help me to find a reference Date: Mon, 8 Nov 1999 22:10:04 +0800 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_0072_01BF2A36.02339A00" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 4.72.3110.5 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3 Precedence: bulk Status: RO Content-Length: 2034 Lines: 63 This is a multi-part message in MIME format. ------=_NextPart_000_0072_01BF2A36.02339A00 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Dear Sirs: In my paper for revision, I need the followed reference in urgent. Will anyone in your convience help me to find it.=20 Fujio Yamaguchi, Masatoshi Niizeki and Hiroyuki Fukunaga, Two robust point in polygon test on the 4x4 determinant method, In: Proceedings of ASME Design Technical Conference, The=20 16th Design Automation Conference, vol23, 1990, pp89-95=20 Thank you very much! Wu Huayi(wuhy@public.wh.hb.cn) ------=_NextPart_000_0072_01BF2A36.02339A00 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable
Dear Sirs:
 
In my paper for revision, I need the followed = reference=20 in urgent.
Will anyone in your convience help me to find it.
 
Fujio Yamaguchi, Masatoshi Niizeki and Hiroyuki Fukunaga,
Two robust point in polygon test on the 4x4 determinant = method,
In: Proceedings of ASME Design Technical Conference, The
16th Design Automation Conference, vol23, 1990, pp89-95
 
Thank you very much!
 
Wu Huayi(wuhy@public.wh.hb.cn) ------=_NextPart_000_0072_01BF2A36.02339A00-- ------------- 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 compgeom-owner@research.bell-labs.com Tue Nov 9 17:06:41 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id RAA27274 for ; Tue, 9 Nov 1999 17:06:39 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Nov 9 16:58:57 EST 1999 To: compgeom-discuss@research.bell-labs.com Received: from scummy.research.bell-labs.com by netlib2; Fri Nov 5 11:51:05 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Nov 5 11:49:53 EST 1999 Received: from tunix.is-bremen.de ([195.90.0.7]) by dusty; Fri Nov 5 11:48:51 EST 1999 Received: from marvin.hh.land-system.de ([212.6.157.251]) by tunix.is-bremen.de (8.9.1/8.9.1) with ESMTP id RAA31467 for ; Fri, 5 Nov 1999 17:49:49 +0100 Received: from COOK by marvin.hh.land-system.de with SMTP (Microsoft Exchange Internet Mail Service Version 5.0.1459.74) id WF6YXNR6; Fri, 5 Nov 1999 17:40:21 -0000 Message-ID: <001f01bf27ac$aec30da0$1200000a@cook> From: "Gang Yang" To: Subject: Help: Creating polygons from line segments Date: Fri, 5 Nov 1999 17:41:01 +0100 MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="----=_NextPart_000_0019_01BF27B4.ED4E4730" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2314.1300 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300 Precedence: bulk Status: RO Content-Length: 7198 Lines: 160 This is a multi-part message in MIME format. ------=_NextPart_000_0019_01BF27B4.ED4E4730 Content-Type: multipart/alternative; boundary="----=_NextPart_001_001A_01BF27B4.ED515470" ------=_NextPart_001_001A_01BF27B4.ED515470 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Hello, everyone: I'm new to this list. I apologize if my message is off topic. I'm writing some codes for creating polygons from line segments. Input = data are lines with all of them intersected. Attachment is a picture of = my line data. The principal method I'm using is the "sweep line" = algorithm. What I do is: 1) transform all lines to monotone lines (to = y-axis); 2) sort the nodes from bottom to top; 3) seaching edges of = polygons from node to node. For convex polygons I have actually aquired = correct results using this algorithm, but not for concave polygons and = nested polygons. I have been trying to solve this for days but in vain. = I will be very thankful if you can give me any advice in this regard. Thank you=20 Gang Yang ----------------------------------------------------------- Land+System Sternstr. 106 20357 Hamburg Germany E-mail: yang@hh.land-system.de or gang.yang@tu-clausthal.de ---------------------------------------------------------- ------=_NextPart_001_001A_01BF27B4.ED515470 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable
Hello, everyone:
 
I'm new to this list. I apologize if my message = is off=20 topic.
 
I'm writing some codes for creating polygons = from line=20 segments. Input data are lines with all of them intersected. Attachment = is a=20 picture of my line data. The principal method I'm using is the "sweep = line"=20 algorithm. What I do is: 1) transform all lines to monotone lines (to = y-axis);=20 2) sort the nodes from bottom to top; 3) seaching edges of polygons from = node to=20 node. For convex polygons I have actually aquired correct results using = this=20 algorithm, but not for concave polygons and nested polygons. I have been = trying=20 to solve this for days but in vain. I will be very thankful if you can = give me=20 any advice in this regard.
 
Thank you
 
Gang Yang
 
-----------------------------------------------------------<= /DIV>
Land+System
Sternstr. 106
20357 Hamburg
Germany
E-mail: yang@hh.land-system.de or
gang.yang@tu-clausthal.de
----------------------------------------------------------
 
------=_NextPart_001_001A_01BF27B4.ED515470-- ------=_NextPart_000_0019_01BF27B4.ED4E4730 Content-Type: image/gif; name="linesegments.gif" Content-Transfer-Encoding: base64 Content-Disposition: attachment; filename="linesegments.gif" R0lGODlhlACOAPcAACFKhP////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// /////////////////////////////////////////////////////ywAAAAAlACOAAAI/gADCBxI sKDBgwgHAkjIsGGAhQ4jIoQoseJEihYzEsSoMSHHjh5BVgRA8qNIiyRPXlQ5keVFky4zwlQ5U2TN jiVj6rwJkqfMmDl96hxZMqVLoRKRHixaUOlQlEWj/jza0+jSp1gbSnXotCVUnh9zZh3K9GHErgZ9 lk36UOzYo243nqXJMC5RtG9fcgVrE6bVqXjzKrTLtTBOvxrFLgycdS1OwyjNet2LMSXjnX/papVZ 8yZhyWEFD84MF3LhznpXCqws2DFQxabrSp68mvTo2RBtv7689DPfzbNbfq7N0ahumsNPJq+9V3bw 3h6PW366vOpx4qvnXs3uPK3a59Z5/jet7hr89qbcgctlG7g8y+ptPf9WSD+208WcxY+/jn2kaYrf MffTYtLBlx9YBp4XUnABdhWVXwl+dRZ/bG3G2oR3IYiVe97pZ9Z86akXHYXrwUUihzbV1515CnqX onIkxvfWhc4pZVKMCx44IY49uSibjeMBlRR8W3lIG3p1ASmgkEkiaJuRaYnYImWNdSjfdDluGFuU /sFIWm5EfpklZhWOqVpiQaWmlXRm9oUjfkmuOGRmlYWJ5ZElupmYim2yqCaXJ4qJZ54Z9khoizzC 2ed+i/ppI49TtrVmhJL6GeJ+ikbKJ5KTMqnpps2Byulto5ZqqqjEGemZlNF9ihub/o3OVBykZcrJ pa2oZnenq6gJRylUXS56Xa+5EvsprcD6t+qtsZ6aq6ONIjeVpQwGeKSxzGZ7KHIOBrkgUste6qy4 25JblaHayqXktbia6654yBbbbrPlumspYnoqx+poD/br74Pj3jsvWvEG/G5r9A5qL3TvWZsuWQNH vGNptT7sKa8St0pxsK6+N6/AClfaMLoWX2wxtof+qjHJBnucsKZ1kqlZxy6HDPJVBfvoZbRU2Yzy YDKjWdbPEAubsbRC+4zwyycjzdm+z0aGMdP1hvq0djSPOCzV9RLstdRZp/rmx0RT6+3VYMO81WNc y4sh23t+u3bPU4es4WEv/qml/tF8n4k2yy3XXPexDKNpctVpN932cwWrynPF45YN7ZKGc7s13YOX LGvjXs89OeYBSw4l5URtibjWmSqutM0rJ4t1yRt5fjPhi7Pu9+vOAgy1vaI/Tvrb0wIqO+6Rk/04 pCoXm/Ozshof6328NX941dIL+y/00y8cfOjO0w589mZzrHrmQNsuctFhE08902myvnxvsILOfbNx Vc+oiW7Zn9/6q2N6o5y7Okz8YBc795TNWAaqnlXwksB26W53sxsVuEIiqDklDkkP3F65+AMmoWzO fOcT3/0EJzzYwM84kHPbiPQFwhSmajsZjJoKH5a88ZGQKZtz2NFMFcC8pW8u/nbRHwS7lqMFgi98 FvSe+pSIngqysIUvSV3uLmi31p2uU75jV99Mx0QXoi43H7OSE20YxhmK8IT9E+OJtjhEM3pRRhAE 0PCW+Dkuai5uI6QjijToxjIeDI8h9CKUiLau3REMjnAjIB/7CEIhUmlmP7RjHdv4R8p4SHKJLN4b iai1KmVRkFn0IABrSEXtLXKSfhTYHvcGRTs60ncfFE0eFXlGRobtldQpUirfiEta9tJLusEkIDVJ R2JaLkax/OIAjUlJVGaIgcqMoStDycuvgNGHtARlCyfovvIwRpiljCA18TRHGRoSfV2EpdyQ98Rs ajN9otRbOPW4o+XgkpvT/mzn33goTTRWcZO2BKhw1unBtd2zlmQ8pYWaFM5expOe2HxkZy65w3FG EnaeA2dDLXpOfb6wdpnkZDFFaqhyJtSjAQ2cM+cUr18Ok6TNdCm/lpecR3W0kQiF0CotiULb7XSl pkTi5PppzWA6kJ1s5OhMGxYh/dX0ptl0ktiOCU1fUShcJ41UkWj6Uz0WMp1BBU1X69lT8N0HqgQ0 aVHxZVaFAtU8an0mQl96xagdcKr4u+Zc6RpW3uEqrhJyp1AhulfpATZpn3RcK7E6y92UNZIUTey+ SHnC/31ysHGcp1hJqZihVbSZxZTqRDnXWcv+c6+nzGGpxuo/8qVUsJktVKBVO/fY+bl2l0MkUIFo NTyHghS2jJrohjybRmaq1Jzw4x9Tn/RZvy52f2BlaSWje1fNkiqplrzjaanL1/Llc2KL821xXfnV ukoxq+K9bZt468eAAAA7 ------=_NextPart_000_0019_01BF27B4.ED4E4730-- ------------- 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 compgeom-owner@research.bell-labs.com Tue Nov 9 17:08:13 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id RAA27347 for ; Tue, 9 Nov 1999 17:08:12 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Nov 9 17:02:43 EST 1999 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Tue Nov 9 15:13:05 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Tue Nov 9 15:11:43 EST 1999 Received: from helium.dcs.kcl.ac.uk ([137.73.8.10]) by dusty; Tue Nov 9 15:10:37 EST 1999 Received: from calcium.kcl.ac.uk (raman@calcium.dcs.kcl.ac.uk [137.73.8.67]) by helium.dcs.kcl.ac.uk (8.9.1a/8.9.1) with SMTP id UAA04268 for ; Tue, 9 Nov 1999 20:11:40 GMT Received: by calcium.kcl.ac.uk (SMI-8.6/SMI-SVR4) id UAA01405; Tue, 9 Nov 1999 20:11:40 GMT From: raman@dcs.kcl.ac.uk (Rajeev Raman) Message-Id: <199911092011.UAA01405@calcium.kcl.ac.uk> Subject: Jobs at King's College London To: compgeom-announce@research.bell-labs.com Date: Tue, 9 Nov 1999 20:11:40 +0000 (GMT) X-Mailer: ELM [version 2.4 PL23] Content-Type: text Precedence: bulk Status: RO Content-Length: 2714 Lines: 59 Department of Computer Science King's College London LECTURESHIPS / SENIOR LECTURESHIPS IN COMPUTER SCIENCE The Department of Computer Science is seeking to fill four posts with further expansion to follow. Candidates with a strong research orientation are invited to apply for these positions. The Department currently has three research groups: ALGORITHM DESIGN: design, analysis and engineering of algorithms, application of algorithmic techniques in bio-informatics, musicology and operations research. INFORMATION SYSTEMS AND SOFTWARE ENGINEERING: human-computer interaction, systems design, notations, distributed World Wide Web based applications, especially health informatics and musicology. Theories of specification, formal methods, design of reactive and real-time systems, automated reasoning in support of software engineering, semantics of object-oriented design languages. LOGIC AND COMPUTATION: logics, AI, reasoning and deduction, proof systems. Preference will be given to candidates whose research interests fit within the Department's current structure. One of the posts is associated with the appointments of Professor Tom Maibaum and Dr Kevin Lano whose work is in the application of sound mathematical techniques in software engineering. Further details about the Department and these posts can be found on the Department's World Wide Web site http://www.dcs.kcl.ac.uk/. The appointments will be made, depending on qualifications and experience, on an appropriate point of the Lecturer A scale from 19,372 pounds to 24,713 pounds, or the Lecturer B scale from 25,655 pounds to 32,199 pounds, or the Senior Lecturer scale from 33,697 pounds to 37,804 pounds per annum, all of which include 2,134 pounds London Allowance per annum. Applicants applying for the post at the Senior Lecturer level will be expected to demonstrate a strong research record and significant teaching experience. For an application form and further details please contact Hillia Holland, School Personnel Officer, School of Physical Sciences and Engineering, King's College London, Strand, London WC2R 2LS; email Hillia.Holland@kcl.ac.uk. The closing date is 7 December and interviews will be held mid January 2000. Please quote reference A3/CCS/49/99. Promoting excellence in teaching, learning & research. Equality of opportunity is College policy. ------------- 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 compgeom-owner@research.bell-labs.com Sun Nov 14 19:50:03 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id TAA15869 for ; Sun, 14 Nov 1999 19:50:00 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Nov 14 19:42:17 EST 1999 Received: from scummy.research.bell-labs.com by netlib2; Sun Nov 14 04:33:04 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sun Nov 14 04:31:32 EST 1999 Received: from peik.bol.sharif.ac.ir ([194.225.42.33]) by dusty; Sun Nov 14 04:30:21 EST 1999 Received: from localhost (bagheri@localhost) by peik.bol.sharif.ac.ir (8.8.7/8.8.7) with SMTP id MAA22247 for ; Sun, 14 Nov 1999 12:59:45 +0330 Date: Sun, 14 Nov 1999 12:59:45 +0330 (IRT) From: Bagheri To: compgeom-discuss@research.bell-labs.com Subject: Open Problem Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 411 Lines: 17 Dear friends, Hi, May I ask you send me some open problems on drawing DAGs(directed asyclic graphs), if there is any, please? --Thanks --Bagheri ------------- 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 compgeom-owner@research.bell-labs.com Fri Nov 19 17:07:52 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id RAA23034 for ; Fri, 19 Nov 1999 17:07:50 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Nov 19 17:04:37 EST 1999 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from nslocum.cs.bell-labs.com by netlib2; Fri Nov 19 16:40:35 EST 1999 Received: by nslocum.cs.bell-labs.com (8.9.3/8.9.3) id QAA14276 for compgeom-announce; Fri, 19 Nov 1999 16:40:34 -0500 (EST) Message-Id: <199911192140.QAA14276@nslocum.cs.bell-labs.com> Date: Fri, 19 Nov 1999 16:40:34 -0500 To: compgeom-announce@research.bell-labs.com From: "Steve Fortune" Precedence: bulk Status: RO Content-Length: 6588 Lines: 150 REMINDER: Deadline is December 6 SUBMISSION instructions now available at the web site CALL FOR PAPERS Sixteenth Annual Symposium on COMPUTATIONAL GEOMETRY June 12-14, 2000 Hong Kong University of Science and Technology http://www.cs.ust.hk/tcsc/scg00.html Sponsored by ACM SIGACT and SIGGRAPH The Sixteenth Annual Symposium on Computational Geometry, featuring an applied track, a theoretical track, and a video review, will be held at Hong Kong University of Science and Technology, Hong Kong. We invite high-quality submissions in the following areas: * geometric algorithms or combinatorial geometry, for the theoretical track, or * implementation issues or applications of computational geometry, for the applied track. The proceedings, with the papers of both tracks, will be distributed at the symposium and will subsequently be available for purchase from ACM. A selection of papers will be invited to special issues of journals. During the conference, sessions of presentations will alternate between the two tracks, rather than being in parallel. Topics for the theoretical track include, but are not limited to design and theoretical analysis of geometric algorithms and data structures; lower bounds for geometric problems; and discrete and combinatorial geometry. Topics for the applied track include, but are not limited to experimental analysis of algorithms and data structures; mathematical and numerical issues arising from implementations; and novel uses of computational geometry in other disciplines, such as robotics, computer graphics, geometric and solid modeling, manufacturing, and geographical information systems. See below for additional information on the two tracks. Theoretical Track Submission Electronic submissions are preferred for the theoretical track (see web page above for instructions), but authors may instead mail 8 copies of an extended abstract to arrive by December 6, 1999 to Pankaj K. Agarwal Department of Computer Science LSRC Building, Rm D207 Duke University Durham, NC 27706 Phone: (919) 660-6540 pankaj@cs.duke.edu Applied Track Submission Electronic submissions are preferred for the applied track (see web page above for instructions), but authors may instead mail 11 copies of an extended abstract to arrive by December 6, 1999 to Steven Fortune Room 2c459 Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 Phone: (908) 582-7042 sjf@research.bell-labs.com Important Dates December 6, 1999: Papers due, both tracks February 13, 2000: Video submissions due February 15, 2000: Notification of acceptance or rejection of papers March 1, 2000: Notification of acceptance or rejection of videos March 15, 2000: Camera-ready papers due April 15, 2000: Final versions of videos due June 12-14, 2000: Symposium Papers that primarily address practical issues and implementation experience, even if not tied to a particular application domain, should be submitted to the applied track. Papers that primarily prove theorems should be submitted to the theoretical track. Most experimental work should be submitted to the applied track; an exception would be experiments in support of mathematical investigations. Submissions to one track may be forwarded to the other for consideration, unless the authors have explicitly stated interest in one track only. Papers should be submitted in the form of an extended abstract. Papers should begin with the title of the paper, each author's name, affiliation, and e-mail address, followed by a succinct statement of the problems and goals that are considered in the paper, the main results achieved, the significance of the work in the context of previous research, and a comparison to past research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages, using 11 point or larger font and with at least one-inch margins all around. For cases in which the authors consider it absolutely essential to include additional technical details that do not fit into 10 pages, these details may be added in a clearly marked appendix that should appear after the body of the paper and the references; this appendix will not be regarded as a part of the submission and will be considered only at the program committee's discretion. Abstracts in hard copy must be received by December 6, 1999, or postmarked by November 29 and sent airmail. Abstracts in electronic form are due by December 6, 5:00 PM EST. These are firm deadlines: late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 2000. A full version of each contribution in final form will be due by March 15, 2000 for inclusion in the proceedings. Conference Chairs Siu-Wing Cheng Otfried Cheong scheng@cs.ust.hk otfried@cs.ust.hk Theoretical Track Program Committee Pankaj K. Agarwal, Chair (Duke) Franz Aurenhammer (Graz) Mark de Berg (Utrecht) Herbert Edelsbrunner (Duke) Jeff Erickson (UIUC) Hazel Everett (Montreal) Klara Kedem (Ben Gurion) Applied Track Program Committee Gill Barequet (Technion) Steven Fortune, Chair (Bell Labs) Chris Gold (Laval U.) Ken Goldberg (Berkeley) Scott Mitchell (Sandia Labs) Tom Peters (U. Conn.) Jean Ponce (UIUC) Stefan Schirra (MPI) Subhash Suri (Wash. U.) ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/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 compgeom-owner@research.bell-labs.com Sat Nov 20 17:18:18 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id RAA10167 for ; Sat, 20 Nov 1999 17:17:14 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Nov 20 17:15:36 EST 1999 Received: from grubby.research.bell-labs.com by netlib2; Fri Nov 19 17:13:04 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Nov 19 17:11:35 EST 1999 Received: from algonquin.uwaterloo.ca ([129.97.78.153]) by dusty; Fri Nov 19 17:10:22 EST 1999 Received: from algonquin.uwaterloo.ca (rudolf@localhost [127.0.0.1]) by algonquin.uwaterloo.ca (8.8.8/8.8.8) with ESMTP id RAA00112; Fri, 19 Nov 1999 17:11:31 -0500 (EST) Message-Id: <199911192211.RAA00112@algonquin.uwaterloo.ca> X-Mailer: exmh version 8.2.0 7/22/99 To: compgeom-announce@research.bell-labs.com cc: rudolf@algonquin.uwaterloo.ca Subject: Call for Videos Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Fri, 19 Nov 1999 17:11:30 -0500 From: Rudolf Hans Fleischer Precedence: bulk Status: RO Content-Length: 3468 Lines: 85 CALL FOR VIDEOS 9th Annual Video Review of Computational Geometry to be presented at the Sixteenth Annual Symposium on Computational Geometry http://www.cs.ust.hk/tcsc/scg00.html June 12-14, 2000 Hong Kong University of Science and Technology Sponsored by ACM SIGACT and SIGGRAPH Videos are sought for a video review of computational geometry. Background This video review showcases the use of visualization in computational geometry for exposition and education, as an interface and a debugging tool in software development, and for the visual exploration of geometry in research. Algorithm animations, visual explanations of structural theorems, descriptions of applications of computational geometry, and demonstrations of software systems are all appropriate. Videos that accompany papers or communications submitted to the technical program committee are encouraged. Submissions Authors should send one preview copy of a videotape to the address below by February 13, 2000. The videotape should be at most eight minutes long (three to five minutes, preferred), and be in VHS NTSC or VHS PAL format. Each video tape must be accompanied by a one- or two-page description of the material shown in the video, and where applicable, the techniques used in the implementation. Please format descriptions following the guidelines for ACM proceedings. Additional material describing the contents of the videos, such as the full text of accompanying papers, may also be included. Textual material may be submitted electronically by e-mailing either the URL of a PostScript file (preferred) or the PostScript file itself to rudolf@uwaterloo.ca If electronic submission is impossible, authors should include five hardcopies of the accompanying text with their video. Videotapes and accompanying text should be sent to Rudolf Fleischer Department of Computer Science University of Waterloo Waterloo, Ontario, N2L 3G1 Canada Tel: (519) 888-4567 ext 2041 FAX: (519) 885-1208 For customs purposes, it is best to declare a value of $5. If you have questions, please contact the committee chair at rudolf@uwaterloo.ca or (519) 888-4567 ext 2041. Notification Authors will be notified of acceptance or rejection, and given reviewers' comments by March 1, 2000. For each accepted video, the final version of the textual description will be due by March 15, 2000 for inclusion in the proceedings. Final versions of accepted videos will be due April 10, 2000 in the best format available. The accepted videos will be edited onto one tape, which will be shown at the conference and will be distributed to the participants. Video Program Committee Therese Biedl (U. Waterloo) Timothy Chan (U. Waterloo) Erik Demaine (U. Waterloo) Martin Demaine (U. Waterloo) Rudolf Fleischer, Chair (U. Waterloo) Anna Lubiw (U. Waterloo) Jack Snoeyink (UNC) ------------- 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 compgeom-owner@research.bell-labs.com Thu Dec 2 13:17:23 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id NAA06528 for ; Thu, 2 Dec 1999 13:17:13 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Dec 2 13:12:55 EST 1999 Received: from scummy.research.bell-labs.com by netlib2; Mon Nov 29 11:47:05 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Nov 29 11:45:11 EST 1999 Received: from amirani.ams.sunysb.edu ([129.49.6.2]) by dusty; Mon Nov 29 11:43:51 EST 1999 Received: from dijkstra (dijkstra.ams.sunysb.edu [129.49.6.129]) by amirani.ams.sunysb.edu (8.9.1a/8.9.1) with SMTP id LAA18409 for ; Mon, 29 Nov 1999 11:45:06 -0500 (EST) Message-Id: <199911291645.LAA18409@amirani.ams.sunysb.edu> Date: Mon, 29 Nov 1999 11:43:23 -0500 (EST) From: Joseph Mitchell Reply-To: Joseph Mitchell Subject: Seeking reviewers for NSF's Information Technology Research Initiative To: compgeom-announce@research.bell-labs.com MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: bl8w6kwTrp2Xy1Bx2zLahQ== X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4m sparc Precedence: bulk Status: RO Content-Length: 3876 Lines: 73 Seeking reviewers for NSF's Information Technology Research Initiative NSF is preparing for the review of proposals submitted to the Information Technology Research (ITR) initiative for FiscalYear 2000. The success of this program depends critically on our ability to enlist the help of expert reviewers such as you to help us identify the outstanding proposals. We are building a pool of reviewers qualified in IT-related research areas. ITR is a new $90M NSF initiative that aims to promote fundamental research in information technology, encouraging in particular research spanning information technology and scientific applications, and in the area of social, ethical and workforce issues. Specific areas include: 1) software; 2) information technology education and workforce; 3) human-computer interface; 4) information management; 5) advanced computational science; 6) scalable information infrastructure; 7) social and economic implications of information technology; and 8) revolutionary computing. The ITR Program Solicitation can be found on the NSF Web Page at http://www.nsf.gov/pubs/1999/nsf99167/nsf99167.htm The Fiscal Year 2000 competition requires the submission of preproposals by January 5, 2000 for all PIs who plan to submit full proposals requesting more than $500K. The preproposals will be panel-reviewed during the week of February 7, 2000 at three locations: 1) at NSF in Arlington, VA; 2) at a location in Chicago, IL near O'Hare Airport; and 3) at a location to be determined in the San Francisco area. Based on the results of the preproposal screening, approximately 120 full proposals will be encouraged for submission by April 17, 2000. Full proposals will be panel reviewed at NSF on May 22, 2000. A separate competition is being organized for those proposals requesting less than $500K for the full duration of the award. For this category of proposal, no preproposal is required. Proposals requesting less than $500K are due at NSF on February 14, 2000. They will be reviewed during the weeks of March 20 and March 27, 2000. We would like to consider you as a potential panelist for this activity. If you are involved in a proposal submitted to any area of ITR, as PI, co-PI or otherwise as a participant, you are ineligible to serve as a panelist. However, persons who are submitting proposals only to the more than $500K competition can serve as panelists to review proposals less than $500K and vice versa. We welcome panelists from foreign countries, national laboratories, and industry. **IF YOU ARE INTERESTED IN PARTICIPATING PLEASE ACT TODAY!******** Indicate your availability, and provide us with your information by completing the ITR Panelist Entry Form at the following URL: http://www.itr.nsf.gov/panelist . We urge you to fill out the form immediately, since we will start to select panelists for the February 7 panel meetings within the next few days. NSF will pay all travel costs in addition to $130 per travel day and $260 per panel day. If you have other questions related to serving as a panelist, please refer to the FAQ section of the ITR Home page at http://www.itr.nsf.gov/it2-faq.html . Finally, we would also appreciate it if you could forward this request to other well-qualified IT scientists who you think may be interested. Since ITR is a large-scale competition, and we have a number of people involved in seeking panelists, we apologize if more than one person contacts you in this regard. We look forward to your reply, Sincerely, The ITR Working Group E-mail: itr@nsf.gov ------------- 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 compgeom-owner@research.bell-labs.com Thu Dec 2 13:17:50 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id NAA06567 for ; Thu, 2 Dec 1999 13:17:45 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Dec 2 13:07:13 EST 1999 Received: from scummy.research.bell-labs.com by netlib2; Wed Dec 1 14:23:06 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Dec 1 14:21:15 EST 1999 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.37]) by dusty; Wed Dec 1 14:19:52 EST 1999 Received: by nrclonex1.imti.nrc.ca with Internet Mail Service (5.5.2448.0) id ; Wed, 1 Dec 1999 14:19:55 -0500 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C70A487E@nrclonex1.imti.nrc.ca> From: "Dickinson, John" To: compgeom-discuss@research.bell-labs.com Subject: Detecting Intersections of orientated boxes Date: Wed, 1 Dec 1999 14:19:54 -0500 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2448.0) Content-Type: text/plain; charset="iso-8859-1" Precedence: bulk Status: RO Content-Length: 1398 Lines: 35 I am looking for any references on intersection detection algorithms for orientated boxes in 3D space, especially optimised algorithms for time critical simmulation applications. I have puzzled out some of the basics: Given two boxes of differing dimensions (length1, height1, width1) and (length2, height2, width2) positioned and orientated arbitrarily in space we want to quickly/cheaply determine if they intersect or not. Current best thought: Projects the edges of one box on three planar surfaces defined by three prependicular faces of the second box and look for overlaps of the projected lines with the rectanglar 2-D profile of the second box. Assuming I do this I would like any references to the fastest public domain line intersection checks. I believe there is one in a volume of Graphics Gems but I am not sure. Any suggestions? John -- -((Insert standard disclaimer here))-|- Washington Irving (1783-1859) - John Kenneth Dickinson | "A sharp tongue is the only Research Council Officer IMTI-NRC | edge tool that grows keener email: john.dickinson@nrc.ca | with constant use." ------------- 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 compgeom-owner@research.bell-labs.com Thu Dec 2 13:18:11 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id NAA06523 for ; Thu, 2 Dec 1999 13:17:11 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Dec 2 13:13:19 EST 1999 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Wed Dec 1 18:45:06 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Dec 1 18:44:37 EST 1999 Received: from duke.cs.duke.edu ([152.3.140.1]) by dusty; Wed Dec 1 18:43:14 EST 1999 Received: from polya.cs.duke.edu (polya.cs.duke.edu [152.3.140.71]) by duke.cs.duke.edu (8.9.1/8.9.1) with ESMTP id SAA14950 for ; Wed, 1 Dec 1999 18:44:34 -0500 (EST) From: Pankaj Kumar Agarwal Received: (pankaj@localhost) by polya.cs.duke.edu (8.8.5/8.6.9) id SAA18817 for compgeom-announce@research.bell-labs.com; Wed, 1 Dec 1999 18:44:34 -0500 (EST) Date: Wed, 1 Dec 1999 18:44:34 -0500 (EST) Message-Id: <199912012344.SAA18817@polya.cs.duke.edu> To: compgeom-announce@research.bell-labs.com Subject: Cal lfor Papers: SCG '00 Precedence: bulk Status: RO Content-Length: 6312 Lines: 140 FINAL CALL FOR PAPERS Sixteenth Annual Symposium on COMPUTATIONAL GEOMETRY SUBMISSION DEADLINE: Dec. 6, 1999 See the conference web page for e-submission instructions June 12-14, 2000 Hong Kong University of Science and Technology http://www.cs.ust.hk/tcsc/scg00.html Sponsored by ACM SIGACT and SIGGRAPH The Sixteenth Annual Symposium on Computational Geometry, featuring an applied track, a theoretical track, and a video review, will be held at Hong Kong University of Science and Technology, Hong Kong. We invite high-quality submissions in the following areas: * geometric algorithms or combinatorial geometry, for the theoretical track, or * implementation issues or applications of computational geometry, for the applied track. The proceedings, with the papers of both tracks, will be distributed at the symposium and will subsequently be available for purchase from ACM. A selection of papers will be invited to special issues of journals. During the conference, sessions of presentations will alternate between the two tracks, rather than being in parallel. Topics for the theoretical track include, but are not limited to design and theoretical analysis of geometric algorithms and data structures; lower bounds for geometric problems; and discrete and combinatorial geometry. Topics for the applied track include, but are not limited to experimental analysis of algorithms and data structures; mathematical and numerical issues arising from implementations; and novel uses of computational geometry in other disciplines, such as robotics, computer graphics, geometric and solid modeling, manufacturing, and geographical information systems. See below for additional information on the two tracks. Theoretical Track Submission Electronic submissions are preferred for the theoretical track (see web page above for instructions), but authors may instead mail 8 copies of an extended abstract to arrive by December 6, 1999 to Pankaj K. Agarwal Department of Computer Science LSRC Building, Rm D207 Duke University Durham, NC 27706 Phone: (919) 660-6540 pankaj@cs.duke.edu Applied Track Submission Electronic submissions are preferred for the applied track (see web page above for instructions), but authors may instead mail 11 copies of an extended abstract to arrive by December 6, 1999 to Steven Fortune Room 2c459 Bell Laboratories 600 Mountain Avenue Murray Hill, NJ 07974 Phone: (908) 582-7042 sjf@research.bell-labs.com Important Dates December 6, 1999: Papers due, both tracks February 13, 2000: Video submissions due February 15, 2000: Notification of acceptance or rejection of papers March 1, 2000: Notification of acceptance or rejection of videos March 15, 2000: Camera-ready papers due April 15, 2000: Final versions of videos due June 12-14, 2000: Symposium Papers that primarily address practical issues and implementation experience, even if not tied to a particular application domain, should be submitted to the applied track. Papers that primarily prove theorems should be submitted to the theoretical track. Most experimental work should be submitted to the applied track; an exception would be experiments in support of mathematical investigations. Submissions to one track may be forwarded to the other for consideration, unless the authors have explicitly stated interest in one track only. Papers should be submitted in the form of an extended abstract. Papers should begin with the title of the paper, each author's name, affiliation, and e-mail address, followed by a succinct statement of the problems and goals that are considered in the paper, the main results achieved, the significance of the work in the context of previous research, and a comparison to past research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages, using 11 point or larger font and with at least one-inch margins all around. For cases in which the authors consider it absolutely essential to include additional technical details that do not fit into 10 pages, these details may be added in a clearly marked appendix that should appear after the body of the paper and the references; this appendix will not be regarded as a part of the submission and will be considered only at the program committee's discretion. Abstracts in hard copy must be received by December 6, 1999, or postmarked by November 29 and sent airmail. Abstracts in electronic form are due by December 6, 5:00 PM EST. These are firm deadlines: late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 2000. A full version of each contribution in final form will be due by March 15, 2000 for inclusion in the proceedings. Conference Chairs Siu-Wing Cheng Otfried Cheong scheng@cs.ust.hk otfried@cs.ust.hk Theoretical Track Program Committee Pankaj K. Agarwal, Chair (Duke) Franz Aurenhammer (Graz) Mark de Berg (Utrecht) Herbert Edelsbrunner (Duke) Jeff Erickson (UIUC) Hazel Everett (Montreal) Klara Kedem (Ben Gurion) Applied Track Program Committee Gill Barequet (Technion) Steven Fortune, Chair (Bell Labs) Chris Gold (Laval U.) Ken Goldberg (Berkeley) Scott Mitchell (Sandia Labs) Tom Peters (U. Conn.) Jean Ponce (UIUC) Stefan Schirra (MPI) Subhash Suri (Wash. U.) ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/threads.html. From compgeom-owner@research.bell-labs.com Wed Dec 8 14:27:43 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id OAA03399 for ; Wed, 8 Dec 1999 14:27:41 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Dec 8 14:25:14 EST 1999 Received: from grubby.research.bell-labs.com by netlib2; Tue Dec 7 02:33:03 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Tue Dec 7 02:32:12 EST 1999 Received: from mail.math.TU-Berlin.DE ([130.149.12.212]) by dusty; Tue Dec 7 02:30:43 EST 1999 Received: from zaphod.math.TU-Berlin.DE (zaphod.math.TU-Berlin.DE [130.149.13.91]) by mail.math.TU-Berlin.DE (8.9.3/8.9.3) with ESMTP id IAA10456; Tue, 7 Dec 1999 08:32:07 +0100 (MET) From: "Guenter M. Ziegler" Received: (from ziegler@localhost) by zaphod.math.TU-Berlin.DE (8.8.8/8.8.8) id IAA17070; Tue, 7 Dec 1999 08:32:06 +0100 (MET) Date: Tue, 7 Dec 1999 08:32:06 +0100 (MET) Message-Id: <199912070732.IAA17070@zaphod.math.TU-Berlin.DE> To: compgeom-announce@research.bell-labs.com Subject: Oriented Matroids (Second edition) X-Sun-Charset: ISO-8859-1 Precedence: bulk Status: RO Content-Length: 3060 Lines: 85 .... we are pleased to announce .... .... new in Paperback ..... .... now available ..... ORIENTED MATROIDS Second edition Anders Björner -- KTH Stockholm Michel Las Vergnas --- Paris 6/CNRS Bernd Sturmfels --- UC Berkeley Neil White --- U Florida & Günter M. Ziegler -- TU Berlin ``Oriented matroids are a very natural mathematical concept which presents itself in many different guises and which has connections and applications to many different areas. These include discrete and computational geometry, combinatorics, convexity, topology, algebraic geometry, operations research, computer science and theoretical chemistry. This is the second edition of the first comprehensive, accessible account of the subject. It is intended for a diverse audience: graduate students who wish to learn the subject from scratch; researchers in the various fields of application who want to concentrate on certain aspects of the theory; specialists who need a thorough reference work; and others at academic points in between. A list of exercises and open problems ends each chapter. For the second edition, the authors have expanded the bibliography greatly to ensure that it remains comprehensive and up-to-date, and they have also added an appendix surveying research since the book was first published.'' !From reviews of the first edition: ``Overall this is a book which is a classic of its type; it is a mine of information, which will be the authoritative source for many years to come.'' Bulletin of the London Mathematical Society Contents: Preface, Notation 1. A first orientation session 2. A second orientation session 3. Axiomatics 4. From face lattices to topology 5. Topological models for oriented matroids 6. Arrangements of pseudolines 7. Constructions 8. Realizability 9. Convex polytopes 10. Linear programming Appendix: Some current frontiers of research (NEW) Bibliography (EXTENDED) Index Encyclopedia of Mathematics and its Applications, Vol. 46 Cambridge University Press 1999 560 pages / 299 exercises / 138 figures ISBN 0 521 77750 X Paperback For further information see http://www.cup.cam.ac.uk or http://www.cup.org and/or my homepage http://www.math.tu-berlin.de (which also has the detailed table of contents and preface). ====================================================================== Prof. Dr. G\"unter M. Ziegler Fachbereich Mathematik, MA 7-1 Technische Universit\"at Berlin Strasse des 17. Juni 136 10623 Berlin Germany email: ziegler@math.tu-berlin.de http://www.math.tu-berlin.de/~ziegler Tel.: 49 - 30 - 314-25730 office Tel.: 49 - 30 - 314-23354 Secr. FAX: 49 - 30 - 314-24413 ====================================================================== ------------- 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 compgeom-owner@research.bell-labs.com Mon Dec 13 19:58:00 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id TAA09820 for ; Mon, 13 Dec 1999 19:57:58 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Dec 13 19:53:17 EST 1999 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Mon Dec 13 06:43:05 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Dec 13 06:41:09 EST 1999 Received: from olive.newcastle.edu.au ([134.148.96.123]) by dusty; Mon Dec 13 06:39:36 EST 1999 Received: (from vlad@localhost) by olive.newcastle.edu.au (8.8.7/8.6.9) id WAA03278 for compgeom-announce@research.bell-labs.com; Mon, 13 Dec 1999 22:41:02 +1100 (EST) Date: Mon, 13 Dec 1999 22:41:02 +1100 (EST) From: Vladimir Estivill-Castro Message-Id: <199912131141.WAA03278@olive.newcastle.edu.au> To: compgeom-announce@research.bell-labs.com Subject: COCOON-2000 Precedence: bulk Status: RO Content-Length: 5295 Lines: 124 We apologize if you have received this before. COCOON'2OOO --- Call for Papers --- Sixth Annual International Computing and Combinatorics Conference July 26-28, 2000, Bondi Beach , Sydney , Australia The Sixth Annual International Computing and Combinatorics Conference, COCOON'2000, will be held in Bondi Beach , Sydney , Australia July 26--28, 2000 (a few weeks before the XXVII Olympics, September 15 -- October 1). The conference aims to provide a forum for researchers in theoretical computer science. The conference will be followed by the 11th Australasian Workshop on Combinatorial Algorithms (AWAOCA). Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In additional to theoretical results, submissions that report substantial results in experimental and applied research are encouraged. Typical, but not exclusive, topics of interest include: * algorithms and data structures * automata, languages and logic * combinatorics related to algorithms and complexity * complexity theory * computational algebra, biology, geometry, and number theory * computational learning theory and knowledge discovery * cryptography and database theory * graph drawing and information visualization * graph theory, communication networks, and optimization * parallel and distributed computing Submissions to the conference this year will again be conducted electronically. Authors should follow the submission guidelines and send a PostScript file of a paper (in English) by February 8, 2000. The submission guidelines are in http://www.cs.newcastle.edu.au/~cocoon2000/submission.html Our home page is: http://www.cs.newcastle.edu.au/~cocoon2000 Alternatively, authors unable to access e-mail may send 6 hard copies of their papers to: Xuemin Lin - COCOON'2000 School of Computer Science and Engineering University of New South Wales Sydney, NSW 2052, Australia. e-mail: lxue@cse.unsw.edu.au A paper should start with the title of the paper, each author's name, affiliation, e-mail address, and a short summary of the main results. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance to the conference. The length of the paper should not exceed 10 pages (using 11 point or larger font, with ample margins all around). If necessary, authors may include a clearly marked appendix that will be read at the discretion of the Program Committee. An abstract of the paper must be submitted electronically by February 1, 2000. Authors will be notified of acceptance or rejection by March 30, 2000. A camera-ready copy of each accepted paper will be required by April 26, 2000. The proceedings of the conference will be published by Springer-Verlag in the Lecture Notes in Computer Science series, and will be available for distribution at the conference. The Hao Wang award will be given to the best paper (details given on our home page). We also introduce an award for the best paper from a young researcher (at most 3 years since PhD). Program Committee Co-Chairs =========================== Ding-Zhu Du (U. of Minnesota, USA) Peter Eades (Newcastle, Australia) Xuemin Lin (New South Wales, Australia) Conference Co-Chairs ==================== Vladimir Estivill-Castro (Newcastle, Australia) Arun Sharma (New South Wales, Australia) Program Committee ================= David Avis (McGill, Canada), Jianer Chen (Texas A&M, USA), Francis Chin (Hong Kong U, Hong Kong), Vladimir Estivill-Castro (Newcastle, Australia), George Havas (UQ, Australia), Hiroshi Imai (Tokyo, Japan), Tao Jiang (UC Riverside, USA), Richard Karp (UC Berkeley, USA), Michael Juenger (Cologne, Germany), D. T. Lee (Academia Sinica, Taiwan), Bernard Mans (Macquarie U., Australia), Brendan McKay (ANU, Australia), Maurice Nivat (Universitie de Paris VII, France), Takeshi Tokuyama (Tohoku, Japan), Roberto Tamassia (Brown, USA), Jie Wang (UNC Greensboro, USA), Shmuel Zaks (Technion, Israel), Louxin Zhang (NUS, Singapore), Shuzhong Zhang (CUHK, Hong Kong), Binhai Zhu (City U Hong Kong, Hong Kong) Invited Speakers ================ * Christos H. Papadimitriou (University of California, Berkeley) * Richard Brent (Oxford University Computing Laboratory) Important Dates =============== * Submission of Abstracts: February 1, 2000 * Submission of Papers: February 8, 2000. * Notification of Acceptance: March 30, 2000. * Final Version: April 26, 2000. * Conference: July 26-28, 2000 . Location ======== The conference will be held at the Swiss-Grand Hotel in Bondi Beach , Sydney , Australia. Further Information =================== Please contact cocoon2000@cse.unsw.edu.au for further information. Sponsors ======== * University of New South Wales * University of Newcastle * Computer Science Association of Australasia ------------- 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 compgeom-owner@research.bell-labs.com Fri Dec 17 12:19:42 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id MAA26703 for ; Fri, 17 Dec 1999 12:19:40 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Dec 17 12:13:14 EST 1999 Received: from scummy.research.bell-labs.com by netlib2; Thu Dec 16 02:03:04 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Dec 16 02:02:40 EST 1999 Received: from mail.kpnqwest.ch ([146.228.10.7]) by dusty; Thu Dec 16 02:01:02 EST 1999 Received: from valium (dyna-azh-51.dial.eunet.ch [193.72.22.173]) by mail.kpnqwest.ch (8.9.3/1.34) via SMTP id HAA23968 for ; Thu, 16 Dec 1999 07:02:00 GMT env-from (autoform@autoform.ch) Message-Id: <3.0.6.32.19991216080859.008aca40@pop.eunet.ch> X-Sender: autoform@pop.eunet.ch X-Mailer: QUALCOMM Windows Eudora Light Version 3.0.6 (32) Date: Thu, 16 Dec 1999 08:08:59 +0100 To: compgeom-discuss@research.bell-labs.com From: autoform Subject: planar embedding (Katrin Dobrindt) Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Precedence: bulk Status: RO Content-Length: 976 Lines: 33 Hi, Perhaps somebody can help me with the following problem or give me a pointer to relevant literature. Given: an arbitrary triangulated mesh in 3-space (with boundaries and holes) Searched : its embedding in the plane. with - an easy-to-implement algorithm; its theoretical complexity is not very important, since these meshes usually have less than 10,000 triangles. by preference - ideally, the planar triangles would have a 'similar' shape as their corresponding triangles in space, - or at least, they should not be too 'bad' for the following FE-calculations, i.e. obtuse angles should be avoided etc. If you have any idea, please answer to my 'personal' mail account. Thanks, Katrin Dobrindt. ------------- 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 compgeom-owner@research.bell-labs.com Fri Dec 17 12:21:19 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id MAA26795 for ; Fri, 17 Dec 1999 12:21:17 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Dec 17 12:16:33 EST 1999 To: compgeom-announce@research.bell-labs.com Received: from grubby.research.bell-labs.com by netlib2; Tue Dec 14 11:23:04 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Tue Dec 14 11:22:18 EST 1999 Received: from mserver.wlu.ca ([192.54.242.16]) by dusty; Tue Dec 14 11:20:46 EST 1999 Received: from pchin (pchin.wlu.ca [192.219.240.80]) by mserver.wlu.ca (8.8.8+Sun/8.8.6) with SMTP id LAA01264 for ; Tue, 14 Dec 1999 11:22:10 -0500 (EST) Message-ID: <000201bf4658$2fc0bcd0$50f0dbc0@pchin.wlu.ca> From: "Paulina Chin" To: Subject: ISSAC 2000: Update to Call for Papers Date: Tue, 14 Dec 1999 12:24:13 -0500 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 4.72.3612.1700 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3612.1700 Precedence: bulk Status: RO Content-Length: 4107 Lines: 89 Please note that the submission deadline for papers has been changed to Jan. 17, 2000. The original anouncement is included below. If you are receiving duplicate mailings or wish to be removed from the ISSAC 2000 mailing list, please send e-mail to pchin@wlu.ca. --------------------------------------------------------------------------- ANNOUNCEMENT AND CALL FOR PAPERS ISSAC 2000 International Symposium on Symbolic and Algebraic Computation St Andrews University, Scotland, August 6-9, 2000 http://www-gap.dcs.st-and.ac.uk/issac2000 ACM sponsorship pending ISSAC provides an opportunity to learn of new developments and to present original research in all areas of symbolic and algebraic computation. ISSAC 2000 will be held at St Andrews University, Scotland's oldest university. Planned activities include invited presentations, research and survey papers, poster sessions, tutorial courses, vendor exhibits and software demonstrations. CONFERENCE TOPICS Topics of the meeting include, but are not limited to: Algorithmic mathematics: Algebraic, symbolic, and symbolic-numeric algorithms including: simplification, polynomial and rational function manipulations, algebraic equations, summation and recurrence equations, integration and differential equations, linear algebra, number theory, group computations, and geometric computing; Computer sciences: Theoretical and practical problems in symbolic mathematical manipulation including: computer algebra systems, data structures, computational complexity, problem solving environments, programming languages and libraries for symbolic-numeric-geometric computation, user interfaces, visualization, software architectures, parallel or distributed computing, mapping algorithms to architectures, analysis and benchmarking, automatic differentiation and code generation, automatic theorem proving, mathematical data exchange protocols; Applications: Problem treatments incorporating algebraic, symbolic, symbolic-numeric and geometric computation in an essential or novel way, including engineering, economics and finance, architecture, physical and biological sciences, computer sciences, logic, mathematics, statistics, and uses in education. CALL FOR PAPERS Research results and insightful analyses of current concerns are the primary focus. Papers will be reviewed by the Program Committee and additional referees. Survey articles may be suitable for submission, if clearly identified as such, and will be considered in a separate category from the research papers. Simultaneous submission for publication elsewhere is not allowed. Authors are invited to submit papers to the Program Committee Chair before January 17, 2000. Submission instructions can be obtained from the conference Web page or by sending e-mail to bajaj@cs.utexas.edu. A poster session will be organized separately. Information is available on the conference Web site. FURTHER INFORMATION For more information, please refer to the conference Web page, http://www-gap.dcs.st-and.ac.uk/issac2000. E-mail inquiries may be sent to issac2000@dcs.st-and.ac.uk or to one of the conference committee members listed below: General Chair: Tomas Recio, recio@matesco.unican.es Local Arrangements Chair: Steve Linton, sal@dcs.st-and.ac.uk Program Committee Chair: Chandrajit Bajaj, bajaj@cs.utexas.edu Tutorial Chair: Josef Schicho, josef.schicho@risc.uni-linz.ac.at Exhibitor Chair: Marc Moreno Maza, Numerical Algorithms Group, marc@nag.co.uk Poster Session Chair: Arjeh Cohen, amc@win.tue.nl Editor: Carlo Traverso, traverso@posso.dm.unipi.it Treasurer: Colin Campbell, cmc@st-andrews.ac.uk Publicity Chair: Paulina Chin, pchin@wlu.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://uiuc.edu/~sariel/CG/compgeom/threads.html. From compgeom-owner@research.bell-labs.com Tue Dec 28 11:37:29 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id LAA07052 for ; Tue, 28 Dec 1999 11:37:28 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Dec 28 11:34:57 EST 1999 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Tue Dec 21 10:03:06 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Dec 21 10:02:41 EST 1999 Received: from indigo.cs.bgu.ac.il ([132.72.42.23]) by dusty; Tue Dec 21 10:01:01 EST 1999 Received: from cyan.cs.bgu.ac.il (klara@cyan.cs.bgu.ac.il [132.72.42.12]) by indigo.cs.bgu.ac.il (8.9.2/8.9.2) with ESMTP id RAA18911; Tue, 21 Dec 1999 17:02:35 +0200 (IST) From: klara kedem Received: (klara@localhost) by cyan.cs.bgu.ac.il (8.9.0/8.6.9) id RAA22335; Tue, 21 Dec 1999 17:02:34 +0200 (IST) Date: Tue, 21 Dec 1999 17:02:34 +0200 (IST) Message-Id: <199912211502.RAA22335@cyan.cs.bgu.ac.il> To: cg2000@CS.bgu.ac.il, compgeom-announce@research.bell-labs.com Subject: EuroCG 2000 - upcoming deadline + travel information Precedence: bulk Status: RO Content-Length: 855 Lines: 25 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ 16TH EUROPEAN WORKSHOP ON COMPUTATIONAL GEOMETRY March 13-14-15 2000 Eilat Club Hotel, Eilat, Israel +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ Deadline for submissions is January 7th, 2000 For further information (including NEW travel information) please see our web site http://www.cs.bgu.ac.il/~cg2000 +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ------------- 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 compgeom-owner@research.bell-labs.com Tue Dec 28 11:38:12 1999 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id LAA07070 for ; Tue, 28 Dec 1999 11:38:10 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Dec 28 11:29:59 EST 1999 Received: from scummy.research.bell-labs.com by netlib2; Tue Dec 21 03:55:06 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Dec 21 03:54:11 EST 1999 Received: from pony-express.cs.rit.edu ([129.21.30.24]) by dusty; Tue Dec 21 03:52:34 EST 1999 Received: from idaho (idaho [129.21.37.195]) by pony-express.cs.rit.edu (8.9.3/8.9.3) with ESMTP id DAA13867 for ; Tue, 21 Dec 1999 03:53:59 -0500 (EST) Date: Tue, 21 Dec 1999 03:53:58 -0500 (EST) From: Javid Huseynov To: compgeom-discuss@research.bell-labs.com Subject: Re: planar embedding (Katrin Dobrindt) In-Reply-To: <3.0.6.32.19991216080859.008aca40@pop.eunet.ch> Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 2492 Lines: 71 This problem can be attempted by finding an embeddable (or realizable) configuration that is topologically equivalent to the mesh in 3 space. Namely, you can build a planar configuration that has the same triangle orientations, or counterclockwise predicates as the one in question. If you imagine this mesh as a point system and extract consecutive convex hulls, you may attempt placing those hulls on a Euclidean plane while checking that all counterclockwise predicates satisfy. I did this for some systems on up to 30 points. Perhaps, "Axioms and Hulls" by Donald Knuth would help. Also, there is a signficant research done by Goodman and Pollack, Ringel, etc. In general, Peter Shor has proved that problem of deciding whether or not an arbitrary point system is embeddable or not is NP-hard. But you may test the embeddability in polynomial time. Good luck. ---------------------------------------------------------- Javid Huseynov * Information and Computer Science PhD Student * University of California Irvine javid@baku.ics.uci.edu * http://www.ics.uci.edu/~javid ---------------------------------------------------------- On Thu, 16 Dec 1999, autoform wrote: > > Hi, > > Perhaps somebody can help me with the following problem or give me a > pointer to relevant literature. > > Given: an arbitrary triangulated mesh in 3-space (with boundaries and > holes) > Searched : its embedding in the plane. > > with > - an easy-to-implement algorithm; its theoretical complexity is not very > important, since these meshes usually have less than 10,000 triangles. > > by preference > - ideally, the planar triangles would have a 'similar' shape as their > corresponding triangles in space, > - or at least, they should not be too 'bad' for the following > FE-calculations, i.e. obtuse angles should be avoided etc. > > If you have any idea, please answer to my 'personal' mail account. > > Thanks, > > Katrin Dobrindt. > > > ------------- > 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 compgeom-owner@research.bell-labs.com Tue Dec 28 11:40:04 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id LAA07092 for ; Tue, 28 Dec 1999 11:39:59 -0500 (EST) Message-Id: <199912281639.LAA07092@duke.cs.duke.edu> Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Dec 28 11:34:51 EST 1999 Received: from scummy.research.bell-labs.com by netlib2; Mon Dec 20 14:31:06 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Dec 20 14:29:12 EST 1999 Received: from math.fu-berlin.de ([160.45.40.10]) by dusty; Mon Dec 20 14:27:35 EST 1999 Received: (qmail 21619 invoked from network); 20 Dec 1999 20:29:09 +0100 Received: from sahib.inf.fu-berlin.de (HELO sahib) (160.45.111.13) by leibniz.math.fu-berlin.de with SMTP; 20 Dec 1999 20:29:09 +0100 Date: Mon, 20 Dec 1999 20:29:09 +0100 (MET) From: Helmut Alt Reply-To: Helmut Alt Subject: Ph.D. and Postdoc scholarships To: compgeom-announce@research.bell-labs.com MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: FVkwIM/xiInlw6sPZytFdg== X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4u sparc Precedence: bulk Status: RO Content-Length: 3045 Lines: 67 ---------------------------------------------------------------------------- European Graduate Program Berlin ------------------------------------------ Zurich Combinatorics, Geometry, and Computation ---------------------------------------------------------------------------- In the newly established graduate program two-year scholarships for Ph.D.students are available in Berlin and Zurich starting April 1st, 2000. Applicants should have a degree in mathematics, computer science, or a related area equivalent to the German or Swiss university diploma (e.g. M.S.) with grades significantly above average. Furthermore at each location a postdoctoral position is available for at most two years. The program is a joint initiative of the ETH Zurich, the three universities of Berlin - Free University, Technical University, Humboldt-University - and the Konrad-Zuse-Research Center. The German partners are financially suppor- ted by the German Research association (Deutsche Forschungsgemeinschaft, DFG). The amount of the scholarships in Berlin is calculated according to the guidelines of the DFG and is up to DM 2690 per month, tax free (family supplement DM 400). The scientific program ranges from theoretical fundamentals to applications. The areas of research are combinatorics, geometry, optimization, algorithms and computation, computer graphics, and vision. In Berlin the students are supervised by the professors Aigner, Alt, Rote, Schulz (FU), Moehring, Zieg- ler (TU), Proemel (HU) and Groetschel (ZIB). The participating professors at ETH Zurich are Fukuda, Van Gool, M. Gross, Luethi, Nievergelt, Richter-Ge- bert, Schiele, Welzl und Widmayer. Applications with curriculum vitae, copies of certificates, theses, a letter of recommendation of the last advisor, a brief description of the proposed research and, especially for applicants for the postdoctoral position, re- prints of publications should be sent in until Februar 2, 2000 to one of the speakers of the program: in Berlin in Zurich Prof. Dr. Helmut Alt Prof. Dr. Emo Welzl Institut fuer Informatik Institut fuer Theoretische Informatik Freie Universitaet Berlin ETH Zentrum Takustrasse 9 CH-8092 Zurich D-14195 Berlin Further Information can be obtained from Bettina Felsner Emo Welzl Tel. ++49-30-838 75 104 Tel. ++41-1-63 273 92 bfelsner@inf.fu-berlin.de emo@inf.ethz.ch Internet: http://www.inf.fu-berlin.de/gk-cgc --------------------------------------------------------------------------- ------------- 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 compgeom-owner@research.bell-labs.com Fri Dec 31 16:37:59 1999 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id QAA14490 for ; Fri, 31 Dec 1999 16:37:57 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Dec 31 16:32:05 EST 1999 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Wed Dec 29 03:45:04 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Dec 29 03:44:32 EST 1999 Received: from mail.mpi-sb.mpg.de ([139.19.1.1]) by dusty; Wed Dec 29 03:42:48 EST 1999 Received: from mpii-km.ag1.mpi-sb.mpg.de (mpii-km.ag1.mpi-sb.mpg.de [139.19.10.17]) by mail.mpi-sb.mpg.de (8.8.7/8.8.8) with ESMTP id JAA01130 for ; Wed, 29 Dec 1999 09:44:52 +0100 From: mehlhorn@mpi-sb.mpg.de Received: (from mehlhorn@localhost) by mpii-km.ag1.mpi-sb.mpg.de (8.9.3/8.9.3) id JAA04813 for compgeom-announce@research.bell-labs.com; Wed, 29 Dec 1999 09:44:26 +0100 (MET) Date: Wed, 29 Dec 1999 09:44:26 +0100 (MET) Message-Id: <199912290844.JAA04813@mpii-km.ag1.mpi-sb.mpg.de> To: compgeom-announce@research.bell-labs.com Subject: LEDA: A Platform for Combinatorial and Geometric Computing X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 2226 Lines: 75 Stefan N"aher and Kurt Mehlhorn are proud to announce the LEDAbook. The LEDAbook is now available from Cambridge University Press. We quote from the announcement by Cambridge University Press. ``The book provides a comprehensive treatment of the LEDA system and its use. Written by the main authors of the system, it treats the architecture of the system, discusses the functionality of the data types and algorithms available in the system, gives the implementation of many modules of the system, and illustrates the use of LEDA in many examples. The book is essential for all workers in combinatorial and geometric computing, for casual or intensive users of LEDA, for library designers and software engineers, and for students taking an algorithms course.'' The book has about 1000 pages and is divided into 14 chapters. Chapter 1, Introduction page 1 Chapter 2, Foundations 16 Chapter 3, Basic Data Types 58 Chapter 4, Numbers and Matrices 99 Chapter 5, Advanced Data Types 121 Chapter 6, Graphs and their Data Structures 240 Chapter 7, Graph Algorithms 283 Chapter 8, Embedded Graphs 498 Chapter 9, The Geometry Kernels 581 Chapter 10, Geometry Algorithms 637 Chapter 11, Windows and Panels 813 Chapter 12, GraphWin 857 Chapter 13, On the Implementation of LEDA 904 Chapter 14, Manual Pages and Documentation 963 You may download some of the chapters from the LEDA book home page http://www.mpi-sb.mpg.de/~mehlhorn/LEDAbook.html and you may order the book from Cambridge University Press. http://www.cup.cam.ac.uk/Scripts/webbook.asp?isbn=0521563291 Enjoy, Stefan and Kurt ------------- 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 compgeom-owner@research.bell-labs.com Mon Jan 3 20:26:48 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id UAA17880 for ; Mon, 3 Jan 2000 20:26:47 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Jan 3 20:24:19 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Mon Jan 3 11:15:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Jan 3 11:13:06 EST 2000 Received: from swarm.cs.wustl.edu ([128.252.165.116]) by dusty; Mon Jan 3 11:11:20 EST 2000 Received: (from roman@localhost) by swarm.cs.wustl.edu (980427.SGI.8.8.8/980728.SGI.AUTOCF) id KAA53887 for compgeom-announce@research.bell-labs.com; Mon, 3 Jan 2000 10:11:24 -0600 (BLT) Date: Mon, 3 Jan 2000 10:11:24 -0600 (BLT) From: roman@swarm.cs.wustl.edu (Catalin Roman) Message-Id: <200001031611.KAA53887@swarm.cs.wustl.edu> To: compgeom-announce@research.bell-labs.com Subject: Faculty Positions at Washington University Precedence: bulk Status: RO Content-Length: 3184 Lines: 63 Washington University in Saint Louis Department of Computer Science Applications are invited for tenure-track faculty positions at the Assistant, Associate and Full Professor levels. Applicants should hold a doctorate in Computer Science or a closely related field, have a record of accomplishment in research, and demonstrate a strong commitment to teaching. Washington University is a leading private national university recognized for its world class intellectual contributions (20 Nobel Prize Laureates have been associated with the University), its exceptional resources (an endowment of $2.8 billion, among the largest in the nation), and its location in the midst of a delightful residential community which places much value on education and culture. With annual external research funding of $6.3 million, Computer Science is emerging as one of the preeminent departments in the University and the School of Engineering and Applied Science. The Department plans to expand its size from 16 to 20 regular faculty. This aggressive growth pattern will be accompanied by commensurate increases in departmental resources. The Department seeks outstanding candidates likely to develop synergistic relationships with existing areas of excellence within the department: networking and communications; distributed computing and object-oriented software technologies; graphics, visualization, and human interfaces; electronic commerce, artificial intelligence; computer architecture and engineering; theoretical computer science, algorithms, and programming languages; and computational science with emphasis on biomedical applications. Candidates with a strong background in electronic commerce, embedded systems design, graphics and visualization, and distributed databases will receive special consideration. With the strong backing of the University and the School, the Department is committed to making significant investments in promising new areas of study and to providing the kind of resources and environment that will enable new faculty members to flourish intellectually. Academic couples seeking to co-locate are strongly encouraged to apply. Research groups in search of a highly supportive institutional environment may also want to consider relocating to Washington University. For more information on our department, see our World Wide Web page at http://www.cs.wustl.edu. Qualified applicants should send a curriculum vita and the names and addresses of at least three references to Dr. Catalin Roman, Chairman, Department of Computer Science, Campus Box 1045, Washington University, One Brookings Drive, St. Louis, MO 63130-4899. Applications will be considered as they are received. Those received after February 1, 2000, may not receive full consideration. Washington University is an equal opportunity/affirmative action employer. ------------- 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 compgeom-owner@research.bell-labs.com Mon Jan 3 20:27:50 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id UAA17894 for ; Mon, 3 Jan 2000 20:27:49 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Jan 3 20:24:21 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Mon Jan 3 12:43:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Jan 3 12:41:14 EST 2000 Received: from swarm.cs.wustl.edu ([128.252.165.116]) by dusty; Mon Jan 3 12:39:28 EST 2000 Received: (from roman@localhost) by swarm.cs.wustl.edu (980427.SGI.8.8.8/980728.SGI.AUTOCF) id LAA55300 for compgeom-announce@research.bell-labs.com; Mon, 3 Jan 2000 11:39:32 -0600 (BLT) Date: Mon, 3 Jan 2000 11:39:32 -0600 (BLT) From: roman@swarm.cs.wustl.edu (Catalin Roman) Message-Id: <200001031739.LAA55300@swarm.cs.wustl.edu> To: compgeom-announce@research.bell-labs.com Subject: COORDINATION 2000 (First Call for Papers) Precedence: bulk Status: RO Content-Length: 5968 Lines: 196 Call for Papers COORDINATION 2000 Fourth International Conference on Coordination Models and Languages Limassol, Cyprus 11-13 September 2000 http://www-gloc.di.fct.unl.pt/coord00/ The need for increased programmer productivity and rapid development of complex systems provide the pragmatic motivation for the development of coordination languages and models. The intellectual excitement associated with such endeavors is rooted in the decades-old desire to leverage off increasingly higher levels of abstractions. Coordination-based methods provide a clean separation between individual software components and their interaction within the overall software organization. This separation makes large applications more tractable, supports global analysis, and enhances reuse of software. Building on the success of the last three COORDINATION conferences, whose proceedings were published by Springer in the LNCS series, this conference provides a forum for the growing community of researchers interested in models, languages, and implementation techniques for coordination. Topics of interest include (but are not limited to): * Theoretical models and foundations for coordination: component composition, concurrency, mobility, dynamic aspects of coordination. * Specification, refinement, and analysis of software architectures: patterns and styles, verification of functional and non-functional properties. * Coordination, architectural, and interface definition languages: implementation, interoperability, heterogeneity. * Agent-oriented languages: formal models for interacting agents. * Dynamic software architectures: mobile agents, configuration, reconfiguration. * Tools and environments for the development of coordinated applications: integration within the development process. * Industrial relevance of coordination and software architectures: programming in the large, domain-specific software architectures and coordination models, case studies. Proceedings The conference proceedings will be published by Springer, in the LNCS (Lecture Notes in Computer Science) series. Submission Instructions Authors are invited to submit full papers (in English, up to 6000 words) electronically. Details on paper submission will be available on the conference web page http://www-gloc.di.fct.unl.pt/coord00/. The authors' instructions provided by Springer should be followed. They can be obtained from http://www.springer.de/comp/lncs/authors.html. Full papers must be received no later than 14 April 2000. Simultaneous or similar submissions to other conferences or journals are not allowed. An abstract of no more than 250 words must be received by 7 April 2000. Details on abstract submission will be available on the conference web page http://www-gloc.di.fct.unl.pt/coord00/. Submissions should explicitly state their contribution and their relevance to the theme of the conference. Other criteria for selection will be originality, significance, correctness, and clarity. Conference Location The conference will be held in Limassol, the most popular and lively city of Cyprus, which is located on the southern coast of the island. The conference venue will be a five-star hotel on the coast. IMPORTANT DATES Pre-submission abstracts: 7 Apr 2000 Full paper submissions: 14 Apr 2000 Notification of acceptance: 14 Jun 2000 Camera-ready version: 7 Jul 2000 Program co-chairs: Antonio Porto New University of Lisbon, Portugal ap@di.fct.unl.pt http://www-gloc.di.fct.unl.pt/~ap Gruia-Catalin Roman Washington University in St. Louis, USA roman@cs.wustl.edu http://www.cs.wustl.edu/~roman Organizing Chair: George A. Papadopoulos University of Cyprus george@cs.ucy.ac.cy http://www.cs.ucy.ac.cy/papadopo.html Program Committee (partial list): Farhad Arbab CWI, The Netherlands Farhad.Arbab@cwi.nl GianLuigi Ferrari U. Pisa, Italy giangi@di.unipi.it Jose Luiz Fiadeiro U. Lisbon, Portugal llf@di.fc.ul.pt Roberto Gorrieri U. Bologna, Italy gorrieri@cs.unibo.it Paola Inverardi U. l'Aquila, Italy inverard@univaq.it Jean-Marie Jacquet U. Namur, Belgium jmj@info.fundp.ac.be Edwin de Jong Signaal, The Netherlands edejong@signaal.nl Joost Kok U. Leiden, The Netherlands joost@wi.leidenuniv.nl Jose Meseguer SRI, USA meseguer@csl.sri.com Naftaly Minsky Rutgers U., USA minsky@cs.rutgers.edu Antonio Natali U. Bologna, Italy anatali@deis.unibo.it Rocco De Nicola U. Firenze, Italy denicola@dsi.unifi.it George Papadopoulos U. Cyprus, Cyprus george@cs.ucy.ac.cy Rick Schlichting U. Arizona, USA rick@cs.arizona.edu Robert Tolksdorf T.U. Berlin, Germany tolk@cs.tu-berlin.de Alan Wood U. York, UK wood@cs.york.ac.uk Sponsorship: This conference is officially sponsored by the Esprit Working Group 24512 "Coordina" (see http://www-gloc.di.fct.unl.pt/activity/coordina/). ------------- 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 compgeom-owner@research.bell-labs.com Tue Jan 11 09:17:52 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id JAA24033 for ; Tue, 11 Jan 2000 09:17:50 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jan 11 09:09:26 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Tue Jan 4 14:41:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Jan 4 14:39:22 EST 2000 Received: from hermes.cs.brandeis.edu ([129.64.2.5]) by dusty; Tue Jan 4 14:37:33 EST 2000 Received: from mancha.cs.brandeis.edu (IDENT:melnik@mancha.cs.brandeis.edu [129.64.3.103]) by hermes.cs.brandeis.edu (8.9.3/8.9.3) with ESMTP id OAA10793 for ; Tue, 4 Jan 2000 14:39:18 -0500 Received: from localhost (melnik@localhost) by mancha.cs.brandeis.edu (8.8.7/8.8.7) with ESMTP id OAA06701 for ; Tue, 4 Jan 2000 14:39:21 -0500 Date: Tue, 4 Jan 2000 14:39:21 -0500 (EST) From: Ofer Melnik To: compgeom-discuss@research.bell-labs.com Subject: convex hull interior Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 1063 Lines: 29 Hi, I was wondering if someone could help me out. I am interested in algorithms that given a group of red points in n-dimensional space can answer whether a new blue point is within the interior of the convex hull defined by the red points. I realize that this can be phrased as a linear programming problem. But are there specific results on this problem, in terms of exact and approximate computational complexity? Are there good algorithms to solve it? Where we know, when they will be efficient and inefficient? Thanks for any help, -Ofer ----------------------------------------------------------------- Ofer Melnik melnik@cs.brandeis.edu Volen Center for Complex Systems Ph: (781)-736-2719 Brandeis University (781)-736-DEMO Waltham MA 02254 ------------- 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 compgeom-owner@research.bell-labs.com Tue Jan 11 09:28:15 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id JAA24207 for ; Tue, 11 Jan 2000 09:28:12 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Jan 11 09:22:22 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Thu Jan 6 14:17:07 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Jan 6 14:15:43 EST 2000 Received: from largo.eecs.tufts.edu ([130.64.24.99]) by dusty; Thu Jan 6 14:13:55 EST 2000 Received: from nebula.eecs.tufts.edu (nebula [130.64.23.175]) by largo.eecs.tufts.edu (8.9.1a/8.9.1) with ESMTP id OAA04105 for ; Thu, 6 Jan 2000 14:15:38 -0500 (EST) From: Diane Souvaine Received: (from dls@localhost) by nebula.eecs.tufts.edu (8.9.1a/8.9.1) id OAA04450 for compgeom-announce@research.bell-labs.com; Thu, 6 Jan 2000 14:15:41 -0500 (EST) Date: Thu, 6 Jan 2000 14:15:41 -0500 (EST) Message-Id: <200001061915.OAA04450@nebula.eecs.tufts.edu> To: compgeom-announce@research.bell-labs.com Subject: Faculty Position at Tufts University Precedence: bulk Status: RO Content-Length: 2798 Lines: 49 The Department of Electrical Engineering and Computer Science at Tufts University seeks to hire a tenure-track faculty member in Computer Science at the Assistant or Associate Professor level. The successful candidate will be responsible for excellence in teaching, research, and advising in both the undergraduate and graduate programs of the department. We also expect the successful candidate to develop funded research programs in his/her area of interest, supervise graduate research, and publish in refereed journals. A doctorate in Computer Science or a closely related field is required. Preference will be given to candidates who can teach programming-oriented courses and whose research connects to on-going departmental research in artificial intelligence, data compression, discrete math/theory, distributed computing, human-computer interaction, machine learning, multimedia, CAD for integrated circuits, computational geometry, and/or visualization and exploration of large data sets. Tufts University is a Research I class institution that happens to be the smallest such institution, giving it unique character. With about 5,000 undergraduates, 3,000 graduate students, and a world-wide reputation for its undergraduate education and several of its graduate programs, Tufts offers a unique opportunity for academic professionals interested in combining world-class research with close connections to outstanding undergraduate, Masters, and Ph.D. students. Located just a few miles or a short 'T' ride from Boston and Cambridge, the Department offers B.S., M.S. and Ph.D. programs in Electrical Engineering, in Computer Engineering, and in Computer Science. For more information on the Department or other Tufts positions available, please visit . Applications including a cover letter, a resume, a teaching statement, a research plan, and three letters of recommendation should be sent to Prof. Diane Souvaine, Chair of the Computer Science Search, Department of Electrical Engineering and Computer Science, Tufts University, 161 College Avenue, Medford, Massachusetts, 02155. Review of applications begins February 7, 2000. An Affirmative Action/Equal Opportunity employer, Tufts University is committed to excellence in teaching and scholarship, and to building a faculty that reflects the diversity of both its students and the world. Members of underrepresented groups (people of color, persons with disabilities, Vietnam veterans, and women) are strongly encouraged to apply. ------------- 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 compgeom-owner@research.bell-labs.com Tue Jan 11 09:28:17 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id JAA24211 for ; Tue, 11 Jan 2000 09:28:15 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Jan 11 09:22:41 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Fri Jan 7 07:47:07 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Jan 7 07:45:46 EST 2000 Received: from mail.cs.uu.nl ([131.211.80.32]) by dusty; Fri Jan 7 07:43:55 EST 2000 Received: from cs.uu.nl (ezinge.cs.uu.nl [131.211.80.170]) by mail.cs.uu.nl (Postfix) with ESMTP id 0D983451A for ; Fri, 7 Jan 2000 13:45:44 +0100 (MET) Message-ID: <3875E036.3E318E86@cs.uu.nl> Date: Fri, 07 Jan 2000 13:46:46 +0100 From: Marc van Kreveld X-Mailer: Mozilla 4.61 [en] (WinNT; I) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: PhD student position, Utrecht, NL Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 2301 Lines: 69 At the Department of Computer Science of Utrecht University, there is an opening for a PhD student on a project entitled Geometric Algorithms for the Visualisation of Traffic and Transportation, funded by the dr.ir. Cornelis Lely-foundation. This project has as its goal the development and implementation of algorithms for special purpose cartographic visualization for traffic and transportation. The research will be done in the Applied Algorithms group headed by prof.dr. Mark Overmars (http://www.cs.uu.nl/groups/AA/). Summary The project consists of research on geometric algorithms for the visualization of data or analyses on (road) networks. In particular, cartographic visualization by special purpose maps like schematic maps and cartograms will be studied. The topics of research are chosen in collaboration with the Advisory Board for Traffic and Transportation of the Ministry of Transport, Public Works, and Water Management. The study of the cartographic problem will lead to a suitable operationalization or formalization. This is followed by research on geometric algorithms that provides solutions to these cartographic problems. Implementations will be done to test the formalization and algorithmic solution. The algorithms to be developed may also be based on combinatorial optimization, and simulation (e.g. finite element methods). The research should lead to scientific publications in applied computational geometry and automated cartography, based on new solutions and algorithmic results. We offer - A position as a PhD student for four years - An interesting, internationally oriented working environment - Additional stipend on top of the standard (Dutch) PhD student salary We look for - A computer scientist with a Master's degree and with interest in and knowledge of algorithms, preferably geometric algorithms More information Interested candidates can contact dr. M.J. van Kreveld (Marc), phone. +31 - 30 - 2534119, e-mail: marc@cs.uu.nl ------------- 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 compgeom-owner@research.bell-labs.com Tue Jan 11 09:28:57 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id JAA24231 for ; Tue, 11 Jan 2000 09:28:54 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jan 11 09:22:37 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Tue Jan 11 06:33:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Jan 11 06:31:55 EST 2000 Received: from core.inf.ethz.ch ([129.132.178.196]) by dusty; Tue Jan 11 06:30:02 EST 2000 Received: from shadow.inf.ethz.ch (emo@shadow-brain.inf.ethz.ch [129.132.16.3]) by core.inf.ethz.ch (8.9.3/8.9.3) with ESMTP id MAA25695; Tue, 11 Jan 2000 12:31:47 +0100 (MET) From: Emo Welzl Received: (from emo@localhost) by shadow.inf.ethz.ch (8.8.8/8.8.8) id MAA02641; Tue, 11 Jan 2000 12:31:47 +0100 (MET) Date: Tue, 11 Jan 2000 12:31:47 +0100 (MET) Message-Id: <200001111131.MAA02641@shadow.inf.ethz.ch> To: compgeom-announce@research.bell-labs.com Subject: ICALP 2000 Cc: emo@inf.ethz.ch X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 6610 Lines: 192 EXTENSION OF DEADLINE FOR PAPER SUBMISSION TO JANUARY 24TH, 2000. ------------------------------------------------ Call for Papers ICALP'2000 27th International Colloquium on Automata, Languages and Programming July 9-15, 2000, Geneva, Switzerland The 27-th annual meeting of the European Association of Theoretical Computer Science will be held in Geneva, Switzerland. As is the case of the two tracks of the journal Theoretical Computer Science, the scientific program of the Colloquium is split into two parts: Track A of the meeting will correspond to Algorithms, Automata, Complexity, and Games, while Track B will correspond to Logic, Semantics and Theory of Programming. Original contributions to theory of computer science, to be presented either in Track A or in Track B, are being sought. Authors are invited to submit extended abstracts of their papers, not exceeding 12 pages in the standard Springer Verlag LNCS style. Instructions for paper submissions can be found at the conference web page. Authors from countries where access to Internet is difficult may mail a single copy of their paper directly to the address of the conference chairman. Submissions should consist of: a cover page, with the author's full name, address, fax number, e-mail address, a 100-word abstract, keywords, and to which track (A or B) the paper is being submitted and an extended abstract describing original research in no more than 12 pages. It is expected that accepted papers will be presented at the conference. Simultaneous submission to other conferences with published proceedings is not allowed. Conference Chair: Jose D. P. Rolim Centre Universitaire d'Informatique University of Geneva 24 rue du General Dufour 1211 Geneva 4 Switzerland mailto:icalp@cui.unige.ch ICALP'2000 Program Committee Track A: Emo Welzl, Chair, ETH Zuerich Harry Buhrman, CWI Amsterdam Peter Bro Miltersen, Univ. Aarhus Martin Dietzfelbinger, Techn Univ Ilmenau Afonso Ferreira, CNRS-I3S-INRIA Sophia Antipolis Marcos Kiwi, Univ. de Chile Jens Lagergren, KTH Stockholm Gheorghe Paun, Romanian Acad. Guenter Rote, Techn. Univ. Graz Ronitt Rubinfeld, Cornell Univ. Amin Shokrollahi, Bell Labs Luca Trevisan, Columbia Univ. Serge Vaudenay, ENS Paris Uri Zwick, Tel Aviv Univ. Track B: Ugo Montanari, Chair, Univ. of Pisa Rajeev Alur, Univ. Pennsylvania, Philadelphia Rance Cleaveland, SUNY at Stony Brook Pierpaolo Degano, Univ. of Pisa Jose Fiadeiro, Univ. of Lisbon Andy Gordon, Microsoft Research, Cambridge, Orna Grumberg, Technion, Haifa Claude Kirchner, Inria, Nancy Mogens Nielsen, Univ. of Aarhus Catuscia Palamidessi, Penn. State Univ, Univ. Park Joachim Parrow, KTH, Stockholm Edmund Robinson, QMW, London Jan Rutten, CWI, Amsterdam Jan Vitek, Univ. of Geneva Martin Wirsing, Ludwig-Maximilians-University, Munich Pierre Wolper, Univ. of Liege. Special Award Richard Karp, Berkeley Invited Speakers Track A: Andrei Broder, Altavista Oded Goldreich, MIT and Weizman Inst. Johan Haastad, KTH Stockholm Kurt Mehlhorn, Max Plank Institute Track B: Samsom Abramsky, Edinburgh U. Gregor Engels, Paderborn U. Roberto Gorrieri, U. Bologna Zohar Manna, Stanford U. Satellite Workshops * Workshop on Randomization and Approximation in CS. (RANDOM'2000) * Workshop on Algorithms for Communication Networks (ARACNE) * Workshop on Boolean Functions and Applications * Workshop on Intersection Types and Related Systems (ITRS '00) * Workshop on Graph Transformation and Visual Modeling Techniques * Workshop on Process Algebra and Performance Models (PAPM 2000) * Workshop on Theor. Found. of Security Analysis and Design (IFIP WG 1.7) General Information Geneva is situated along the banks of Lac Leman and Le Rhone. The lake showcases the plumed fountain Jet d'Eau, and various districts of Geneva are connected by bridges across the waterways. The University of Geneva where ICALP '00 will convene is located on the `Left Bank' off Place Neuve and along the Promenade des Bastions near the Old Town section of Geneva. Geneva is a city of water parks and gardens and welcoming walkways which encourage exploration of the historical sites, museums, and international business and shopping districts. The University of Geneva is located near `Old Town' an area dotted with sidewalk cafes, student life, and building antiquities dating back to the 5th century. Geneva is a crossroads situated in the heart of Europe and linked to the world by a vast network of motorways, airlines and railways. For those planning to attend ICALP '00 in Geneva, it is an excellent opportunity to organize short trips into the countryside of charming villages and vineyards. Tours to please all ages and interests are available including afternoon train excursions, shopping cruises on Lake Geneva and The Rhone, and bus and cablecar trips in the Alps. For some, the most inviting attraction will be mouintain climbing. Mont Blanc, one of the highest points in Europe and the city of Chamonix are less than an hour away. Accomodations at a very special ICALP rate have been reserved in a couple of hotels and very inexpensive rooms will be available at the Student Housing. Lunch will be served daily on campus and there will be morning and afternoon refreshment breaks. Note that the specially priced hotel accommodations reserved for ICALP participants are located only a 5-10 minute walk to the campus. Important Dates Workshop Proposals: November 10,1999 Submissions: January 24, 2000 Notification: March 21, 2000 Final Copies: April 18, 2000 Further Information Further information related to ICALP'00, with instructions for paper submissions and conference registration, as well as with details on conference site, registration fee, accommodation, social program, and payments, will appear at the conference webpage at http://cuiwww.unige.ch/~icalp and in forthcoming issues of EATCS Bulletin. The conference is organized by the Centre Universitaire d'Informatique of the University of Geneva. ------------- 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 compgeom-owner@research.bell-labs.com Tue Jan 11 09:28:59 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id JAA24238 for ; Tue, 11 Jan 2000 09:28:57 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jan 11 09:22:35 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Jan 6 17:07:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Jan 6 17:06:51 EST 2000 Received: from moosilauke.cs.dartmouth.edu ([129.170.212.178]) by dusty; Thu Jan 6 17:05:02 EST 2000 Received: (from scot@localhost) by moosilauke.cs.dartmouth.edu (8.9.3/8.9.3) id RAA16129; Thu, 6 Jan 2000 17:06:46 -0500 (EST) From: Scot Drysdale Message-Id: <200001062206.RAA16129@moosilauke.cs.dartmouth.edu> Subject: Dartmouth needs visitor to teach Grad. Theory To: scot@cs.dartmouth.edu (Scot Drysdale) Date: Thu, 6 Jan 2000 17:06:45 -0500 (EST) Cc: compgeom-announce@research.bell-labs.com, THEORY-A@LISTSERV.NODAK.EDU, sigcse.members@acm.org, members@lacs.edu, scot@cs.dartmouth.edu (Scot Drysdale) In-Reply-To: <199905112214.SAA03807@moosilauke.cs.dartmouth.edu> from "Scot Drysdale" at May 11, 1999 06:14:14 PM X-Mailer: ELM [version 2.5 PL0pre8] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 1041 Lines: 30 Visitor needed to teach Graduate Theory of Computation at Dartmouth College Due to and unexpected leave Dartmouth College would like to hire a visitor to teach the Graduate Theory of Computation course this spring term (March 27-June 6). To apply please send a c.v., cover letter, and names of three references to: Professor Scot Drysdale Chair, Department of Computer Science Dartmouth College 6211 Sudikoff Laboratory Hanover, NH 03755 email: scot@cs.dartmouth.edu phone: 603/646-2101 fax: 603/646-1672 References should address both teaching and research. Dartmouth is an equal opportunity, affirmative action employer and encourages applications from women and minorities. ------------- 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 compgeom-owner@research.bell-labs.com Wed Jan 12 14:07:59 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id OAA21272 for ; Wed, 12 Jan 2000 14:07:56 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Jan 12 14:03:01 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Wed Jan 12 04:39:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Jan 12 04:38:52 EST 2000 Received: from zeus.cc.ucy.ac.cy ([194.42.1.1]) by dusty; Wed Jan 12 04:36:59 EST 2000 Received: from ada.cs.ucy.ac.cy (ada.cs.ucy.ac.cy [194.42.10.200]) by zeus.cc.ucy.ac.cy (8.9.3/8.9.3) with ESMTP id LAA306816 for ; Wed, 12 Jan 2000 11:29:12 +0200 Date: Wed, 12 Jan 2000 11:42:45 +0200 (WET) From: George Angelos Papadopoulos Reply-To: george@cs.ucy.ac.cy To: COMPGEON Subject: Academic Vacancies: C.S. Dept - Univ. of Cyprus Message-ID: Organization: Department of Computer Science - University of Cyprus Address: 75 Kallipoleos Str. -- POB 20537 -- CY-1678 -- Nicosia -- Cyprus Tel: +357-2-892242 -- Fax: +357-2-339062 URL: http://www.cs.ucy.ac.cy/papadopo.html MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 2153 Lines: 61 DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF CYPRUS VISITING PROFESSORSHIPS The Department of Computer Science at the University of Cyprus has a number of vacancies for visiting professors at the ranks of Assistant, Associate, and Full Professor. ALL fields of study will be considered but preference will be given to applicants associated with one or more of the following ones: * Computer Architecture * Parallel and Distributed Processing * Programming Languages * Multimedia Information Systems * Data Communication Networks * Artificial Intelligence * Software Engineering * Database Systems A visiting appointment is usually for one semester (Spring semester: Jan-June; Winter semester: Sept-Dec), but it can be renewed for up to four semesters. Applicants should hold a Ph.D. in a relevant subject, have post Ph.D. experience, and be fluent in Greek. The annual salaries for these positions (including the 13th salary) are: Professor (Scale A15-A16) CYP 25.479 - 33.120 Associate Professor (Scale A14-A15) CYP 22.473 - 30.636 Assistant Professor (Scale A13-A14) CYP 20.966 - 28.288 Lecturer (Scale A12-A13) CYP 17.706 - 25.933 (At present CYP 1 = 1.1 sterling and CYP 1 = 1.80 U.S. dollars). Presently, the Department is seeking applications for the winter and spring semesters of the academic year 2000-2001. Anyone wishing to apply should send a full CV to the following address: The Chairperson Department of Computer Science University of Cyprus 75 Kallipoleos Street P.O. Box 20537, CY-1678 Nicosia, CYPRUS For more details and other information, interested individuals may contact the Chairperson of the Department of Computer Science: Associate Professor Antonis Kakas Tel: +357-2-892238, Fax: +357-2-339062, E-mail: antonis@ucy.ac.cy ------------- 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 compgeom-owner@research.bell-labs.com Wed Jan 12 14:09:33 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id OAA21290 for ; Wed, 12 Jan 2000 14:09:30 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Jan 12 14:03:36 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Wed Jan 12 10:49:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Jan 12 10:48:16 EST 2000 Received: from jinai.cs.nyu.edu ([128.122.80.169]) by dusty; Wed Jan 12 10:46:23 EST 2000 Received: (from yap@localhost) by jinai.cs.nyu.edu (8.9.1/8.9.1) id KAA12288 for compgeom-announce@research.bell-labs.com; Wed, 12 Jan 2000 10:48:13 -0500 (EST) Date: Wed, 12 Jan 2000 10:48:13 -0500 (EST) From: Chee Yap Message-Id: <200001121548.KAA12288@jinai.cs.nyu.edu> To: compgeom-announce@research.bell-labs.com Subject: New Book Precedence: bulk Status: RO Content-Length: 2265 Lines: 54 Announcing a new book: Fundamental Problems of Algorithmic Algebra by CHEE YAP, New York University Oxford University Press, 2000. Websites: Oxford University Press Announcement: http://www.oup-usa.org/isbn/0195125169.html Book Homepage: http://www.cs.nyu.edu/cs/faculty/yap/book/ Table of Contents: http://www.cs.nyu.edu/cs/faculty/yap/book/toc.html ============================================================== 511 pp.; 22 line illus; 7-1/2 x 9-1/4; 0-19-512516-9; $72 (US) ============================================================== Computer Algebra systems represents a rapidly growing application of computer science to all areas of scientific research and computation. Well-known computer algebra systems such as Maple, Macsyma, Mathematica and REDUCE are now a basic tool on most computers. Underlying these systems are efficient algorithms for various algebraic operations. The field of Computer Algebra, or Algorithmic Algebra, constitute the study of these algorithms and their properties, and represents a rich intersection of theoretical computer science with very classical mathematics. For researchers in computational geometry, computer algebra offers the necessary tools in the investigation of nonlinear problems and issues of current interest such as non-robustness in geometric algorithms. Yap's book focuses on a collection of core problems in this area; in effect, they are the computational versions of the classical Fundamental Problem of Algebra and its derivatives. It attempts to be self-contained in its mathematical development while addressing the algorithmic aspects of problems. The book is intended for a first course in algorithmic algebra (or computer algebra) for advanced undergraduates or beginning graduate students in computer science. Additionally, it will be a useful reference for professionals in this field. Excellent presentation of mathematics relevant to computer algebra. ==================================================== ------------- 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 compgeom-owner@research.bell-labs.com Wed Jan 12 14:10:32 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id OAA21310 for ; Wed, 12 Jan 2000 14:10:27 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Jan 12 14:03:08 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Wed Jan 12 11:05:07 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Jan 12 11:04:00 EST 2000 Received: from largo.eecs.tufts.edu ([130.64.24.99]) by dusty; Wed Jan 12 11:02:06 EST 2000 Received: from piano.eecs.tufts.edu (piano [130.64.24.27]) by largo.eecs.tufts.edu (8.9.1a/8.9.1) with ESMTP id LAA25302 for ; Wed, 12 Jan 2000 11:03:40 -0500 (EST) From: Diane Souvaine Received: (from dls@localhost) by piano.eecs.tufts.edu (8.9.1a/8.9.1) id LAA06831 for compgeom-announce@research.bell-labs.com; Wed, 12 Jan 2000 11:03:51 -0500 (EST) Date: Wed, 12 Jan 2000 11:03:51 -0500 (EST) Message-Id: <200001121603.LAA06831@piano.eecs.tufts.edu> To: compgeom-announce@research.bell-labs.com Subject: Graduate Fellowship at Tufts University Precedence: bulk Status: RO Content-Length: 2354 Lines: 51 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Engineering College Graduate Student Research Fellowships $18,000 Stipend Plus Tuition The College of Engineering at Tufts University has an exciting NSF fellowship opportunity available for an outstanding graduate student computer scientist who is also interested in being involved in bringing concepts from the foundations of computer science into middle school (grades 6-8) curriculum. The fellowships are for the amount of $18,000 per twelve months, and are annually renewable up to three years, based upon fellow performance. The Computer Science Fellow chosen for this program will work with 6th through 8th grade teachers and students with the guidance of Tufts Computer Science Faculty. The goal is to infuse principles of algorithmic thinking and computer science applications into middle school mathematics classes in Massachusetts. The fellow will act as a resource for the middle school mathematics teachers. Graduate students accepted as fellows will receive $18,000 for a June May commitment and an annual full tuition scholarship for graduate study in Computer Science in the College of Engineering at Tufts University. The fellowship is in lieu of a traditional teaching or research assistantship, encouraging instead contributing an understanding of the foundations of computer science to 6-8 classes while pursuing their own advanced degree and computer science research. Please visit www.ceeo.tufts.edu for details of fellowship or application, and www.eecs.tufts.edu for details about graduate study in computer science and how to apply for the M.S./Ph.D. Program, or contact one of: Dr. Martha Cyr Prof. Diane Souvaine 105 Anderson Hall Elect. Engr. and Computer Science Dept. Tufts University Tufts University Medford, MA 02155 Medford, MA 02155 mcyr@tufts.edu dls@eecs.tufts.edu Application target date : February 14th, 2000 Fellowship Recipients must be citizens of the U.S. or permanent residents. ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ------------- 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 compgeom-owner@research.bell-labs.com Fri Jan 14 09:53:11 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id JAA05077 for ; Fri, 14 Jan 2000 09:53:08 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Jan 14 09:45:29 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Thu Jan 13 10:35:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Jan 13 10:33:11 EST 2000 Received: from mail.math.TU-Berlin.DE ([130.149.12.212]) by dusty; Thu Jan 13 10:31:15 EST 2000 Received: from zaphod.math.TU-Berlin.DE (zaphod.math.TU-Berlin.DE [130.149.13.91]) by mail.math.TU-Berlin.DE (8.9.3/8.9.3) with ESMTP id QAA15149; Thu, 13 Jan 2000 16:33:06 +0100 (MET) From: "Guenter M. Ziegler" Received: (from ziegler@localhost) by zaphod.math.TU-Berlin.DE (8.8.8/8.8.8) id QAA12754; Thu, 13 Jan 2000 16:33:06 +0100 (MET) Date: Thu, 13 Jan 2000 16:33:06 +0100 (MET) Message-Id: <200001131533.QAA12754@zaphod.math.TU-Berlin.DE> To: compgeom-announce@research.bell-labs.com Subject: DISCRETE AND ALGORITHMIC GEOMETRY: Euro-Conference on Crete Cc: souzana@itia.math.uch.gr, emo@inf.ethz.ch X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 3439 Lines: 106 ==================================================================== DISCRETE AND ALGORITHMIC GEOMETRY Euroconference on Crete August 19-25, 2000 ==================================================================== ... The Foundation for Research and Technology-Hellas (Institute of Applied and Computational Mathematics) ... ... in collaboration with the University of Crete (Department of Mathematics) ... ... continue in 2000 their series `` Euroconferences in Mathematics on Crete'' ... sponsored mainly by the TMR Programme of EU Commission ... including the following conference: Time: 19-25 August 2000: Topic: DISCRETE AND ALGORITHMIC GEOMETRY Organisers: Emo Welzl (ETH Z"urich, Switzerland) G"unter M. Ziegler (Berlin, Germany) Main speakers: Gil Kalai (Jerusalem, Israel) Raimund Seidel (Saarbr"ucken, Germany) Jack Snoeyink (Vancouver, Canada) Emo Welzl (ETH Z"urich, Switzerland) G"unter M. Ziegler (Berlin, Germany) Location: The conferences will take place at the Anogia Academic Village, a conference center located at the traditional Cretan village of Anogia on the slopes of the mountain Ida. Anogia is located at an elevation of 750 m, about 45 minutes by car from Heraklion, the largest city of Crete, and about half an hour from the closest coast. Costs: The living expenses (accommodation plus meals) per day for a person are estimated at about 32 Euro in a double room or 40 Euro in a single room. The registration fee amounts to 250 Euro. Financial Support available (!): The Training and Mobility of Researchers (TMR) Programme financially supports young researchers from the countries of the European Economic Area and Israel, as well as researchers from certain countries in Central and Eastern Europe, to enable them to attend the conferences. There may be also some limited funds from other sources available to support participants not belonging to the above groups. Support can cover (all or part of) travel, living and registration expenses. For information please contact the local co-ordinator: Susanna Papadopoulou Department of Mathematics University of Crete Heraklion, Crete, GREECE Fax-Nr.: 81-393881 e-mail: souzana@math.uch.gr Registration: please send the registration form below to ziegler@math.tu-berlin.de ==================================================================== DISCRETE AND ALGORITHMIC GEOMETRY Euroconference on Crete August 19-25, 2000 Name: Affiliation: Nationality: Address (e-mail and snail-mail): Fields of interest: Would you like to give a talk ? If yes, is the title already fixed ? Do you need financial support ? Short curriculum vitae: ==================================================================== ------------- 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 compgeom-owner@research.bell-labs.com Fri Jan 14 09:53:14 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id JAA05081 for ; Fri, 14 Jan 2000 09:53:11 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Jan 14 09:45:08 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Fri Jan 14 08:03:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Jan 14 08:02:54 EST 2000 Received: from lily.newcastle.edu.au ([134.148.96.116]) by dusty; Fri Jan 14 08:00:57 EST 2000 Received: (from vlad@localhost) by lily.newcastle.edu.au (8.8.7/8.6.9) id AAA17868 for compgeom-announce@research.bell-labs.com; Sat, 15 Jan 2000 00:02:47 +1100 (EST) Date: Sat, 15 Jan 2000 00:02:47 +1100 (EST) From: Vladimir Estivill-Castro Message-Id: <200001141302.AAA17868@lily.newcastle.edu.au> To: compgeom-announce@research.bell-labs.com Subject: COCOON-2000 Precedence: bulk Status: RO Content-Length: 5301 Lines: 124 We apologize if you have received this before. COCOON'2OOO --- FINAL Call for Papers --- Sixth Annual International Computing and Combinatorics Conference July 26-28, 2000, Bondi Beach , Sydney , Australia The Sixth Annual International Computing and Combinatorics Conference, COCOON'2000, will be held in Bondi Beach , Sydney , Australia July 26--28, 2000 (a few weeks before the XXVII Olympics, September 15 -- October 1). The conference aims to provide a forum for researchers in theoretical computer science. The conference will be followed by the 11th Australasian Workshop on Combinatorial Algorithms (AWAOCA). Original research papers in the areas of algorithms, theory of computation, computational complexity, and combinatorics related to computing are solicited. In additional to theoretical results, submissions that report substantial results in experimental and applied research are encouraged. Typical, but not exclusive, topics of interest include: * algorithms and data structures * automata, languages and logic * combinatorics related to algorithms and complexity * complexity theory * computational algebra, biology, geometry, and number theory * computational learning theory and knowledge discovery * cryptography and database theory * graph drawing and information visualization * graph theory, communication networks, and optimization * parallel and distributed computing Submissions to the conference this year will again be conducted electronically. Authors should follow the submission guidelines and send a PostScript file of a paper (in English) by February 8, 2000. The submission guidelines are in http://www.cs.newcastle.edu.au/~cocoon2000/submission.html Our home page is: http://www.cs.newcastle.edu.au/~cocoon2000 Alternatively, authors unable to access e-mail may send 6 hard copies of their papers to: Xuemin Lin - COCOON'2000 School of Computer Science and Engineering University of New South Wales Sydney, NSW 2052, Australia. e-mail: lxue@cse.unsw.edu.au A paper should start with the title of the paper, each author's name, affiliation, e-mail address, and a short summary of the main results. The paper should provide sufficient detail to allow the Program Committee to evaluate its validity, quality, and relevance to the conference. The length of the paper should not exceed 10 pages (using 11 point or larger font, with ample margins all around). If necessary, authors may include a clearly marked appendix that will be read at the discretion of the Program Committee. An abstract of the paper must be submitted electronically by February 1, 2000. Authors will be notified of acceptance or rejection by March 30, 2000. A camera-ready copy of each accepted paper will be required by April 26, 2000. The proceedings of the conference will be published by Springer-Verlag in the Lecture Notes in Computer Science series, and will be available for distribution at the conference. The Hao Wang award will be given to the best paper (details given on our home page). We also introduce an award for the best paper from a young researcher (at most 3 years since PhD). Program Committee Co-Chairs =========================== Ding-Zhu Du (U. of Minnesota, USA) Peter Eades (Newcastle, Australia) Xuemin Lin (New South Wales, Australia) Conference Co-Chairs ==================== Vladimir Estivill-Castro (Newcastle, Australia) Arun Sharma (New South Wales, Australia) Program Committee ================= David Avis (McGill, Canada), Jianer Chen (Texas A&M, USA), Francis Chin (Hong Kong U, Hong Kong), Vladimir Estivill-Castro (Newcastle, Australia), George Havas (UQ, Australia), Hiroshi Imai (Tokyo, Japan), Tao Jiang (UC Riverside, USA), Richard Karp (UC Berkeley, USA), Michael Juenger (Cologne, Germany), D. T. Lee (Academia Sinica, Taiwan), Bernard Mans (Macquarie U., Australia), Brendan McKay (ANU, Australia), Maurice Nivat (Universitie de Paris VII, France), Takeshi Tokuyama (Tohoku, Japan), Roberto Tamassia (Brown, USA), Jie Wang (UNC Greensboro, USA), Shmuel Zaks (Technion, Israel), Louxin Zhang (NUS, Singapore), Shuzhong Zhang (CUHK, Hong Kong), Binhai Zhu (City U Hong Kong, Hong Kong) Invited Speakers ================ * Christos H. Papadimitriou (University of California, Berkeley) * Richard Brent (Oxford University Computing Laboratory) Important Dates =============== * Submission of Abstracts: February 1, 2000 * Submission of Papers: February 8, 2000. * Notification of Acceptance: March 30, 2000. * Final Version: April 26, 2000. * Conference: July 26-28, 2000 . Location ======== The conference will be held at the Swiss-Grand Hotel in Bondi Beach , Sydney , Australia. Further Information =================== Please contact cocoon2000@cse.unsw.edu.au for further information. Sponsors ======== * University of New South Wales * University of Newcastle * Computer Science Association of Australasia ------------- 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 compgeom-owner@research.bell-labs.com Fri Jan 14 10:35:04 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id KAA06087 for ; Fri, 14 Jan 2000 10:35:01 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Jan 14 10:33:37 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Fri Jan 14 10:05:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Jan 14 10:04:13 EST 2000 Received: from mail.crs4.it ([156.148.1.33]) by dusty; Fri Jan 14 10:02:15 EST 2000 Received: from crs4.it (filuferru.crs4.it [156.148.4.36]) by mail.crs4.it (Postfix) with ESMTP id DB33710B1; Fri, 14 Jan 2000 16:07:30 +0100 (MET) Sender: gobbetti@crs4.it Message-ID: <387FB929.E04D3A2C@crs4.it> Date: Sat, 15 Jan 2000 01:02:49 +0100 From: Enrico Gobbetti Organization: CRS4/VVR X-Mailer: Mozilla 4.03C-SGI [en] (X11; I; IRIX64 6.5 IP25) MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: Job Opening: Research position at CRS4 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 2822 Lines: 70 *** *** EXPERT LEVEL RESEARCH POSITIONS IN COMPUTER GRAPHICS *** Ref.: VVR-EXPERT-0100 URL: http://www.crs4.it/vvr/contents/announce/job_01_99 The Visualization and Virtual Reality area at CRS4 invites applications for an expert-level research position in computer graphics. The following specialties are of value to us: multiresolution modeling, geometric simplification, time-critical rendering, object-oriented technology, Eiffel, C++, OpenGL, Windows NT. The successful candidates must possess the following requirements: * University Degree, preferrably MSc or Ph.D., in Computer Science or related fields; * Considerable research and development experience in the field of computer graphics; * Theoretical and practical background in geometric modeling; * A good understanding of component based object-oriented programming technology. Good communication skill, attitude to work in group, and some previous experience in international projects complete the profile of the successful candidate, that will immediatly start working on one of the projects of the group. In particular, the candidate is expected to provide a leading contribution to the development of software components for multiresolution modeling and simplification in the context of a three-year European project. A two year renewable contract will be offered, with salary depending on the demonstrated expertise of the successful candidate. This offer of employment is in accordance with the current Italian "Contratto Collettivo Nazionale di Lavoro per l'industria Metalmeccanica Privata". CRS4 is an interdisciplinary research center established in 1991 and located near Cagliari (Sardinia, Italy). Its activities encompass many areas related to computational science and information technology. The Center currently has a staff of about 90 researchers and has outstanding facilities. CRS4 provides a stimulating work environment for highly motivated individuals. Further information about CRS4's Visualization and Virtual Reality group can be obtained on the Internet at: http://www.crs4.it/vvr. The position is available immediately and applications will be accepted until the position is filled. Applicants should send a resume, including a cover letter quoting Ref. VVR-EXPERT-0100, to: Dr. Fabio Bettio CRS4 VI Strada Ovest, Z.I. Macchiareddu C.P. 94 I-09010 Uta (CA), Italy. E-mail: fabio@crs4.it Fax : +39 070 2796 216 Electronic submissions (in HTML, ASCII, PDF, or PostScript) are strongly encouraged. ------------- 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 compgeom-owner@research.bell-labs.com Mon Jan 17 16:58:24 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id QAA29295 for ; Mon, 17 Jan 2000 16:58:22 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Jan 17 16:52:35 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Sun Jan 16 13:33:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sun Jan 16 13:32:35 EST 2000 Received: from ns1.tu-graz.ac.at ([129.27.2.3]) by dusty; Sun Jan 16 13:30:36 EST 2000 Received: from sbox.tu-graz.ac.at (e-221.vc-graz.ac.at [193.171.244.221]) by ns1.tu-graz.ac.at (8.9.3/8.9.3) with ESMTP id TAA15546 for ; Sun, 16 Jan 2000 19:32:32 +0100 (MET) Message-ID: <38820F44.6658EF66@sbox.tu-graz.ac.at> Date: Sun, 16 Jan 2000 19:34:44 +0100 From: Iris Reinbacher X-Mailer: Mozilla 4.04 [en] (Win95; I) MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com Subject: thesis Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 750 Lines: 28 I am a student at the Technical University Graz (Austria) and I am writing my diploma-thesis on "Random Triangulations (of Sets of Points)" (at Dr. Aichholzer). I am (already really desperatly) looking for the master thesis of T. Ono: A (Markov) Chain Approach to Random Generation of Triangulation I would be very grateful if you were able to tell me any sources where I could try to get it or maybe even send me a copy of it. Thanks in advance! Reinbacher Iris TU Graz Austria ------------- 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 compgeom-owner@research.bell-labs.com Sat Jan 22 18:12:28 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id SAA23445 for ; Sat, 22 Jan 2000 18:12:25 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sat Jan 22 18:08:54 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Wed Jan 19 16:17:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Jan 19 16:16:06 EST 2000 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.37]) by dusty; Wed Jan 19 16:14:05 EST 2000 Received: by nrclonex1.imti.nrc.ca with Internet Mail Service (5.5.2650.21) id ; Wed, 19 Jan 2000 16:16:00 -0500 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C77AFF91@nrclonex1.imti.nrc.ca> From: "Dickinson, John" To: compgeom-discuss@research.bell-labs.com Subject: Convolution of triangle meshes Date: Wed, 19 Jan 2000 16:15:55 -0500 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2650.21) Content-Type: text/plain; charset="iso-8859-1" Precedence: bulk Status: RO Content-Length: 928 Lines: 25 I need to expand a triangle mesh before doing intersection checks to ensure minimum separation distances between objects. The operation in image processing on a 2D grid would be known as convolution. Has work been done on this in 3D for free-form surfaces described by triangular meshes? I'll take any references people have even if it doesn't directly apply to meshed surfaces. John -- -((Insert standard disclaimer here))-|- Washington Irving (1783-1859) - John Kenneth Dickinson | "A sharp tongue is the only Research Council Officer IMTI-NRC | edge tool that grows keener email: john.dickinson@nrc.ca | with constant use." ------------- 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 compgeom-owner@research.bell-labs.com Sat Jan 22 18:12:30 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id SAA23449 for ; Sat, 22 Jan 2000 18:12:28 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sat Jan 22 18:09:19 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Wed Jan 19 16:39:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Jan 19 16:38:11 EST 2000 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.37]) by dusty; Wed Jan 19 16:36:11 EST 2000 Received: by nrclonex1.imti.nrc.ca with Internet Mail Service (5.5.2650.21) id ; Wed, 19 Jan 2000 16:38:10 -0500 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C77AFF92@nrclonex1.imti.nrc.ca> From: "Dickinson, John" To: compgeom-discuss@research.bell-labs.com Subject: topological reconstruction of triangular meshes Date: Wed, 19 Jan 2000 16:38:07 -0500 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2650.21) Content-Type: text/plain; charset="iso-8859-1" Precedence: bulk Status: RO Content-Length: 1243 Lines: 42 I am also looking for algorithms or even code that reconstruct topological information from a list of triangles. I mean tha I have a list of triangles with their surface normal and 3 vertex points specified in 3-space like: normal (nx,ny,nz) vextices 1:(x,y,z) 2:(x,y,z) 3:(x,y,z) normal (nx,ny,nz) vextices 1:(x,y,z) 2:(x,y,z) 3:(x,y,z) ... and I want to create two lists: vertices 1: (x,y,z) 2: (x,y,z) 3: (x,y,z) 4: (x,y,z) ... and triangles 1: use vertices 1,3,5 2: use vertices 2,4,5 ... etc. Note that the vertex coordinates "should" match in the data input but some loss of precision is often encountered leading to difficulties in matching vertices from different triangles together. John -- -((Insert standard disclaimer here))-|- Washington Irving (1783-1859) - John Kenneth Dickinson | "A sharp tongue is the only Research Council Officer IMTI-NRC | edge tool that grows keener email: john.dickinson@nrc.ca | with constant use." ------------- 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 compgeom-owner@research.bell-labs.com Sat Jan 22 18:17:20 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id SAA23521 for ; Sat, 22 Jan 2000 18:17:10 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Jan 22 18:14:33 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Fri Jan 21 17:59:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Jan 21 17:58:18 EST 2000 Received: from ares.cs.Virginia.EDU ([128.143.136.41]) by dusty; Fri Jan 21 17:56:17 EST 2000 Received: from viper.cs.Virginia.EDU (viper.cs.Virginia.EDU [128.143.137.17]) by ares.cs.Virginia.EDU (8.9.2/8.9.2/UVACS-2000011700) with ESMTP id RAA07955 for ; Fri, 21 Jan 2000 17:58:15 -0500 (EST) Received: (from gd2000@localhost) by viper.cs.Virginia.EDU (8.9.2/8.9.2) id RAA19805; Fri, 21 Jan 2000 17:58:15 -0500 (EST) Date: Fri, 21 Jan 2000 17:58:15 -0500 (EST) Message-Id: <200001212258.RAA19805@viper.cs.Virginia.EDU> From: Graphics 2000 Conference To: compgeom-announce@research.bell-labs.com Subject: CFP: Symposium on Graph Drawing (GD 2000) Precedence: bulk Status: RO Content-Length: 5326 Lines: 126 Please forward this CFP to any of your colleagues who might be interested. ........................................................................ Graph Drawing 2000 Preliminary Call for Papers Colonial Williamsburg (Virginia, USA) September 20-23, 2000 http://www.cs.virginia.edu/~gd2000/ * Deadlines: ---------- o Submissions: May 24, 2000 o Notification of acceptance: July 19, 2000 o Early Registration: July 31, 2000 (Late registration TBA.) o Camera-ready copies of accepted papers: September 20, 2000 * Location: Colonial Williamsburg offers a peaceful retreat atmosphere. Located on the grounds of the 18th-century Historic Area Visitor Center, the conference is also conveniently located to shopping, restaurants, golf and more, all within walking distance. Colonial Williamsburg is located 150 miles south of Washington, D.C. on Interstate 64. Richmond International Airport is less than 50 minutes away -- rental car and shuttle service is available. Train and bus service are available from Washington, D.C. For more information on Colonial Williamsburg, visit: http://www.history.org/ * 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, geometry, topology, visual languages, visual perception, information visualization, computer-human interaction, and graphic design. Much research in graph drawing is motivated by applications to systems for viewing and interacting with graphs. 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 12 pages in the conference proceedings, and short papers 6 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 May 24, 2000. 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 sent by e-mail. 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: ------------------ Therese Biedl, University of Waterloo Peter Eades, University of Newcastle Wendy Feng, Tom Sawyer Software Ashim Garg, SUNY Buffalo Michael Goodrich, Johns Hopkins Michael Kaufmann, University of Tubingen Jan Kratochvil, Charles University Giuseppe Liotta, University of Perugia Joe Marks (chair), MERL Stephen North, AT&T Research Kathy Ryall, University of Virginia Kozo Sugiyama, JAIST Roberto Tamassia, Brown University Robin Thomas, Georgia Tech. Dorothea Wagner, University of Konstanz Stephen Wismath, University of Lethbridge * Organizing Committee: --------------------- Joe Marks, MERL Janet O'Halloran, MERL Kathy Ryall (chair), University of Virginia * Contest Committee: ------------------ Franz Brandenburg (chair), University of Passau * Contact Information: -------------------- o Conference URL: www.cs.virginia.edu/~gd2000/ o Conference Organization: gd2000@cs.virginia.edu o Electronic Submission: gd2000subm@merl.com o Hard-copy Submission: Joe Marks MERL, 201 Broadway Cambridge, MA 02139, USA Phone: 617-621-7534 ........................................................................ ------------- 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 compgeom-owner@research.bell-labs.com Sat Jan 22 18:19:22 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id SAA23554 for ; Sat, 22 Jan 2000 18:19:19 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sat Jan 22 18:15:24 EST 2000 To: compgeom-announce@research.bell-labs.com Received: from grubby.research.bell-labs.com by netlib2; Sat Jan 22 08:17:03 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Sat Jan 22 08:15:32 EST 2000 Received: from wren.cs.unc.edu ([152.2.128.86]) by dusty; Sat Jan 22 08:13:28 EST 2000 Received: from snoeyinkltcs (xylog-port4.cs.unc.edu [152.2.132.164]) by wren.cs.unc.edu (8.9.3/8.9.3) with SMTP id IAA02746; Sat, 22 Jan 2000 08:15:24 -0500 (EST) Message-ID: <005401bf64da$bf60bf20$a4840298@cs.unc.edu> From: "Jack Snoeyink" To: Subject: Reminder to volunteer to review proposals for NSF, if you are able Date: Sat, 22 Jan 2000 08:15:05 -0500 Organization: UNC Chapel Hill MIME-Version: 1.0 Content-Type: text/plain; charset="Windows-1252" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2919.6600 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2919.6600 Precedence: bulk Status: RO Content-Length: 2749 Lines: 57 Sorry for the broadcast, but your assistance could help the US-based members of our community. NSF is being flooded with proposals for its Information Technology Research program, which is targetted towards long-term, including theoretical, research. There are two categories (<=500K and >500K) and those who apply to a category cannot review for that category, which makes it difficult for NSF to find reviewers for its two-day panels. To the US-based members of our community that have applied, it is important that NSF finds panel reviewers that can speak to the quality of the research proposed. If you willing and able to travel to a panel meeting, please consider volunteering. See http://www.itr.nsf.gov for the details on the Information Technology Research program, or http://www.itr.nsf.gov/panelist/ to volunteer. I've included the dates below. Jack Snoeyink@cs.unc.edu UNC Chapel Hill, Computer Science CB 3175, Sitterson Hall, Chapel Hill, NC 27599-3175 USA http://www.cs.unc.edu/~snoeyink ph+1(919)962-1969 fax+1(919)962-1799 Preproposal panels (You will only be asked for one of the following two meeting dates). These review preproposals for the awards with budgets over $500K. 7-8 February 2000 (click if available): 10-11 February 2000 (click if available): ---------------------------------------------------------------------------- ---- Full proposal panels, proposals with budgets not over $500K (You will only be asked for one of the following dates): 20-21 March 2000 (click if available): 23-24 March 2000 (click if available): 27-28 March 2000 (click if available): 30-31 March 2000 (click if available): ---------------------------------------------------------------------------- ---- Full proposal panels, proposals with budgets over $500K (You will only be asked for one of the following dates): 22-23 May 2000 (click if available): 25-26 May 2000 (click if available): ---------------------------------------------------------------------------- ---- Click here if you prefer to attend panels meeting near Washington, DC: or on the West Coast: or in the Midwest: We'll try to follow your preferences, but subject expertise is more important than travel, and we may have to suggest a panel meeting somewhere else. We anticipate that the meetings on Mon-Fri will be in the vicinity of NSF (Arlington, Va.) and the meetings on Thu-Fri will be either in Chicago or the San Francisco areas, although the details are not certain. ------------- 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 compgeom-owner@research.bell-labs.com Sun Jan 23 20:16:07 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id UAA11901 for ; Sun, 23 Jan 2000 20:16:04 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sun Jan 23 20:11:12 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Sun Jan 23 11:47:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sun Jan 23 11:45:56 EST 2000 Received: from na-ims.alcoa.com ([147.154.3.39]) by dusty; Sun Jan 23 11:43:53 EST 2000 Received: by NA-IMS with Internet Mail Service (5.5.2448.0) id ; Sun, 23 Jan 2000 11:45:54 -0500 Message-ID: <5D53FF24216DD311ABFA0000E8961A3308AA1A@na-atc1.atc.alcoa.com> From: "Watton, John D." To: compgeom-discuss@research.bell-labs.com, "'Dickinson, John'" Subject: RE: topological reconstruction of triangular meshes Date: Sun, 23 Jan 2000 11:43:52 -0500 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2448.0) Content-Type: text/plain Precedence: bulk Status: RO Content-Length: 919 Lines: 26 You might want to check out admesh: http://www.varlog.com/products/admesh/ Source is provided in C for reading STL files which are basically triangles with vertex and normal information. The purpose of the program is to repair STL files but it does write OFF and VRML files which are formats similar to what you want back. The usual technique is to hash the triangles with the vertices as keys in order to collect shared vertices together. In order to handle tolerancing the vertex coords are divided by a tolerance and rounded. Be careful though, the integer values get large as tol goes down and integer overflows can occur. John Watton Alcoa Inc. ------------- 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 compgeom-owner@research.bell-labs.com Sun Jan 23 20:16:16 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id UAA11910 for ; Sun, 23 Jan 2000 20:16:13 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sun Jan 23 20:12:25 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Sun Jan 23 10:11:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sun Jan 23 10:09:13 EST 2000 Received: from snow.cs.dartmouth.edu ([129.170.212.127]) by dusty; Sun Jan 23 10:07:10 EST 2000 Received: by snow.cs.dartmouth.edu (980427.SGI.8.8.8/4.2) id KAA30543; Sun, 23 Jan 2000 10:08:26 -0500 (EST) Date: Sun, 23 Jan 2000 10:08:26 -0500 (EST) Message-Id: <200001231508.KAA30543@snow.cs.dartmouth.edu> From: Bruce Randall Donald To: compgeom-announce@research.bell-labs.com To: THEORYNT@LISTSERV.NODAK.EDU cc: klaus@akpeters.com Subject: WAFR 2000 Accepted Papers X-poultry-efficacious: Invariant tyrosine moraine. Reply-To: brd@cs.dartmouth.edu (Bruce Randall Donald) Precedence: bulk Status: RO Content-Length: 3357 Lines: 110 WAFR 2000 Fourth International Workshop on Algorithmic Foundations of Robotics March 16-18 Dartmouth Hanover, NH http://www.cs.dartmouth.edu/~wafr/ The following papers were accepted for presentation at WAFR 2000. Further information about the conference is available at the WAFR 2000 Web site. ==================================================================== List of accepted papers Kinematic tolerance analysis with configuration spaces: method and case study --- L. Joskowicz, E. Sacks Encoders for spherical motion using discrete sensors --- E. Scheinerman, G. S. Chirikjian, D. Stein On Random Sampling in Contact Configuration Space --- X. Ji and J. Xiao AutoBalancer: An Online Dynamic Balance Compensation Scheme for Humanoid Robots --- S. Kagami, F. Kanehiro, Y. Tamiya, M. Inaba, H. Inoue Deformable Free Space Tilings for Kinetic Collision Detection --- P. Agarwal, J. Basch, L. Guibas, J. Hershberger, L. Zhang Real-time Global Deformations --- Y. Zhuang, J. Canny Planning for coordinated vehicles with bounded curvature --- A. Bicchi, L. Pallottino Randomized Path Planning for a Rigid Body Based on Hardware Accelerated Voronoi Sampling --- C. Pisula, K. Hoff, M. Lin, D. Manocha Manipulation of Pose Distributions --- Mark Moll, M. A. Erdmann Controlled Module Density Helps Reconfiguration Planning --- A. Nguyen, L. Guibas, M. Yim Positioning Symmetric and Non-Symmetric Parts using Radial and Constant Force Fields --- F. Lamiraux, L. Kavraki Weighted Region Optimal Path Problem --- J. Reif, Z. Sun Complete Distributed Coverage of Rectilinear Environments --- Z. J. Butler, A. A. Rizzi, R. L. Hollis Closed-Loop Distributed Manipulation Using Discrete Actuator Arrays --- J. E. Luntz, W. Messner, H. Choset Pulling Motion Based Tactile Sensing --- M. Kaneko, T. Tsuji Rapidly-Exploring Random Trees: Progress and Prospects --- S. M. LaValle, J. J. Kuffner Steering Algorithms for Dynamic Robotic Locomotion Systems --- J. P. Ostrowski, K. A. McIsaac Compensatory Grasping with the Parallel Jaw Gripper --- T. Zhang, G. Smith, K. Goldberg Reliable Mobile Robot Navigation From Unreliable Visual Cues --- A. J. Briggs, D. Scharstein, S. D. Abbott A Kinematics-Based Probabilistic Roadmap Method for Closed Chain Systems --- L. Han, N. M. Amato Toward Real-Time Motion Planning in Dynamic Environments --- P. Leven, S. Hutchinson Graphical Construction of Time Optimal Trajectories for Differential Drive Robots --- D. J. Balkcom, M. T. Mason Coupled Oscillators for Legged Robots --- M. D. Berkemeier Motion Planning for Kinematic Stratified Systems with Application to Quasi-Static Legged Locomotion and Finger Gaiting --- B. Goodwine, J. Burdick ==================================================================== Bruce Donald (for the WAFR Chairs). For further enquiries, please contact: wafr@cs.dartmouth.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://uiuc.edu/~sariel/CG/compgeom/threads.html. From compgeom-owner@research.bell-labs.com Wed Jan 26 18:20:23 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id SAA22633 for ; Wed, 26 Jan 2000 18:20:20 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Jan 26 18:11:43 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Mon Jan 24 07:17:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Jan 24 07:15:30 EST 2000 Received: from hotmail.com ([216.32.181.149]) by dusty; Mon Jan 24 07:13:27 EST 2000 Received: (qmail 57481 invoked by uid 0); 24 Jan 2000 12:15:27 -0000 Message-ID: <20000124121527.57480.qmail@hotmail.com> Received: from 209.239.65.145 by www.hotmail.com with HTTP; Mon, 24 Jan 2000 04:15:27 PST X-Originating-IP: [209.239.65.145] From: "ergin duran" To: compgeom-discuss@research.bell-labs.com Subject: Curves Morphing on Trimed Surfaces. Date: Mon, 24 Jan 2000 13:15:27 CET Mime-Version: 1.0 Content-Type: text/plain; format=flowed Precedence: bulk Status: RO Content-Length: 1079 Lines: 28 Hello, The description: multi curve contour morphing on multi surfaces (trimmed). Therefore, the equation of the curves must follow the equation of the surfaces. In some cases one curve must follow an equation of two trimmed surface equation with the small gap in between. The definitions of the surfaces and curves can be in any form, such as Bezier or Nurbs .. I know sound a little weird but is there any thing similar. At least one can give me some ideas on the limitations of the current computational solutions available on internet or in some books or some publications…? I will appreciate for any answer related. Sincerely, My name is Ergin Duran e-mail address : erginduran@hotmail.com ______________________________________________________ Get Your Private, Free Email at http://www.hotmail.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 compgeom-owner@research.bell-labs.com Wed Jan 26 18:20:25 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id SAA22638 for ; Wed, 26 Jan 2000 18:20:22 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Jan 26 18:14:08 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Wed Jan 26 06:29:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Jan 26 06:27:54 EST 2000 Received: from core.inf.ethz.ch ([129.132.178.196]) by dusty; Wed Jan 26 06:25:48 EST 2000 Received: from shadow.inf.ethz.ch (emo@shadow-brain.inf.ethz.ch [129.132.16.3]) by core.inf.ethz.ch (8.9.3/8.9.3) with ESMTP id MAA17322; Wed, 26 Jan 2000 12:27:38 +0100 (MET) From: Emo Welzl Received: (from emo@localhost) by shadow.inf.ethz.ch (8.8.8/8.8.8) id MAA13428; Wed, 26 Jan 2000 12:27:37 +0100 (MET) Date: Wed, 26 Jan 2000 12:27:37 +0100 (MET) Message-Id: <200001261127.MAA13428@shadow.inf.ethz.ch> To: compgeom-announce@research.bell-labs.com Subject: ESA 2000 - Call for Papers Cc: emo@inf.ethz.ch, msp@dcs.warwick.ac.uk X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 4116 Lines: 93 ESA 2000 - Call for Papers 8th Annual European Symposium on Algorithms 5 - 8 September 2000 Max-Planck-Institut fuer Informatik, Saarbruecken, Germany Scope The Symposium covers research in the use, design, and analysis of efficient algorithms and data structures in computer science, discrete applied mathematics and mathematical programming. ESA 2000 is jointly organized with WAE 2000 and APPROX 2000 in the framework of CONF 2000. For general information, please see http://www.mpi-sb.mpg.de/~conf2000 . Topics Papers are solicited describing original results in all areas of algorithmic research, including but not limited to: Approximation Algorithms; Machine Learning; Combinatorial Optimization; On-line Algorithms; Computational Biology; Parallel and Distributed Computing; Computational Geometry; Pattern Matching and Data Compression; Databases and Information Retrieval; Randomized Algorithms; External-memory Algorithms; Symbolic Computation. Graph and Network Algorithms; The algorithms may be sequential, distributed or parallel, and they should be analyzed either mathematically or by rigorous computational experiments. Submissions that report on experimental and applied research are especially encouraged. Important Dates Submission of Papers March 26, 2000 Notification of Acceptance May 15, 2000 Final Version due June 4, 2000 Conference September 5-8, 2000 Programme Committee Lars Arge (Duke) Mike Paterson (Chair)(Warwick) Yossi Azar (Tel Aviv) Marco Pellegrini (CNR, Pisa) Leslie Goldberg (Warwick) R. Ravi (Carnegie-Mellon) Mike Juenger (Koeln) Jan van Leeuwen (Utrecht) Danny Krizanc (Wesleyan) Emo Welzl (ETH, Zuerich) Alessandro Panconesi (Bologna) Publication Proceedings will be published in the Springer series Lecture Notes in Computer Science. Previous proceedings of ESA, 1998 in Venice and 1999 in Prague, appeared as LNCS 1461 and LNCS 1643. Submission Guidelines Submissions should consist of an extended abstract describing original research in no more than 10 pages and an optional appendix, with more details to be read/consulted at the discretion of the programme committee. The submission should give the author's email address and fax number if available. Electronic submissions are solicited. A detailed description of the electronic submission process will be available at http://www.mpi-sb.mpg.de/~conf2000/esa2000/subm.html . The postscript file must be received by 11:59pm (BST) on March 26, 2000, for your submission to be considered. In extreme cases, contributions may be submitted by sending 6 hard copies to: Mike Paterson, ESA 2000 Department of Computer Science University of Warwick Coventry, CV4 7AL, UK Your hard copy submission must be received by March 26 (or postmarked March 19 or earlier and sent by airmail) in order to be considered. Simultaneous submission to other conferences with published proceedings is not allowed except to APPROX 2000 with the understanding that if the paper is accepted to ESA 2000 then the paper will be withdrawn from APPROX 2000 immediately by sending an email message to kj@informatik.uni-kiel.de. Accepted contributed papers will receive an allotment of 12 pages in the proceedings. It is expected that all accepted papers will be presented at the symposium. For more information see http://www.mpi-sb.mpg.de/~conf2000/esa2000/ or contact Mike Paterson (msp@dcs.warwick.ac.uk). ------------- 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 compgeom-owner@research.bell-labs.com Sun Jan 30 20:43:32 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id UAA23187 for ; Sun, 30 Jan 2000 20:43:29 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sun Jan 30 20:39:55 EST 2000 To: compgeom-announce@research.bell-labs.com Received: from scummy.research.bell-labs.com by netlib2; Fri Jan 28 23:19:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Jan 28 23:17:43 EST 2000 Received: from simsan.skku.ac.kr ([203.252.53.7]) by dusty; Fri Jan 28 23:15:34 EST 2000 Received: from yurim ([203.252.53.39]) by simsan.skku.ac.kr (8.8.8+Sun/8.8.8) with SMTP id NAA25969 for ; Sat, 29 Jan 2000 13:30:17 +0900 (KST) Message-ID: <004901bf6a11$12628ce0$2735fccb@skku.ac.kr> From: "JungHyun Han" To: Subject: openings in Korea Date: Sat, 29 Jan 2000 13:26:49 +0900 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_0044_01BF6A5C.7F1CE9C0" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2919.6600 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2919.6600 Precedence: bulk Status: RO Content-Length: 12519 Lines: 178 This is a multi-part message in MIME format. ------=_NextPart_000_0044_01BF6A5C.7F1CE9C0 Content-Type: text/plain; charset="ks_c_5601-1987" Content-Transfer-Encoding: base64 VGhlIFNjaG9vbCBvZiBFbGVjdHJpY2FsIGFuZCBDb21wdXRlciBFbmdpbmVlcmluZyBhdCBTdW5n IEt5dW4gS3dhbiANClVuaXZlcnNpdHkgaGFzIGltbWVkaWF0ZSBvcGVuaW5ncyBmb3IgdGhyZWUg cmVzZWFyY2ggZmFjdWx0eSBwb3NpdGlvbnMgDQphdCB0aGUgQXNzaXN0YW50IG9yIEFzc29jaWF0 ZSBQcm9mZXNzb3IgbGV2ZWwuIFRoZXNlIHBvc2l0aW9ucyBhcmUgDQpmb3IgdGhlIHRocmVlLXll YXIgcmVzZWFyY2ggcHJvamVjdCBlbnRpdGxlZCAiSW1hZ2UtYmFzZWQgSW50ZXJuZXQgVlIgDQph bmQgYWdlbnQgdGVjaG5vbG9naWVzIGZvciBpbnRlbGxpZ2VudCBFbGVjdHJvbmljIENvbW1lcmNl IiBmdW5kZWQgYnkgDQp0aGUgQnJhaW4gS29yZWEgMjEgcHJvZ3JhbSBvZiB0aGUgTWluaXN0cnkg b2YgRWR1Y2F0aW9uLCBSZXB1YmxpYyBvZiBLb3JlYSANCmFuZCBTYW1zdW5nIEFkdmFuY2VkIElu c3RpdHV0ZSBvZiBTY2llbmNlIGFuZCBUZWNobm9sb2d5LiANCkFyZWFzIG9mIGludGVyZXN0IGFy ZSAoMSkgY29tcHV0ZXIgZ3JhcGhpY3Mgb3IgY29tcHV0YXRpb25hbCBnZW9tZXRyeSwgDQooMikg Y29tcHV0ZXIgdmlzaW9uLCBhbmQgKDMpIGFnZW50IHRlY2hub2xvZ2llcyBmb3IgRWxlY3Ryb25p YyBDb21tZXJjZS4gDQpDYW5kaWRhdGVzIG11c3QgaGF2ZSBhIGRvY3RvcmF0ZSBpbiBjb21wdXRl ciBzY2llbmNlIG9yIGEgcmVsYXRlZCBmaWVsZC4gDQpUaGUgcG9zaXRpb25zIHdpbGwgcmVtYWlu IG9wZW4gdW50aWwgdGhleSBhcmUgZmlsbGVkOyBob3dldmVyLCBwb3RlbnRpYWwgY2FuZGlkYXRl cw0KYXJlIHVyZ2VkIHRvIHN1Ym1pdCB0aGVpciByZXN1bWVzIHZpYSBlbWFpbCB1bnRpbCBGZWIu IDEwIGZvciBmYXZvcmFibGUgY29uc2lkZXJhdGlvbnMuIA0KDQpUaGUgaW5pdGlhbCBhcHBvaW50 bWVudCBpcyBmb3Igb25lIHllYXIgd2l0aCB0aGUgcG9zc2liaWxpdHkgb2YgcmVuZXdhbC4gDQpI b3dldmVyLCB0d28teWVhciBhcHBvaW50bWVudCB3aWxsIGJlIGNvbnNpZGVyZWQgZm9yIGV4Y2Vs bGVudCBjYW5kaWRhdGVzLCANCnN0aWxsIHdpdGggdGhlIHBvc3NpYmxlIHJlbmV3YWwgZm9yIGFu IGFkZGl0aW9uYWwgeWVhci4gVGhlIGFubnVhbCBzYWxhcnkgaXMgDQoyNCwwMDAsMDAwIHdvbiAo YXBwcm94aW1hdGVseSBVUyQyMSwwMDApLiBDb25zaWRlcmluZyB0aGUgbG93IGluY29tZSB0YXhl cyANCmFuZCBsaXZpbmcgY29zdCBpbiBLb3JlYSwgdGhlIHNhbGFyeSBtYXkgYW1vdW50IHRvIG1v cmUgdGhhbiBVUyQ0MCwwMDAuIA0KVGhlcmUgaXMgYWxzbyBnZW5lcm91cyB0cmF2ZWwgc3VwcG9y dCBmb3IgaW50ZXJuYXRpb25hbCBjb25mZXJlbmNlcy4gDQoNClN1bmcgS3l1biBLd2FuIFVuaXZl cnNpdHkoU0tLVSkgaXMgdGhlIG9sZGVzdCB1bml2ZXJzaXR5IGluIEtvcmVhLCANCmVzdGFibGlz aGVkIGluIDEzOTguIFNLS1UgaXMgcmFua2VkIDV0aCBpbiBLb3JlYSBhbmQgMjh0aCBpbiBBc2lh IGJ5IEFzaWEgV2Vlay4gDQpTS0tVIGhhcyBiZWVuIGV4cGVyaWVuY2luZyBhIHJhcGlkIGdyb3d0 aCBsYXRlbHkgc2luY2UgU2Ftc3VuZyBwYXJ0aWNpcGF0ZWQgDQppbiBydW5uaW5nIHRoZSBVbml2 ZXJzaXR5LiBUaGUgU2Nob29sIG9mIEVsZWN0cmljYWwgYW5kIENvbXB1dGVyIEVuZ2luZWVyaW5n IA0KY3VycmVudGx5IGhhcyA0NiBmdWxsLXRpbWUgZmFjdWx0eSBtZW1iZXJzLCBhbmQgb2ZmZXJz IEJTL01TL1BoRCBwcm9ncmFtcyANCnRvIGFwcHJveGltYXRlbHkgMTIwMCB1bmRlcmdyYWR1YXRl IG1ham9ycyBhbmQgMzUwIGdyYWR1YXRlIHN0dWRlbnRzLiANClN1cHBvcnQgdG8gdGhlIG5ldyBm YWN1bHR5IGlzIHF1aXRlIGV4Y2VsbGVudC4NCg0KTG9jYXRlZCAxNSBtaWxlcyBzb3V0aCBvZiBT ZW91bCBhbmQgc3Vycm91bmRlZCBieSBoaWdoLXRlY2ggaW5kdXN0cmllcyANCnN1Y2ggYXMgU2Ft c3VuZywgU0tLVSBjb21iaW5lcyBhIHNtYWxsIHRvd24gYXRtb3NwaGVyZSB3aXRoIHRoZSBhZHZh bnRhZ2VzIA0Kb2YgYSBtYWpvciBtZXRyb3BvbGl0YW4gYXJlYS4gVGhlIHF1YWxpdHkgb2YgbGlm ZSBpcyBleHRyYW9yZGluYXJ5LCBhbmQgDQp0aGUgb3Bwb3J0dW5pdGllcyBmb3IgY29uc3VsdGlu ZyBhbmQgam9pbnQgcmVzZWFyY2ggd2l0aCBpbmR1c3RyeSBhcmUgZXhjZWxsZW50Lg0KDQpQbGVh c2UgZW1haWwgYSByZXN1bWUgaW5jbHVkaW5nIHRoZSBhcHBsaWNhbnQncyBlbWFpbCBhZGRyZXNz IGFuZCANCmEgbGlzdCBvZiByZWZlcmVuY2VzIHRvOiBEci4gSGFuLCBKdW5nSHl1biAoZm9yIGNv bXB1dGVyIGdyYXBoaWNzKSwgDQpEci4gWWksIEp1bmUtSG8gKGZvciBjb21wdXRlciB2aXNpb24p LCBvciBEci4gTGVlLCBFdW4tU2VvayAoZm9yIGFnZW50IHRlY2hub2xvZ2llcyANCmZvciBFbGVj dHJvbmljIENvbW1lcmNlKS4gSWYgeW91IGFyZSBpbnRlcmVzdGVkIGluIGludGVyZGlzY2lwbGlu YXJ5IHJlc2VhcmNoIA0KZW5jb21wYXNzaW5nIG1vcmUgdGhhbiB0d28gYXJlYXMsIG9yIGhhdmUg aW5xdWlyaWVzIGluIHRoZSBvdmVyYWxsIHByb2plY3QsIA0KcGxlYXNlIGNvbnRhY3QgRHIuIEhh bi4gDQoNCkRyLiBIYW4sIEp1bmdIeXVuDQpTY2hvb2wgb2YgRWxlY3RyaWNhbCBhbmQgQ29tcHV0 ZXIgRW5naW5lZXJpbmcNClN1bmdreXVua3dhbiBVbml2ZXJzaXR5LCBTdXdvbiwgS29yZWEgNDQw LTc0Ng0KVGVsOiArODItMzMxLTI5MC03MTQwDQpGYXg6ICs4Mi0zMzEtMjkwLTcyMTENCkVtYWls OiBoYW5AZWNlLnNra3UuYWMua3INCldXVzogaHR0cDovL2dyYXBoaWNzLnNra3UuYWMua3INCg0K RHIuIFlpLCBKdW5lLUhvDQpUZWw6ICs4Mi0zMzEtMjkwLTcxNDINCkZheDogKzgyLTMzMS0yOTAt NzIzMQ0KRW1haWw6IGpoeWlAeXVyaW0uc2trdS5hYy5rcg0KV1dXOiBodHRwOi8vdnVsY2FuLnNr a3UuYWMua3INCg0KRHIuIExlZSwgRXVuLVNlb2sNClRlbDogKzgyLTMzMS0yOTAtNzEzNQ0KRmF4 OiArODItMzMxLTI5MC03MjExDQpFbWFpbDogZXNsZWVAc2VvcG8uc2trdS5hYy5rcg0KV1dXOiBo dHRwOi8vc2VvcG8uc2trdS5hYy5rcg0KDQotLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0t LS0tLS0tLS0tLS0tLS0tLS0NCkhhbiwgSnVuZ0h5dW4NClNjaG9vbCBvZiBFbGVjdHJpY2FsIGFu ZCBDb21wdXRlciBFbmdpbmVlcmluZw0KU3VuZyBLeXVuIEt3YW4gVW5pdmVyc2l0eQ0KU3V3b24s IDQ0MC03NDYsIEtvcmVhDQorODItMzMxLTI5MC03MTQwIChwaG9uZSkgKzgyLTMzMS0yOTAtNzIx MSAoZmF4KQ0KaHR0cDovL2dyYXBoaWNzLnNra3UuYWMua3INCi0tLS0tLS0tLS0tLS0tLS0tLS0t LS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLQ0KIA0K ------=_NextPart_000_0044_01BF6A5C.7F1CE9C0 Content-Type: text/html; charset="ks_c_5601-1987" Content-Transfer-Encoding: base64 PCFET0NUWVBFIEhUTUwgUFVCTElDICItLy9XM0MvL0RURCBIVE1MIDQuMCBUcmFuc2l0aW9uYWwv L0VOIj4NCjxIVE1MPjxIRUFEPg0KPE1FVEEgY29udGVudD0idGV4dC9odG1sOyBjaGFyc2V0PWtz X2NfNTYwMS0xOTg3IiBodHRwLWVxdWl2PUNvbnRlbnQtVHlwZT4NCjxNRVRBIGNvbnRlbnQ9Ik1T SFRNTCA1LjAwLjI5MTkuNjMwNyIgbmFtZT1HRU5FUkFUT1I+DQo8U1RZTEU+PC9TVFlMRT4NCjwv SEVBRD4NCjxCT0RZIGJnQ29sb3I9I2ZmZmZmZj4NCjxESVY+PEZPTlQgc2l6ZT0yPg0KPERJVj48 Rk9OVCBzaXplPTI+VGhlIFNjaG9vbCBvZiBFbGVjdHJpY2FsIGFuZCBDb21wdXRlciBFbmdpbmVl cmluZyBhdCBTdW5nIEt5dW4gDQpLd2FuIDwvRk9OVD48L0RJVj4NCjxESVY+PEZPTlQgc2l6ZT0y PlVuaXZlcnNpdHkgaGFzIGltbWVkaWF0ZSBvcGVuaW5ncyBmb3IgdGhyZWUgcmVzZWFyY2ggZmFj dWx0eSANCnBvc2l0aW9ucyA8L0ZPTlQ+PC9ESVY+DQo8RElWPjxGT05UIHNpemU9Mj5hdCB0aGUg QXNzaXN0YW50IG9yIEFzc29jaWF0ZSBQcm9mZXNzb3IgbGV2ZWwuIFRoZXNlIHBvc2l0aW9ucyAN CmFyZSA8L0ZPTlQ+PC9ESVY+DQo8RElWPjxGT05UIHNpemU9Mj5mb3IgdGhlIHRocmVlLXllYXIg cmVzZWFyY2ggcHJvamVjdCBlbnRpdGxlZCAiSW1hZ2UtYmFzZWQgDQpJbnRlcm5ldCBWUiA8L0ZP TlQ+PC9ESVY+DQo8RElWPjxGT05UIHNpemU9Mj5hbmQgYWdlbnQgdGVjaG5vbG9naWVzIGZvciBp bnRlbGxpZ2VudCBFbGVjdHJvbmljIENvbW1lcmNlIiANCmZ1bmRlZCBieSA8L0ZPTlQ+PC9ESVY+ DQo8RElWPjxGT05UIHNpemU9Mj50aGUgQnJhaW4gS29yZWEgMjEgcHJvZ3JhbSBvZiB0aGUgTWlu aXN0cnkgb2YgRWR1Y2F0aW9uLCANClJlcHVibGljIG9mIEtvcmVhIDwvRk9OVD48L0RJVj4NCjxE SVY+PEZPTlQgc2l6ZT0yPmFuZCBTYW1zdW5nIEFkdmFuY2VkIEluc3RpdHV0ZSBvZiBTY2llbmNl IGFuZCBUZWNobm9sb2d5LiANCjwvRk9OVD48L0RJVj4NCjxESVY+PEZPTlQgc2l6ZT0yPkFyZWFz IG9mIGludGVyZXN0IGFyZSAoMSkgY29tcHV0ZXIgZ3JhcGhpY3Mgb3IgY29tcHV0YXRpb25hbCAN Cmdlb21ldHJ5LCA8L0ZPTlQ+PC9ESVY+DQo8RElWPjxGT05UIHNpemU9Mj4oMikgY29tcHV0ZXIg dmlzaW9uLCBhbmQgPC9GT05UPjxGT05UIHNpemU9Mj4oMykgYWdlbnQgDQp0ZWNobm9sb2dpZXMg Zm9yIEVsZWN0cm9uaWMgQ29tbWVyY2UuIDwvRk9OVD48L0RJVj4NCjxESVY+PEZPTlQgc2l6ZT0y PkNhbmRpZGF0ZXMgbXVzdCBoYXZlIDwvRk9OVD48Rk9OVCBzaXplPTI+YSBkb2N0b3JhdGUgaW4g DQpjb21wdXRlciBzY2llbmNlIG9yIGEgcmVsYXRlZCBmaWVsZC4gPC9GT05UPjwvRElWPg0KPERJ Vj48Rk9OVCBzaXplPTI+VGhlIHBvc2l0aW9ucyB3aWxsIHJlbWFpbiZuYnNwOzwvRk9OVD48Rk9O VCBzaXplPTI+b3BlbiB1bnRpbCANCnRoZXkgYXJlIGZpbGxlZDsgaG93ZXZlciwgcG90ZW50aWFs IGNhbmRpZGF0ZXM8L0ZPTlQ+PC9ESVY+DQo8RElWPjxGT05UIHNpemU9Mj5hcmUgdXJnZWQgdG8g PC9GT05UPjxGT05UIHNpemU9Mj5zdWJtaXQgdGhlaXIgcmVzdW1lcyB2aWEgDQplbWFpbCB1bnRp bCBGZWIuIDEwJm5ic3A7Zm9yIGZhdm9yYWJsZSBjb25zaWRlcmF0aW9ucy4mbmJzcDs8L0ZPTlQ+ PC9ESVY+DQo8RElWPjxGT05UIHNpemU9Mj48QlI+VGhlIGluaXRpYWwgYXBwb2ludG1lbnQgaXMg Zm9yIG9uZSB5ZWFyIHdpdGggdGhlIA0KcG9zc2liaWxpdHkgb2YgcmVuZXdhbC4gPC9GT05UPjwv RElWPg0KPERJVj48Rk9OVCBzaXplPTI+SG93ZXZlciwgdHdvLXllYXIgYXBwb2ludG1lbnQgd2ls bCBiZSBjb25zaWRlcmVkIGZvciBleGNlbGxlbnQgDQpjYW5kaWRhdGVzLCA8L0ZPTlQ+PC9ESVY+ DQo8RElWPjxGT05UIHNpemU9Mj5zdGlsbCB3aXRoIHRoZSBwb3NzaWJsZSByZW5ld2FsIGZvciBh biBhZGRpdGlvbmFsIHllYXIuIFRoZSANCmFubnVhbCBzYWxhcnkgaXMgPC9GT05UPjwvRElWPg0K PERJVj48Rk9OVCBzaXplPTI+MjQsMDAwLDAwMCB3b24gKGFwcHJveGltYXRlbHkgVVMkMjEsMDAw KS4gQ29uc2lkZXJpbmcgdGhlIGxvdyANCmluY29tZSB0YXhlcyA8L0ZPTlQ+PC9ESVY+DQo8RElW PjxGT05UIHNpemU9Mj5hbmQgbGl2aW5nIGNvc3QgaW4gS29yZWEsIHRoZSBzYWxhcnkgbWF5IGFt b3VudCB0byBtb3JlIHRoYW4gDQpVUyQ0MCwwMDAuIDwvRk9OVD48L0RJVj4NCjxESVY+PEZPTlQg c2l6ZT0yPlRoZXJlIGlzIGFsc28gZ2VuZXJvdXMgdHJhdmVsIHN1cHBvcnQgZm9yIGludGVybmF0 aW9uYWwgDQpjb25mZXJlbmNlcy4gPC9GT05UPjwvRElWPg0KPERJVj4mbmJzcDs8L0RJVj4NCjxE SVY+PEZPTlQgc2l6ZT0yPlN1bmcgS3l1biBLd2FuIFVuaXZlcnNpdHkoU0tLVSkgaXMgdGhlIG9s ZGVzdCB1bml2ZXJzaXR5IGluIA0KS29yZWEsIDwvRk9OVD48L0RJVj4NCjxESVY+PEZPTlQgc2l6 ZT0yPmVzdGFibGlzaGVkIGluIDEzOTguIFNLS1UgaXMgcmFua2VkIDV0aCBpbiBLb3JlYSBhbmQg Mjh0aCBpbiANCkFzaWEgYnkgQXNpYSBXZWVrLiA8L0ZPTlQ+PC9ESVY+DQo8RElWPjxGT05UIHNp emU9Mj5TS0tVIGhhcyBiZWVuIGV4cGVyaWVuY2luZyBhIHJhcGlkIGdyb3d0aCBsYXRlbHkgc2lu Y2UgU2Ftc3VuZyANCnBhcnRpY2lwYXRlZCA8L0ZPTlQ+PC9ESVY+DQo8RElWPjxGT05UIHNpemU9 Mj5pbiBydW5uaW5nIHRoZSBVbml2ZXJzaXR5LiBUaGUgU2Nob29sIG9mIEVsZWN0cmljYWwgYW5k IA0KQ29tcHV0ZXIgRW5naW5lZXJpbmcgPC9GT05UPjwvRElWPg0KPERJVj48Rk9OVCBzaXplPTI+ Y3VycmVudGx5IGhhcyA0NiBmdWxsLXRpbWUgZmFjdWx0eSBtZW1iZXJzLCBhbmQgb2ZmZXJzIA0K QlMvTVMvUGhEIHByb2dyYW1zIDwvRk9OVD48L0RJVj4NCjxESVY+PEZPTlQgc2l6ZT0yPnRvIGFw cHJveGltYXRlbHkgMTIwMCB1bmRlcmdyYWR1YXRlIG1ham9ycyBhbmQgMzUwIGdyYWR1YXRlIA0K c3R1ZGVudHMuIDwvRk9OVD48L0RJVj4NCjxESVY+PEZPTlQgc2l6ZT0yPlN1cHBvcnQgdG8gdGhl IG5ldyBmYWN1bHR5IGlzIHF1aXRlIGV4Y2VsbGVudC48L0ZPTlQ+PC9ESVY+DQo8RElWPjxGT05U IHNpemU9Mj48QlI+TG9jYXRlZCAxNSBtaWxlcyBzb3V0aCBvZiBTZW91bCBhbmQgc3Vycm91bmRl ZCBieSANCmhpZ2gtdGVjaCBpbmR1c3RyaWVzIDwvRk9OVD48L0RJVj4NCjxESVY+PEZPTlQgc2l6 ZT0yPnN1Y2ggYXMgU2Ftc3VuZywgU0tLVSBjb21iaW5lcyBhIHNtYWxsIHRvd24gYXRtb3NwaGVy ZSB3aXRoIA0KdGhlIGFkdmFudGFnZXMgPC9GT05UPjwvRElWPg0KPERJVj48Rk9OVCBzaXplPTI+ b2YgYSBtYWpvciBtZXRyb3BvbGl0YW4gYXJlYS4gVGhlIHF1YWxpdHkgb2YgbGlmZSBpcyANCmV4 dHJhb3JkaW5hcnksIGFuZCA8L0ZPTlQ+PC9ESVY+DQo8RElWPjxGT05UIHNpemU9Mj50aGUgb3Bw b3J0dW5pdGllcyBmb3IgY29uc3VsdGluZyBhbmQgam9pbnQgcmVzZWFyY2ggd2l0aCANCmluZHVz dHJ5IGFyZSBleGNlbGxlbnQuPC9GT05UPjwvRElWPg0KPERJVj48Rk9OVCBzaXplPTI+PEJSPlBs ZWFzZSBlbWFpbCBhIHJlc3VtZSBpbmNsdWRpbmcgdGhlIGFwcGxpY2FudCdzIGVtYWlsIA0KYWRk cmVzcyBhbmQgPC9GT05UPjwvRElWPg0KPERJVj48Rk9OVCBzaXplPTI+YSBsaXN0IG9mIHJlZmVy ZW5jZXMgdG86IERyLiBIYW4sIEp1bmdIeXVuIChmb3IgY29tcHV0ZXIgDQpncmFwaGljcyksIDwv Rk9OVD48L0RJVj4NCjxESVY+PEZPTlQgc2l6ZT0yPkRyLiBZaSwgSnVuZS1IbyAoZm9yIGNvbXB1 dGVyIHZpc2lvbiksIG9yIERyLiBMZWUsIEV1bi1TZW9rIA0KKGZvciBhZ2VudCB0ZWNobm9sb2dp ZXMgPC9GT05UPjwvRElWPg0KPERJVj48Rk9OVCBzaXplPTI+Zm9yIEVsZWN0cm9uaWMgQ29tbWVy Y2UpLiBJZiB5b3UgYXJlIGludGVyZXN0ZWQgaW4gDQppbnRlcmRpc2NpcGxpbmFyeSByZXNlYXJj aCA8L0ZPTlQ+PC9ESVY+DQo8RElWPjxGT05UIHNpemU9Mj5lbmNvbXBhc3NpbmcgbW9yZSB0aGFu IHR3byBhcmVhcywgb3IgaGF2ZSBpbnF1aXJpZXMgaW4gdGhlIA0Kb3ZlcmFsbCBwcm9qZWN0LCA8 L0ZPTlQ+PC9ESVY+DQo8RElWPjxGT05UIHNpemU9Mj5wbGVhc2UgY29udGFjdCBEci4gSGFuLiA8 L0ZPTlQ+PC9ESVY+DQo8RElWPiZuYnNwOzwvRElWPg0KPERJVj48Rk9OVCBzaXplPTI+RHIuIEhh biwgSnVuZ0h5dW48QlI+U2Nob29sIG9mIEVsZWN0cmljYWwgYW5kIENvbXB1dGVyIA0KRW5naW5l ZXJpbmc8QlI+U3VuZ2t5dW5rd2FuIFVuaXZlcnNpdHksIFN1d29uLCBLb3JlYSA0NDAtNzQ2PEJS PlRlbDogDQorODItMzMxLTI5MC03MTQwPEJSPkZheDogKzgyLTMzMS0yOTAtNzIxMTxCUj5FbWFp bDogPEEgDQpocmVmPSJtYWlsdG86aGFuQGVjZS5za2t1LmFjLmtyIj5oYW5AZWNlLnNra3UuYWMu a3I8L0E+PEJSPldXVzogPEEgDQpocmVmPSJodHRwOi8vZ3JhcGhpY3Muc2trdS5hYy5rciI+aHR0 cDovL2dyYXBoaWNzLnNra3UuYWMua3I8L0E+PC9GT05UPjwvRElWPg0KPERJVj4mbmJzcDs8L0RJ Vj4NCjxESVY+PEZPTlQgc2l6ZT0yPkRyLiBZaSwgSnVuZS1IbzxCUj5UZWw6ICs4Mi0zMzEtMjkw LTcxNDI8QlI+RmF4OiANCis4Mi0zMzEtMjkwLTcyMzE8QlI+RW1haWw6IDxBIA0KaHJlZj0ibWFp bHRvOmpoeWlAeXVyaW0uc2trdS5hYy5rciI+amh5aUB5dXJpbS5za2t1LmFjLmtyPC9BPjxCUj5X V1c6IDxBIA0KaHJlZj0iaHR0cDovL3Z1bGNhbi5za2t1LmFjLmtyIj5odHRwOi8vdnVsY2FuLnNr a3UuYWMua3I8L0E+PC9GT05UPjwvRElWPg0KPERJVj4mbmJzcDs8L0RJVj4NCjxESVY+PEZPTlQg c2l6ZT0yPkRyLiBMZWUsIEV1bi1TZW9rPEJSPlRlbDogKzgyLTMzMS0yOTAtNzEzNTxCUj5GYXg6 IA0KKzgyLTMzMS0yOTAtNzIxMTxCUj5FbWFpbDogPEEgDQpocmVmPSJtYWlsdG86ZXNsZWVAc2Vv cG8uc2trdS5hYy5rciI+ZXNsZWVAc2VvcG8uc2trdS5hYy5rcjwvQT48QlI+V1dXOiA8QSANCmhy ZWY9Imh0dHA6Ly9zZW9wby5za2t1LmFjLmtyIj5odHRwOi8vc2VvcG8uc2trdS5hYy5rcjwvQT48 L0ZPTlQ+PC9ESVY+DQo8RElWPiZuYnNwOzwvRElWPg0KPERJVj48L0ZPTlQ+PEZPTlQgDQpzaXpl PTI+LS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tPEJSPkhh biwgDQpKdW5nSHl1bjxCUj5TY2hvb2wgb2YgRWxlY3RyaWNhbCBhbmQgQ29tcHV0ZXIgRW5naW5l ZXJpbmc8QlI+U3VuZyBLeXVuIEt3YW4gDQpVbml2ZXJzaXR5PEJSPlN1d29uLCA0NDAtNzQ2LCBL b3JlYTxCUj4rODItMzMxLTI5MC03MTQwIChwaG9uZSkgKzgyLTMzMS0yOTAtNzIxMSANCihmYXgp PEJSPjxBIA0KaHJlZj0iaHR0cDovL2dyYXBoaWNzLnNra3UuYWMua3IiPmh0dHA6Ly9ncmFwaGlj cy5za2t1LmFjLmtyPC9BPjxCUj4tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0t LS0tLS0tLS0tLS08QlI+Jm5ic3A7PC9GT05UPjwvRElWPjwvRElWPjwvQk9EWT48L0hUTUw+DQo= ------=_NextPart_000_0044_01BF6A5C.7F1CE9C0-- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Tue Feb 1 12:50:56 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id MAA10916 for ; Tue, 1 Feb 2000 12:50:53 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Feb 1 12:45:43 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon Jan 31 14:27:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Jan 31 14:27:01 EST 2000 Received: from mail.mpi-sb.mpg.de ([139.19.1.1]) by dusty; Mon Jan 31 14:24:53 EST 2000 Received: from mpii01704.ag1.mpi-sb.mpg.de (mpii01704.ag1.mpi-sb.mpg.de [139.19.10.157]) by mail.mpi-sb.mpg.de (8.8.7/8.8.8) with ESMTP id UAA15135 for ; Mon, 31 Jan 2000 20:26:50 +0100 From: jopsi@mpi-sb.mpg.de Received: (from jopsi@localhost) by mpii01704.ag1.mpi-sb.mpg.de (8.9.3/8.9.3) id UAA15397 for compgeom-announce@research.bell-labs.com; Mon, 31 Jan 2000 20:26:44 +0100 (MET) Message-Id: <200001311926.UAA15397@mpii01704.ag1.mpi-sb.mpg.de> Subject: ESA, WAE, APPROX caal for papers To: compgeom-announce@research.bell-labs.com Date: Mon, 31 Jan 2000 20:26:44 +0100 (MET) X-Mailer: ELM [version 2.4ME+ PL52 (25)] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 931 Lines: 32 ----------------------------------------------------------------- Call for papers: ---------------- ESA 2000 APPROX 2000 WAE 2000 Max-Planck-Institut fuer Informatik Saarbruecken, 5-9 until 8-9 The above three conferences in the areas of Algorithms, Approximation and Algorithms Engineering are jointly organized in Saarbruecken, Germany. The deadlines for submission of papers are as follows: ESA 2000: March 26 APPROX 2000: April 3 WAE 2000: May 5 For more details have a look at the website of the conferences at http://www.mpi-sb.mpg.de/~conf2000 ----------------------------------------------------------------- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Tue Feb 1 12:50:59 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id MAA10920 for ; Tue, 1 Feb 2000 12:50:55 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Feb 1 12:45:27 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Tue Feb 1 08:19:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Feb 1 08:17:21 EST 2000 Received: from mail.cs.uu.nl ([131.211.80.32]) by dusty; Tue Feb 1 08:15:11 EST 2000 Received: from leros.cs.uu.nl (leros.cs.uu.nl [131.211.80.214]) by mail.cs.uu.nl (Postfix) with ESMTP id B9409451C for ; Tue, 1 Feb 2000 14:17:19 +0100 (MET) Date: Tue, 1 Feb 2000 14:17:19 +0100 (MET) From: Geert-Jan Giezeman To: compgeom-announce@research.bell-labs.com Subject: CGAL 2.1, Computational Geometry Algorithms Library Message-ID: X-Org: Department of Computer Science; Utrecht University X-Org: P.O. Box 80.089; 3508 TB Utrecht; The Netherlands. X-Org: phone: +31-30-2531454; telefax: +31-30-2513791 MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 1523 Lines: 42 We are pleased to announce release 2.1 of CGAL, the Computational Geometry Algorithms Library. CGAL 2.1 is the first release to support the Windows platform. Additions to release 2.0 include: - Triangulations in 3D - Alpha shapes - Several algorithms on sets of points in 2D - Support for compilers under Windows NT/98/95 (VC++, g++). - and more The CGAL project is a collaborative effort to develop a robust, easy to use, and efficient C++ software library of geometric data structures and algorithms. The CGAL library contains: - Basic geometric primitives such as points, vectors, lines, predicates such as for relative positions of points, and operations such as intersections and distance calculation. - A collection of standard data structures and geometric algorithms, such as convex hull, (Delaunay) triangulation, planar map, polyhedron, smallest enclosing sphere, and multidimensional query structures. - Interfaces to other packages, e.g. for visualisation, and I/O, and other support facilities. For further information and for downloading the library and its documentation, please visit the CGAL web page: http://www.cs.uu.nl/CGAL/ Should you have any questions or comments, please send a message to cgal@cs.uu.nl ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Feb 3 18:19:59 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id SAA21483 for ; Thu, 3 Feb 2000 18:19:52 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Feb 3 18:12:56 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Wed Feb 2 08:21:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Feb 2 08:19:57 EST 2000 Received: from maildns.FSBDial.co.uk ([195.89.137.4]) by dusty; Wed Feb 2 08:17:47 EST 2000 Received: from [195.89.184.30] by maildns.freenet.co.uk (NTMail 4.30.0013/NT0619.00.8ceac940) with ESMTP id njkdmaaa for ; Wed, 2 Feb 2000 13:19:17 +0000 Sender: steph@research.bell-labs.com Message-ID: <38983157.4025F33B@lmm.jussieu.fr> Date: Wed, 02 Feb 2000 13:29:59 +0000 From: "StÂphane Popinet" Organization: LMM, Universit Paris VI, France X-Mailer: Mozilla 4.07 [en] (X11; I; Linux 2.0.36 i686) MIME-Version: 1.0 To: Compgeom mailing list Subject: GTS 0.2.0 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 8bit Precedence: bulk Status: RO Content-Length: 1068 Lines: 27 Release 0.2.0 of GTS is avalaible for download at http://gts.sourceforge.net The GNU Triangulated Surface Library (GTS) provides a set of useful functions to deal with 3D surfaces meshed with interconnected triangles. It features metric operations (area, volume, curvature, etc.), 2D Delaunay and constrained Delaunay triangulations, robust geometric predicates and set operations on surfaces (union, intersection, etc.), surface refinement and coarsening (multiresolution models), bounding-boxes trees for collision/intersection detection and triangle strips generation for fast-rendering. GTS is licensed under the Library General Public License (LGPL) which gives you entire freedom to use it in an educational or commercial environment free of charge. Thank you for your attention, Stéphane Popinet ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Feb 3 18:20:03 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id SAA21486 for ; Thu, 3 Feb 2000 18:19:53 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Feb 3 18:14:48 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Wed Feb 2 08:37:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Feb 2 08:35:43 EST 2000 Received: from himmelsborg.cs.lth.se ([130.235.16.11]) by dusty; Wed Feb 2 08:33:33 EST 2000 Received: from hannar.cs.lth.se (andrzej@hannar [130.235.16.102]) by himmelsborg.cs.lth.se (8.9.3/8.9.3/perf-jw-tr) with ESMTP id OAA05547 for ; Wed, 2 Feb 2000 14:35:40 +0100 (MET) From: Andrzej Lingas Received: (from andrzej@localhost) by hannar.cs.lth.se (8.9.3+Sun/8.9.3) id OAA07146 for compgeom-announce@research.bell-labs.com; Wed, 2 Feb 2000 14:35:39 +0100 (MET) Date: Wed, 2 Feb 2000 14:35:39 +0100 (MET) Message-Id: <200002021335.OAA07146@hannar.cs.lth.se> To: compgeom-announce@research.bell-labs.com Subject: SWAT'2000 X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 668 Lines: 24 Call for papers --------------- The deadline submission for SWAT'2000, February 15, is approaching. It is time to remind you about this great opportunity to attend one of the oldest European algorithm conferences and see the lovely fjords of Norway in the historic town of Bergen the coming summer. For more details have a look at the website of the conference at http://www.ii.uib.no/swat2000/. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Feb 3 18:20:04 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id SAA21490 for ; Thu, 3 Feb 2000 18:19:54 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Feb 3 18:14:11 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Wed Feb 2 09:17:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Feb 2 09:15:32 EST 2000 Received: from convex.cs.unb.ca ([131.202.33.93]) by dusty; Wed Feb 2 09:13:22 EST 2000 Received: (from bremner@localhost) by convex.cs.unb.ca (8.9.3/8.9.3) id KAA00868; Wed, 2 Feb 2000 10:16:45 -0400 From: David Bremner MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <14488.15436.992086.386007@convex.cs.unb.ca> Date: Wed, 2 Feb 2000 10:16:44 -0400 (AST) To: compgeom-announce@research.bell-labs.com Subject: CCCG 2000 First Call for Papers X-Mailer: VM 6.71 under 21.1 (patch 4) "Arches" XEmacs Lucid Precedence: bulk Status: RO Content-Length: 3801 Lines: 138 12th Canadian Conference on Computational Geometry Fredericton, New Brunswick August 16-19, 2000 First Call for Papers Introduction ============ Computational Geometry is a discipline concerned with algorithms, software, and mathematical foundations for the treatment of geometric data by computer. The Canadian Conference on Computational Geometry (CCCG) reflects this diversity of interest, with invited speakers and contributed papers on topics ranging from geometric applications in industry to the frontiers of pure mathematics. Invited Speakers ================ - Gil Kalai, Hebrew University of Jerusalem (to be confirmed) The Paul Erdos Memorial Lecture on Discrete Geometry - Naoki Kato, University of Kyoto Applications of Computational Geometry in Architecture Contributions ============= Papers are solicited on both experimental and theoretical topics within computational geometry. An illustrative, but not exclusive list of topics - Applications of computational geometry - Art gallery problems - Discrete and combinatorial Geometry - Geometric data structures - Graph drawing - Lower bounds for geometric problems - Motion planning - Robustness in geometric algorithms Authors should submit a 4 page extended abstract by the submission deadline given below. Accepted papers will be allocated approximately twenty minutes for presentation at the conference. The preferred method of submission is electronic; details will be available on the conference web site (http://www.cs.unb.ca/conf/cccg) closer to the deadline. If you are unable to submit electronically, please ensure a paper copy of your extended abstract reaches Canadian Conference for Computational Geometry c/o David Bremner Faculty of Computer Science University of New Brunswick P.O. Box 4400 Fredericton, NB E3B 5A3 by the submission deadline. Special Issue ============= The program committee will invite the authors of approximately 6 of the accepted papers to submit a final version to a special issue of Computational Geometry: Theory and Applications. These papers will go through a full refereeing process for the journal, but have the advantage of relatively speedy publication. Deadlines ========= 2000/04/14 Extended abstracts due 2000/06/01 Notification of acceptence or rejection 2000/07/03 Proceedings version of the paper due 2000/08/01 Special issue papers due Location and Dates ================== CCCG 2000 will be held at the Sheraton Hotel in Fredericton, New Brunswick from August 16 to August 19 of 2000. The technical program will take place August 16-18, with an optional excursion on August 19. Personel ======== Conference Chair: David Bremner Program Committee ----------------- Prosenjit Bose Carleton University David Bremner University of New Brunswick Claudia Iturriaga University of New Brunswick Mark Keil University of Saskatchewan Alex Lopez-Ortiz University of New Brunswick Anna Lubiw University of Waterloo Barry Monson University of New Brunswick David Rappaport Queen's University Godfried Toussaint McGill University Stephen Wismath University of Lethbridge Organizing Committee -------------------- David Bremner Joe Horton Claudia Iturriaga Alex Lopez-Ortiz Barry Monson Brad Nickerson (all at University of New Brunswick) Questions? ========== For more information see the conference web site at http://www.cs.unb.ca/conf/cccg Or contact us by email: cccg@unb.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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Mon Feb 7 11:31:50 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.1/8.9.1) with SMTP id LAA02575 for ; Mon, 7 Feb 2000 11:31:44 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Feb 7 11:28:12 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Fri Feb 4 15:55:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Feb 4 15:54:39 EST 2000 Received: from ares.cs.Virginia.EDU ([128.143.136.41]) by dusty; Fri Feb 4 15:52:26 EST 2000 Received: from viper.cs.Virginia.EDU (viper.cs.Virginia.EDU [128.143.137.17]) by ares.cs.Virginia.EDU (8.9.2/8.9.2/UVACS-2000011700) with ESMTP id PAA20134 for ; Fri, 4 Feb 2000 15:54:35 -0500 (EST) From: David Luebke Received: (from luebke@localhost) by viper.cs.Virginia.EDU (8.9.2/8.9.2) id PAA25204 for compgeom-announce@research.bell-labs.com; Fri, 4 Feb 2000 15:54:35 -0500 (EST) Message-Id: <200002042054.PAA25204@viper.cs.Virginia.EDU> Subject: VDSlib: view-dependent polygonal simplification package To: compgeom-announce@research.bell-labs.com Date: Fri, 4 Feb 2000 15:54:35 -0500 (EST) X-Mailer: ELM [version 2.4ME+ PL65 (25)] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 2956 Lines: 58 [I recently posted the below announcement on comp.graphics.algorithms; a couple of people have since recommended that I post it to this list.] ------------------------------------------------------------------------- I'd like to announce the alpha release of VDSlib, a public-domain package for view-dependent simplification and rendering of polygonal environments: http://vdslib.virginia.edu Geometric simplification, also known as "level of detail" or "multiresolution modeling", is a well-known technique for managing scene complexity in interactive rendering. The most common approach creates several discrete levels of detail (LODs) for every object in a preprocess, and selects at run-time which LOD will represent each object based on factors such as the object's distance or size on the screen. View-dependent simplification (VDS) takes a different approach, creating a data structure which can be queried at run time to generate a simplified object spanning multiple levels of detail. Since the simplification is adjusted dynamically, it can exploit the current view parameters. For example, VDS can represent portions of a large object near the viewer with high fidelity but distant portions at low fidelity, or or render silhouette regions of an object at more detail than interior regions. VDSlib provides a software library, written in C, for the construction and rendering of view-dependent simplifications. It is designed to be extremely flexible, with a callback-based API that allows developers or researchers to plug in their own criteria for simplifying, culling, and rendering the model. VDSlib is based on the algorithm presented in the SIGGRAPH 97 paper "View-Dependent Simplification of Arbitrary Polygonal Environments" by David Luebke and Carl Erikson, with a number of improvements and refinements. This algorithm is similar in some ways to other view-dependent simplification schemes introduced independently by researches such as Hughes Hoppe (Progressive Meshes) and Xia & Varshney (Merge Trees). We hope that VDSlib, with its flexible framework, will prove useful both to 3-D developers wishing to experiment with the latest LOD techniques and to researchers interested in exploring algorithms, criteria, and metrics for view-dependent simplification. For more details, including full documentation and a sample application, please see the VDSlib web site at http://vdslib.virginia.edu. Thanks, Dave Luebke -- David Luebke, Assistant Professor University of Virginia http://www.cs.virginia.edu/~luebke Department of Computer Science luebke@cs.virginia.edu Charlottesville, VA 22903-2442 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Sat Feb 12 16:50:31 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA27046 for ; Sat, 12 Feb 2000 16:50:28 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Feb 12 16:47:27 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Fri Feb 11 10:19:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Feb 11 10:18:21 EST 2000 Received: from mail.crs4.it ([156.148.1.33]) by dusty; Fri Feb 11 10:15:59 EST 2000 Received: from crs4.it (geri.crs4.it [156.148.2.78]) by mail.crs4.it (Postfix) with ESMTP id DC8CC1132 for ; Fri, 11 Feb 2000 16:21:56 +0100 (MET) Message-ID: <38A428D2.B0624CEB@crs4.it> Date: Fri, 11 Feb 2000 16:20:50 +0100 From: Enrico Gobbetti Organization: CRS4/VVR X-Mailer: Mozilla 4.71 [en] (WinNT; I) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: Job Opening: Research position at CRS4 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 3252 Lines: 79 *** *** EXPERT LEVEL RESEARCH POSITIONS IN COMPUTER GRAPHICS *** Ref.: VVR-EXPERT-0100 URL: http://www.crs4.it/vvr/contents/announce/job_01_99 The Visualization and Virtual Reality area at CRS4 invites applications for an expert-level research position in computer graphics. The following specialties are of value to us: multiresolution modeling, geometric simplification, time-critical rendering, object-oriented technology, Eiffel, C++, OpenGL, Windows NT. The successful candidates must possess the following requirements: * University Degree, preferrably MSc or Ph.D., in Computer Science or related fields; * Considerable research and development experience in the field of computer graphics; * Theoretical and practical background in geometric modeling; * A good understanding of component based object-oriented programming technology. Good communication skill, attitude to work in group, and some previous experience in international projects complete the profile of the successful candidate, that will immediatly start working on one of the projects of the group. In particular, the candidate is expected to provide a leading contribution to the development of software components for multiresolution modeling and simplification in the context of a three-year European project. A two year renewable contract will be offered, with salary depending on the demonstrated expertise of the successful candidate. This offer of employment is in accordance with the current Italian "Contratto Collettivo Nazionale di Lavoro per l'industria Metalmeccanica Privata". CRS4 is an interdisciplinary research center established in 1991 and located near Cagliari (Sardinia, Italy). Its activities encompass many areas related to computational science and information technology. The Center currently has a staff of about 90 researchers and has outstanding facilities. CRS4 provides a stimulating work environment for highly motivated individuals. Further information about CRS4's Visualization and Virtual Reality group can be obtained on the Internet at: http://www.crs4.it/vvr. The position is available immediately and applications will be accepted until the position is filled. Applicants should send a resume, including a cover letter quoting Ref. VVR-EXPERT-0100, to: Dr. Fabio Bettio CRS4 VI Strada Ovest, Z.I. Macchiareddu C.P. 94 I-09010 Uta (CA), Italy. E-mail: fabio@crs4.it Fax : +39 070 2796 216 Electronic submissions (in HTML, ASCII, PDF, or PostScript) are strongly encouraged. -- --------------------------------------------------------------------- Enrico Gobbetti Head, Visualization and Virtual Reality Group CRS4, VI Str. Ovest, ZI Macchiareddu, CP 94, I-09010 Uta (CA), Italy E-mail: Enrico.Gobbetti@crs4.it WWW: http://www.crs4.it/~gobbetti Phone: +39 070 2796 318 Fax: +39 070 2796 216 --------------------------------------------------------------------- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Sat Feb 12 16:50:33 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA27050 for ; Sat, 12 Feb 2000 16:50:30 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Feb 12 16:46:23 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Thu Feb 10 11:59:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Feb 10 11:58:04 EST 2000 Received: from disi.unige.it ([130.251.61.19]) by dusty; Thu Feb 10 11:55:45 EST 2000 Received: (from magillo@localhost) by disi.unige.it (8.8.8/8.8.8) id RAA23472 for compgeom-announce@research.bell-labs.com; Thu, 10 Feb 2000 17:57:06 +0100 (MET) Date: Thu, 10 Feb 2000 17:57:06 +0100 (MET) From: Paola Magillo Message-Id: <200002101657.RAA23472@disi.unige.it> To: compgeom-announce@research.bell-labs.com Subject: Multi-Tesselation (MT) package available Precedence: bulk Status: RO Content-Length: 2347 Lines: 56 We are pleased to announce the distribution of the Multi-Tesselation (MT) package. For information and downloading, see: http://www.disi.unige.it/person/MagilloP/MT/index.html The MT package is a dimension-independent package for the representation and manipulation of spatial objects as simplicial complexes at multiple resolutions. It allows the design of interactive applications which exploit the full power of multiresolution on geometric objects represented by meshes in any dimension. The MT Package is fully parametric on: - The dimension of the mesh (e.g., a surface made of triangles, a volume made of tetrahedra, and any higher dimensional complex made of simplexes); - The dimension on the embedding space; - Any attribute that you wish to store at the vertices and at the cells of your mesh; - Any criterion that you wish to adopt in order to extract meshes at variable resolution from the multiresolution model. With the MT package, you can: - Manage multiresolution the way you like: you just have to specify the attributes you wish to include and the condition to test the resolution. - Use your own simplification code to build the multiresolution model: you just have to include commands provided by a class in the library. The MT Package also contains some off-the-shelf programs, which can be either used directly, or adopted as templates to write new applications: - Programs to build multiresolution models of terrains and surfaces; - Demo programs using the MT library to fly over a terrain, and to analyze an object by interactively using a magic lens. - Documentation and guidelines are included in the distribution. The library is written in ANSI C++ and has been tested under Unix on PC (Linux), and Silicon Graphics (Irix). Please send any questions or comments to magillo@disi.unige.it --------------------------------------------- Paola Magillo DISI - University of Genova Via Dodecaneso 35 - 16146 Genova (Italy) Phone: +39-010-353-6705 Fax: +39-010-353-6699 Email: magillo@disi.unige.it --------------------------------------------- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Sat Feb 12 16:50:35 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA27054 for ; Sat, 12 Feb 2000 16:50:32 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Feb 12 16:47:20 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Fri Feb 11 07:13:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Feb 11 07:12:05 EST 2000 To: compgeom-announce@research.bell-labs.com Received: from zeus.cc.ucy.ac.cy ([194.42.1.1]) by dusty; Fri Feb 11 07:09:45 EST 2000 Received: from ada.cs.ucy.ac.cy (ada.cs.ucy.ac.cy [194.42.10.200]) by zeus.cc.ucy.ac.cy (8.9.3/8.9.3) with ESMTP id OAA219558; Fri, 11 Feb 2000 14:01:32 +0200 Date: Fri, 11 Feb 2000 14:15:38 +0200 (WET) From: George Angelos Papadopoulos Reply-To: george@cs.ucy.ac.cy Subject: Job Announcement -- C.S. Dept. -- Univ. of Cyprus Message-ID: Organization: Department of Computer Science - University of Cyprus Address: 75 Kallipoleos Str. -- POB 20537 -- CY-1678 -- Nicosia -- Cyprus Tel: +357-2-892242 -- Fax: +357-2-339062 URL: http://www.cs.ucy.ac.cy/~george MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 2548 Lines: 67 DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF CYPRUS VISITING PROFESSORSHIPS The Department of Computer Science at the University of Cyprus has a number of vacancies for visiting professors at the ranks of Assistant, Associate, and Full Professor. ALL fields of study will be considered, but preference will be given to applicants associated with one or more of the following ones: * Computer Architecture * Parallel and Distributed Processing * Programming Languages * Multimedia Information Systems * Data Communication Networks * Artificial Intelligence * Software Engineering * Database Systems A new M.Sc. course on "Advanced Information Technologies" will commence next September and the successful applicants will therefore have the opportunity to teach at both the undergraduate and graduate levels. A visiting appointment is usually for one semester (Spring semester: Jan-June; Winter semester: Sept-Dec), but it can be renewed for up to four semesters. Applicants should hold a Ph.D. in a relevant subject, have post Ph.D. experience, and BE FLUENT IN GREEK (both these requirements are mandatory). The annual salaries for these positions (including the 13th salary) are: Professor (Scale A15-A16) CYP 25.479 - 33.120 Associate Professor (Scale A14-A15) CYP 22.473 - 30.636 Assistant Professor (Scale A13-A14) CYP 20.966 - 28.288 Lecturer (Scale A12-A13) CYP 17.706 - 25.933 (At present CYP 1 = 1.1 sterling and CYP 1 = 1.80 U.S. dollars). Presently, the Department is seeking applications for the winter and spring semesters of the academic year 2000-2001. The processing of applications will start on the 1st May 2000 and will continue until all the available positions have been filled. Anyone wishing to apply should send a full CV to the following address: The Chairperson Department of Computer Science University of Cyprus 75 Kallipoleos Street P.O. Box 20537, CY-1678 Nicosia, CYPRUS For more details and other information, interested individuals may contact the Chairperson of the Department of Computer Science: Associate Professor Antonis Kakas Tel: +357-2-892238, Fax: +357-2-339062, E-mail: antonis@ucy.ac.cy ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Feb 16 14:07:59 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id OAA04174 for ; Wed, 16 Feb 2000 14:07:56 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Feb 16 14:04:18 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon Feb 14 13:21:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Feb 14 13:20:22 EST 2000 Received: from midgard.umiacs.umd.edu ([128.8.120.136]) by dusty; Mon Feb 14 13:18:02 EST 2000 Received: from [128.8.122.59] (baldur.umiacs.umd.edu [128.8.122.59]) by midgard.umiacs.umd.edu (8.9.3/8.9.1) with ESMTP id NAA19662 for ; Mon, 14 Feb 2000 13:20:13 -0500 (EST) X-Sender: deflo@midgard.umiacs.umd.edu Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Mon, 14 Feb 2000 13:20:12 -0500 To: compgeom-announce@research.bell-labs.com From: Leila De Floriani Subject: postdoc and Ph.D. positions available Precedence: bulk Status: RO Content-Length: 2463 Lines: 63 Postdoc and PhD positions Several temporary positions, both doctoral and post-doctoral, are now available within a new EU research training network called MINGLE (Multiresolution in Geometric Modelling). These positions will normally be between 6 months and two years in duration and will provide an excellent opportunity to gain research experience abroad. The main objective of the project is to train young European researchers, both in mathematics and computer science, in various aspects of multiresolution in geometric modelling. Relevant research topics include: hierarchical decomposition of triangulations, generation of smooth surfaces from irregular triangle meshes, thinning, decimation, compression of meshes, remeshing, wavelets, application of multiresolution representations to computer graphics, and data structures and algorithms for storage and manipulation. MINGLE will run from 2000 to 2003 and involves research teams from the following nine partners: SINTEF Applied Mathematics, Norway Contact: Michael Floater Tel Aviv University, Israel Contact: Nira Dyn Munich University of Technology, Germany Contact: Armin Iske Technion, Israel Contact: Craig Gotsman Max Planck Institute, Saarbrucken, Germany Contact: Hans-Peter Seidel Joseph Fourier University, Grenoble, France Contact: George-Pierre Bonneau University of Cambridge, UK Contact: Neil Dodgson University of Genova, Italy Contact: Leila De Floriani Systems in Motion AS, Norway Contact: Paal-Robert Engnaes Further details are available on the webpage http://www.oslo.sintef.no/mingle/ (especially concerning the eligibility rules). If you consider making an application, please contact the partner or partners you are interested in. Women are especially encouraged to apply. For general enquiries about MINGLE, please contact the coordinating partner via Michael Floater (mif@math.sintef.no) or Ewald Quak (ewq@math.sintef.no). ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Feb 16 14:08:26 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id OAA04200 for ; Wed, 16 Feb 2000 14:08:22 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Feb 16 14:04:55 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Sun Feb 13 15:07:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sun Feb 13 15:06:40 EST 2000 Received: from duke.cs.duke.edu ([152.3.140.1]) by dusty; Sun Feb 13 15:04:19 EST 2000 Received: from polya.cs.duke.edu (polya.cs.duke.edu [152.3.140.71]) by duke.cs.duke.edu (8.9.3/8.9.3) with ESMTP id PAA11988; Sun, 13 Feb 2000 15:06:33 -0500 (EST) From: Pankaj Kumar Agarwal Received: (pankaj@localhost) by polya.cs.duke.edu (8.8.5/8.6.9) id PAA02413; Sun, 13 Feb 2000 15:06:32 -0500 (EST) Date: Sun, 13 Feb 2000 15:06:32 -0500 (EST) Message-Id: <200002132006.PAA02413@polya.cs.duke.edu> To: DMA-LIST@NIC.SURFNET.NL, THEORY-A@LISTSERV.NODAK.EDU, compgeom-announce@research.bell-labs.com Subject: SCG'00: List of Accepted Papers Precedence: bulk Status: RO Content-Length: 4229 Lines: 143 SCG'00: LIST OF ACCEPTED PAPERS =============================== Theory Track ------------ Point sets with many k-sets Geza Toth Testing the congruence of $d$-dimensional point sets Peter Brass and Christian Knauer Sweep Algorithms for Constructing Higher-Dimensional Constrained Delaunay Triangulations Jonathan Richard Shewchuk An Improved bound for $k$-Sets in Three Dimensions Micha Sharir and Shakhar Smorodinsky and Gabor Tardos Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus Timothy M. Chan Origin-Embracing Distributions or A Continuous Analogue of the Upper Bound Theorem Uli Wagner and Emo Welzl Surface reconstruction simplified Nina Amenta, Sunghee Choi, Tamal K. Dey and Naveen Leekha Random Sampling in Geometric Optimization: New Insights and Applications Bernd Gaertner and Emo Welzl Cutting glass Janos Pach and Gabor Tardos Reachability by paths of bounded curvature in convex polygons Hee-kap Ahn and Otfried Cheong and Jiri Matousek and Antoine Vigneron Linear-Time Polygon Triangulation Made Easy Via Randomization Nancy M. Amato and Michael T. Goodrich and Edgar A. Ramos Kinetic Connectivity for Unit Disks Leonidas Guibas and John Hershberger and Subhash Suri and Li Zhang Exact and Efficient Unions of balls. Nina Amenta and Ravi Kolluri When Crossings Count - Approximating the Minimum Spanning Tree Sariel Har-Peled and Piotr Indyk Multivariate regression depth Marshall Bern and David Eppstein The 2-Center Problem with Obstacles Dan Halperin and Micha Sharir and Ken Goldberg I/O-Efficient Dynamic Planar Point Location Lars Arge and Jan Vahrenhold Kinetic Collision Detection for Simple Polygons David Kirkpatrick and Jack Snoeyink and Bettina Speckmann Point Set Labeling with Specified Positions Srinivas Doddi and Madhav V. Marathe and Bernard M.E. Moret A Helly-type theorem for hyperplane transversals to well-separated convex sets Boris Aronov and Jacob E. Goodman and Richard Pollack and Rephael Wenger On the continuous Weber and k-means problems S.P.Fekete and J.S.B.Mitchell and K.Weinbrecht Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes Edgar A. Ramos Delaunay Triangulations and Voronoi Diagrams for Riemannian Greg Leibon and David Letscher A Trace Bound for the Hereditary Discrepancy Bernard Chazelle and Alexey Lvov Linear Programming Queries Revisited Edgar A. Ramos Applied Track ------------- Smooth shape reconstruction Jean-Daniel Boissonnat and Frederic Cazals An algorithm for searching a polygonal region with a flashlight Steven M. Lavalle and Borislav Simov and Giora Slutzki Fast Software for Box Intersections Afra Zomorodian and Herbert Edelsbrunner Computing with Minkowski sums Ioannis Z Emiris Algebraic methods and arithmetic filtering for exact predicates on circle arcs Olivier Devillers and Alexandra Fronville and Bernard Mourrain and Monique Teillaud Reconstructing curves with sharp corners Tamal K. Dey and Rafe Wenger Densest Translational Lattice Packing of Non-Convex Polygons Victor J. Milenkovic Pitfalls in Computing with Pseudorandom Determinants Bernd Gaertner LOOK - A Lazy Object-Oriented Kernel for Geometric Computation Stefan Funke Computing Approximate Shortest Paths on Convex Polytopes Pankaj K. Agarwal and Sariel Har-Peled and Meetesh Karia Voronoi-based interpolation with higher continuity Hisamoto Hiyoshi and Kokichi Sugihara Mesh Generation for Domains with Small Angles Jonathan Richard Shewchuk Triangulations in CGAL J. D. Boissonnat and O. Devillers and M. Teillaud and M. Yvinec An Efficient, Exact, and Generic Quadratic Programming Solver for Geometric Optimization Bernd Gaertner and Sven Schoenherr Improving the Surface Cycle Structure for Hexahedral Mesh Generation Matthias Mueller-Hannemann The Analysis of a Simple k-Means Clustering Algorithm T. Kanungo and D. M. Mount and N. S. Netanyahu and C. Piatko and R. Silverman and A. Y. Wu ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Feb 23 15:22:04 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id PAA11133 for ; Wed, 23 Feb 2000 15:22:01 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Feb 23 15:19:08 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Wed Feb 16 23:47:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Feb 16 23:45:35 EST 2000 Received: from desh.cse.iitd.ernet.in ([202.141.68.3]) by dusty; Wed Feb 16 23:43:11 EST 2000 Received: from cse.iitd.ernet.in (root@revati.cse.iitd.ernet.in [10.20.13.26]) by desh.cse.iitd.ernet.in (8.8.7/8.8.7) with ESMTP id JAA00524; Thu, 17 Feb 2000 09:58:35 +0530 Received: (from sanjiva@localhost) by cse.iitd.ernet.in (8.9.3/8.9.3) id JAA00952; Thu, 17 Feb 2000 09:57:53 +0530 Date: Thu, 17 Feb 2000 09:57:53 +0530 Message-Id: <200002170427.JAA00952@cse.iitd.ernet.in> X-Authentication-Warning: revati.cse.iitd.ernet.in: sanjiva set sender to sanjiva@revati.cse.iitd.ernet.in using -f From: Sanjiva Prasad To: DMANET@math.utwente.nl, acclaim@sics.se, amast@cs.utwente.nl, arpanet-bboards@mc.lcs.mit.edu, categories@mta.ca, cav-all@csa.cs.technion.ac.il, cipher@itd.nrl.navy.mil, clp@iscs.nus.sg.cse.iitd.ernet.in, concurrency-request@cwi.nl, conf@FIZ-Karlsruhe.DE, cs-logic@cs.indiana.edu, csp-list@saturne.cert.fr.cse.iitd.ernet.in, dbworld@cs.wisc.edu, dma-list@nic.surfnet.nl, eacsl@dimi.uniud.it, eapls@mailbase.ac.uk, eatcs-it@cs.unibo.it, eccc@eccc.uni-trier.de, facs@lboro.ac.uk, fm-info@air16.larc.nasa.gov, formal-methods@cs.uidaho.edu, info-hol@leopard.cs.byu.edu, isabelle-users@cl.cam.ac.uk, kgs@logic.tuwien.ac.at, lambda-usergroup@dcs.ed.ac.uk, lfcs-interest@dcs.ed.ac.uk, lics@research.bell-labs.com, lics-request@sun5.mathematik.uni-freiburg.de, logic-request@cs.cornell.edu, logic@theory.lcs.mit.edu, lprolog@central.cis.upenn.edu, mfpsmail@math.tulane.edu, objecttypes@daimi.aau.dk, PetriNets@daimi.aau.dk, procos-list@comlab.ox.ac.uk, proof-request@cs.chalmers.se, pvs@csl.sri.com, qed@mcs.anl.gov, reflection@p300.cpl.uiuc.edu, rewriting@loria.fr, sicstus-users@sics.se, softverf@xsun.sdct.itl.nist.gov, theorem-provers@mc.lcs.mit.edu, theory-logic@cs.cmu.edu, theorynt@listserv.nodak.edu, compgeom-announce@research.bell-labs.com Subject: FST TCS 2000 --- cfpo ascii version -- Precedence: bulk Status: RO Content-Length: 6584 Lines: 190 [ apologies for multiple copies. - SP ] *********************************************************************** * * * FST TCS 2000 * * * * Foundations of Software Technology and Theoretical Computer Science * * December 13--15, 2000 * * New Delhi, India * * * *********************************************************************** * Call for Papers * *********************************************************************** IARCS, the Indian Association for Research in Computing Science, announces the 20th Annual FST TCS Conference in New Delhi. Tentatively planned satellite events include include two workshops: on Computational Geometry and on Advances in Programming Languages. Authors are invited to submit papers presenting original and unpublished research on **any** theoretical aspects of Computer Science. Papers in applied areas with a strong foundational emphasis are also welcome. The proceedings of the last six years' conferences (Springer-Verlag Lecture Notes in Computer Science volumes 880, 1026, 1180, 1346, 1530, 1738) give an idea of the kind of papers typically presented at FST TCS. Typical areas include (but are not restricted to): Automata, Languages and Computability Randomized and Approximation Algorithms Computational Geometry Computational Biology Combinatorial Optimization Graph and Network Algorithms Complexity Theory Parallel and Distributed Computing New Models of Computation Concurrent, Real-time and Hybrid Systems Logics of Programs and Modal Logics Database Theory and Information Retrieval Automated Reasoning, Rewrite Systems, and Applications Logic, Proof Theory, Model Theory and Applications Semantics of Programming Languages Static Analysis and Type Systems Theory of Functional and Constraint-based Programming Software Specification and Verification Cryptography and Security Protocols For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. Important Dates --------------- Deadline for Submission 31 May, 2000 Notification to Authors 15 August, 2000 Final Version of Accepted Papers due 15 September, 2000 Deadline for Early Registration 15 November, 2000 Submission Guidelines - --------------------- Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 A4-size pages, with 1.5 inch top margin and other margins 1 inch wide with 11 point or larger font. Authors who feel that more details are necessary may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should contain a short abstract. If available, e-mail addresses and fax numbers of the authors should be included. Electronic Submissions - ---------------------- Electronic submission is strongly encouraged. Self-contained uuencoded gzipped Postscript versions of the paper may be sent by e-mail to fsttcs20@cse.iitd.ernet.in In addition, the following information in ASCII format should be sent to this address in a **separate** e-mail: Title; authors; communicating author's name, address, and e-mail address and fax number if available; abstract of paper. Hard-Copy Submissions - --------------------- If electronic submission is not possible, authors may submit five (5) hard-copies of the paper by post to the following address: FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas New Delhi 110 016 INDIA Invited Speakers ---------------- Invited Speakers who have confirmed participation include: Peter Buneman (U Penn) Bernard Chazelle (Princeton) E. Allen Emerson (U Texas, Austin) Philip Wadler (Bell Labs) Programme Committee ------------------- Pankaj Agarwal (Duke) Manindra Aggarwal (IIT, Kanpur) Tetsuo Asano (JAIST) Vijay Chandru (IISc, Bangalore) Rance Cleaveland (Stony Brook) Anuj Dawar (Cambridge) Madhavan Mukund (CMI, Chennai) Sampath Kannan (AT&T Research) Sanjiv Kapoor (IIT, Delhi) (Co-chair) Kamal Lodaya (IMSc, Chennai) Gopalan Nadathur (U Chicago) Seffi Naor (Bell Labs and Technion) Tobias Nipkow (TU Munich) Luke Ong (Oxford) C. Pandurangan (IIT, Madras) Paritosh Pandya (TIFR) Benjamin Pierce (U Penn) Sanjiva Prasad (IIT, Delhi) (Co-chair) Sridhar Rajgopal (IBM, Almaden) A. Ranade (IIT, Bombay) Dave Sands (Chalmers) A Prasad Sistla (U Illinois, Chicago) Michiel Smid (Magdeburg) Mandayam K. Srivas (SRI) Organized by ------------ Indian Institute of Technology, Delhi Hauz Khas, New Delhi 100 016. Organzing Committee ------------------- Sandeep Sen (chair) Naveen Garg (treasurer) S N Maheshwari Conference Site --------------- The Conference will take place at the India International Centre, 40 Lodhi Estate, Max Mueller Marg, New Delhi 110 003. Correspondence Address ---------------------- All correspondence regarding submissions may be addressed to FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas, New Delhi 110 016, INDIA Email: fsttcs20@cse.iitd.ernet.in Fax: +91 11 686 8765 Phone: +91 11 659 1294 / 659 1286 URL: http://www.cse.iitd.ernet.in/~fsttcs20 -- Sanjiva Prasad Associate Professor Department of Computer Science and Engineering sanjiva@cse.iitd.ernet.in Indian Institute of Technology, Delhi (Off) +91 11 659 1294 Hauz Khas, New Delhi 110016 (Res) +91 11 659 1684 INDIA (Fax) +91 11 686 8765 http://www.cse.iitd.ernet.in/~sanjiva ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Sun Mar 5 19:49:57 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id TAA03452 for ; Sun, 5 Mar 2000 19:49:55 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sun Mar 5 19:45:58 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Thu Mar 2 23:35:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Mar 2 23:33:33 EST 2000 Received: from vampire.minmet.uq.edu.au ([130.102.168.4]) by dusty; Thu Mar 2 23:31:02 EST 2000 Received: from sturgess.minmet.uq.edu.au (mmpg55.minmet.uq.edu.au [130.102.112.155]) by vampire.minmet.uq.edu.au with SMTP (Microsoft Exchange Internet Mail Service Version 5.5.2650.21) id FPRHLPFB; Fri, 3 Mar 2000 14:36:16 +1000 Message-Id: <3.0.1.32.20000303143409.0072975c@vampire.minmet.uq.edu.au> X-Sender: sturgess@vampire.minmet.uq.edu.au X-Mailer: Windows Eudora Light Version 3.0.1 (32) Date: Fri, 03 Mar 2000 14:34:09 +1000 To: compgeom-discuss@research.bell-labs.com From: Sam Sturgess Subject: circumsphere Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Precedence: bulk Status: RO Content-Length: 1292 Lines: 40 Hi I got this email address from the follwing web page http://www.ics.uci.edu/~eppstein/junkyard/circumcenter.html I was looking for exactly what the question asks, ie I am searching for a numerically stable algorithm to calculate the radius r (and perhaps the center m) of the circumsphere of a tetrahedron in three dimensions, given by the coordinates of the vertices a, b, c, d in R^3. I am using the formula in a Delaunay Tessellation of a randomly packed bed of spheres. Having worked through the formula given though I am confused, as for a simple tetrahedron with vertex coordinates a(0,0,00 b(0,1,0) c(0,0,1) d(1,0,0) I found the centre to lie outside the tetrahedron at (0.5,0.5,0.5). If you could explain this I'd greatly appreciate it. Otherwise if you know of any references (such as a geometry text) that contains such a formula and relevant explanations then I appreciate that as well. Thank-you Sam Sturgess (Masters Research) Dept Mining Mineral Materials Engineering University of Qld, Australia ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Mar 9 14:52:12 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id OAA23663 for ; Thu, 9 Mar 2000 14:52:07 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Mar 9 14:51:47 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon Mar 6 05:49:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Mar 6 05:48:42 EST 2000 Received: from eerie.site-eerie.ema.fr ([146.19.2.1]) by dusty; Mon Mar 6 05:46:09 EST 2000 Received: from maileerie.site-eerie.ema.fr (maileerie [146.19.1.3]) by eerie.site-eerie.ema.fr (8.9.3/8.9.1) with ESMTP id LAA00447 for ; Mon, 6 Mar 2000 11:48:11 +0100 (MET) Received: from site-eerie.ema.fr (gate-gw [146.19.1.21]) by maileerie.site-eerie.ema.fr (8.9.3/8.9.1) with ESMTP id LAA29794; Mon, 6 Mar 2000 11:56:00 +0100 (MET) Message-ID: <38C38D18.8D4E440@site-eerie.ema.fr> Date: Mon, 06 Mar 2000 11:48:56 +0100 From: aupetit X-Mailer: Mozilla 4.61 [en] (WinNT; I) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com, aupetit@eerie.site-eerie.ema.fr Subject: Approximate the Natural Neighbors... Content-Type: text/plain; charset=iso-8859-1 X-MIME-Autoconverted: from 8bit to quoted-printable by eerie.site-eerie.ema.fr id LAA00447 Precedence: bulk Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by duke.cs.duke.edu id OAA23663 Status: RO X-Status: A Content-Length: 830 Lines: 27 Hi, I am working in the field of artificial Neural Networks. I'd like to use Natural Neighbors interpolation techniques in that field but I come up against a difficulty: the dimension of the data space is quite high (for example 10 dimensions) and so it seems that NN are not a feasible technique in such a case. Does it exist a method to approximate the natural neighbors and eventually to approximate the natural neighbors coordinates in the case of high-dimensional spaces? Thank you Best regards Mishaël Aupetit PhD Student in Neural Networks LGI2P-EMA, France ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Mar 9 14:57:44 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id OAA23922 for ; Thu, 9 Mar 2000 14:57:40 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Mar 9 14:55:51 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Thu Mar 9 05:13:03 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Mar 9 05:12:40 EST 2000 Received: from gem.dcs.warwick.ac.uk ([137.205.227.1]) by dusty; Thu Mar 9 05:10:04 EST 2000 Received: (from msp@localhost) by gem.dcs.warwick.ac.uk (8.9.3/8.9.1) id KAA23898; Thu, 9 Mar 2000 10:12:28 GMT Date: Thu, 9 Mar 2000 10:12:28 GMT From: Mike Paterson Message-Id: <200003091012.KAA23898@gem.dcs.warwick.ac.uk> To: compgeom-announce@research.bell-labs.com Cc: msp@dcs.warwick.ac.uk Subject: ESA - Call for Papers Precedence: bulk Status: RO Content-Length: 776 Lines: 22 ESA 2000 - Final Call 8th Annual European Symposium on Algorithms 5 - 8 September 2000 Max-Planck-Institut fu"r Informatik, Saarbru"cken, Germany Submission Deadline March 26, 2000 A detailed description of the submission process is available at http://www.mpi-sb.mpg.de/~conf2000/esa2000/subm.html/. For more information see http://www.mpi-sb.mpg.de/~conf2000/esa2000/ or contact Mike Paterson (msp@dcs.warwick.ac.uk). ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Sun Mar 12 19:53:20 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id TAA07302 for ; Sun, 12 Mar 2000 19:53:17 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Mar 12 19:48:55 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Fri Mar 10 16:37:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Mar 10 16:36:23 EST 2000 Received: from swarm.cs.wustl.edu ([128.252.165.116]) by dusty; Fri Mar 10 16:33:44 EST 2000 Received: (from roman@localhost) by swarm.cs.wustl.edu (980427.SGI.8.8.8/980728.SGI.AUTOCF) id PAA74963 for compgeom-announce@research.bell-labs.com; Fri, 10 Mar 2000 15:36:15 -0600 (BLT) Date: Fri, 10 Mar 2000 15:36:15 -0600 (BLT) From: roman@swarm.cs.wustl.edu (Catalin Roman) Message-Id: <200003102136.PAA74963@swarm.cs.wustl.edu> To: compgeom-announce@research.bell-labs.com Subject: COORDINATION 2000 (Second Call for Papers) Precedence: bulk Status: RO Content-Length: 6707 Lines: 154 Second Call for Papers COORDINATION 2000 Fourth International Conference on Coordination Models and Languages Limassol, Cyprus 11-13 September 2000 The need for increased programmer productivity and rapid development of complex systems provide the pragmatic motivation for the development of coordination languages and models. The intellectual excitement associated with such endeavors is rooted in the decades-old desire to leverage off increasingly higher levels of abstractions. Coordination-based methods provide a clean separation between individual software components and their interaction within the overall software organization. This separation makes large applications more tractable, supports global analysis, and enhances reuse of software. Building on the success of the last three editions, this conference provides a forum for the growing community of researchers interested in models, languages, and implementation techniques for coordination. Topics Topics of interest include (but are not limited to): * Theoretical models and foundations for coordination: component composition, concurrency, mobility, dynamic aspects of coordination. * Specification, refinement, and analysis of software architectures: patterns and styles, verification of functional and non-functional properties. * Coordination, architectural, and interface definition languages: implementation, interoperability, heterogeneity. * Agent-oriented languages: formal models for interacting agents. * Dynamic software architectures: mobile agents, configuration, reconfiguration. * Tools and environments for the development of coordinated applications: integration within the development process. * Industrial relevance of coordination and software architectures: programming in the large, domain-specific software architectures and coordination models, case studies. Proceedings The conference proceedings will be published by Springer, in the LNCS (Lecture Notes in Computer Science) series. Proceedings of the previous editions of this conference are also available in the LNCS series: volumes 1061, 1282 and 1594. Submission Instructions Authors are invited to submit full papers (in English, up to 6000 words) electronically in PostScript or PDF using a two phase online submission process. First, registration of the paper and an abstract of no more than 250 words must be complete before 7 April 2000. After successfully completeing this, you will receive a url through which to submit your paper, due no later than 14 April 2000. The authors' instructions provided by Springer should be followed. A link can be found from the conference web page. Simultaneous or similar submissions to other conferences or journals are not allowed. Submissions should explicitly state their contribution and their relevance to the theme of the conference. Other criteria for selection will be originality, significance, correctness, and clarity. Conference Location The conference will be held in Limassol, the most popular and lively city of Cyprus, which is located on the southern coast of the island. The conference venue will be a five-star hotel on the coast. Important Dates Pre-submission abstracts 7 Apr 2000 Full paper submissions 14 Apr 2000 Notification of acceptance 14 Jun 2000 Camera-ready version 7 Jul 2000 Program co-chairs António Porto Gruia-Catalin Roman New University of Lisbon, Portugal Washington University in St. Louis, ap@di.fct.unl.pt USA http://www-gloc.di.fct.unl.pt/~ap roman@cs.wustl.edu http://www.cs.wustl.edu/~roman Organizing Chair George A. Papadopoulos University of Cyprus george@cs.ucy.ac.cy http://www.cs.ucy.ac.cy/papadopo.html Program Committee (excluding co-chairs) Gul Agha U. Illinois, Jean-Marie Jacquet George Papadopoulos Urbana-Champaign, USA U. Namur, Belgium U. Cyprus, Cyprus jmj@info.fundp.ac.be george@cs.ucy.ac.cy agha@cs.uiuc.edu Edwin de Jong Rick Schlichting Farhad Arbab Signaal, The U. Arizona, USA CWI, The Netherlands Netherlands rick@cs.arizona.edu Farhad.Arbab@cwi.nl edejong@signaal.nl Katia Sycara Lubomir Bic Joost Kok Carnegie Mellon U., USA U. California, U. Leiden, The Katia.Sycara@cs.cmu.edu Irvine, USA Netherlands bic@ics.uci.edu joost@wi.leidenuniv.nl John Thomas Cruzio, USA GianLuigi Ferrari Jose Meseguer jthomas@cruzio.com U. Pisa, Italy SRI, USA giangi@di.unipi.it meseguer@csl.sri.com Robert Tolksdorf T.U. Berlin, Germany José Luiz Fiadeiro Naftaly Minsky tolk@cs.tu-berlin.de U. Lisbon, Portugal Rutgers U., USA llf@di.fc.ul.pt minsky@cs.rutgers.edu Alan Wood U. York, UK Roberto Gorrieri Antonio Natali wood@cs.york.ac.uk U. Bologna, Italy U. Bologna, Italy gorrieri@cs.unibo.it anatali@deis.unibo.it Daniel Yankelevich Pragma Consultores, Paola Inverardi Rocco De Nicola Argentina U. l'Aquila, Italy U. Firenze, Italy dyankele@pragma.com.ar inverard@univaq.it denicola@dsi.unifi.it Sponsorship This conference is officially sponsored by the Esprit Working Group 24512 Coordina. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Sun Mar 12 19:53:22 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id TAA07306 for ; Sun, 12 Mar 2000 19:53:19 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Mar 12 19:48:19 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Fri Mar 10 13:35:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Mar 10 13:33:25 EST 2000 Received: from alpha.xerox.com ([13.1.64.93]) by dusty; Fri Mar 10 13:30:46 EST 2000 Received: from gratiano.parc.xerox.com ([13.2.116.55]) by alpha.xerox.com with SMTP id <68087(1)>; Fri, 10 Mar 2000 10:33:20 PST Received: by gratiano.parc.xerox.com id <34095>; Fri, 10 Mar 2000 10:28:58 PST From: Marshall Bern To: compgeom-announce@research.bell-labs.com Subject: Theory jobs at Xerox PARC Cc: bern@parc.xerox.com, goldberg@parc.xerox.com X-Sun-Charset: US-ASCII Message-Id: <00Mar10.102858pst."34095"@gratiano.parc.xerox.com> Date: Fri, 10 Mar 2000 10:33:20 PST Precedence: bulk Status: RO Content-Length: 1163 Lines: 30 The Xerox PARC theoretical computer science group is now interviewing for a researcher and a programmer/algorithm designer. Current projects include robust statistics, data compression, and document scanning, improvement, and authentication. The researcher candidate must have a Ph.D. in computer science or a related field, and have a demonstrated record of developing new theoretical techniques to solve applied problems. The programmer candidate must have a strong programming background and a B.S., M.S., or Ph.D. in computer science or a related field (e.g., mathematics or statistics). The programming position would be a good opportunity for a "pre-doc" to try out research. To apply, send a current resume and names of 3 references to Dr. Marshall Bern Xerox PARC 3333 Coyote Hill Rd. Palo Alto, CA 94304 USA bern@parc.xerox.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/maillist.html. From compgeom-owner@research.bell-labs.com Thu Mar 16 15:44:48 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id PAA11499 for ; Thu, 16 Mar 2000 15:44:46 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Mar 16 15:40:38 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Tue Mar 14 17:33:07 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Mar 14 17:31:24 EST 2000 Received: from swarm.cs.wustl.edu ([128.252.165.116]) by dusty; Tue Mar 14 17:31:23 EST 2000 Received: (from roman@localhost) by swarm.cs.wustl.edu (980427.SGI.8.8.8/980728.SGI.AUTOCF) id QAA21113 for compgeom-announce@research.bell-labs.com; Tue, 14 Mar 2000 16:31:08 -0600 (BLT) Date: Tue, 14 Mar 2000 16:31:08 -0600 (BLT) From: roman@swarm.cs.wustl.edu (Catalin Roman) Message-Id: <200003142231.QAA21113@swarm.cs.wustl.edu> To: compgeom-announce@research.bell-labs.com Subject: COORDINATION 2000 (Second Call for Papers - updated) Precedence: bulk Status: RO Content-Length: 6707 Lines: 160 Please note the updated URL... ---- Second Call for Papers COORDINATION 2000 Fourth International Conference on Coordination Models and Languages Limassol, Cyprus 11-13 September 2000 http://www-gloc.di.fct.unl.pt/coord00/ The need for increased programmer productivity and rapid development of complex systems provide the pragmatic motivation for the development of coordination languages and models. The intellectual excitement associated with such endeavors is rooted in the decades-old desire to leverage off increasingly higher levels of abstractions. Coordination-based methods provide a clean separation between individual software components and their interaction within the overall software organization. This separation makes large applications more tractable, supports global analysis, and enhances reuse of software. Building on the success of the last three editions, this conference provides a forum for the growing community of researchers interested in models, languages, and implementation techniques for coordination. Topics Topics of interest include (but are not limited to): * Theoretical models and foundations for coordination: component composition, concurrency, mobility, dynamic aspects of coordination. * Specification, refinement, and analysis of software architectures: patterns and styles, verification of functional and non-functional properties. * Coordination, architectural, and interface definition languages: implementation, interoperability, heterogeneity. * Agent-oriented languages: formal models for interacting agents. * Dynamic software architectures: mobile agents, configuration, reconfiguration. * Tools and environments for the development of coordinated applications: integration within the development process. * Industrial relevance of coordination and software architectures: programming in the large, domain-specific software architectures and coordination models, case studies. Proceedings The conference proceedings will be published by Springer, in the LNCS (Lecture Notes in Computer Science) series. Proceedings of the previous editions of this conference are also available in the LNCS series: volumes 1061, 1282 and 1594. Submission Instructions Authors are invited to submit full papers (in English, up to 6000 words) electronically in PostScript or PDF using a two phase online submission process. First, registration of the paper and an abstract of no more than 250 words must be complete before 7 April 2000. After successfully completeing this, you will receive a url through which to submit your paper, due no later than 14 April 2000. The authors' instructions provided by Springer should be followed. A link can be found from the conference web page. Simultaneous or similar submissions to other conferences or journals are not allowed. Submissions should explicitly state their contribution and their relevance to the theme of the conference. Other criteria for selection will be originality, significance, correctness, and clarity. Conference Location The conference will be held in Limassol, the most popular and lively city of Cyprus, which is located on the southern coast of the island. The conference venue will be a five-star hotel on the coast. Important Dates Pre-submission abstracts 7 Apr 2000 Full paper submissions 14 Apr 2000 Notification of acceptance 14 Jun 2000 Camera-ready version 7 Jul 2000 Program co-chairs António Porto Gruia-Catalin Roman New University of Lisbon, Portugal Washington University in St. Louis, ap@di.fct.unl.pt USA http://www-gloc.di.fct.unl.pt/~ap roman@cs.wustl.edu http://www.cs.wustl.edu/~roman Organizing Chair George A. Papadopoulos University of Cyprus george@cs.ucy.ac.cy http://www.cs.ucy.ac.cy/papadopo.html Program Committee (excluding co-chairs) Gul Agha U. Illinois, Jean-Marie Jacquet George Papadopoulos Urbana-Champaign, USA U. Namur, Belgium U. Cyprus, Cyprus agha@cs.uiuc.edu jmj@info.fundp.ac.be george@cs.ucy.ac.cy Farhad Arbab Edwin de Jong Rick Schlichting CWI, The Netherlands Signaal, The U. Arizona, USA Farhad.Arbab@cwi.nl Netherlands rick@cs.arizona.edu edejong@signaal.nl Katia Sycara Lubomir Bic Joost Kok Carnegie Mellon U., USA U. California, U. Leiden, The Katia.Sycara@cs.cmu.edu Irvine, USA Netherlands bic@ics.uci.edu joost@wi.leidenuniv.nl John Thomas Cruzio, USA GianLuigi Ferrari Jose Meseguer jthomas@cruzio.com U. Pisa, Italy SRI, USA giangi@di.unipi.it meseguer@csl.sri.com Robert Tolksdorf T.U. Berlin, Germany José Luiz Fiadeiro Naftaly Minsky tolk@cs.tu-berlin.de U. Lisbon, Portugal Rutgers U., USA llf@di.fc.ul.pt minsky@cs.rutgers.edu Alan Wood U. York, UK Roberto Gorrieri Antonio Natali wood@cs.york.ac.uk U. Bologna, Italy U. Bologna, Italy gorrieri@cs.unibo.it anatali@deis.unibo.it Daniel Yankelevich Pragma Consultores, Paola Inverardi Rocco De Nicola Argentina U. l'Aquila, Italy U. Firenze, Italy dyankele@pragma.com.ar inverard@univaq.it denicola@dsi.unifi.it Sponsorship This conference is officially sponsored by the Esprit Working Group 24512 Coordina. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Mar 16 15:46:44 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id PAA11588 for ; Thu, 16 Mar 2000 15:46:42 -0500 (EST) Message-Id: <200003162046.PAA11588@duke.cs.duke.edu> Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Mar 16 15:40:40 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Tue Mar 14 14:55:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Mar 14 14:53:13 EST 2000 Received: from CUNYVM.CUNY.EDU ([128.228.1.2]) by dusty; Tue Mar 14 14:53:13 EST 2000 Received: from CUNYVM.CUNY.EDU by CUNYVM.CUNY.EDU (IBM VM SMTP V2R4) with BSMTP id 0597; Tue, 14 Mar 00 14:51:21 EST Received: from CUNYVM.CUNY.EDU (NJE origin JOEYC@CUNYVM) by CUNYVM.CUNY.EDU (LMail V1.2c/1.8c) with RFC822 id 4663; Tue, 14 Mar 2000 14:51:22 -0500 Date: Tue, 14 Mar 2000 14:51:04 EST From: Joe Malkevitch Subject: Geometry Conference To: Computational Geometry Precedence: bulk Status: RO Content-Length: 2619 Lines: 81 Geometry Conference Recent Trends in Geometry and Symmetry A Conference in Honor of Donald W. Crowe Donald W. Crowe has spent over 40 years popularizing, researching and teaching the many facets of geometry, especially aspects of geometry related to symmetry. The purpose of this conference is to honor his efforts by providing a forum to discuss new trends and developments in the study of geometry and symmetry. In addition to talks by invited speakers, conference attendees will have the opportunity to give expository and survey talks (varied-length time slots will be available) related to the themes of the conference. There will also be ample time for attendees to interact on an informal basis. Attendees are encouraged to bring along models for display in the Model Room. Invited speakers include: H.S.M. Coxeter (University of Toronto) Chandler Davis (University of Toronto) Greg Frederickson (Purdue University) Solomon Garfunkel (COMAP) (Banquet speaker) Sue Whitesides (McGill University) Time: May 4, 2000 - May 7, 2000 Place: Van Vleck Hall, University of Wisconsin (Madison) Co-organizers: Amir Assadi (University of Wisconsin) Steven Bauman (University of Wisconsin) Joseph Malkevitch (York College(CUNY)) Dorothy Washburn (Maryland Institute, College of Art) Robert Wilson (University of Wisconsin) Sponsors: National Science Foundation, EHR-Division of Undergraduate Education Algebra Caucus of the University of Wisconsin Mathematics Department Mathematics Department Colloquium Fund Contributed papers: Contributed papers (length up to 30 minutes) dealing with the areas of: Symmetry, intuitive geometry, polyhedra, tilings, finite geometry, computational geometry, visualization, convexity, discrete geometry, graph theory, geometric games, etc. are welcomed. If it's geometry, we want to hear about it! Conference web page (includes registration and housing information): http://outreach.math.wisc.edu/conference.htm For further information contact: Joseph Malkevitch email: joeyc@cunyvm.cuny.edu phone: 718-262-2551 (voicemail if no answer.) Joe Malkevitch Department of Mathematics, York College (CUNY) Jamaica, NY 11451 E-mail: joeyc@cunyvm.cuny.edu Phone: (718) 262-2551 Web Page: http://www.york.cuny.edu/~malk ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Mar 16 15:46:51 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id PAA11593 for ; Thu, 16 Mar 2000 15:46:49 -0500 (EST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Mar 16 15:40:26 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Mar 16 08:41:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Mar 16 08:39:23 EST 2000 Received: from convex.cs.unb.ca ([131.202.33.93]) by dusty; Thu Mar 16 08:39:21 EST 2000 Received: (from bremner@localhost) by convex.cs.unb.ca (8.9.3/8.9.3) id JAA11811; Thu, 16 Mar 2000 09:42:38 -0400 From: David Bremner MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <14544.58574.292928.674762@convex.cs.unb.ca> Date: Thu, 16 Mar 2000 09:42:38 -0400 (AST) To: compgeom-announce@research.bell-labs.com Subject: CCCG 2000, Second Call for Papers X-Mailer: VM 6.71 under 21.1 (patch 4) "Arches" XEmacs Lucid Precedence: bulk Status: RO Content-Length: 260 Lines: 7 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Mon Feb 15 01:59:15 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id BAA15043; Mon, 15 Feb 1999 01:59:07 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id BAA11222; Mon, 15 Feb 1999 01:52:38 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Feb 14 18:48:42 EST 1999 Received: from research.research.bell-labs.com by netlib2; Wed Feb 10 15:41:03 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Feb 10 15:39:56 EST 1999 Received: from fing.edu.uy ([164.73.32.97]) by dusty; Wed Feb 10 15:39:50 EST 1999 Received: from nana.fing.edu.uy by fing.edu.uy with smtp (Smail3.1.28.1 #4) id m10AgKS-0004uwC; Wed, 10 Feb 99 17:33 GMT-3:00 Received: by nana.fing.edu.uy (SMI-8.6/SMI-SVR4) id RAA23359; Wed, 10 Feb 1999 17:35:31 +0300 From: latin@fing.edu.uy (LATIN 2000 - INCO) Message-Id: <199902101435.RAA23359@nana.fing.edu.uy> Subject: First Call for Papers LATIN'2000 To: compgeom-announce@research.bell-labs.com Date: Wed, 10 Feb 1999 11:35:31 +0300 (GMT+3:00) X-Mailer: ELM [version 2.4 PL21] Content-Type: text Precedence: bulk Status: RO Content-Length: 4537 Lines: 106 We will thank you very much if you could publicize this call for papers. There is also a postscript version of it in our web page at http://www.fing.edu.uy/~latin. Gaston Gonnet Chair of LATIN'2000 Daniel Panario and Alfredo Viola, Organizers of LATIN'2000 ------------------------- cut here ---------------------------------- Call for Papers Latin American Theoretical INformatics - LATIN'2000 http://www.fing.edu.uy/~latin April 10--14, 2000 Punta del Este, Uruguay A series of Symposia in Theoretical Computer Science was launched in 1992, to be held in Latin America: LATIN (Latin American Theoretical INformatics). This is the fourth event of the series, after Sao Paulo, Brazil (1992), Valparaiso, Chile (1995), and Campinas, Brazil (1998). The proceedings were published by Springer-Verlag, in the Lecture Notes in Computer Science Series (volumes 583, 911 and 1380, respectively). We plan to have the proceedings of LATIN'2000 published in a similar way. Typical, but not exclusive, topics of interest for LATIN'2000 include: algorithms; analysis of algorithms; automata theory; coding theory; combinatorics (designs, enumeration, optimization, structures); computability and complexity; computational biology; computational geometry; computational number theory; computer algebra and symbolic computation; cryptography; data compression; data structures; discrete mathematics; experimental algorithmics; formal languages; graph theory; logic in computing; mathematical programming; on-line problems; pattern matching; parallel and distributed algorithms; programming theory; quantum computation; and random structures and algorithms. Authors are cordially invited to submit an extended abstract in English of at most ten pages, not counting the references. Authors are asked to prepare their papers using the standard LaTeX2e. The electronic address for submissions will be specified in the conference's web page. The papers must be received by August 31, 1999 (or postmarked by August 20, 1999 and sent via courier mail). This is a firm deadline. Authors will be notified of acceptance or rejection by November 1, 1999. A final copy of each accepted paper is required by December 1, 1999. This is again a firm deadline. Punta del Este is one of South America's top coastal resorts, located one hour east of Montevideo. We expect an exciting meeting, with the main accommodation and conference site in a hotel facing the Atlantic Ocean. This will provide the opportunity for close interaction among participants in a very attractive setting. More information about the submission process and about Punta del Este can be found in the conference's web page (http://www.fing.edu.uy/~latin). Invited Speakers Allan Borodin (Canada) Philippe Flajolet (France) Joachim von zur Gathen (Germany) Yoshiharu Kohayakawa (Brazil) Andrew Odlyzko (USA) Prabhakar Raghavan (USA) Program Committee Ricardo Baeza-Yates (Chile) Daniel Panario (Canada) Bela Bollobas (USA) Dominique Perrin (France) Felipe Cucker (Hong Kong) Patricio Poblete (Chile) Josep Diaz (Spain) Bruce Reed (France) Esteban Feuerstein (Argentina) Bruce Richmond (Canada) Celina M. de Figueiredo (Brazil) Vojtech Rodl (USA) Gaston Gonnet (Switzerland, Chair) Imre Simon (Brazil) Jozef Gruska (Czech Republic) Neil Sloane (USA) Joos Heintz (Argentina/Spain) Endre Szemeredi (USA) Gerard Huet (France) Jorge Stolfi (Brazil) Marcos Kiwi (Chile) Alfredo Viola (Uruguay) Ming Li (Canada) Yoshiko Wakabayashi (Brazil) Claudio Lucchesi (Brazil) Siang Wun Song (Brazil) Ron Mullin (Canada) Nivio Ziviani (Brazil) Ian Munro (Canada) The organizing committee is co-chaired by Alfredo Viola and Daniel Panario. To receive further announcements please send your name, affiliation and e-mail to latin@fing.edu.uy, or contact http://www.fing.edu.uy/~latin. PLEASE PUBLICIZE *** PLEASE PUBLICIZE *** PLEASE PUBLICIZE ------------- 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 From compgeom-owner@research.bell-labs.com Mon Feb 15 02:15:45 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id CAA15302; Mon, 15 Feb 1999 02:15:43 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id CAA12072; Mon, 15 Feb 1999 02:09:13 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Feb 14 18:51:01 EST 1999 Received: from research.research.bell-labs.com by netlib2; Fri Feb 12 07:29:03 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Feb 12 07:27:28 EST 1999 Received: from grande.dcc.unicamp.br ([143.106.1.11]) by dusty; Fri Feb 12 07:27:27 EST 1999 Received: from amazonas.dcc.unicamp.br (amazonas.dcc.unicamp.br [143.106.7.11]) by grande.dcc.unicamp.br (8.9.1/8.9.1) with ESMTP id KAA14254 for ; Fri, 12 Feb 1999 10:24:28 -0200 (EDT) Received: from coruja.dcc.unicamp.br (coruja.dcc.unicamp.br [143.106.24.80]) by amazonas.dcc.unicamp.br (8.8.5/8.8.5) with ESMTP id KAA02783 for ; Fri, 12 Feb 1999 10:24:29 -0200 (EDT) Received: (from stolfi@localhost) by coruja.dcc.unicamp.br (8.8.5/8.8.5) id KAA19110; Fri, 12 Feb 1999 10:24:27 -0200 (EDT) Date: Fri, 12 Feb 1999 10:24:27 -0200 (EDT) Message-Id: <199902121224.KAA19110@coruja.dcc.unicamp.br> From: Jorge Stolfi To: compgeom-announce@research.bell-labs.com Subject: SIBGRAPI'99 First Call For Papers MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Reply-To: stolfi@dcc.unicamp.br Content-Transfer-Encoding: quoted-printable X-MIME-Autoconverted: from 8bit to quoted-printable by grande.dcc.unicamp.br id KAA14254 Precedence: bulk Status: RO Content-Length: 7096 Lines: 180 F I R S T C A L L F O R P A P E R S=20 =3D =3D =3D =3D =3D =3D =3D =3D =3D =3D =3D S I B G R A P I ' 9 9 =3D =3D =3D =3D =3D =3D =3D =3D =3D =3D =3D XII Brazilian Symposium on Computer Graphics and Image Processing University of Campinas, SP, Brazil - October 17--20, 1999 ----------------------------------------------------------- Image synthesis * Animation and simulation * Geometric modeling Computational geometry * Graphical interfaces * Scientific visualiz= ation Multimedia * Virtual reality * Image retrieval * Image segmentation Pattern recognition * Computer vision * Mathematical morphology Image compression * Three-dimensional images * Remote sensing Geographical databases * Graphics hardware * Applications -------------------------------------------------- http://www.dca.fee.unicamp.br/sibgrapi99/ THE CONFERENCE SIBGRAPI, a traditional yearly event of the Brazilian Computer Society, is the main technical congress for the country's computer graphics and image processing community.=20 SIBGRAPI'99 will be the 12th issue of the conference, and the second one with international program committee and call for papers. The program will include presentation of TECHNICAL PAPERS, short COURSES, PANELS and WORKSHOPS, invited LECTURES, VIDEO and ART SHOWS, and a COMMERCIAL EXHIBITION. =20 CALL FOR CONTRIBUTIONS The SIBGRAPI'99 Program Committee invites technical contributions in all areas of computer graphics and image processing, including (but not exclusively) the ones listed above, in the following categories: FULL PAPERS (up to 10 pages) and EXTENDED ABSTRACTS (2 pages), about original and unpublished developments on algorithms, techniques, hardware, or applications, related to the Symposium's themes. Submissions will be evaluated for relevance, originality, technical value, and conformity with the SIBGRAPI'99 style standards. Accepted items will be presented as technical lectures and published in the Proceedings. TECHNICAL POSTERS about projects still in progress. Submissions will be evaluated for their expected interest to the Symposium attendance, their potential to foster technical cooperation, and their overall quality. Accepted items will be exhibited in a Poster Session, and reduced copies will be made available to the participants. =20 SHORT COURSES about classical or timely topics, at advanced or elementary level. Course proposals will be evaluated for relevance to the SIBGRAPI'99 themes, contents, originality, expected demand, and the lecturers' qualifications. Each course will consist of three to six hours of lectures, with printed notes (20-50 pages). =20 WORKSHOPS and PANEL DISCUSSIONS, on topics related to the SIBGRAPI'99 themes, to be held together with the Symposium. Proposals to organize such events will be evaluated for relevance, expected attendance and value to the audience, and the proposers' qualifications. A description of each approved event (2 pages) will be printed in the SIBGRAPI'99 Proceedings. =20 =20 Detailed guidelines for preparing submissions in all these categories can be obtained at the addresses listed below.=20 NOTE: Submissions that fail to follow those guidelines may be rejected, regardless of their merit. ORGANIZING COMMITTEE L=E9o Pini de Magalh=E3es (Unicamp), chair Pedro Jussieu de Rezende (Unicamp), co-chair Alexandre Xavier Falc=E3o (Unicamp)=20 Ivan Luiz Marques Ricarte (Unicamp) Jos=E9 M=E1rio De Martino (Unicamp) M=E1rcio Lobo Neto (USP) Neucimar Jer=F4nimo Leite (Unicamp) Roberto Alencar Lotufo (Unicamp) =20 PROGRAM COMMITTEE (preliminary) Jorge Stolfi (Unicamp, BR), chair Cl=E9sio Luis Tozzi (Unicamp, BR), co-chair Antonio Oliveira (UFRJ, BR) Arnaldo Albuquerque (UFMG, BR) Brian Wyvill (U. Calgary, CA) Carla M. S. Freitas (UFRGS, BR) Gilles Bertrand (ESIEE, FR) Jo=E3o M. Carvalho (UFPB, BR) Jos=E9 L. Encarna=E7=E3o (IGD Darmstadt, DE) Junior Barrera (USP, BR) Luciano F. Costa (USP-SC, BR) Luiz H. de Figueiredo (LNCC, BR) Manuel Pr=F3spero dos Santos (UNL, PT) Nelson D. A. Mascarenhas (UFSCar, BR) Olga R. P. Bellon (UFPR, BR) Peter Eades (U. of Newcastle, AU) Paulo C=E9zar Carvalho (IMPA, BR) and Shin-Ting Wu (Unicamp), courses Gilbertto Prado (Unicamp, BR), art gallery =20 Marcelo K. Zuffo (USP, BR), video show CONFERENCE LOCATION SIBGRAPI'99 will be held in the campus of the University of Campinas (Unicamp), one of Brazil's leading universities. Campinas is an agricultural and industrial town of 800,000 people, with a vigorous cultural life, including an acclaimed symphonic orchestra. The city is also a major technological center, being home to many research institutions and high-tech industries. =20 Campinas is located about 100 km (a one-hour drive) Northwest of S=E3o Paulo, the largest city in South America and the third largest in the world. S=E3o Paulo is the economic capital of Brazil, and Rio's permanent rival in cultural and gastronomic matters.=20 =20 Campinas is connected to S=E3o Paulo and several Brazilian cities by regular air routes (including two or three daily flights to Rio), good highways, and numerous intercity buses. =20 The visitor to Campinas will find plenty of opportunities for tourism starting from there. We will mention only that some 200km from Campinas are the forests and scenic views of the Serra do Mar, and the Atlantic coast with its warm waters and uncountable beaches. In the opposite direction, a day's drive away, is the huge Pantanal marshland with its rich and unique fauna. IMPORTANT DATES Papers and abstracts:=20 submission deadline 22/Apr/99=20 decision due 21/Jun/99=20 final version due 09/Aug/99 Tutorials and Posters: submission deadline 22/Apr/99=20 decision due 21/Jun/99 final version due 09/Sep/99 Workshops and Panels: proposals deadline 05/Apr/99 decision due 03/May/99 final program due 09/Sep/99 ADDRESSES http://www.dca.fee.unicamp.br/sibgrapi99/ sibgrapi99@dca.fee.unicamp.br SIBGRAPI'99 DCA-FEEC-UNICAMP Caixa Postal 6101 13083-970 Campinas, SP - BRAZIL ------------- 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 From compgeom-owner@research.bell-labs.com Thu Feb 18 00:13:13 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA10362; Thu, 18 Feb 1999 00:13:13 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id AAA09140; Thu, 18 Feb 1999 00:06:42 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Feb 17 17:02:57 EST 1999 Received: from research.research.bell-labs.com by netlib2; Mon Feb 15 05:01:01 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Feb 15 04:59:54 EST 1999 Received: from oak.fernuni-hagen.de ([132.176.114.41]) by dusty; Mon Feb 15 04:59:54 EST 1999 Received: from nansen.fernuni-hagen.de by oak.fernuni-hagen.de via local-channel with SMTP; Mon, 15 Feb 1999 10:58:32 +0100 Received: by nansen.fernuni-hagen.de (SMI-8.6/SMI-SVR4) id KAA19301; Mon, 15 Feb 1999 10:56:06 +0100 From: Martin.Erwig@FernUni-Hagen.de (Martin Erwig) Message-Id: <199902150956.KAA19301@nansen.fernuni-hagen.de> Subject: Intersection of 3D objects To: compgeom-discuss@research.bell-labs.com Date: Mon, 15 Feb 1999 10:56:05 +0100 (MET) X-Mailer: ELM [version 2.4 PL23] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 2673 Lines: 60 Hi, I hope the following is not out of the scope of this mailing list. I am looking for algorithms and their complexities for the following two problems: (1) Intersection of two 3D volumes (2) Intersection of a 3D volume and a 3D line I have already looked into geombib (a VERY GOOD enterprise!), and some papers seem to be relevant, but before getting copies (some are quite difficult to obtain), I would like to know more precisely where I should look at. Some more details on the above two problems: (A) 3D volumes should be sets of (generally non-convex) polyhedra. (ie, volumes need not be connected). Volumes should be allowed to have holes. (If there are simpler algorithms for polyhedra without holes, this would also be interesting to know). (B) 3D lines are monotonic wrt the z-axis (ie, they can be viewed as functions the z-axis to the x-y-plane). Lines can be thought of as being given by a collection of straight line segments. Lines might consists of more than one component. (C) We can distinguish different topological relationships between two 3D objects: for volume/line it is possible that they are disjoint, that the line is inside the volume, or that the line runs along the border of the volume. The algorithm should ideally return an ordered sequence of z-intervals together with the information about the corresponding parts of the volume/of the region (each of which might be undefined), and of their topological relationship. (For each change in the topological relationship, a new interval should be reported. For topological relationships that hold only for one z-coordinate (here, intersection points) no (degenerated) interval has to be reported, since it can be derived from the other intervals.) For two volumes, we have five topological relationships: disjoint, externally tangent, overlap, internally tangent, and inside. I would appreciate any comments on this problem and, in particular, pointers to relevant papers. Thanks a lot, Martin ----------------------------------------------------------------------------- Dr. Martin Erwig Phone: +49 2331 987-4286 FernUniversitaet Hagen Fax: +49 2331 987-4278 Praktische Informatik IV Email: erwig@fernuni-hagen.de 58084 Hagen erwig@acm.org Germany URL: http://www.fernuni-hagen.de/inf/pi4/erwig/ ----------------------------------------------------------------------------- ------------- 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 From compgeom-owner@research.bell-labs.com Thu Feb 18 00:24:40 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA10753; Thu, 18 Feb 1999 00:24:38 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id AAA10347; Thu, 18 Feb 1999 00:18:07 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Feb 17 17:08:12 EST 1999 Received: from research.research.bell-labs.com by netlib2; Tue Feb 16 07:07:02 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Feb 16 07:06:10 EST 1999 Received: from dimoni.upc.es ([147.83.2.62]) by dusty; Tue Feb 16 07:04:53 EST 1999 Received: from grec.ma2.upc.es (grec.upc.es [147.83.90.53]) by dimoni.upc.es (8.8.6/8.8.6) with SMTP id NAA06338 for ; Tue, 16 Feb 1999 13:03:27 +0100 (MET) Received: by grec.ma2.upc.es (4.1/SMI-4.1) id AA14828; Tue, 16 Feb 99 12:58:22 +0100 Date: Tue, 16 Feb 99 12:58:22 +0100 From: geomc@grec.ma2.upc.es (Geometria computacional) Message-Id: <9902161158.AA14828@grec.ma2.upc.es> To: compgeom-announce@research.bell-labs.com Subject: New geom.bib search page Precedence: bulk Status: RO Content-Length: 541 Lines: 17 The Computational Geometry Research Group of the Universitat Politecnica de Catalunya announces its GEOM.BIB SEARCH PAGE: http://www-ma2.upc.es/~geomc/geombibe.html It has been used for more than one year by the Spanish CG community, and seems to work pretty well. English, Catalan and Spanish are the language options. You are all welcome to use it! ------------- 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 From compgeom-owner@research.bell-labs.com Thu Feb 18 00:32:47 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA10989; Thu, 18 Feb 1999 00:32:45 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id AAA11874; Thu, 18 Feb 1999 00:26:15 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Feb 17 17:09:46 EST 1999 Received: from research.research.bell-labs.com by netlib2; Tue Feb 16 17:23:02 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Feb 16 17:22:34 EST 1999 Received: from alpha.xerox.com ([13.1.64.93]) by dusty; Tue Feb 16 17:22:32 EST 1999 Received: from gratiano.parc.xerox.com ([13.2.116.55]) by alpha.xerox.com with SMTP id <56836(4)>; Tue, 16 Feb 1999 14:22:29 PST Received: by gratiano.parc.xerox.com id <177475>; Tue, 16 Feb 1999 14:22:20 PST From: Marshall Bern To: compgeom-announce@research.bell-labs.com Subject: SoCG Acceptance List Message-Id: <99Feb16.142220pst."177475"@gratiano.parc.xerox.com> Date: Tue, 16 Feb 1999 14:22:20 PST Precedence: bulk Status: RO Content-Length: 3991 Lines: 151 THEORETICAL TRACK: (27 papers) Approximation and exact algorithms for minimum-width annuli and shells Agarwal, Aronov, Har-Peled, Sharir Lower bounds for kinetic planar subdivisions Agarwal, Basch, de Berg, Guibas, Hershberger Motion planning of a ball amid polyhedral obstacles in three dimensions Agarwal and Sharir The path of a triangulation Aichholzer The table layout problem Anderson and Sobti Polytopes in arrangements Aronov and Dey Spanning trees crossing few barriers Asano, de Berg, Cheong, Guibas, Snoeyink, Tamaki Geometric algorithms for trap design Beretty, Goldberg, Overmars, van der Stappen Generalizing ham sandwich cuts to equitable subdivisions Bespamyatnikh, Kirkpatrick, Snoeyink Line and curve segment intersection with restricted predicates Boissonat, Snoeyink Hierarchical vertical decompositions, ray shooting , and circular arc queries in simple polygons Cheng, Cheong, Everett, van Oostrum Sliver exudation Cheng, Dey, Edelsbrunner, Facello, Teng Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami Demaine, Demaine, Mitchell Curve reconstruction: connecting dots with good reason Dey, Mehlhorn, Ramos Edgewise subdivision of a simplex Edelsbrunner, Grayson The complexity of the union of (alpha, beta)-covered objects Efrat On minimum stars, minimum Steiner stars, and maximum matchings Fekete and Meijer Curve reconstruction, the TSP, and Menger's theorem on length Giesen Kinetic connectivity of rectangles Hershberger, Suri On bisectors for different distance functions Icking, Klein, Ma, Nickel, Weibler Visibility-based pursuit-evasion in a polygonal room with a door Lee, Shin, Chwa New bounds on crossing number Pach, Spencer, Toth On range reporting, ray shooting, and k-level construction Ramos Small distortion and volume preserving embedding Rao Sharp bounds on geometric permutation of pairwise disjoint balls Smorodinsky, Mitchell, Sharir Strechability of star-like pseudo-visibility graphs Streinu Efficient algorithms for maximum regression depth van Kreveld, Mitchell, Rousseeuw, Sharir, Snoeyink, Speckmann APPLIED TRACK (17 papers) Error-Bounded Regular Algebraic Spline Curves Bajaj and Xu Exact Geometric Computation Made Easy Burnikel, Fleischer, Mehlhorn, Schirra Determining an Optimal Penetration among Weighted Regions in Two and Three Dimensions Chen, Daescu, Hu, Wu and Xu On Deletion in Delaunay Triangulations Devillers Topological Beam Tracing, Fortune Geometric Pattern Matching: A Performance Study Gavrilov, Indyk, Motwani and Venkatasubramanian Crust and Anti-Crust: A One-Step Boundary and Skeleton Extraction Algorithm Gold H-Walk: Hierarchical Distance Computation for Moving Convex Bodies, Guibas, Hsu and Zhang Interval Methods for Kinetic Simulations Guibas and Karavelas A Core Library for Robust Numeric and Geometric Computation Karamcheti, Pechtchanski and Yap MAPC: A library for Efficient and Exact Manipulation of Algebraic Points and Curves Keyser, Culver, Manocha and Krishnan One-sided Smoothing of Polygons Lutterkort and Peters: A Geometric Approach to Computing Higher-Order Form Factors Pellegrini Controlled Perturbation for Arrangements of Polyhedral Surfaces with Application to Swept Volumes Raab Computing Roundness is Easy if the Set is Almost Round Ramos Empirical Design of Geometric Algorithms Weihe, Brandes, Liebers, Muller-Hannemann, Wagner and Willhalm Motion Planning for a Rigid Body Using Random Networks on the Medial Axis of the Free Space Wilmarth, Amato and Stiller ------------- 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 From compgeom-owner@research.bell-labs.com Mon Feb 22 03:18:37 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id DAA25995; Mon, 22 Feb 1999 03:18:36 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id DAA22992; Mon, 22 Feb 1999 03:18:37 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Feb 21 20:15:21 EST 1999 Received: from research.research.bell-labs.com by netlib2; Fri Feb 19 08:55:09 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Feb 19 08:54:55 EST 1999 Received: from ibm35.engga.uwo.ca ([129.100.224.45]) by dusty; Fri Feb 19 08:54:55 EST 1999 Received: from localhost (dickijk@localhost) by ibm35.engga.uwo.ca (AIX4.3/UCB 8.8.8/8.7) with SMTP id IAA06194 for ; Fri, 19 Feb 1999 08:55:35 -0600 X-Authentication-Warning: ibm35.engga.uwo.ca: dickijk owned process doing -bs Date: Fri, 19 Feb 1999 08:55:34 -0600 (CST) From: John Dickinson To: compgeom-discuss Subject: What are the best conferences for Computational Geometry? Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 731 Lines: 23 Dear All, What are the best conferences for Computational Geometry? Web addresses for info for attendees welcome. I am particularly interested in ones that have some focus on solid modelling and associated issues. John -- -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859) ---- John Kenneth Dickinson | "A sharp tongue is the only Grad. Student Mech. Eng. U.W.O. | edge tool that grows keener email: jkdickin@julian.uwo.ca | with constant use." http://publish.uwo.ca/~jkdickin/ | ------------- 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 From compgeom-owner@research.bell-labs.com Mon Feb 22 16:00:52 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA12047; Mon, 22 Feb 1999 16:00:51 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA07596; Mon, 22 Feb 1999 16:00:47 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Feb 22 08:57:27 EST 1999 Received: from research.research.bell-labs.com by netlib2; Mon Feb 22 08:31:01 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Feb 22 08:30:31 EST 1999 Received: from amirani.ams.sunysb.edu ([129.49.6.2]) by dusty; Mon Feb 22 08:30:31 EST 1999 Received: from polya (polya.ams.sunysb.edu [129.49.6.5]) by amirani.ams.sunysb.edu (8.9.1a/8.9.1) with ESMTP id IAA12929; Mon, 22 Feb 1999 08:30:27 -0500 (EST) From: Joseph Mitchell Received: (jsbm@localhost) by polya (SMI-8.6/8.6.9) id IAA12594; Mon, 22 Feb 1999 08:30:26 -0500 Date: Mon, 22 Feb 1999 08:30:26 -0500 Message-Id: <199902221330.IAA12594@polya> To: dickijk@engga.uwo.ca Subject: conferences Cc: compgeom-discuss@research.bell-labs.com Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Content-MD5: 8ue5nu4DnOCNFr5mIl5IJg== Precedence: bulk Status: RO Content-Length: 1062 Lines: 32 Dear John, Please refer to my website, http://www.ams.sunysb.edu/~jsbm/events.html where I try to keep an up-to-date list of links of interest to computational geometers (including theory and applications areas, like graphics, solid modelling, GIS, etc). Additions are always welcome! The main conferences in CG include the annual ACM SoCG and the Canadian conference (CCCG); there are also a variety of workshops, including the European workshop, and the annual fall workshop series (originally at Stony Brook (91-95), and lately hosted by CGC sites (96-98)). CGers also like to publish in some "algorithms" conferences, such as SODA, WADS/SWAT, and ISAAC, as well as the traditional theory conferences (FOCS and STOC). Each application area has its own events too.... ACM Solid Modelling, SIGGRAPH, Eurographics, I3DG, Visualization, WAFR, ICRA, etc. Good luck! Joe ------------- 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 From compgeom-owner@research.bell-labs.com Mon Feb 22 16:12:09 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA12447; Mon, 22 Feb 1999 16:12:07 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA09299; Mon, 22 Feb 1999 16:11:57 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Feb 22 09:01:33 EST 1999 Received: from research.research.bell-labs.com by netlib2; Mon Feb 22 02:45:08 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Feb 22 02:43:17 EST 1999 Received: from jupiter.kaist.ac.kr ([143.248.135.80]) by dusty; Mon Feb 22 02:43:10 EST 1999 Received: (from kychwa@localhost) by jupiter.kaist.ac.kr (8.8.8Ha/8.8.8-NOSPAM) id QAA05737 for compgeom-announce@research.bell-labs.com; Mon, 22 Feb 1999 16:41:33 +0900 (KST) Message-ID: <19990222164133.A5687@jupiter.kaist.ac.kr> Date: Mon, 22 Feb 1999 16:41:33 +0900 From: Chwa Kyung-Yong To: compgeom-announce@research.bell-labs.com Subject: Distinguished Visiting Faculty Position from KAIST Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Mailer: Mutt 0.93.2i Precedence: bulk Status: RO Content-Length: 1298 Lines: 30 DISTINGUISHED VISITING FACULTY POSITION The computer science department at Korea Advanced Institute of Science and Technology (KAIST) invites applications for a faculty appointment in the general area of computer science, particularly in, but not restricted to theoretical computer science. We are seeking a researcher and teacher of great distinction whose work has been internationally acclaimed. Initial duties for the position will be teaching both undergraduate and graduate students for about 3 hours/week in every semester and advising the department chairman. In addition, he or she will plan and conduct independent or joint research programs. Salary will depend on qualifications and experience, but will be around US$120,000/year. Information about KAIST can be found on the Web page at: . Application should be sent with a curriculum vitae to : Faculty Search Committee Department of Computer Science KAIST, 373-1 Kusong-dong, Yusong, Taejon, Korea 305-701 Fax: +82-42-869-3510 e-mail: fsc@jupiter.kaist.ac.kr ------------- 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 From compgeom-owner@research.bell-labs.com Tue Feb 23 16:43:08 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA20528; Tue, 23 Feb 1999 16:43:06 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA13738; Tue, 23 Feb 1999 16:42:26 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Feb 23 09:28:15 EST 1999 Received: from research.research.bell-labs.com by netlib2; Mon Feb 22 18:39:04 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Feb 22 18:37:01 EST 1999 To: compgeom-announce@research.bell-labs.com Received: from louie.scs.carleton.ca ([134.117.5.2]) by dusty; Mon Feb 22 18:37:00 EST 1999 Received: from leo.scs.carleton.ca (dehne@leo [134.117.5.3]) by louie.scs.carleton.ca (96/30.01.97) with ESMTP id SAA07941 for ; Mon, 22 Feb 1999 18:35:12 -0500 (EST) From: Frank Dehne Received: (from dehne@localhost) by leo.scs.carleton.ca (96/96.1) id SAA22212 for compgeom-announce@research.bell-labs.com; Mon, 22 Feb 1999 18:25:41 -0500 (EST) Date: Mon, 22 Feb 1999 18:25:41 -0500 (EST) Message-Id: <199902222325.SAA22212@leo.scs.carleton.ca> Subject: WADS'99 Content-Type: text Precedence: bulk Status: RO Content-Length: 2783 Lines: 57 CALL FOR PAPERS 1999 Workshop on Algorithms And Data Structures (WADS'99) August 12-14, 1999 Vancouver, Britich Columbia, Canada http://www.scs.carleton.ca/~wads/ Sponsored by The Pacific Institute for the Mathematical Sciences 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) by e-mail to "wads@scs.carleton.ca". Detailed submission instructions are located at http://www.scs.carleton.ca/~dehne/proj/wads/99/instr.html. Submissions must arrive on or before March 1, 1999. Authors will be notified of acceptance or rejection by April 30, 1999. 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 21, 1999 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 (tentative): Charles Leiserson, Marc Snir, Nadia Magnenat Thalman, Umesh Vazirani, and Jeff Vitter Conference Co-Chairs: B. Bhattacharya and A. Gupta, Computer Science, Simon Fraser University, wads_local@cs.sfu.ca, http://www.cs.sfu.ca/~wads Program Committee: Co-Chairs: F. Dehne (Carleton), A. Gupta (SFU), J.-R. Sack (Carleton) and R. Tamassia (Brown). PC-Members: A. Andersson (Uppsala), A. Apostolico (Purdue and Padova), G. Ausiello (Rome), G. Bilardi (Padova) , K. Clarkson (Lucent), R. Cleve (Calgary), M. Cosnard (INRIA-LORIA, France), L. Devroye (McGill), P. Dymond (York), M. Farach-Colton (Rutgers), P. Fraigniaud (Paris), M. Goodrich (Johns Hopkins) A. Grama (Purdue), M. Keil (Saskatchewan), D. Kirkpatrick (UBC), R. Krishnamurti (SFU), D.T. Lee (Northwestern), F. Luccio (Pisa), A. Maheshwari (Carleton), G. Plaxton (Univ. of Texas at Austin), A. Rau-Chaplin (Dalhousie), J. Reif (Duke), F. Ruskey (U. Vic), P.G. Spirakis (Patras), L. Stewart (Alberta), H. Sudborough (U. Texas Dallas), P. Vitanyi (CWI), P. Widmayer (ETH), C.K. Wong (Chinese U. Hong Kong). ------------- 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 From compgeom-owner@research.bell-labs.com Thu Feb 25 16:25:22 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA01615; Thu, 25 Feb 1999 16:25:20 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA18018; Thu, 25 Feb 1999 16:24:51 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Feb 25 09:10:33 EST 1999 Received: from research.research.bell-labs.com by netlib2; Thu Feb 25 03:13:04 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Feb 25 03:12:33 EST 1999 Received: from gemma.inria.fr ([138.96.16.98]) by dusty; Thu Feb 25 03:12:32 EST 1999 Received: by gemma.inria.fr (8.8.8/8.8.5) id JAA07222; Thu, 25 Feb 1999 09:12:32 +0100 (MET) From: Jeff Vitter MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Date: Thu, 25 Feb 1999 09:00:59 +0100 (MET) To: compgeom-announce@research.bell-labs.com Subject: External Memory Algorithms and Data Structures X-Mailer: VM 6.43 under 20.4 "Emerald" XEmacs Lucid Message-ID: <14037.782.684747.567860@gemma.inria.fr> Content-Transfer-Encoding: quoted-printable X-MIME-Autoconverted: from 8bit to quoted-printable by gemma.inria.fr id JAA07222 Precedence: bulk Status: RO Content-Length: 1784 Lines: 43 My updated survey "External Memory Algorithms and Data Structures" is now available on the web. It will appear as one of the chapters in the book on External Memory Algorithms, co-edited=20 with James Abello and published by AMS in the DIMACS series in Discrete Mathematics and Theoretical Computer Science. The survey article is available at either of the following two URLs: http://www.cs.duke.edu/~jsv/Papers/Vit98.IO_survey.ps.gz. http://www.cs.duke.edu/~jsv/Papers/Vit98.IO_survey.pdf If you got an earlier message recently, I apologize=20 for the bother. The article was just finalized yesterday,=20 so the version I mentioned earlier has been modified. =20 If you've already downloaded it, you may want to re-download it. I'm currently putting together a joint manuscript with Lars Arge on the subject of external memory algorithms and data structures, which we hope to have done in a year, so more later! -- Jeff -- Jeffrey S. Vitter =20 Lehrman Professor and Chair Email: jsv@cs.duke.edu Department of Computer Science Phone: (919) 660-6548 Duke University, Box 90129 FAX: (919) 660-6502 Durham, N.C. 27708-0129 Web: http://www.cs.duke.edu/~jsv/ Jusqu'=E0 fin juin 1999: Jeffrey S. VITTER Projet PRISME Phone: +33 4.92.38.77.49 I.N.R.I.A. Sophia Antipolis Secr: +33 4.92.38.77.38 (Agn=E8s) 2004, route des Lucioles FAX: +33 4.92.38.76.43 B. P. 93 Email: Jeff.Vitter@sophia.inria.fr 06902 Sophia Antipolis Cedex Web: http://www.cs.duke.edu/~jsv/ FRANCE =20 ------------- 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 From compgeom-owner@research.bell-labs.com Fri Feb 26 04:27:43 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id EAA17873; Fri, 26 Feb 1999 04:27:40 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id EAA22652; Fri, 26 Feb 1999 04:27:30 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Feb 25 21:15:02 EST 1999 Received: from research.research.bell-labs.com by netlib2; Thu Feb 25 10:29:04 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Thu Feb 25 10:28:45 EST 1999 Received: from CS.Princeton.EDU ([128.112.136.10]) by dusty; Thu Feb 25 10:28:40 EST 1999 Received: from polytope (polytope.CS.Princeton.EDU [128.112.136.205]) by CS.Princeton.EDU (8.8.8/8.8.8) with ESMTP id KAA12351 for ; Thu, 25 Feb 1999 10:27:51 -0500 (EST) Received: by polytope via sendmail from stdin id (Debian Smail3.2.0.102) for compgeom-announce@research.bell-labs.com; Thu, 25 Feb 1999 10:29:09 -0500 (EST) Resent-Message-Id: Received: from localhost (really [127.0.0.1]) by polytope via smail with esmtp id (Debian Smail3.2.0.102) for ; Thu, 25 Feb 1999 08:44:49 -0500 (EST) Received: from imap.cs.princeton.edu by localhost with IMAP (fetchmail-4.7.6) for herve@localhost (single-drop); Thu, 25 Feb 1999 08:44:49 -0500 (EST) Received: from alcor.inria.fr (root@alcor.inria.fr [138.96.16.17]) by CS.Princeton.EDU (8.8.8/8.8.8) with ESMTP id IAA06525 for ; Thu, 25 Feb 1999 08:43:22 -0500 (EST) Received: from sophia.inria.fr by alcor.inria.fr (8.8.8/8.8.5) with ESMTP id OAA06408 for ; Thu, 25 Feb 1999 14:43:17 +0100 (MET) Received: from lix.polytechnique.fr by sophia.inria.fr (8.8.8/8.8.5) with ESMTP id OAA12400 for ; Thu, 25 Feb 1999 14:43:16 +0100 (MET) Received: from x-mailer.polytechnique.fr (x-mailer.polytechnique.fr [129.104.35.1]) by lix.polytechnique.fr (w.x.y/w.x.y) with ESMTP id OAA07539 for ; Thu, 25 Feb 1999 14:43:14 +0100 (MET) Received: from hexagon.math-inst.hu (erdos99@hexagon.math-inst.hu [193.224.79.1]) by x-mailer.polytechnique.fr (x.y.z/X.Y.Z) with ESMTP id OAA18522 for ; Thu, 25 Feb 1999 14:42:00 GMT Received: (from erdos99@localhost) by hexagon.math-inst.hu (8.8.8/8.8.8/3s) id OAA16694 for bronnima@lix.polytechnique.fr; Thu, 25 Feb 1999 14:42:58 +0100 (MET) Date: Thu, 25 Feb 1999 14:42:58 +0100 (MET) From: "Conference in memory of Paul Erdos'99" Message-Id: <199902251342.OAA16694@hexagon.math-inst.hu> To: bronnima@lix.polytechnique.fr MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Resent-From: herve@CS.Princeton.EDU Resent-Date: Thu, 25 Feb 1999 10:29:09 -0500 Resent-To: compgeom-announce@research.bell-labs.com Content-Transfer-Encoding: quoted-printable X-MIME-Autoconverted: from 8bit to quoted-printable by CS.Princeton.EDU id KAA12351 Precedence: bulk Status: RO Content-Length: 18553 Lines: 479 Second Announcement Paul Erdos and his Mathematics Budapest, July 4-11, 1999 The Hungarian Academy of Sciences, the Janos Bolyai Mathematical Society, The Eotvos Lorand University of Budapest and The Mathematical Institute of The Hungarian Academy of Sciences, organize a conference dedicated to the memory of Paul Erdos which will be held July 4 - 11, 1999, in Budapest, Hungary. The topics of the conference include the basic fields to which Paul Erdos contributed: Analysis (including Ergodic Theory), Combinatorics (including Combinatorial Algebra, Combinatorial Geometry and Theoretical Computer Science), Number Theory, Probability Theory, and Set Theory among others. Scientific Program The program will include the following types of lectures and presentations. Plenary lectures: These will be expository lectures on particular areas of Paul Erdos' work. We emphasize that these talks will be addressed to a broad mathematical audience. Their aim is to put the theorems and conjectures of Paul Erdos in a historical context. The plenary speakers will be N. Alon (Israel), B. Bollobas (USA, England), P. Borwein (Canada), P. D.T.A. Elliott (USA), R. L. Graham (USA), A. Hajnal (Hungary, USA), P. Komjath (Hungary), D. S. Lubinsky (South Africa), C. Pomerance (USA), I. Z. Ruzsa (Hungary), M. Simonovits (Hungary) and J. Spencer (USA). Parallel sessions: There will be five parallel sessions in the fields listed above consisting of invited lectures of 30 minutes duration each. The emphasis will be on the influence of Paul Erdos' work. We had to put a limit on the number of lectures, but we gladly offer participants the opportunity to contribute to the poster session, the volume of short communications or to mini workshops described below. Poster Session: All participants may present their work in scheduled poster sessions provided they submit an abstract by March 31, 1999. A LaTeX template for posters may be obtained from the conference's homepage: http://www.math-inst.hu/~erdos99 Volume of Short Communications: All participants are invited to submit an extended abstract [maximum: 3 pages] that is expected to be related to the mathematics of Paul Erdos. These will be refereed and the volume will be distributed at the beginning of the conference. The deadline for submitting the extended abstracts is also March 31, 1999. Mini-Workshops: For small groups that wish to get together for specialized discussions we shall be happy to arrange the appropriate facilities. Conference volumes The Volume of Short Communications (invited and contributed, as well) will be distributed at the conference and its price is included in the registration fee. We will publish the invited papers in two different ways. The papers containing mainly new results in Combinatorics and related areas will appear in a special issue of Combinatorica. We do not plan to publish research papers in other areas, e.g. Analysis, Analytic Number Theory, Set Theory. On the other hand, survey type papers of the invited speakers (in any area of the conference)=20 will be collected in one or more volumes of the Bolyai Society Mathematical Studies (published by the Janos Bolyai Mathematical Society). This series started with the volumes "Erdos is 80 I, II" and has already reached 10 volumes. The program starts as follows: 4 July, Sunday 14.00 - 18.00 Registration=20 18.30 - 20.00 Welcome Party 5 July, Monday 9.00 - 10.00 Opening session=20 10.30 - 13.00 Plenary sessions=20 Technical Equipment Overhead projectors, tape recorders and video equipment will be provided. Please indicate extra needs on your Registration Form. We greatfully acknowledge the support of the following sponsors: -Arany Janos Foundation -DIMACS -DIMANET-PECO -DIMATIA -European Mathematical Union (EMU) -Foundation for the Modernization of Hungarian Education (KOMA) -Hungarian Academy of Sciences -Hungarian National Committee for Technical Development (OMFB) -Hungarian National Foundation for Scientific Research (OTKA) -International Mathematical Union (IMU) -Number Theory Foundation -Pazmany-Eotvos Foundation (ELTE) -Soros Foundation Registration and Accommodation Registration fee: $160 if paid in full by April 1st, $250 afterwards. Registration fee for accompanying persons is $80 until April 1st,=20 $100 afterwards. The registration fee includes - Admission to scientific sessions - Conference Program, Volume of Short Communications and Abstracts - Welcome Party - Refreshments - Banquet - Conference Excursion The registration fee for accompanying persons includes -Welcome party -Banquet -Conference Excursion There is a possibility to buy additional tickets for the Welcome Party, the Banquet and the Excursion, separately. =20 Accommodation Hotel accommodation can be reserved at rates listed on the enclosed Hotel Reservation Form. Please complete and return this form together with your hotel deposit not later than 1 April, 1999. A deposit of one (1) night will be required to secure your hotel reservation. For methods of payment see below. The Organizing Secretariat reserves the right to book you into a similar hotel should the requested hotel be fully booked. A written confirmation will be sent to you after receiving your deposit. The outstanding balance should be paid directly at the registration desk. Advance payment for registration and hotel can be made by=20 credit card, bank transfer or certified/cashier check (unfortunately=20 not by personal check). By credit card Please give the card number, card type (e.g. Visa, Mastercard, etc.)=20 and the expiration date.=20 By bank transfer=20 Bank name: Hungarian Foreign Trade Bank Ltd. Bank address: 1051 Budapest, Szent Istvan ter 11. Hungary =20 Swift code: MKKBHUHB=20 Account number for participants:=20 MTA "Tudomany" 501-00047-2100-4019 PEM'99=20 The name of the participant should be clearly stated on the bank payment. Please note that the Organizing Secretariat will not accept bank charges; bank charges are at the sender's expense. =20 By certified/guaranteed payment cheque=20 The cheque, which should state the participant's name clearly, should be enclosed with the completed Registration Form and made payable to: PEM '99, Office for International Cooperation, HAS, 1051 Budapest, Nador u. 7., Hungary. =20 Personal or company cheques cannot be accepted. During the Congress major credit cards will be accepted at the Registration Desk. Cancellation and refunds Cancellation of the participation and hotel reservation can only be made in writing to the Organizing Secretariat. Full refunds of the registration fee will be made before 31 May, 1999, while 80% can be refunded between 31 May and 15 June, 1999. No refunds will be made after 15 June.=20 Unfortunately, we cannot return hotel deposits in case of cancellation.=20 You are kindly asked to return, via ordinary mail, fax, or e-mail (to: khajos@office.mta.hu), the enclosed Registration and Hotel Reservation Forms together with a copy of the bank transfer document (registration fee + one night hotel deposit) to the Organizing Secretariat not later than 1 April, 1999. These forms can also be downloaded from http://www.math-inst.hu/~erdos99 in PostScript, MSWord, LaTeX or ASCII text format. If you send your registration via e-mail, please use the ASCII TEXT FORMAT ONLY.=20 Deadlines=20 =20 - all deadlines are as "postmarked by" March 31st, 1999 - deadline for the submission of Abstracts May 15, 1999 - confirmation of the acceptance of Abstracts by the Selection Committee April 1, 1999 - registration with $160 registration fee April 1, 1999 - hotel reservation. After April 1st we cannot guarantee the availability of hotel rooms of chosen comfort level. (We have deadlines towards the hotels.) GENERAL INFORMATION =20 Conference site:=20 Hungarian Academy of Sciences 1051 Budapest Roosevelt ter 9. Transfer from the airport to the city The city can be easily reached by Airport Minibus Service. These minibuses are comfortable and they take you to any address in the city from Airport Terminals 1 and 2. Price per person is HUF 1.500 (approximately 6-8 USD). This door-to-door minibus service is much more reasonably priced than taxis. Local Transportation in Budapest Buses, trams and the metro (subway) run without conductors. Tickets must be purchased in advance at your hotel or at metro stations. Each ticket (except daily and weekly tickets) is valid for one ride only and must be punched on the bus, tram or trolley-bus=20 or stamped at the entrance to the metro. The cost of a one-way ticket=20 is HUF 90. It is suggested to buy a weekly ticket, which costs about 1700 HUF. There are also daily tickets available, and cheaper tickets=20 for short travels on metro.=20 Passport and Visa Visitors to Hungary must possess a valid passport. Entry visas are not required for citizens of most European countries, USA, Canada, South Africa, Israel and Mexico.=20 Entry visas are required for citizens of Australia, Brazil, Cambodia,=20 China, Columbia, Egypt, India, Iran, Libya, Marocco, New Zeland,=20 North-Korea, Pakistan, Phillippines, Syria, Taiwan, Thailand, Turkey,=20 Venezuela, Yemen, among others. You are kindly requested to inquire=20 at the Hungarian Embassy or Consulate in your country. Currency, Exchange, Credit cards The official currency in Hungary is the Hungarian Forint (HUF), the exchange rate is 1 USD =3D 225 HUF (February 1999). Foreign currency can be brought into Hungary without restrictions. Currency exchange is available at the airport, at major banks and hotels. Banking hours in the city are 09.00 - 14.00, Monday to Friday. Automatic teller machines are available throughout the city and accept most major credit and bank cards (MAC, CIRRUS, PLUS, etc.). Cheques and major credit cards are accepted in hotels, larger restaurants, some department stores and shops but you should ask before ordering a service. There is no money exchange at the conference registration desk. Weather and Clothing The climate in Hungary in July is usually sunny with an average daily temperature of 25 C (77 Fahrenheit). Showers may occur=20 but normally humidity is not high. However, it is not totally=20 unlikely that temperatures may stay only in the teens. Informal=20 dress is appropriate for all events. Electricity supply In Hungary electricity is supplied at 220 V, 50 Hz. The 2-pin plug is different from the one used in some other countries, but same as in for example Germany. Letter of Invitation Upon request the Organizing Secretariat will issue personal invitations to those wishing to participate in the congress. It should be understood that the exclusive purpose of such invitations is to assist participants in obtaining funds or visas. It is not a commitment of the Organizing Committee to provide any financial support. Budapest, the Host City The twin cities of Buda and Pest are situated opposite each other on the banks of the Danube. Buda, on the right bank is the more ancient of the two, going back in her origins to Roman times and beyond. The baroque Royal Palace - looking down to the plain where the city of Pest sprawls - is the fourth or fifth regal habitat on the hill. Pest, the more modern, is the home of the country's political life and the seat of government. There, in the heart of the administration district, stands the magnificent neo-gothic building of the Houses of Parliament and just a couple of blocks away the central building of the Hungarian Academy of Sciences, next to the oldest bridge of the city. Pest, which stretches to the East and to the South, is also the center of business, banking and industry of the country. Do not miss the busy shopping street of "Vaci utca" with its elegant shops and cafes. Hilly Buda, with her famous museums on Castle Hill and the winding medieval streets of the old "burgher town", offering romantic walks and enchanting views of bustling Pest, is also renowned for the traditional Hungarian cuisine to be tasted in some of the country's finest restaurants. Another famous feature of Budapest are its thermal baths. They were introduced by the Turks in the 16th century. There are nice swimming pools, as well, so don't forget your swimming suit at home! Scientific correspondence should be addressed to the organizing committee: V.T. Sos (Committee Chair), A. Sali (secretary), L. Babai, B. Bollobas, A. Hajnal, G.O.H. Katona, M. Laczkovich, L. Lovasz, P. Revesz, A. Sarkozy, M. Simonovits, J. Szabados. URL: http://www.math-inst.hu/~erdos99 e-mail: erdos99@math-inst.hu fax: (+36-1-)317-7166 Renyi Mathematical Institute of HAS Budapest P.O.B. 127 H-1364 Hungary All other correspondence, including registration, hotel reservation, etc should be addressed to the Organazing Secretariat:=20 Ms Katalin Hajos=20 Office for International Cooperation=20 Hungarian Academy of Sciences=20 Budapest, Nador u.7. H-1051 Hungary=20 tel/fax: (+36-1-)317-2840=20 e-mail: khajos@office.mta.hu =0C ________________________________________________________________ HOTEL RESERVATION FORM Paul Erd=F5s and his Mathematics July 4- 11, 1999 Budapest, Hungary ____________________________________________________________ =20 NAME:..................................................................= .... Ms /Mr Family Name First Name= (s) PHONE: country code:.... area code:.... number:.....................= .... FAX : country code: ....area code: ....number:.....................= .... E-MAIL:......................................................... Please tick where appropriate: ____Single ____Double Date of arrival: .../ 07 /99 Date of departure: .../07 /99 Number of nights in hotel: .. Name of person(s) sharing room:................................. .............................................. Hotel deposit paid: ............................................ Method of payment:.............................................. Remarks:........................................................ ................................................................ Please tick at the required hotel category : HOTEL single room double room USD/night USD/ night * * * * * ____ Intercontinental, Hyatt 150 180 =09 * * * * ____ Mercure, Hungaria, Helia 110 140 =20 * * * ____ Orion, Bara, Griff 80 100 * * ____ Hill, Bolyai 40 50 * ____ Student hostel 20 30 Hotel rooms are to be reserved by sending a deposit for one night before April 15, 1999. Please note that reservations will be confirmed only after receipt of your hotel deposit. Hotel room rates are per night and include breakfast and all taxes. Final payments can be made by bank transfer or at the Registration Desk. Additional charges (e.g. mini-bar, laundry, telephone calls etc.) are to be paid to the hotel upon check-out. Date:____________________ =09 Signature:______________________________________________________ ________________________________________________________________ Please complete and sign this form and send along with the proof of payments before April 15, 1999 to the Office for International Cooperation of the Hungarian Academy of Sciences H-1051 Budapest, Nador u.7. Tel: + 36 (1) 317 6215 Fax: + 36 (1) 317 2840 or 317 6215 ________________________________________________________________ =0C REGISTRATION FORM Paul Erd=F5s and His Mathematics July 4-11, 1999 Budapest, Hungary ____________________________________________________________ Please print or type NAME:........................................................... Ms /Mr Family Name (for badge) First Name(s) COUNTRY:........................................................ COMPANY/ORGANIZATION:........................................... ................................................................ ................................................................ MAILING ADDRESS: ............................................... Street Address =09 ............................................... City Country with postal code:....................................... PHONE: country code:.....area code:....No:...................... FAX: country code:.....area code:....No:.................... E-MAIL: ........................................................ ACCOMPANYING PERSON(S): ........................................ ................................................................ ................................................................ =09 I enclose the following proof of payment : Registration fee:............................................USD Accompanying person's registration fee:......................USD Hotel deposit................................................USD _____________________USD (Please note that all fees must be paid in USD.) Credit Card: ____Visa ____MasterCard ____Other:________________ Card Number:___________________________________ Expiration Date:______________________________ Date: Signature:_________________________________ ____________________________________________________________________ Please complete and sign this form and send along with the proof of payments before April 15, 1999 to the Office for International Cooperation of the Hungarian Academy of Sciences H-1051 Budapest, Nador u.7. Tel: + 36 (1) 317 6215 Fax: + 36 (1) 317 2840 or 317 6215 =1A ------------- 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 From compgeom-owner@research.bell-labs.com Sun Feb 28 19:05:03 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id TAA06530; Sun, 28 Feb 1999 19:05:02 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id TAA08427; Sun, 28 Feb 1999 19:04:56 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Feb 28 11:57:30 EST 1999 Received: from research.research.bell-labs.com by netlib2; Fri Feb 26 11:23:03 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Feb 26 11:21:15 EST 1999 Received: from ibm35.engga.uwo.ca ([129.100.224.45]) by dusty; Fri Feb 26 11:21:13 EST 1999 Received: from localhost (dickijk@localhost) by ibm35.engga.uwo.ca (AIX4.3/UCB 8.8.8/8.7) with SMTP id LAA08396 for ; Fri, 26 Feb 1999 11:21:40 -0600 X-Authentication-Warning: ibm35.engga.uwo.ca: dickijk owned process doing -bs Date: Fri, 26 Feb 1999 11:21:40 -0600 (CST) From: John Dickinson To: compgeom-discuss Subject: Thanks. Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 709 Lines: 19 I just wanted to say thank you very much to everyone who sent me email regarding my request ofr information on Solid Modelling conferences. I recieved too many answers to reply to individually. John -- -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859) ---- John Kenneth Dickinson | "A sharp tongue is the only Grad. Student Mech. Eng. U.W.O. | edge tool that grows keener email: jkdickin@julian.uwo.ca | with constant use." http://publish.uwo.ca/~jkdickin/ | ------------- 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 From compgeom-owner@research.bell-labs.com Tue Mar 2 01:30:44 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id BAA23656; Tue, 2 Mar 1999 01:30:42 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id BAA01034; Tue, 2 Mar 1999 01:30:37 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Mar 1 18:18:50 EST 1999 Received: from research.research.bell-labs.com by netlib2; Mon Mar 1 03:55:04 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Mar 1 03:53:55 EST 1999 Received: from concave.cs.wits.ac.za ([146.141.27.66]) by dusty; Mon Mar 1 03:53:53 EST 1999 Received: from [146.141.27.215] (oconee.cs.wits.ac.za [146.141.27.215]) by concave.cs.wits.ac.za (8.8.8/8.8.8) with ESMTP id KAA03159 for ; Mon, 1 Mar 1999 10:53:47 +0200 (SAT) X-Sender: ian@mail.cs.wits.ac.za Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Mon, 1 Mar 1999 10:55:08 +0200 To: COMPGEOM-ANNOUNCE@research.bell-labs.com From: Ian Sanders Subject: SAICSIT'99: first announcement and call for papers Precedence: bulk Status: RO Content-Length: 3855 Lines: 106 SAICSIT'99: Prepare for the New Millennium ========================================= Johannesburg, South Africa The South African Institute of Computer Scientists and Information Technologists Annual Conference 17-19 November 1999 Conference Theme ================ For computers, 2000 is a big year because of the Y2k problem. Pedants may argue that the millennium starts in 2001, but 2000 is a big enough occasion if we can survive it. Are Computer Science and Information Systems academics and professionals ready for the new millennium? This conference is an opportunity to present papers on good ideas for the future of our area. The ACM and IEEE are currently debating Curriculum 2001. What should change? How much is fundamental? What will the hot issues of the next decade be? What can we learn from both developments in academia and best current practice in industry? South Africa has a strong tradition of research in Computer Science and Information Systems education, so this is likely to be a focus for some of the best contributions. However, papers in all areas of Computer Science and Information Systems are welcome. We would be especially interested to have experience papers from industry, to guide us in our future work. We have a strong programme committee to ensure that the quality of papers will be high. We also have a commitment to encourage new researchers to publish, with a new ideas track, and industry players to contribute, in an experience papers track. Call for Papers =============== Areas in which papers are solicited include, but are not restricted to: AI, robotics and expert systems acoustic rendering compilers computational geometry Computer Science education computer architecture computer graphics computer vision database systems electronic commerce formal methods and verification gender issues human computer interaction information management in commercial supply chains Information Systems education IS Strategy IT management methods of discrete optimisation multimedia and education multimedia object oriented systems, languages and design parallel and distributed computing programming languages simulation software engineering virtual reality Papers will be considered in three categories: * research papers: reviewed to standard of South African Computer Journal * ideas papers: papers not yet ready for journal publication but which contain an interesting idea * experience papers: papers which may not have the degree of novelty or academic contribution of a research papers, but which add to knowledge of practice in the field All papers will appear in a special issue of South African Computer Journal, with the papers which match SACJ's review standards specifically identified as research papers. How to Submit ============= See the detailed call for proposals at . Need to know more? Send mail to saicsit99-info@cs.wits.ac.za, or consult the conference web pages at . Key Dates ========= * Papers due: 22 July 1999 * Acceptances due: 27 August 1999 * final corrections due: 24 September 1999 * Conference dates 17-19 November 1999 -- Philip Machanick Department of Computer Science University of the Witwatersrand, 2050 Wits, South Africa phone 27(11) 716-4542 fax 339-3513/403-9317 http://www.cs.wits.ac.za/~philip/ mailto:philip@cs.wits.ac.za ------------- 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 From compgeom-owner@research.bell-labs.com Tue Mar 2 01:34:22 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id BAA23707; Tue, 2 Mar 1999 01:34:18 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id BAA01388; Tue, 2 Mar 1999 01:34:12 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Mar 1 18:23:38 EST 1999 To: compgeom-announce@research.bell-labs.com Received: from research.research.bell-labs.com by netlib2; Mon Mar 1 09:57:02 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Mar 1 09:55:13 EST 1999 Received: from mailer.siam.org ([192.108.225.1]) by dusty; Mon Mar 1 09:55:12 EST 1999 Received: from venn.siam.org (gateway.siam.org [192.108.225.116]) by mailer.siam.org (8.8.5/8.8.5) with SMTP id JAA11431 for ; Mon, 1 Mar 1999 09:55:11 -0500 (EST) From: flores@siam.org Received: from ccMail by venn.siam.org (ccMail Link to SMTP R8.00.00) id AA920300110; Mon, 01 Mar 99 09:55:12 -0500 Message-Id: <9903019203.AA920300110@venn.siam.org> X-Mailer: ccMail Link to SMTP R8.00.00 Date: Mon, 01 Mar 99 09:55:08 -0500 To: Subject: Brief announcement.Please Post in your electronic Newletter MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 534 Lines: 21 Sixth SIAM Conference on GEOMETRIC DESIGN November 2-5, 1999 Sheraton Old Town Hotel Albuquerque, New Mexico Deadline for submission of contributed abstracts: APRIL 1, 1999. For information about the conference, visit: www.siam.org/meetings/gd99 or contact meetings@siam.org ------------- 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 From compgeom-owner@research.bell-labs.com Tue Mar 2 01:49:26 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id BAA23961; Tue, 2 Mar 1999 01:49:23 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id BAA03283; Tue, 2 Mar 1999 01:49:16 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Mar 1 18:25:17 EST 1999 Received: from research.research.bell-labs.com by netlib2; Mon Mar 1 12:15:01 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Mar 1 12:14:23 EST 1999 Received: from jupiter.kaist.ac.kr ([143.248.135.80]) by dusty; Mon Mar 1 12:14:19 EST 1999 Received: (from kychwa@localhost) by jupiter.kaist.ac.kr (8.8.8Ha/8.8.8-NOSPAM) id CAA10753 for compgeom-announce@research.bell-labs.com; Tue, 2 Mar 1999 02:14:45 +0900 (KST) Message-ID: <19990302021444.A10742@jupiter.kaist.ac.kr> Date: Tue, 2 Mar 1999 02:14:44 +0900 From: Chwa Kyung-Yong To: compgeom-announce@research.bell-labs.com Subject: Distinguished Faculty Position Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Mailer: Mutt 0.93.2i Precedence: bulk Status: RO Content-Length: 1367 Lines: 30 Korea Advanced Institute of Science and Technology -------------------------------------------------- Distinguished Faculty Position ============================== The computer science department at Korea Advanced Institute of Science and Technology (KAIST) invites applications for a distinguished faculty position in, but not limited to, theoretical computer science. We invite applications from researchers whose work has earned to international acclaim. Duties include offering one course every semester, advising the department chairman, and conducting research programs. Research activities may be conducted independently or jointly with other KAIST faculties. Yearly salary, commensurate with qualifications and experience, is expected to be around US $ 120,000.00. The appointment can be made for up to three years starting from September 1999. Interested candidates are requested to submit their full C.V. to Faculty Search Committee Department of Computer Science, KAIST, 373-1 Kusong-dong, Yusong, Taejon, Korea 305-701 Fax: +82-42-869-3510, e-mail: fsc@cs.kaist.ac.kr Additional information is available at http://cs.kaist.ac.kr. ------------- 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 From compgeom-owner@research.bell-labs.com Tue Mar 2 01:53:24 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id BAA24015; Tue, 2 Mar 1999 01:53:23 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id BAA03525; Tue, 2 Mar 1999 01:53:15 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Mar 1 18:30:05 EST 1999 Received: from research.research.bell-labs.com by netlib2; Mon Mar 1 08:57:02 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Mar 1 08:56:16 EST 1999 Received: from ibm35.engga.uwo.ca ([129.100.224.45]) by dusty; Mon Mar 1 08:56:13 EST 1999 Received: from localhost (dickijk@localhost) by ibm35.engga.uwo.ca (AIX4.3/UCB 8.8.8/8.7) with SMTP id IAA08404 for ; Mon, 1 Mar 1999 08:56:35 -0600 X-Authentication-Warning: ibm35.engga.uwo.ca: dickijk owned process doing -bs Date: Mon, 1 Mar 1999 08:56:35 -0600 (CST) From: John Dickinson To: compgeom-discuss Subject: Re: What are the best conferences for Computational Geometry? (fwd) Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 9437 Lines: 250 I have been asked to direct to the list a sort of summary of the email I received on which were the best conferences. I didn't keep all the mail but I did keep three that are worth reviewing (passing on to everyone). I'll post them one by one (sorry, kludgy old email editor). John -- -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859) ---- John Kenneth Dickinson | "A sharp tongue is the only Grad. Student Mech. Eng. U.W.O. | edge tool that grows keener email: jkdickin@julian.uwo.ca | with constant use." http://publish.uwo.ca/~jkdickin/ | ---------- Forwarded message ---------- Date: Sun, 21 Feb 1999 21:50:18 -0500 From: Victor Milenkovic Reply-To: vjm@cs.miami.edu To: dickijk@engga.uwo.ca Subject: Re: What are the best conferences for Computational Geometry? I am the local arrangements chair for Symposium on Computational Geometry this year. I append the current information. I'll be updating the web page soon. The web site for the Solid Modeling Conference is: http://www.engin.umich.edu/dept/meam/deslab/cadcam/ACMSM/ Victor Victor Milenkovic Associate Professor of Computer Science University of Miami Department of Math and Computer Science P.O. Box 249085 Coral Gables, FL 33124 (305) 284-4194 FAX: -2848 Main Office: -2575 vjm@cs.miami.edu http://www.cs.miami.edu/~vjm/ >From: Marshall Bern >Subject: CFP-- ACM Symp. Computational Geometry >Comments: To: THEORY-A@LISTSERV.NODAK.EDU >To: THEORYNT@LISTSERV.NODAK.EDU > > CALL FOR PAPERS > > Fifteenth Annual ACM Symposium on > COMPUTATIONAL GEOMETRY > > June 13--16, 1999 > Miami Beach, Florida > > http://www.cs.miami.edu/events/SCG99/ > > Sponsored by ACM SIGACT & SIGGRAPH > > >The 1999 ACM Symposium on Computational Geometry, featuring >an applied track, a theoretical track, and a video review, >will be held at the Radisson Deauville Resort in Miami Beach, Florida. >We invite submissions that address > applications of geometric computing, for the applied track, or > fundamental problems of geometric computing, for the theoretical track. >During the conference, sessions of presentations will alternate between >the two tracks, rather than being in parallel. The proceedings, >with the papers of both tracks, will be distributed at the symposium >and will subsequently be available for purchase from ACM. A selection >of papers will be invited to special issues of journals. >The conference will accept electronic submissions of postscript files; >guidelines will be available via the conference homepage, given above. > > >Topics for the applied track include, but are not limited to > experimental analysis of algorithms and data structures; > robotics and virtual worlds; > computer graphics, simulation and visualization; > image processing; > geometric and solid modeling; > computer aided geometric design; > manufacturing; > geographical information systems. >Electronic submissions are preferred, but authors may instead >mail 14 copies of an extended abstract to arrive by December 4, 1998 to: > > John Canny > Computer Science Division > 529 Soda Hall > Berkeley, CA 94720-1776 > Phone: (510) 642-9955 > jfc@cs.berkeley.edu > >Topics for the theoretical track include, but are not limited to: > theoretical analysis of geometric algorithms and data structures; > discrete and combinatorial geometry; > mathematical and numerical issues arising from implementations. >Electronic submissions are preferred, but authors may instead >mail 8 copies of an extended abstract to arrive by December 4, 1998 to: > > Marshall Bern > Xerox PARC > 3333 Coyote Hill Road > Palo Alto, CA 94304-1314 > Phone: (650) 812-4443 > bern@parc.xerox.com > > >Important Dates > > December 4, 1998: Extended abstract due, both tracks > February 13, 1999: Video submissions due > February 15, 1999: Notification of acceptance or rejection of papers > March 1, 1999: Notification of acceptance or rejection of videos > March 15, 1999: Camera-ready papers due > April 15, 1999: Final versions of videos due > June 13-16, 1999: Symposium > > >Papers that primarily address practical issues >and implementation experience, even if not tied to >a particular application domain, should be submitted to >the applied track. Papers that primarily prove theorems >should be submitted to the theoretical track. >Most experimental work should be submitted to the >applied track; an exception would be experiments >in support of mathematical investigations. >Submissions to one track may be forwarded >to the other for consideration, unless the authors have explicitly >stated interest in one track only. > >An extended abstract sent to a program committee >should begin with a succinct statement of the problems and goals of >the paper, the main results, and the significance of the work in the >context of previous research. The abstract should provide sufficient detail to >allow the program committee to evaluate the validity, quality, and >relevance of the contribution. The entire extended abstract should not >exceed 10 pages at a reasonable font size. >An optional appendix may be included, but this >will be used at the program committee's discretion. > >Abstracts in hard copy must be received by December 4, 1998, or >postmarked by November 27 and sent airmail. Electronic submissions are >also due December 4. These are firm deadlines: late submissions will >not be considered. Authors will be notified of acceptance or rejection >by February 15, 1999. A full version of each contribution in final >form will be due by March 15, 1999 for inclusion in the proceedings. > > > Conference Chair: Victor Milenkovic (U Miami) > vjm@cs.miami.edu > >Applied Track Program Committee: > > Pankaj Agarwal (Duke) > Nina Amenta (U Texas) > Amy Briggs (Middlebury College) > John Canny, Chair (Berkeley) > David Dobkin (Princeton) > Dan Halperin (Tel Aviv) > Yan-Bin Jia (Carnegie-Mellon) > Lydia Kavraki (Rice) > Jean-Claude Latombe (Stanford) > Dinesh Pai (U British Columbia) > Jonathan Shewchuk (Berkeley) > Jack Snoeyink (U British Columbia) > Frank van der Stappen (Utrecht) > >Theoretical track Program Committee: > > Marshall Bern, Chair (Xerox PARC) > Herve Bronnimann (INRIA Sophia-Antipolis) > Timothy Chan (U Miami) > David Eppstein (UC-Irvine) > Bernd Gaertner (ETH Zuerich) > Jacob E. Goodman (City College, CUNY) > Anna Lubiw (U Waterloo) > > > > CALL FOR VIDEOS > > 8th Annual Video Review of Computational Geometry > >Background: This video review showcases the use of visualization in >computational geometry for exposition and education, as an interface >and a debugging tool in software development, and for the visual >exploration of geometry in research. Algorithm animations, visual >explanations of structural theorems, descriptions of applications of >computational geometry, and demonstrations of software systems are all >appropriate. Videos that accompany papers or communications submitted >to the technical program committee are encouraged. > >Submissions: Authors should send one preview copy of a videotape to the >address below by February 13, 1999. The videotape should be at most eight >minutes long (three to five minutes, preferred), and be in VHS NTSC >or VHS PAL format. > >Each video tape must be accompanied by >a one- or two-page description of the material >shown in the video, and where applicable, the techniques used >in the implementation. >Please format >descriptions following the guidelines for ACM proceedings. >Additional material describing the contents of the videos, such as the full >text of accompanying papers, may also be included. > >Textual material may be submitted electronically by e-mailing either >the URL of a PostScript file (preferred) or the PostScript file >itself to jeffe@cs.uiuc.edu. >If electronic submission is impossible, authors should include >5 hardcopies of the accompanying text with their video. > >Videotapes and accompanying text should be sent to: > > Jeff Erickson > Department of Computer Science > University of Illinois > 1304 W. Springfield Ave. > Urbana, IL 61801 > Phone: (217) 333-6769 > >For customs purposes, it is best to declare a value of $5. If you have >questions, please contact the committee chair at >jeffe@cs.uiuc.edu or (217) 333-6769. > >Notification: Authors will be notified of acceptance or rejection, and >given reviewers' comments by March 1, 1999. For each accepted >video, the final version of the textual description will be due by >March 15, 1999 for inclusion in the proceedings. Final versions of >accepted videos will be due April 15, 1999 in the best format >available. The accepted videos will be edited onto one tape, which >will be shown at the conference, distributed to the participants, and >available from ACM after the conference. > >Video Program Committee: > > Danny Chen (Notre Dame) > Jeff Erickson, Chair (U Illinois) > John Sullivan (U Illinois) > Subhash Suri (Washington U) > Shang-Hua Teng (U Illinois) > > ------------- 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 From compgeom-owner@research.bell-labs.com Tue Mar 2 01:58:42 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id BAA24098; Tue, 2 Mar 1999 01:58:41 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id BAA03888; Tue, 2 Mar 1999 01:58:35 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Mar 1 18:30:49 EST 1999 Received: from research.research.bell-labs.com by netlib2; Mon Mar 1 08:59:02 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Mar 1 08:57:18 EST 1999 Received: from ibm35.engga.uwo.ca ([129.100.224.45]) by dusty; Mon Mar 1 08:57:15 EST 1999 Received: from localhost (dickijk@localhost) by ibm35.engga.uwo.ca (AIX4.3/UCB 8.8.8/8.7) with SMTP id IAA10966 for ; Mon, 1 Mar 1999 08:57:37 -0600 X-Authentication-Warning: ibm35.engga.uwo.ca: dickijk owned process doing -bs Date: Mon, 1 Mar 1999 08:57:37 -0600 (CST) From: John Dickinson To: compgeom-discuss Subject: Re: What are the best conferences for Computational Geometry? (fwd) Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 1433 Lines: 45 2nd message with useful pointers! -- -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859) ---- John Kenneth Dickinson | "A sharp tongue is the only Grad. Student Mech. Eng. U.W.O. | edge tool that grows keener email: jkdickin@julian.uwo.ca | with constant use." http://publish.uwo.ca/~jkdickin/ | ---------- Forwarded message ---------- Date: Mon, 22 Feb 1999 12:22:01 +0100 From: Christian Icking To: John Dickinson Subject: Re: What are the best conferences for Computational Geometry? > What are the best conferences for Computational Geometry? Web addresses > for info for attendees welcome. Have a look at: http://www.cs.miami.edu/events/SCG99/ http://www-sop.inria.fr/prisme/cg99/ These pages might be interesting for you, too: http://www.ics.uci.edu/~eppstein/gina/conf.html http://www.uiuc.edu/ph/www/jeffe/compgeom/events.html http://www.scs.carleton.ca/~csgs/resources/cg.html http://www.geom.umn.edu/~mucke/GeomDir/ -- Christian Icking FernUniversitaet Hagen phone: +49 2331 / 987 - 4330 Praktische Informatik VI fax: +49 2331 / 987 - 4896 D - 58084 Hagen email: icking@feu.de ------------- 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 From compgeom-owner@research.bell-labs.com Tue Mar 2 02:15:21 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id CAA24391; Tue, 2 Mar 1999 02:15:20 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id CAA05434; Tue, 2 Mar 1999 02:15:10 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Mar 1 18:31:35 EST 1999 Received: from research.research.bell-labs.com by netlib2; Mon Mar 1 09:01:01 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Mar 1 08:59:51 EST 1999 Received: from ibm35.engga.uwo.ca ([129.100.224.45]) by dusty; Mon Mar 1 08:59:49 EST 1999 Received: from localhost (dickijk@localhost) by ibm35.engga.uwo.ca (AIX4.3/UCB 8.8.8/8.7) with SMTP id JAA11910 for ; Mon, 1 Mar 1999 09:00:11 -0600 X-Authentication-Warning: ibm35.engga.uwo.ca: dickijk owned process doing -bs Date: Mon, 1 Mar 1999 09:00:11 -0600 (CST) From: John Dickinson To: compgeom-discuss Subject: Last forawrded message about conferences and resources. Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 6943 Lines: 258 I had recieved another email from Joe Mitchell, but he also directed his response to the list so I won't repost it. John -- -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859) ---- John Kenneth Dickinson | "A sharp tongue is the only Grad. Student Mech. Eng. U.W.O. | edge tool that grows keener email: jkdickin@julian.uwo.ca | with constant use." http://publish.uwo.ca/~jkdickin/ | ---------- Forwarded message ---------- Date: Mon, 22 Feb 1999 09:37:28 -0500 (EST) From: Mike Pratt - MIDT To: dickijk@engga.uwo.ca Cc: pratt@nist.gov Subject: Re: What are the best conferences for Computational Geometry? ---------- John, Joe Mitchell's list does not contain many entires in the `shape modeling' area. I attach a list of my own, with more entries of this kind, and also more oriented towards applications in engineering design and manufacture. Mike Pratt ---------- X-Sun-Data-Type: default X-Sun-Data-Description: default X-Sun-Data-Name: confs.html X-Sun-Charset: us-ascii X-Sun-Content-Lines: 214 Meetings and Conferences

MEETINGS AND CONFERENCES

Format:

Dates
Title
Location
Organisers
Source of information (if no Web site)
Deadline details [D/M/Y] (if any)

************************************
*****************1999***************
************************************

22 - 24 February 1999
Swiss Conference on CAD/CAM
Neucha^tel, Switzerland
University of Neucha^tel
EXTENDED ABSTRACT BY 1998-11-15

23 - 26 February 1999
International Conference on Visual Computing (ICVC99)
Goa, India
IFIP TC5 and WG5.10
PAPERS BY 1998-10-15

1 - 4 March 1999
Shape Modeling International '99
Aizu-Wakamatsu, Japan
University of Aizu + ACM SIGGRAPH, CGS & IEEE Computer Society
FULL PAPER BY 1998-09-15

15 - 18 March 1999
1999 National Design Engineering Conference
Chicago, IL
[212-705-7008]
NOT KNOWN

15 - 17 March 1999
15th European Workshop on Computational Geometry
Antibes, France
NOT KNOWN
ABSTRACT BY 1999-01-15 (NO PAPERS)

13 - 16 April 199
Product Data Technology Europe 1999
Stavanger, Norway
EC DGIII, POSC/CAESAR, SINTEF etc.
ABSTRACT BY 1998-11-02

20 - 21 April 199
Solid Modelling '99 (!)
Coventry, UK
EDA Exhibitions?
NOT KNOWN

25 - 28 April 1999
NAFEMS World Congress '99 - `Effective Engineering Analysis'
Newport, RI
NAFEMS
ABSTRACTS BY 1998-05-15

2 - 4 June 1999
Graphics Interface '99
Kingston, Ontario, Canada
Canadian Human-Computer Communications Society
PAPERS BY 1999-10-31

9 - 11 June 1999
5th ACM Solid Modeling Symposium
Ann Arbor, MI
ACM
ABSTRACT BY 30/09/98, PAPER BY 30/10/98

13 - 16 June 1999
15th Annual ACM Symposium on Computational Geometry
Miami Beach, FL
ACM
NO DETAILS YET

21 - 27 June 1999
Computational Mathematics Driven by Industrial Applications
Martina Franca, Apulia, Italy
Centro Internazionale Matematico Estivo (CIME)
THIS IS A COURSE, NOT A CONFRENCE

3 - 7 July 1999
Curves and Surfaces '99
Saint-Malo, France
AFA etc.
NO INFORMATION YET

21 - 24 July 1999
3rd International Symposium on Assembly and Task Planning (ISATP'99)
Oporto, Portugal
IEEE Robotics & Automation Group
PAPERS BY 01/12/98

4 - 6 August 1999
2nd Symposium on Unstructured Mesh Generation
Boulder, Colorado
International Association for Computational Mechanics, etc.
ABSTRACTS by 1999-01-05, PAPERS BY 1999-03-29

8 - 13 August 1999
SIGGRAPH 99: 26th International Conference on Computer Graphics and Interactive Techniques
Los Angeles, CA
ACM SIGGRAPH
PAPERS BY 1999-01-13

7 - 11September 1999
Eurographics '99
MIlan, Italy
Eurographics
PAPERS BY 1999-01-15

12 - 15 September 1999
ASME Design Technical Conferences
Las Vegas, NV
ASME
FULL PAPERS PROBABLY AROUND DEC '98

4 - 8 October 1999
2nd International Conference on 3D Digital Imaging and Modeling
Ottawa, Canada
NRC Canada
PAPERS BY 1999-03-05

2 - 5 November 1999
6th SIAM Conference on Geometric Design
Albuquerque, NM
SIAM
MINISYMPOSIUM PROPOSALS BY 1998-03-01, PAPER ABSTRACTS BY 04-01

14 - 19 November 1999
International Mechanical Engineering Congress & Exposition
Nashville, TN
ASME
NOT YET KNOWN

********************************
************ 2000 **************
********************************

7 - 11 February 2000
7th International Central European Conference on Computer Graphics and Visualization (WSCG2000)
Plzen, Czech Republic Eurographics/ACM SIGGRAPH/IFIP WG5.10
FULL PAPER BY 1999-09-30(?)

10 - 12 April 2000
Geometric Modelling and Processing 2000
Hong Kong
IMA, GMS, IEEE Computer Society
FULL PAPER BY 1999-08-15

11 - 14 April 2000
Product Data Technology Europe 2000
Amsterdam, Netherlands
EC DGIII, POSC/CAESAR, SINTEF etc.
NOT YET KNOWN

22 - 26 May 2000
IFIP WG5.2 Conferences on CAD
Parma, Italy
NO DETAILS YET

June 2000
SoCG 00: 16th Annual ACM Symposium on Computational Geometry
Hong Kong
NO FURTHER INFORMATION YET

5 - 10 November 2000
International Mechanical Engineering Congress & Exposition
Orlando, FL
ASME
NOT YET KNOWN

********************************
************ 2001 **************
********************************

11 - 16 November 2001
International Mechanical Engineering Congress & Exposition
New York, NY
ASME
NOT YET KNOWN

------------- 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 From compgeom-owner@research.bell-labs.com Wed Mar 3 16:10:12 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA15647; Wed, 3 Mar 1999 16:10:11 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA01960; Wed, 3 Mar 1999 16:09:57 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Mar 3 09:02:10 EST 1999 Received: from research.research.bell-labs.com by netlib2; Mon Mar 1 19:01:02 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Mar 1 19:00:01 EST 1999 Received: from hera.EECS.Berkeley.EDU ([128.32.240.97]) by dusty; Mon Mar 1 18:59:59 EST 1999 Received: from hera.EECS.Berkeley.EDU (localhost.Berkeley.EDU [127.0.0.1]) by hera.EECS.Berkeley.EDU (8.8.5/8.8.3) with ESMTP id PAA29174 for ; Mon, 1 Mar 1999 15:59:58 -0800 From: Jonathan Shewchuk To: compgeom-discuss@research.bell-labs.com Subject: Stabbing numbers of triangulations Date: Mon, 01 Mar 1999 15:59:57 -0800 Message-ID: <29172.920332797@hera.EECS.Berkeley.EDU> Precedence: bulk Status: RO Content-Length: 817 Lines: 28 It is well known that a tetrahedralization of n vertices in E^3 may have Theta(n^2) tetrahedra. My main question: - Consider a line passing through a tetrahedralization. What is the (asymptotically) largest number of tetrahedra the line can intersect? If it's o(n^2), is there a proof? If it's Theta(n^2), is there an example? If anyone knows an answer to this, I would be very grateful to hear it. Some additional questions: - How about in dimensions higher than 3? - What if the triangulation is Delaunay? Thanks, Jonathan Shewchuk Computer Science Division University of California at Berkeley jrs@cs.berkeley.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 From compgeom-owner@research.bell-labs.com Wed Mar 3 19:38:30 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id TAA19985; Wed, 3 Mar 1999 19:38:29 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id TAA26456; Wed, 3 Mar 1999 19:38:19 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Mar 3 12:31:41 EST 1999 Received: from research.research.bell-labs.com by netlib2; Wed Mar 3 11:07:01 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Mar 3 11:05:27 EST 1999 Received: from cs.utexas.edu ([128.83.139.9]) by dusty; Wed Mar 3 11:05:25 EST 1999 Received: from olive.cs.utexas.edu (amenta@olive.cs.utexas.edu [128.83.120.97]) by cs.utexas.edu (8.8.5/8.8.5) with ESMTP id KAA24211 for ; Wed, 3 Mar 1999 10:05:24 -0600 (CST) Received: by olive.cs.utexas.edu (8.8.5/Client-1.5) id KAA04822; Wed, 3 Mar 1999 10:05:24 -0600 (CST) Message-Id: <199903031605.KAA04822@olive.cs.utexas.edu> From: "Nina Amenta" Date: Wed, 3 Mar 1999 10:05:24 -0600 X-Mailer: Mail User's Shell (7.2.6 beta(3) 11/17/96) To: compgeom-discuss@research.bell-labs.com Subject: Stabbing numbers of triangulations Precedence: bulk Status: RO Content-Length: 2248 Lines: 58 Jonathan Shewchuk asks: - Consider a line passing through a tetrahedralization. What is the (asymptotically) largest number of tetrahedra the line can intersect? If it's o(n^2), is there a proof? If it's Theta(n^2), is there an example? It's Theta(n^2), as a corollary of G"unter & my Deformed Products paper (aka Shadows and Slices). We showed that the intersection of a 2-plane H with the convex hull V of n vertices in R^4 can be a polygon G with O(n^2) faces. Each face of G is the intersection of H with a 3-face of V. Now consider projecting V to a 3-plane along a line contained in H. The projection of H becomes a line. The projection of each 3-face intersected by H becomes a tetrahedraon in either the projection of the upper or lower hull of V. One or the other of these must have O(n^2) tetrahedra intersecting the line corresponding to H. - How about in dimensions higher than 3? Same argument. The dual of a deformed product polytope in dimension d intersects some 2-plane in a polygon with O(n^floor(d/2)) faces. Again, project to dimension d-1 along a line parallel to the 2-plane. - What if the triangulation is Delaunay? Beats me. I tried a little to munge the deformed products construction so that the vertices all lay on a paraboloid, but no luck. We showed (same paper) that a slice through a *cyclic* 4-polytope can only have a linear number of faces, so it's possible that the same is true of the CH of points on a paraboloid. The reference is: Nina Amenta and G"unter Ziegler. Deformed products and maximal shadows of polytopes, in: Advances in Discrete and Computational Geometry (B. Chazelle, J.E. Goodman, R. Pollack, eds.), Contemporary Mathematics 223 (1999), Amer. Math. Soc., Providence, 57-90. ftp://ftp.math.tu-berlin.de/pub/Preprints/combi/Report-502-1996.ps.Z Conference version: Nina Amenta and G"unter Ziegler. Shadows and slices of polytopes, Proceedings of the 12th Annual ACM Symposium on Computational Geometry, pages 10-19, (1996). http://www.cs.utexas.edu/users/amenta/pubs/projection.ps.gz ------------- 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 From compgeom-owner@research.bell-labs.com Thu Mar 11 22:05:09 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id WAA13207; Thu, 11 Mar 1999 22:05:09 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id WAA02569; Thu, 11 Mar 1999 22:04:58 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Mar 11 14:57:16 EST 1999 Received: from research.research.bell-labs.com by netlib2; Tue Mar 9 05:37:03 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Mar 9 05:36:43 EST 1999 Received: from al-basit.info-ab.uclm.es ([161.67.8.19]) by dusty; Tue Mar 9 05:36:43 EST 1999 Received: from info-ab.uclm.es (alcala.info-ab.uclm.es [161.67.8.63]) by al-basit.info-ab.uclm.es (8.7.5/8.7.3) with ESMTP id LAA06729 for ; Tue, 9 Mar 1999 11:38:28 +0100 Message-ID: <36E4F8E6.CF3CA340@info-ab.uclm.es> Date: Tue, 09 Mar 1999 11:39:44 +0100 From: "Pascual GonzÂlez LÂpez" X-Mailer: Mozilla 4.03 [es] (Win95; I) MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com Subject: cube-sphere intersection Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO X-Status: A Content-Length: 459 Lines: 13 I need to determine the existence of an intersection between a cube and a sphere. I have found a solution that solves the problem, but I would like to apply the most efficient proposal. Which is the most efficient algorithm that solves this problem?. Thanks in advanced. ------------- 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 From compgeom-owner@research.bell-labs.com Thu Mar 18 16:42:14 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA04803; Thu, 18 Mar 1999 16:42:12 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA27442; Thu, 18 Mar 1999 16:41:31 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Mar 18 09:34:26 EST 1999 Received: from research.research.bell-labs.com by netlib2; Wed Mar 17 14:19:06 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Mar 17 14:18:57 EST 1999 Received: from burdell.cc.gatech.edu ([130.207.3.207]) by dusty; Wed Mar 17 14:18:57 EST 1999 Received: from gvu1.cc.gatech.edu (root@gvu1.cc.gatech.edu [130.207.119.241]) by burdell.cc.gatech.edu (8.9.1/8.9.1) with ESMTP id OAA27845 for ; Wed, 17 Mar 1999 14:18:56 -0500 (EST) Received: from [130.207.3.99] (rossignac.cc.gatech.edu [130.207.3.99]) by gvu1.cc.gatech.edu (8.9.1/8.9.1) with ESMTP id OAA00981 for ; Wed, 17 Mar 1999 14:18:49 -0500 (EST) X-Sender: jarek@gvu1.cc.gatech.edu Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Wed, 17 Mar 1999 14:18:34 -0400 To: compgeom-announce@research.bell-labs.com From: Jarek Rossignac Subject: Register for I3DG and hotel before March 26 Precedence: bulk Status: RO Content-Length: 2053 Lines: 59 The ACM SYMPOSIUM FOR INTERACTIVE 3-D GRAPHICS is fast approaching. The deadline for registration for conference and hotel is March 26, 1999. After that date, you may still register, but there is an additional $50 registration charge -- and the conference hotel will not guarantee to have rooms available at our special rate. If you have not yet registered, please register online today at http://www.gvu.gatech.edu/i3dg/registration.html and contact the Conference Hotel to reserve a room (see http://www.gvu.gatech.edu/i3dg/hotel.html) or call the Sheraton Colony Square Hotel in Atlanta at 404/894-6000 and ask for their future room reservations desk. Be sure to request the Interactive 3-D Graphics Symposium group rate. Program information for the conference is now up on the web: http://www.gvu.gatech.edu/i3dg/program.html There are a limited number of openings for student volunteers. Please pass this on to your colleagues and students. More information can be found at: http://www.gvu.gatech.edu/i3dg/volunteers.html Please contact (404) 894-4672 if you wish to reserve some space for industrial or academic exhibits. Hope to see you in Atlanta! - Jarek _______________________________________ Jarek Rossignac, Professor and Director GVU Center mailto:jarek@cc.gatech.edu Phone: 404/894-0671, Fax: 404/894-0673 http://www.gvu.gatech.edu/people/faculty/jarek.rossignac/ Mail address: College of Computing, Room 241 Georgia Institute of Technology Atlanta, GA 30332-0280 (For courier delivery please add: 801 Atlantic Drive, NW) For schedule-related issues, please contact and cc Vicky Skelton, 404/894-0075, mailto:vskelton@cc.gatech.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://uiuc.edu/~sariel/CG/compgeom/threads.html. From compgeom-owner@research.bell-labs.com Thu Mar 25 16:51:24 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA11156; Thu, 25 Mar 1999 16:51:23 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA15575; Thu, 25 Mar 1999 16:50:52 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Mar 25 09:39:03 EST 1999 Received: from research.research.bell-labs.com by netlib2; Wed Mar 24 15:43:02 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Wed Mar 24 15:41:33 EST 1999 Received: from duke.cs.duke.edu ([152.3.140.1]) by dusty; Wed Mar 24 15:41:32 EST 1999 Received: from polya.cs.duke.edu (polya.cs.duke.edu [152.3.140.71]) by duke.cs.duke.edu (8.9.1/8.9.1) with ESMTP id PAA00148 for ; Wed, 24 Mar 1999 15:41:30 -0500 (EST) From: Pankaj Kumar Agarwal Received: (pankaj@localhost) by polya.cs.duke.edu (8.8.5/8.6.9) id PAA13319 for compgeom-announce@research.bell-labs.com; Wed, 24 Mar 1999 15:41:30 -0500 (EST) Date: Wed, 24 Mar 1999 15:41:30 -0500 (EST) Message-Id: <199903242041.PAA13319@polya.cs.duke.edu> To: compgeom-announce@research.bell-labs.com Subject: Visiting Asst Prof position at Duke Precedence: bulk Status: RO Content-Length: 2547 Lines: 60 VISITING ASSISTANT PROFESSOR POSITION AVAILABLE Center for Geometric Computing Department of Computer Science Duke University A postdoctoral position at the level of Assistant Research Professor is available starting in September 1999 in the Center for Geometric Computing, Department of Computer Science at Duke University, under the supervision of Profs. Pankaj Agarwal and Jeff Vitter. Duke is an equal opportunity employer. The position, which is contingent upon grant funding, is for one year and can be extended for one or more additional years by mutual consent. Applicants must have clearly demonstrated experience and skills in the design, analysis, and implementation of combinatorial algorithms, especially in the area of geometric algorithms. Teaching responsibilities include one research course per year on a related topic. The position will include membership in the Center for Geometric Computing, a collaborative effort funded by the Army Research Office with participation from researchers at Brown, Duke, and Johns Hopkins Universities. (See http://www.cs.duke.edu/CGC/ for more information on the Center.) The problems of interest center around large-scale geometric computations. They include development of efficient methods for the design of geometric data structures, for constructing geometric configurations, and for geometric visualization. Issues involving I/O communication, memory hierarchies, and parallel models of computation are important. Apart from pursuing his or her own research interests in geometric computing, the candidate is expected to play a vital role in the center. Additional responsibilities will include interacting with agency scientists and helping prepare contract, technical, and other reports. The candidate will interact closely with geometric computing groups at Brown, Johns Hopkins, and the Army Research Laboratories. Please send your CV and a letter of research interests, and ask three evaluators to send letters of reference, by US Mail or email to Pankaj K. Agarwal Department of Computer Science Duke University Box 90129 Durham, NC 27708-0129 Email: pankaj@cs.duke.edu Tel: (919) 660-6540 To be assured of full consideration, all material including reference letters must arrive by April 23, 1999. ------------- 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 compgeom-owner@research.bell-labs.com Wed Mar 31 16:57:18 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA06467; Wed, 31 Mar 1999 16:57:17 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA27853; Wed, 31 Mar 1999 16:56:56 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Mar 31 09:48:38 EST 1999 To: compgeom-announce@research.bell-labs.com Received: from research.research.bell-labs.com by netlib2; Tue Mar 30 13:25:05 EST 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Mar 30 13:23:53 EST 1999 Received: from mailer.siam.org ([192.108.225.1]) by dusty; Tue Mar 30 13:23:52 EST 1999 Received: from venn.siam.org (gateway.siam.org [192.108.225.116]) by mailer.siam.org (8.8.5/8.8.5) with SMTP id NAA18170 for ; Tue, 30 Mar 1999 13:23:50 -0500 (EST) From: flores@siam.org Received: from ccMail by venn.siam.org (ccMail Link to SMTP R8.00.00) id AA922818228; Tue, 30 Mar 99 13:23:50 -0500 Message-Id: <9903309228.AA922818228@venn.siam.org> X-Mailer: ccMail Link to SMTP R8.00.00 Date: Tue, 30 Mar 99 13:23:46 -0500 To: Subject: PLEASE POST MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 938 Lines: 30 Sixth SIAM Conference on GEOMETRIC DESIGN November 2-5, 1999 Sheraton Old Town Hotel Albuquerque, New Mexico DEADLINE FOR ABSTRACT SUBMISSIONS EXTENDED TO APRIL 15, 1999. Due to several requests that we have received, the Organizing Committee is pleased to inform you that the DEADLINE for submissions of a 75-word abstract for a Standard Lecture Session or Poster Session; a 75-word abstract plus one-page extended abstract for a Focus Session has been extended to APRIL 15, 1999. For more information about the conference, visit: www.siam.org/meetings/gd99. ------------- 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 compgeom-owner@research.bell-labs.com Wed Apr 7 00:10:51 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA29928; Wed, 7 Apr 1999 00:10:50 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id BAA24495; Wed, 7 Apr 1999 01:10:35 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Apr 6 17:56:55 EDT 1999 Received: from research.research.bell-labs.com by netlib2; Tue Apr 6 11:19:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Apr 6 11:17:10 EDT 1999 Received: from mail.unixg.ubc.ca ([137.82.27.14]) by dusty; Tue Apr 6 11:17:08 EDT 1999 Received: from 00-05-02-fd-ef-c2.bconnected.net ([209.53.33.222]) by mail.unixg.ubc.ca with esmtp (Exim 1.92 #1) id 10UXb1-0000Vn-00; Tue, 6 Apr 1999 08:16:59 -0700 X-Mailer: Microsoft Outlook Express Macintosh Edition - 4.5 (0410) Date: Tue, 06 Apr 1999 07:16:23 -0800 Subject: CCCG 1st call for papers From: "Jack Snoeyink" To: compgeom-announce@research.bell-labs.com CC: mantler@cs.ubc.ca, snoeyink@cs.ubc.ca Mime-version: 1.0 X-Priority: 3 Content-type: text/plain; charset="ISO-8859-1" Content-transfer-encoding: quoted-printable Message-Id: Precedence: bulk Status: RO Content-Length: 2907 Lines: 66 -------------------------------------------------------- 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 compgeom-owner@research.bell-labs.com Tue Apr 13 17:33:53 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA16127; Tue, 13 Apr 1999 16:33:52 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA28173; Tue, 13 Apr 1999 16:29:25 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Apr 13 09:23:07 EDT 1999 Received: from research.research.bell-labs.com by netlib2; Tue Apr 13 07:29:01 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Tue Apr 13 07:27:56 EDT 1999 Received: from po7.andrew.cmu.edu ([128.2.10.107]) by dusty; Tue Apr 13 07:27:54 EDT 1999 Received: (from postman@localhost) by po7.andrew.cmu.edu (8.8.5/8.8.2) id HAA03761 for compgeom-announce@research.bell-labs.com; Tue, 13 Apr 1999 07:27:52 -0400 (EDT) Received: via switchmail; Tue, 13 Apr 1999 07:27:51 -0400 (EDT) Received: from pcs8.andrew.cmu.edu via qmail ID ; Tue, 13 Apr 1999 07:27:27 -0400 (EDT) Received: from pcs8.andrew.cmu.edu via qmail ID ; Tue, 13 Apr 1999 07:27:19 -0400 (EDT) Received: from mms.4.60.Jun.27.1996.03.02.53.sun4.51.EzMail.PC.3.2.CUILIB.3.45.SNAP.NOT.LINKED.pcs8.andrew.cmu.edu.sun4m.54 via MS.5.6.pcs8.andrew.cmu.edu.sun4_51; Tue, 13 Apr 1999 07:27:19 -0400 (EDT) Message-ID: <8r4mcLm00Ui701eEY0@andrew.cmu.edu> Date: Tue, 13 Apr 1999 07:27:19 -0400 (EDT) From: Kenji Shimada To: compgeom-announce@research.bell-labs.com Subject: 8IMR: call for papers Precedence: bulk Status: RO Content-Length: 9181 Lines: 237 *************************************************************** ** 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 compgeom-owner@research.bell-labs.com Sat Apr 17 01:29:47 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA16793; Sat, 17 Apr 1999 00:29:46 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id BAA22534; Sat, 17 Apr 1999 01:26:24 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Apr 16 18:22:15 EDT 1999 Received: from research.research.bell-labs.com by netlib2; Fri Apr 16 09:27:02 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Apr 16 09:25:38 EDT 1999 Received: from inf.ethz.ch ([129.132.10.10]) by dusty; Fri Apr 16 09:25:37 EDT 1999 Received: from shadow.inf.ethz.ch (gaertner@shadow-brain.inf.ethz.ch [129.132.16.3]) by inf.ethz.ch (8.8.8/8.8.8) with ESMTP id PAA07196; Fri, 16 Apr 1999 15:25:34 +0200 (MET DST) Received: (from gaertner@localhost) by shadow.inf.ethz.ch (8.8.8/8.8.8) id PAA14661; Fri, 16 Apr 1999 15:25:32 +0200 (MET DST) Date: Fri, 16 Apr 1999 15:25:32 +0200 (MET DST) From: Bernd Gaertner Message-Id: <199904161325.PAA14661@shadow.inf.ethz.ch> To: compgeom-announce@research.bell-labs.com Subject: New code for smallest enclosing balls Cc: gaertner@inf.ethz.ch X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 2300 Lines: 61 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 compgeom-owner@research.bell-labs.com Sat Apr 17 01:40:22 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA17082; Sat, 17 Apr 1999 00:40:22 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id BAA23100; Sat, 17 Apr 1999 01:37:05 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Apr 16 18:19:43 EDT 1999 Received: from research.research.bell-labs.com by netlib2; Fri Apr 16 08:39:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Apr 16 08:38:29 EDT 1999 Received: from grendel.csc.smith.edu ([131.229.222.23]) by dusty; Fri Apr 16 08:38:28 EDT 1999 Received: from coxeter.csc.smith.edu (coxeter.csc.smith.edu [131.229.222.126]) by grendel.csc.smith.edu (8.8.8/8.8.8/SC-CS-1.0) with ESMTP id IAA26036; Fri, 16 Apr 1999 08:38:28 -0400 (EDT) Received: from localhost (orourke@localhost) by coxeter.csc.smith.edu (8.8.8/8.8.8/SC-CScli-1.0) with ESMTP id IAA01666; Fri, 16 Apr 1999 08:38:26 -0400 (EDT) X-Authentication-Warning: coxeter.csc.smith.edu: orourke owned process doing -bs Date: Fri, 16 Apr 1999 08:38:26 -0400 From: "Joseph O'Rourke" To: compgeom-announce@research.bell-labs.com cc: Ken Clarkson Subject: Call for Steering Committee nominations Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 1796 Lines: 44 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 compgeom-owner@research.bell-labs.com Sat Apr 17 01:52:14 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA17257; Sat, 17 Apr 1999 00:52:12 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id BAA23711; Sat, 17 Apr 1999 01:48:58 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Apr 16 18:23:32 EDT 1999 Received: from research.research.bell-labs.com by netlib2; Fri Apr 16 14:37:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Fri Apr 16 14:36:15 EDT 1999 Received: from alpha.cs.miami.edu ([192.70.171.94]) by dusty; Fri Apr 16 14:36:14 EDT 1999 Received: by alpha.cs.miami.edu id AA05664; Fri, 16 Apr 1999 14:36:17 -0400 Date: Fri, 16 Apr 1999 14:36:17 -0400 From: Victor Milenkovic Message-Id: <9904161836.AA05664@alpha.cs.miami.edu> To: compgeom-announce@research.bell-labs.com Subject: 15th Annual ACM Symposium on Computational Geometry Reply-To: vjm@cs.miami.edu Precedence: bulk Status: RO Content-Length: 1154 Lines: 32 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 compgeom-owner@research.bell-labs.com Mon Apr 19 16:56:27 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id PAA03867; Mon, 19 Apr 1999 15:56:25 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA24653; Mon, 19 Apr 1999 16:52:32 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Apr 19 09:45:31 EDT 1999 Received: from research.research.bell-labs.com by netlib2; Sat Apr 17 19:33:01 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Sat Apr 17 19:31:09 EDT 1999 Received: from siren.shore.net ([207.244.124.5]) by dusty; Sat Apr 17 19:31:08 EDT 1999 Received: from pm4-062.port.shore.net (default) [207.244.108.62] by siren.shore.net with smtp (Exim) id 10YeYD-0002BK-00; Sat, 17 Apr 1999 19:31:06 -0400 Message-Id: <3.0.3.32.19990417193059.0086bb70@shell1.shore.net> X-Sender: bradb@shell1.shore.net X-Mailer: QUALCOMM Windows Eudora Pro Version 3.0.3 (32) Date: Sat, 17 Apr 1999 19:30:59 -0400 To: compgeom-discuss@research.bell-labs.com From: Brad Barber Subject: decomposition of non-convex objects Cc: nagle@shell5.ba.best.com Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Precedence: bulk Status: RO Content-Length: 1706 Lines: 45 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 compgeom-owner@research.bell-labs.com Tue Apr 20 16:36:52 1999 Return-Path: Received: from post.tau.ac.il (root@[132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id PAA13397; Tue, 20 Apr 1999 15:36:49 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA19567; Tue, 20 Apr 1999 16:33:20 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Apr 20 09:22:26 EDT 1999 Received: from research.research.bell-labs.com by netlib2; Mon Apr 19 14:27:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Apr 19 14:26:03 EDT 1999 Received: from me.engr.wisc.edu ([128.104.189.230]) by dusty; Mon Apr 19 14:25:57 EDT 1999 Received: from sal-hop (vshapiro-laptop.engr.wisc.edu [128.104.189.75]) by me.engr.wisc.edu (8.8.8+Sun/8.8.8L) with SMTP id NAA24606; Mon, 19 Apr 1999 13:25:46 -0500 (CDT) Message-Id: <199904191825.NAA24606@me.engr.wisc.edu> X-Sender: vshapiro@me.engr.wisc.edu X-Mailer: QUALCOMM Windows Eudora Pro Version 4.0 Date: Mon, 19 Apr 1999 13:30:40 -0400 To: Brad Barber , compgeom-discuss@research.bell-labs.com From: Vadim Shapiro Subject: Re: decomposition of non-convex objects Cc: nagle@shell5.ba.best.com In-Reply-To: <3.0.3.32.19990417193059.0086bb70@shell1.shore.net> Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Precedence: bulk Status: RO Content-Length: 3440 Lines: 97 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 compgeom-owner@research.bell-labs.com Tue Apr 20 16:39:40 1999 Return-Path: Received: from post.tau.ac.il (root@[132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id PAA13465; Tue, 20 Apr 1999 15:39:33 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA19935; Tue, 20 Apr 1999 16:36:13 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Apr 20 09:20:19 EDT 1999 Received: from research.research.bell-labs.com by netlib2; Mon Apr 19 10:21:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Mon Apr 19 10:20:36 EDT 1999 Received: from tribble.cme.nist.gov ([129.6.32.54]) by dusty; Mon Apr 19 10:20:36 EDT 1999 Received: from titanic.cme.nist.gov (titanic.cme.nist.gov [129.6.32.10]) by tribble.cme.nist.gov (8.8.6/8.8.6) with ESMTP id KAA02204; Mon, 19 Apr 1999 10:20:32 -0400 (EDT) Received: from h185161.nist.gov (euclid [129.6.185.161]) by titanic.cme.nist.gov (8.8.6/8.8.6) with ESMTP id KAA06311; Mon, 19 Apr 1999 10:20:29 -0400 (EDT) From: Mike Pratt - MIDT Received: (from pratt@localhost) by h185161.nist.gov (8.8.6/8.8.6) id KAA16516; Mon, 19 Apr 1999 10:20:29 -0400 (EDT) Date: Mon, 19 Apr 1999 10:20:29 -0400 (EDT) Message-Id: <199904191420.KAA16516@h185161.nist.gov> To: bradb@shore.net Subject: Re: decomposition of non-convex objects Cc: compgeom-discuss@research.bell-labs.com X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 602 Lines: 20 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 compgeom-owner@research.bell-labs.com Tue Apr 27 20:50:24 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id TAA29910; Tue, 27 Apr 1999 19:50:22 +0200 (GMT+0200) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id UAA23882; Tue, 27 Apr 1999 20:47:01 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Apr 27 13:37:31 EDT 1999 Received: from research.research.bell-labs.com by netlib2; Sun Apr 18 07:59:02 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by research; Sun Apr 18 07:57:57 EDT 1999 Received: from grande.dcc.unicamp.br ([143.106.1.11]) by dusty; Sun Apr 18 07:57:55 EDT 1999 Received: from amazonas.dcc.unicamp.br (amazonas.dcc.unicamp.br [143.106.7.11]) by grande.dcc.unicamp.br (8.9.1/8.9.1) with ESMTP id IAA04647; Sun, 18 Apr 1999 08:53:59 -0300 (EST) Received: from coruja.dcc.unicamp.br (coruja.dcc.unicamp.br [143.106.24.80]) by amazonas.dcc.unicamp.br (8.8.5/8.8.5) with ESMTP id IAA03839; Sun, 18 Apr 1999 08:54:00 -0300 (EST) Received: (from stolfi@localhost) by coruja.dcc.unicamp.br (8.8.5/8.8.5) id IAA23269; Sun, 18 Apr 1999 08:53:53 -0300 (EST) Date: Sun, 18 Apr 1999 08:53:53 -0300 (EST) Message-Id: <199904181153.IAA23269@coruja.dcc.unicamp.br> From: Jorge Stolfi To: compgeom-announce@research.bell-labs.com, moderator@vislist.com, globillum@imag.fr, image-based-rendering@cs.unc.edu Cc: (Alexandre Xavier Falcăo) afalcao@dcc.unicamp.br, (Antonio Oliveira) oliveira@taurus.lcg.ufrj.br, (Arnaldo Albuquerque) arnaldo@dcc.ufmg.br, (Brian Wyvill) brian.wyvill@imag.fr, (Carla M. S. Freitas) carla@inf.ufrgs.br, (Clésio Luis Tozzi) clesio@dca.fee.unicamp.br, (Gilbertto Prado) gtto@sol.com.br, (Gilles Bertrand) bertrang@esiee.fr, (Ivan Luiz Marques Ricarte) ricarte@dca.fee.unicamp.br, (José Encarnaçăo) jle2@igd.fhg.de, (José Mario De Martino) martino@dca.fee.unicamp.br, (Joăo Marques de Carvalho) carvalho@petri.dee.ufpb.br, (Junior Barrera) jb@ime.usp.br, (Luciano da Fontoura Costa) luciano@if.sc.usp.br, (Luiz H. de Figueiredo) lhf@visgraf.impa.br, (Léo Pini Magalhăes) leopini@dca.fee.unicamp.br, (Manuel Próspero dos Santos) ps@di.fct.unl.pt, (Marcelo Knörich Zuffo) mkzuffo@lsi.usp.br, (Maria Cecilia Baranauskas) cecilia@dcc.unicamp.br, (Márcio Lobo Neto) lobonett@lsi.usp.br, (Nelson D. Á. Mascarenhas) nelson@dc.ufscar.br, (Neucimar Jerônimo Leite) neucimar@dcc.unicamp.br, (Olga Regina Pereira Bellon) olga@inf.ufpr.br, (Paulo Cezar Carvalho) pcezar@visgraf.impa.br, (Paulo Cezar Pinto Carvalho) pcezar@impa.br, (Pedro Jussieu de Rezende) rezende@dcc.unicamp.br, (Peter Eades) peter.eades@ul.ie, (Roberto de Alencar Lotufo) lotufo@dca.fee.unicamp.br, (Wu Shin-Ting) ting@dca.fee.unicamp.br Subject: SIBGRAPI'99 - LAST CALL FOR PAPERS and DEADLINE EXTENSION MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Reply-To: stolfi@dcc.unicamp.br Content-Transfer-Encoding: 8bit Precedence: bulk Status: RO Content-Length: 851 Lines: 23 [ 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. From compgeom-owner@research.bell-labs.com Tue May 18 03:42:57 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id DAA01644; Tue, 18 May 1999 03:42:56 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id DAA28779; Tue, 18 May 1999 03:39:45 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon May 17 20:35:46 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Sat May 15 15:43:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Sat May 15 15:42:03 EDT 1999 Received: from dirty.research.bell-labs.com ([204.178.16.6]) by dusty; Sat May 15 15:42:01 EDT 1999 Received: from aditya.pune.gsslco.co.in ([202.141.13.254]) by dirty; Sat May 15 15:35:17 EDT 1999 Received: from bhanu.pune.gsslco.co.in (bhanu.pune.gsslco.co.in [202.54.16.68]) by aditya.pune.gsslco.co.in (8.9.3/8.9.3) with ESMTP id AAA14217 for ; Sun, 16 May 1999 00:29:04 +0530 (IST) Received: from gsslco.co.in (trimitee.pune.gsslco.co.in [172.16.3.53]) by bhanu.pune.gsslco.co.in (8.8.4/8.8.4) with ESMTP id AAA23412 for ; Sun, 16 May 1999 00:29:18 +0530 (IST) Message-ID: <373DC368.1523DDCA@gsslco.co.in> Date: Sun, 16 May 1999 00:26:40 +0530 From: Yogesh Sajanikar Reply-To: yogeshs@gsslco.co.in Organization: Geometric Software Services Ltd X-Mailer: Mozilla 4.5 [en] (WinNT; I) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com Subject: cylindrical spline conversion to cartesian spline! Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 591 Lines: 22 Hi, My sincere apologies if I have posted a too novice question. I am working on a problem where I need to transfer a b-spline defined in cylindrical coordinates into a ( / may be an approximate ) cartesian b-spline. I would like to know of any methods / algorithms to solve the problem. Thanks in advance. Regards, Yogesh ------------- 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 compgeom-owner@research.bell-labs.com Tue May 18 03:54:45 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id DAA02125; Tue, 18 May 1999 03:54:44 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id DAA29442; Tue, 18 May 1999 03:51:31 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon May 17 20:34:44 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Mon May 17 10:55:05 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon May 17 10:53:45 EDT 1999 Received: from amirani.ams.sunysb.edu ([129.49.6.2]) by dusty; Mon May 17 10:53:44 EDT 1999 Received: from grizzly.ams (grizzly.ams.sunysb.edu [129.49.6.100]) by amirani.ams.sunysb.edu (8.9.1a/8.9.1) with SMTP id KAA12352; Mon, 17 May 1999 10:53:30 -0400 (EDT) Received: by grizzly.ams (SMI-8.6/SMI-SVR4) id KAA22593; Mon, 17 May 1999 10:53:29 -0400 From: jklosow@ams.sunysb.edu (James Klosowski) Message-Id: <199905171453.KAA22593@grizzly.ams> Subject: QuickCD Collision Detection Library To: compgeom-announce@research.bell-labs.com, i_collide@cs.unc.edu Date: Mon, 17 May 1999 10:53:28 -0400 (EDT) Cc: jklosow@ams.sunysb.edu (James Klosowski) X-Mailer: ELM [version 2.4 PL24 ME8b] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 3211 Lines: 75 QuickCD Version 1.00 --------------------- We are pleased to announce the release of QuickCD, an efficient collision detection package for large polygonal environments. QuickCD has been implemented in C and tested upon a variety of UNIX platforms (SGI, Sun, Linux PC). It accepts as input general polygonal models (often called ``polygon soup''), and can easily handle cracks, self-intersections, and other deficiencies of the input data. Our method is based upon building bounding-volume hierarchies to approximate the input models. Our choice of bounding volume is to use a ``discrete orientation polytope'', or what we have come to call a ``k-dop'', which is a convex polytope whose facets are determined by halfspaces whose outward normals come from a small fixed set of k orientations. Due to our choice of bounding volume, the construction of the hierarchies and the collision detection algorithm are straight-forward and very efficient, both in terms of memory requirements and speed. Another nice feature of our library is that we are able to exploit temporal coherence as objects move from one step to the next. QuickCD has been around for a while, although, until now, only with limited distribution. It was first announced at SIGGRAPH'96 (Vis. Proc., p. 151), where it was compared with the state-of-the-art RAPID system, based on OBB-trees (SIGGRAPH'96). A more complete description of the data structures and algorithms used within the QuickCD library is given in its journal publication: ``Efficient Collision Detection using Bounding Volume Hierarchies of k-DOPs'', which can be found in IEEE Transactions on Visualization and Computer Graphics, vol. 4, no. 1, pp. 21--36, Jan--March 1998. See also the PhD thesis of J. Klosowski for further details. In comparisons with other publicly available collision detection libraries, QuickCD has performed very favorably. The QuickCD library has been developed at the Computational Geometry Lab at the State University of New York at Stony Brook. It has been written by: Jim Klosowski (jklosow@ams.sunysb.edu) Martin Held (held@ams.sunysb.edu) Joseph S.B. Mitchell (jsbm@ams.sunysb.edu) For further information and instructions on how to obtain the source code and example data sets, please visit the QuickCD web page: http://www.ams.sunysb.edu/~jklosow/quickcd/QuickCD.html Please direct comments and questions concerning QuickCD (including being added to the mailing list) to quickcd@ams.sunysb.edu Thank you. Jim Klosowski ------------------------------------------------------------------------- James T. Klosowski Tel : 516-632-8366 Department of Applied Mathematics Fax : 516-632-8490 SUNY Stony Brook WWW : www.ams.sunysb.edu/~jklosow Stony Brook, NY 11794-3600 Email : jklosow@ams.sunysb.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://uiuc.edu/~sariel/CG/compgeom/threads.html. From compgeom-owner@research.bell-labs.com Wed May 19 16:13:34 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA05757; Wed, 19 May 1999 16:13:32 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA00129; Wed, 19 May 1999 16:09:30 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed May 19 09:00:41 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Wed May 19 08:09:05 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed May 19 08:07:26 EDT 1999 Received: from ensg.u-nancy.fr ([192.93.48.6]) by dusty; Wed May 19 08:07:22 EDT 1999 Received: from [192.93.48.154] (royerfx.ensg.u-nancy.fr [192.93.48.154]) by ensg.u-nancy.fr (8.8.8-scinfo/8.8.8-scinfo) with SMTP id OAA01238; Wed, 19 May 1999 14:05:57 +0200 (METDST) Date: Wed, 19 May 1999 14:05:57 +0200 (METDST) Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable X-Mailer: Eudora F1.5.3 To: Jean-Jacques.Royer@ensg.u-nancy.fr From: Jean-Jacques.Royer@ensg.u-nancy.fr (ROYER Jean-Jacques) Subject: CODATA Conference 28-30 June, Paris Precedence: bulk Status: RO Content-Length: 1732 Lines: 44 Dear colleagues I would like to inform you of a forthcoming CODATA Euro-American conference on "Management of Data Information and Knowledge" to be held in Paris, next 28-30 June 1999. The instruction for manuscripts are available at the following address: http://crpg.cnrs-nancy.fr/NEWS/CODATA/Workshop99.html The inscription form is also directly accessible from the Web. I will appreciate if you could diffuse by e-mail the information in order to promote the conference. Thank you in advance for diffusing this information in your institute and for your participation. Sorry for eventual multi postage. Yours Sincerely ____________________________________________________________________________= _ Dr. Jean-Jacques ROYER | Centre de Recherches P=E9trographiques Ecole Nationale Sup=E9rieure de G=E9ologie | et G=E9ochimiques C.R.P.G./C= .N.R.S. I.N.P.L./C.R.P.G./E.N.S.G. | 15 rue ND des Pauvres, B.P. 20 Computer Science Department | F 54501 Vandoeuvre-Les-Nancy rue du Doyen Marcel Roubault, B.P. 40 | France =46 54501 Vandoeuvre-Les-Nancy | =46rance | phone: 33 (0)3 83 59 64 28 | phone: 33 (0)3 83 59 42 25 fax: 33 (0)3 83 59 64 60 ou 64 | fax: 33 (0)3 83 51 17 98 E-mail: Jean-Jacques.Royer@ensg.u-nancy.fr| E-mail: royer@crpg.cnrs-nancy.fr ____________________________________________________________________________ _ ------------- 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 compgeom-owner@research.bell-labs.com Tue May 25 16:26:16 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA00138; Tue, 25 May 1999 16:26:14 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA28471; Tue, 25 May 1999 16:22:19 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue May 25 09:13:46 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Mon May 24 09:29:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon May 24 09:28:20 EDT 1999 Received: from grendel.csc.smith.edu ([131.229.222.23]) by dusty; Mon May 24 09:28:19 EDT 1999 Received: from coxeter.csc.smith.edu (coxeter.csc.smith.edu [131.229.222.126]) by grendel.csc.smith.edu (8.8.8/8.8.8/SC-CS-1.0) with ESMTP id JAA11510; Mon, 24 May 1999 09:28:20 -0400 (EDT) Received: from localhost (orourke@localhost) by coxeter.csc.smith.edu (8.8.8/8.8.8/SC-CScli-1.0) with ESMTP id JAA39044; Mon, 24 May 1999 09:28:17 -0400 (EDT) X-Authentication-Warning: coxeter.csc.smith.edu: orourke owned process doing -bs Date: Mon, 24 May 1999 09:28:17 -0400 From: "Joseph O'Rourke" To: Comp Geom Announce cc: Ken Clarkson Subject: Election results Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 976 Lines: 28 Dear Members of the Comp Geom Community, I am pleased to announce the results of our Steering Committee election. One hundred and five ballots were received, each recording votes for up to five of the twenty-five candidates. The five candidates who received the most votes are: Pankaj Agarwal Jean-Daniel Boissonnat Mike Goodrich Joe Mitchell Jack Snoeyink These five become the new Computational Geometry Steering Committee, to serve two-year appointments. They will organize themselves into officers (Chair, Secretary, etc.) as they see fit, and report at the upcoming SoCG business meeting. Thanks to all for participating in our election process! Joe O'Rourke (Outgoing) 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 compgeom-owner@research.bell-labs.com Tue May 25 16:40:40 1999 Return-Path: Received: from post.tau.ac.il (root@post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA00534; Tue, 25 May 1999 16:40:38 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA29998; Tue, 25 May 1999 16:37:03 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue May 25 09:16:27 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Mon May 24 17:35:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon May 24 17:33:03 EDT 1999 Received: from wsintt08.win.tue.nl ([131.155.70.199]) by dusty; Mon May 24 17:33:02 EDT 1999 Received: from gino@localhost by wsintt08.win.tue.nl (8.8.7) for compgeom-announce@research.bell-labs.com id XAA01440. Mon, 24 May 1999 23:32:58 +0200 (MET DST) Message-ID: <19990524233258.A1436@win.tue.nl> Date: Mon, 24 May 1999 23:32:58 +0200 From: Gino van den Bergen To: compgeom-announce@research.bell-labs.com Subject: ANNOUNCE: GJK-engine collision detection library Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Mailer: Mutt 0.93i Precedence: bulk Status: RO Content-Length: 1229 Lines: 31 I'm happy to announce the release of GJK-engine. GJK-engine is basically the 'heart' of SOLID, a general-purpose software library for collision detection of 3D objects. GJK-engine is a fast and robust implementation of the Gilbert-Johnson-Keerthi algorithm. SOLID uses the GJK algorithm for testing intersections, determining common points, and computing pairs of closest points of convex objects. The GJK-engine is released as a separate library, without the API and bounding-box structures of SOLID. An archive file containing the sources for building the library and an OpenGL demo application can be downloaded from: http://www.win.tue.nl/~gino/solid/ The library is written in standard C++ and relies on STL. Currently, it compiles under GNU g++ version 2.8.1 and Visual C++ 5.0. The source code and documentation is released under the terms of the GNU Library General Public License. -- Gino van den Bergen http://www.win.tue.nl/cs/tt/gino/ ------------- 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 compgeom-owner@research.bell-labs.com Fri Jun 18 16:07:21 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA08983; Fri, 18 Jun 1999 16:07:20 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA02517; Fri, 18 Jun 1999 16:03:39 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Jun 18 08:57:25 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Fri Jun 18 02:33:05 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Jun 18 02:32:53 EDT 1999 Received: from mail1.rrz.Uni-Koeln.DE ([134.95.100.208]) by dusty; Fri Jun 18 02:32:52 EDT 1999 Received: from campfire.rrz.Uni-Koeln.DE (IDENT:785@campfire.rrz.Uni-Koeln.DE [134.95.19.27]) by mail1.rrz.Uni-Koeln.DE (8.9.1a/8.9.1) with ESMTP id IAA23260 for ; Fri, 18 Jun 1999 08:32:38 +0200 (MET DST) Received: (from al001@localhost) by campfire.rrz.Uni-Koeln.DE (8.9.1a/8.9.1) id IAA06529 for compgeom-discuss@research.bell-labs.com; Fri, 18 Jun 1999 08:32:36 +0200 (MET DST) Message-Id: <199906180632.IAA06529@campfire.rrz.Uni-Koeln.DE> Subject: Points_in_Plane_Triangles From: al001@mail1.rrz.Uni-Koeln.DE (Irwin Scollar) Date: Fri, 18 Jun 1999 08:32:36 +0200 (MET DST) To: compgeom-discuss@research.bell-labs.com X-Mailer: fastmail [version 2.4 PL23] Precedence: bulk Status: RO X-Status: A Content-Length: 747 Lines: 19 Given a large scatter of points bounded by a convex hull on a plane, find three points in the scatter which are the vertices of a triangle which has an area larger than that defined by any other set of three points. Can anyone supply a reference to an efficient algorithm and a data structure for solving this problem faster than by brute force or suggest a method for dealing with it if nothing has been published? Irwin Scollar Cologne University AL001@MAIL1.RRZ.UNI-KOELN.DE ------------- 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 compgeom-owner@research.bell-labs.com Fri Jun 18 16:13:51 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA09092; Fri, 18 Jun 1999 16:13:50 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA02975; Fri, 18 Jun 1999 16:10:08 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Jun 18 09:00:31 EDT 1999 To: compgeom-announce@research.bell-labs.com Received: from grubby.research.bell-labs.com by netlib2; Wed Jun 16 13:03:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Jun 16 13:01:24 EDT 1999 Received: from turing.siam.org ([192.108.225.1]) by dusty; Wed Jun 16 13:01:23 EDT 1999 Received: from venn.siam.org (gateway.siam.org [192.108.225.116]) by turing.siam.org (8.9.1b+Sun/8.9.1) with SMTP id NAA09022 for ; Wed, 16 Jun 1999 13:01:06 -0400 (EDT) From: flores@siam.org Received: from ccMail by venn.siam.org (ccMail Link to SMTP R8.00.00) id AA929552481; Wed, 16 Jun 99 13:01:23 -0500 Message-Id: <9906169295.AA929552481@venn.siam.org> X-Mailer: ccMail Link to SMTP R8.00.00 Date: Wed, 16 Jun 99 13:01:20 -0500 To: Subject: PLEASE POST IN YOUR ELECTRONIC NEWSLETTER. THANK YOU. MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 812 Lines: 28 Sixth SIAM Conference on Geometric Design and Short Course on Applications of Classical Geometry in Computer-Aided Design November 2-6, 1999 Sheraton Old Town Hotel Albuquerque, New Mexico The technical program and information on hotel, transportation, and registrations for both conference and short course are now available on the Web. Please visit the conference Web page at www.siam.org/meetings/gd99/ or contact SIAM at meetings@siam.org ------------- 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 compgeom-owner@research.bell-labs.com Fri Jun 18 17:31:17 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id RAA10322; Fri, 18 Jun 1999 17:31:16 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id RAA07869; Fri, 18 Jun 1999 17:27:34 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Jun 18 10:19:20 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Fri Jun 18 09:59:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Jun 18 09:58:15 EDT 1999 Received: from core.inf.ethz.ch ([129.132.178.196]) by dusty; Fri Jun 18 09:58:13 EDT 1999 Received: from lala.inf.ethz.ch (lala.inf.ethz.ch [129.132.11.142]) by core.inf.ethz.ch (8.9.3/8.9.3) with ESMTP id PAA18504; Fri, 18 Jun 1999 15:58:07 +0200 (MET DST) Received: (from hoffmann@localhost) by lala.inf.ethz.ch (980427.SGI.8.8.8/980728.SGI.AUTOCF) id PAA24308; Fri, 18 Jun 1999 15:58:06 +0200 (CEST) From: "Michael Hoffmann" Message-Id: <9906181558.ZM24307@lala.inf.ethz.ch> Date: Fri, 18 Jun 1999 15:58:06 +0000 In-Reply-To: al001@mail1.rrz.Uni-Koeln.DE (Irwin Scollar) "Points_in_Plane_Triangles" (Jun 18, 8:32am) References: <199906180632.IAA06529@campfire.rrz.Uni-Koeln.DE> X-Mailer: Z-Mail (3.2.3 08feb96 MediaMail) To: al001@mail1.rrz.uni-koeln.de (Irwin Scollar) Subject: Re: Points_in_Plane_Triangles Cc: compgeom-discuss@research.bell-labs.com Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Precedence: bulk Status: RO Content-Length: 1885 Lines: 48 On Jun 18, 8:32am, Irwin Scollar wrote: > Subject: Points_in_Plane_Triangles > Given a large scatter of points bounded by a convex hull on a plane, find > three points in the scatter which are the vertices of a triangle which has an > area larger than that defined by any other set of three points. If you are looking for an implementation, we have implemented a O(kn + n log n) algorithm for finding the maximal (wrt area or perimeter) k-gon in the CGAL library, see http://www.cs.uu.nl/CGAL The implementation is based on an algorithm by Aggarwal et al, references below. For the special case of maximum area triangles there is also a linear algorithm by Dobkin and Snyder (not (yet;) in CGAL). Best regards, Michael Hoffmann Theoretical Computer Science email: hoffmann@inf.ethz.ch ETH Zentrum, IFW B46.2 phone: +41-1-6327390 CH-8092 Zurich, Switzerland fax: +41-1-6321172 @inproceedings{ds-gmmmc-79 , author = "D. P. Dobkin and L. Snyder" , title = "On a general method for maximizing and minimizing among certain geometric problems" , booktitle = "Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci." , year = 1979 , pages = "9--17" } @article{akmsw-gamsa-87 , author = "A. Aggarwal and M. M. Klawe and S. Moran and P. W. Shor and R. Wilber" , title = "Geometric applications of a matrix-searching algorithm" , journal = "Algorithmica" , volume = 2 , year = 1987 , pages = "195--208" , keywords = "polygons, furthest neighbors, convex polygons, routing" , succeeds = "akmsw-gamsa-86" , update = "98.07 agarwal, 96.09 agarwal, 96.05 agarwal, 95.05 korneenko" } ------------- 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 compgeom-owner@research.bell-labs.com Thu Jun 24 16:00:45 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA09639; Thu, 24 Jun 1999 16:00:13 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id PAA16382; Thu, 24 Jun 1999 15:56:24 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Jun 24 08:53:13 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Tue Jun 22 11:13:05 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Tue Jun 22 11:12:12 EDT 1999 Received: from largo.eecs.tufts.edu ([192.138.177.99]) by dusty; Tue Jun 22 11:12:11 EDT 1999 Received: from allegro.eecs.tufts.edu (allegro-slow [192.138.178.36]) by largo.eecs.tufts.edu (8.9.1a/8.9.1) with ESMTP id LAA14529 for ; Tue, 22 Jun 1999 11:09:12 -0400 (EDT) From: Diane Souvaine Received: (from dls@localhost) by allegro.eecs.tufts.edu (8.9.1a/8.9.1) id LAA23257 for compgeom-announce@research.bell-labs.com; Tue, 22 Jun 1999 11:09:51 -0400 (EDT) Date: Tue, 22 Jun 1999 11:09:51 -0400 (EDT) Message-Id: <199906221509.LAA23257@allegro.eecs.tufts.edu> To: compgeom-announce@research.bell-labs.com Subject: Visiting Position at Tufts University for 1999-2000 Precedence: bulk Status: RO Content-Length: 1423 Lines: 32 TUFTS UNIVERSITY - The Electrical Engineering and Computer Science Department invites applications for a new visiting position in computer science for 1999-2000, created in response to the unexpected resignation of an associate professor to accept a job in industry. We expect to conduct a full search during 1999-2000 for a tenure-track position to begin in fall 2000. Applicants should have a strong commitment both to research and to teaching. All research areas will be considered. Submit a curriculum vitae and names, email addresses, and telephone numbers of at least three references, two of whom can talk about your teaching. Review of applications will begin immediately and will continue until the position is full. Please address application materials to Prof. Robert Gonsalves, Chair, Electrical Engineering and Computer Science Department, Tufts University 161 College Avenue Medford, MA 02155 FAX: 617-627-3220 VOICE: 617-627-3217 EMAIL: bobg@eecs.tufts.edu Information about the department can be found at http://www.eecs.tufts.edu Please feel free to contact me with questions. Diane Souvaine, 617-627-2486, dls@eecs.tufts.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://uiuc.edu/~sariel/CG/compgeom/threads.html. From compgeom-owner@research.bell-labs.com Thu Jun 24 16:26:08 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA10285; Thu, 24 Jun 1999 16:26:07 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA19222; Thu, 24 Jun 1999 16:22:20 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Jun 24 08:55:02 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Tue Jun 22 12:59:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Tue Jun 22 12:58:23 EDT 1999 Received: from amirani.ams.sunysb.edu ([129.49.6.2]) by dusty; Tue Jun 22 12:58:22 EDT 1999 Received: from dijkstra (dijkstra.ams.sunysb.edu [129.49.6.129]) by amirani.ams.sunysb.edu (8.9.1a/8.9.1) with SMTP id MAA14609 for ; Tue, 22 Jun 1999 12:58:19 -0400 (EDT) Message-Id: <199906221658.MAA14609@amirani.ams.sunysb.edu> Date: Tue, 22 Jun 1999 12:57:45 -0400 (EDT) From: Joseph Mitchell Reply-To: Joseph Mitchell Subject: postdoc/visitor opportunity at Stony Brook To: compgeom-announce@research.bell-labs.com MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: cxVsYZ+9ZswfcaWJm7fUxA== X-Mailer: dtmail 1.2.0 CDE Version 1.2 SunOS 5.6 sun4m sparc Precedence: bulk Status: RO Content-Length: 1600 Lines: 48 Postdoctoral/Visiting Position starting Fall, 1999 Computational Geometry Lab University at Stony Brook We anticipate having a postdoctoral or visiting position available at the University at Stony Brook, in the Department of Applied Mathematics and Statistics, starting in the fall of 1999. Duties would include: 1. Conducting research, in collaboration with Stony Brook faculty and students, in support of various projects in the areas of computational geometry and algorithms, with applications in computer graphics, visualization, manufacturing, and GIS. Many of the applications projects require facility with geometric software and algorithm development. 2. Assisting in the supervision of graduate students in the Lab. 3. Modest teaching (one course per semester). Faculty in the algorithms/geometry area include Estie Arkin, Joe Mitchell, Michael Bender, Steve Skiena, Amitabh Varshney, and adjuncts Martin Held, Claudio Silva, Karel Zikan. In addition, there are opportunities to collaborate with the Center for Visual Computing (Ari Kaufman, director) at Stony Brook. To be considered for the position, send a notice of intent, and a vita (in ascii, latex, or ps) to Joe Mitchell (jsbm@ams.sunysb.edu), by July 15, 1999. The University at Stony Brook is an Equal Opportunity employer. ------------- 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 compgeom-owner@research.bell-labs.com Sat Jun 26 00:31:29 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA29823; Sat, 26 Jun 1999 00:31:28 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id AAA04316; Sat, 26 Jun 1999 00:27:42 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Jun 25 17:23:09 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Thu Jun 24 18:41:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Jun 24 18:39:20 EDT 1999 Received: from louie.scs.carleton.ca ([134.117.5.2]) by dusty; Thu Jun 24 18:39:19 EDT 1999 Received: from [134.117.5.190] (MACstation30 [134.117.5.190]) by louie.scs.carleton.ca (96/30.01.97) with ESMTP id SAA08494; Thu, 24 Jun 1999 18:37:46 -0400 (EDT) X-Sender: wads@louie.scs.carleton.ca Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Thu, 24 Jun 1999 18:51:33 -0400 To: wads@scs.carleton.ca From: "WADS'99" Subject: 1999 Workshop on Algorithms And Data Structures Precedence: bulk Status: RO Content-Length: 835 Lines: 31 1999 Workshop on Algorithms And Data Structures (WADS'99) August 11 - August 14, 1999 Harbour Center, Simon Fraser University, Vancouver, BC, Canada Sponsored by The Pacific Institute for Mathematical Sciences. Organizing Comm.: B. Bhattacharya, A. Gupta, A. Liestman, T. Shermer e-mail: wads@cs.sfu.ca Conference Information: http://www.pims.math.ca/sections/activities/wads99.html Conference Program: http://www.pims.math.ca/wads99/programme.html Registration: http://www.pims.math.ca/wads99/register.html REGISTER NOW! EARLY REGISTRATION DEADLINE: July 9 ------------- 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 compgeom-owner@research.bell-labs.com Sat Jun 26 00:47:21 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA00502; Sat, 26 Jun 1999 00:47:20 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id AAA07143; Sat, 26 Jun 1999 00:43:35 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Jun 25 17:28:28 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Fri Jun 25 07:35:06 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Jun 25 07:33:57 EDT 1999 Received: from core.inf.ethz.ch ([129.132.178.196]) by dusty; Fri Jun 25 07:33:56 EDT 1999 Received: from blabla.inf.ethz.ch (gaertner@blabla.inf.ethz.ch [129.132.11.130]) by core.inf.ethz.ch (8.9.3/8.9.3) with ESMTP id NAA03174; Fri, 25 Jun 1999 13:33:54 +0200 (MET DST) Received: (from gaertner@localhost) by blabla.inf.ethz.ch (8.8.8/8.8.8) id NAA22078; Fri, 25 Jun 1999 13:33:53 +0200 (MET DST) Date: Fri, 25 Jun 1999 13:33:53 +0200 (MET DST) From: Bernd Gaertner Message-Id: <199906251133.NAA22078@blabla.inf.ethz.ch> To: compgeom-announce@research.bell-labs.com Subject: Late Summer School at ETH Zuerich Cc: gaertner@inf.ethz.ch X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 4339 Lines: 91 Late Summer School ``Facets of the Polytope World'' ETH Zuerich, Switzerland, September 13-16, 1999 The goal of this school is to introduce a number of basic concepts in discrete geometry to students of different levels by means of lectures and exercises. Each of the three speakers will cover a full day (titles and abstracts below), and one more day (Wednesday 12) is reserved for a hike in the beautiful mountains of Switzerland. There will be no assumptions beyond basic Linear Algebra and a familiarity with mathematical concepts in general. There is no participation fee. We arrange for student housing in single or double rooms, expecting arrival Sunday night and departure Friday morning. The rates are CHF 80,- (single) resp. CHF 60,- (double) for the whole period. We provide a certificate of participation (with an exam, if that is requested). The school will be announced as a regular course with credit at the ETH. The number of participants is limited. An application should be sent as early as possible, but definitely before July 15 to the address below. It should include a short Curriculum Vitae and indication whether accommodation as offered above is needed (in which case early registration is highly recommended). Bernd Gaertner Departement Informatik, ETH Zentrum, IFW CH-8092 Zuerich, Switzerland For further information: Tel ++41 1 632 73 92, Fax ++41 1 632 11 72, email gaertner@inf.ethz.ch, or richter@inf.ethz.ch ____________________ -------------------- Speakers and topics: --------------------------------------------------------------------------- Bernd Gaertner: ``Randomization and Abstraction in geometric optimization'' Many popular geometric optimization problems (smallest enclosing ball of points, distance between polytopes,...) can be regarded as instances of a simple abstract class known as `LP-type problems'. I will introduce this general framework, describe randomized algorithms for solving all problems in the class, and derive bounds for their expected performance. Among other upper and lower bounds, I will review the currently best theoretical bound for solving the special geometric optimization problem of linear programming in the unit cost model. --------------------------------------------------------------------------- Juergen Richter-Gebert: ``Polytopes in small dimensions'' Already in dimensions three and four, polytopes show a large variety of interesting properties, surprising effects and widely open research problems. We will try to explore some of the most interesting parts of these stories. Among them are - the relation of Spiderwebs, a photograph of the Golden Gate Bridge and polytopes, - how one can cage eggs and potatoes in a tight way by three dimensional polytopes, - why four dimensional polytopes behave as bad as arbitrary polynomials, - and how difficult it is to embed a polytope in a finite quantitized universe --------------------------------------------------------------------------- Emo Welzl: ``Halving Point Sets -- The Inner Structure of Point Sets'' The convex hull of a point set gives a convex polytope, which -- in some sense -- describes the outer structure of the point set. Here we plan to investigate the inner structure, along questions like: Given 2n points in the plane, no three on a line. How many pairs of points can be connected by a halving line, i.e., a line halving the remaining 2n-2 points? So for four points, there are at most three such pairs? Even this innocent looking question in the plane is far from being solved (the answer is known for up to 12 points), not to mention the higher dimensional counterparts. We demonstrate several techniques from discrete geometry applied to these questions, we point out sometimes surprising connections to other problems, and we exhibit a number of computational problems, where these questions arise. ------------- 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 compgeom-owner@research.bell-labs.com Sat Jun 26 00:51:14 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA00562; Sat, 26 Jun 1999 00:51:13 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id AAA07306; Sat, 26 Jun 1999 00:47:27 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Jun 25 17:26:31 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Fri Jun 25 01:15:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Jun 25 01:13:38 EDT 1999 Received: from amirani.ams.sunysb.edu ([129.49.6.2]) by dusty; Fri Jun 25 01:13:37 EDT 1999 Received: from voronoi.ams.sunysb.edu (voronoi.ams.sunysb.edu [129.49.6.26]) by amirani.ams.sunysb.edu (8.9.1a/8.9.1) with SMTP id BAA28082; Fri, 25 Jun 1999 01:13:33 -0400 (EDT) Date: Fri, 25 Jun 1999 01:13:33 -0400 (EDT) From: Joseph Mitchell Message-Id: <199906250513.BAA28082@amirani.ams.sunysb.edu> To: compgeom-announce@research.bell-labs.com Subject: Steering Committee Cc: Jean-Daniel.Boissonnat@sophia.inria.fr, goodrich@cs.jhu.edu, jsbm@amirani.ams.sunysb.edu, orourke@grendel.csc.smith.edu, pankaj@cs.duke.edu, snoeyink@cs.ubc.ca Precedence: bulk Status: RO Content-Length: 632 Lines: 20 The new steering committee (Pankaj Agarwal, Jean-Daniel Boissonnat, Mike Goodrich, Joe Mitchell, and Jack Snoeyink) have assigned officers among themselves, as follows: Chair (99-00): Joe Mitchell (00-01): Mike Goodrich Secretary (99-01): Pankaj Agarwal Please feel free to raise issues, suggestions, concerns with any or all of the committee members ------------- 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 compgeom-owner@research.bell-labs.com Sat Jun 26 01:01:31 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id BAA00817; Sat, 26 Jun 1999 01:01:30 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id AAA07957; Sat, 26 Jun 1999 00:57:45 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Jun 25 17:29:29 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Fri Jun 25 11:51:06 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Jun 25 11:50:52 EDT 1999 Received: from pedigree.cs.ubc.ca ([142.103.6.50]) by dusty; Fri Jun 25 11:50:51 EDT 1999 Received: from cascade.cs.ubc.ca (snoeyink@cascade.cs.ubc.ca [142.103.7.7]) by pedigree.cs.ubc.ca (8.8.8/8.6.9) with ESMTP id IAA19146 for ; Fri, 25 Jun 1999 08:50:50 -0700 (PDT) Message-Id: <199906251550.IAA19146@pedigree.cs.ubc.ca> X-Mailer: exmh version 2.0.2 2/24/98 To: compgeom-announce@research.bell-labs.com Subject: 11th Canadian Conference on Computational Geometry, Aug 15-18 Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Fri, 25 Jun 1999 08:50:49 -0700 From: Jack Snoeyink Precedence: bulk Status: RO Content-Length: 2594 Lines: 55 -------------------------------------------------------- Eleventh Canadian Conference on Computational Geometry University of British Columbia, Vancouver, Canada August 15-18, 1999 http://www.cs.ubc.ca/conferences/CCCG housing deadline July 15 -------------------------------------------------------- The Eleventh Canadian Conference on Computational Geometry (CCCG '99) will be held at the University of British Columbia, Vancouver, Canada, August 15-18, 1999, immediately following the Workshop on Algorithms and Data Structures (WADS'99) We have a programme of 45 submitted presentations plus invited lectures on geometry, robotics, and molecular modeling by Victor Klee (mathematics, Univ of Washington), Dinesh Pai (computer science, UBC) and Susanne Fortier (chemistry, Queens Univ.) See http://www.cs.ubc.ca/conferences/CCCG Registration fees 100 CN$, or 40 CN$ for students, include proceedings, welcome reception, and salmon barbeque in the UBC Botanical Gardens. Registration will occur on site, although we do ask that you inform us of your plans so that we can prepare badges, receipts, and estimate food. Please use the form on the web, or send an email with your name, affiliation (for badge), and address. Tickets for Bard on the Beach performances may also be requested. Aug 16: Vancouver Symphony Orchestra + the Bard company (25 CN$) Aug 18: (23.50 CN$) Midsummer Night's Dream (18 CN$) Measure for Measure We hope that you will join us. o Jack _/\_. snoeyink@cs.ubc.ca (')>-(`) http://www.cs.ubc.ca/spider/snoeyink/ ------------ 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. (Low registration fees and possibility of dorm accomodations also help.) ------------- 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 compgeom-owner@research.bell-labs.com Thu Jul 1 16:00:30 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA14110; Thu, 1 Jul 1999 16:00:23 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id PAA16078; Thu, 1 Jul 1999 15:56:29 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Jul 1 08:51:26 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Thu Jul 1 06:11:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Jul 1 06:10:58 EDT 1999 Received: from eerie.site-eerie.ema.fr ([146.19.2.1]) by dusty; Thu Jul 1 06:10:56 EDT 1999 Received: from maileerie.site-eerie.ema.fr (maileerie [146.19.1.3]) by eerie.site-eerie.ema.fr (8.9.1/8.9.1) with ESMTP id MAA15709 for ; Thu, 1 Jul 1999 12:10:27 +0200 (MET DST) Received: from jessica.eerie.fr (jessica [146.19.4.13]) by maileerie.site-eerie.ema.fr (8.9.1/8.9.1) with ESMTP id MAA26247; Thu, 1 Jul 1999 12:16:34 +0200 (MET DST) From: Aupetit Mickael Received: by jessica.eerie.fr (8.8.8+Sun/SMI-SVR4) id MAA12771; Thu, 1 Jul 1999 12:10:24 +0200 (MET DST) Date: Thu, 1 Jul 1999 12:10:24 +0200 (MET DST) Message-Id: <199907011010.MAA12771@jessica.eerie.fr> To: compgeom-discuss@research.bell-labs.com Subject: Some questions about interpolation... Cc: aupetit@eerie.site-eerie.ema.fr X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 2485 Lines: 65 Hello, my name is Michael Aupetit, I'm a PhD student in the field of Artificial Neural Networks. I'm very interested by interpolation technics. I've heard about "natural Neighbours"; "NURBS" and some other technics, but I fear these technics are not able to deal with high dimensional input spaces (as we found in ANNs) with reasonable time consuming and complexity of operations (e.g. for example,how to calculate vector product used in Natural Neighbour Interpolation, while the dimension of vectors is higher than 3?). So, I have three questions: Hypothesis: I have the p-dimensional Delaunay triangulation of n data points. And I know the Jacobian (gradient) and possibly the Hessian (curvature) in each data point. 1) Does it exist any interpolation method able to deal with high dimension (at least more than 5) that is C1 or C2 where ever? Could you send me references? 2) What is the complexity of existing interpolation technics according to n (the number of data points that support the interpolation) and p (the dimension of the input space) or other parameters? 3) Does it exist "standard" tests to establish that an interpolation method is "good" or "bad"? (e.g. for example, we could imagine an interpolation method able to pass through all data points with a 1st order continuity where ever, but with a not desired behavior between data points, as "holly" or "gap" between them even if they are theoretically in the same plan according to their respective Jacobian...) Thank you for your help Sorry if I've already contacted you by another way. Michael Aupetit ______________________________________ | Michael AUPETIT | | LGI2P - EMA - Site EERIE | | Parc Scientifique G.BESSE | | 30000 Nimes | | FRANCE | | | | Ph.D (1st year) student | | Department of Neural Network | | and Self-organization | | | | Phone: (033) 04.66.04.16.84 | | Fax: (033) 04.66.38.70.74 | | E-mail: aupetit@site-eerie.ema.fr | |______________________________________| ------------- 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 compgeom-owner@research.bell-labs.com Fri Jul 2 01:38:44 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id BAA00626; Fri, 2 Jul 1999 01:38:43 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id BAA11900; Fri, 2 Jul 1999 01:34:53 +0300 (IDT) Message-Id: <199907012234.BAA11900@post.tau.ac.il> Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Jul 1 18:27:15 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Thu Jul 1 13:29:05 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Jul 1 13:28:00 EDT 1999 Received: from HOSTESS.GRAPHICS.CS.CMU.EDU ([128.2.206.188]) by dusty; Thu Jul 1 13:27:59 EDT 1999 Date: Thu, 1 Jul 99 11:12:32 EDT From: Paul.Heckbert@HOSTESS.GRAPHICS.CS.CMU.EDU To: compgeom-discuss@research.bell-labs.com Subject: Re: Some questions about interpolation... Cc: aupetit@eerie.site-eerie.ema.fr Precedence: bulk Status: RO Content-Length: 1435 Lines: 34 Michael Aupetit asked: > Does it exist "standard" tests to establish that an interpolation > method is "good" or "bad"? > > Does it exist any interpolation method able to deal with high > dimension (at least more than 5) You probably want some metric of smoothness or fairness for a function. The most common metric, for univariate functions, is the integral of the square of the second derivative. The interpolating function minimizing this is the "natural cubic spline", whose solution reduces to a tridiagonal system of equations. The metric can be generalized in various ways for multivariate functions. In general, I don't believe the optimal solution in higher dimensions has a closed form solution, but you can use numerical variational techniques, including multigrid or wavelets, to find an approximate solution efficiently. For references, search for "variational surface" at http://www.cs.cmu.edu/~ph/859E/www/project.html and see the work cited there by Terzopoulos and Kobbelt. Paul Heckbert, Associate Professor Computer Science Dept., Carnegie Mellon University 5000 Forbes Ave, Pittsburgh PA 15213-3891, USA ph@cs.cmu.edu http://www.cs.cmu.edu/~ph ------------- 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 compgeom-owner@research.bell-labs.com Mon Jul 5 17:08:56 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id RAA27233; Mon, 5 Jul 1999 17:08:54 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id RAA17499; Mon, 5 Jul 1999 17:05:03 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Jul 5 09:59:42 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Fri Jul 2 13:31:06 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Jul 2 13:30:52 EDT 1999 Received: from cs.dartmouth.edu ([129.170.212.26]) by dusty; Fri Jul 2 13:30:50 EDT 1999 Received: from RAIN (rain.cs.dartmouth.edu [129.170.212.128]) by cs.dartmouth.edu (8.9.3/8.9.3) with SMTP id NAA14262 for ; Fri, 2 Jul 1999 13:30:49 -0400 (EDT) Date: Fri, 2 Jul 1999 13:30:49 -0400 (EDT) Message-Id: <199907021730.NAA14262@cs.dartmouth.edu> From: Bruce Randall Donald To: compgeom-announce@research.bell-labs.com Subject: WAFR 2000 CALL FOR PAPERS X-exhort-holdout: Marten sleek affiance. Reply-To: brd@cs.dartmouth.edu (Bruce Randall Donald) Precedence: bulk Status: RO Content-Length: 3087 Lines: 99 WAFR 2000 CALL FOR PAPERS The Fourth International Workshop on the Algorithmic Foundations of Robotics March 16-18 2000 Dartmouth Hanover, New Hampshire http://www.cs.dartmouth.edu/~wafr Robot algorithms are abstractions of computational processes that control or reason about motion and perception in the physical world. The computation may be implemented in software, hard-wired electronics, biomolecular mechanisms, or purely mechanical devices. Because actions in the physical world are subject to physical laws and geometric constraints, the design and analysis of robot algorithms raises a unique combination of questions in control theory, computational and differential geometry, and computer science. Algorithms serve as a unifying theme in the multi-disciplinary field of robotics. WAFR aims at bringing together a group of about sixty researchers to discuss recent trends and important future directions of research on the algorithmic foundations of robotics. The workshop consists of invited talks by key researchers in the field and twenty contributed presentations in a single track. The proceedings will be published in a hard-cover volume. Topics of interest include, but are not limited to, * geometric algorithms * minimalist and underactuated robotics * manufacturing and assembly * holonomic and nonholonomic motion planning * manipulation planning * sensor-based planning * controllability, complexity, and completeness * task-level planning * grasping and fixturing * physically realistic simulation * navigation * computational biology * modular and reconfigurable robots * distributed manipulation VENUE Participants will stay at the historic Hanover Inn on the Appalachian Trail, near the White Mountains of New Hampshire. The workshop will take place on the Dartmouth campus. PAPER SUBMISSION Authors are invited to submit four (4) copies of a full paper by December 1, 1999 to Prof. Kevin Lynch Mechanical Engineering Department Northwestern University 2145 Sheridan Road Evanston, IL 60208 Authors will be notified of the disposition of their papers by January 20, 2000. Camera-ready copies of the papers are due by February 20. These will be distributed to the workshop participants. Final versions of the papers for publication are due after the workshop. GENERAL CHAIRS Bruce Donald, Dartmouth Kevin Lynch, Northwestern Daniela Rus, Dartmouth PROGRAM COMMITTEE Pankaj Agarwal, Duke Srinivas Akella, UIUC Nancy Amato, Texas A&M Antonio Bicchi, U. Pisa Bruce Donald, Dartmouth Kamal Kant Gupta, Simon Frasier Leslie Kaelbling, Brown Makoto Kaneko, U. Hiroshima David Kriegman, UIUC Steve LaValle, Iowa State Kevin Lynch, Northwestern Dinesh Manocha, UNC Jim Ostrowski, U. Pennsylvania John Reif, Duke Daniela Rus, Dartmouth Elisha Sacks, Purdue ------------- 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 compgeom-owner@research.bell-labs.com Mon Jul 5 17:23:31 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id RAA27648; Mon, 5 Jul 1999 17:23:30 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id RAA18737; Mon, 5 Jul 1999 17:19:37 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Jul 5 10:03:40 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Sat Jul 3 23:57:05 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sat Jul 3 23:56:43 EDT 1999 Received: from austin.cs.unc.edu ([152.2.128.87]) by dusty; Sat Jul 3 23:56:42 EDT 1999 Received: from geom.cs.unc.edu (geom.cs.unc.edu [152.2.129.41]) by austin.cs.unc.edu (8.8.8/8.8.8) with ESMTP id XAA00511; Sat, 3 Jul 1999 23:06:32 -0400 (EDT) Received: (from lin@localhost) by geom.cs.unc.edu (8.8.8/8.8.8) id XAA03597; Sat, 3 Jul 1999 23:05:18 -0400 (EDT) Date: Sat, 3 Jul 1999 23:05:18 -0400 (EDT) From: Ming Lin Message-Id: <199907040305.XAA03597@geom.cs.unc.edu> To: amato@cs.tamu.edu, brd@cs.dartmouth.edu, christian.laugier@inrialples.fr, compgeom-announce@research.bell-labs.com, csh@galerkin.stanford.edu, dm@cs.unc.edu, dyhsu@cs.stanford.edu, fischer@cive.stanford.edu, gadh@engr.wisc.edu, goldberg@ieor.berkeley.edu, halperin@math.tau.ac.il, hhg@robotics.stanford.edu, i_collide@cs.unc.edu, jbrown@cs.stanford.edu, jean-francois.rit@der.edf.fr, jean-louis.bouchet@edf.fr, jks@ai.mit.edu, jpl@basquiat.lass.fr, jxiao@nsf.gov, karl@ee.washington.edu, kavraki@cs.rice.edu, khatib@Forum.Stanford.EDU, kmlynch@nwu.edu, latombe@cs.stanford.edu, lin@cs.unc.edu, mirtich@merl.com, nathan@deneb.com, ohlund@centricsoftware.com, pai@cs.ubc.ca, raju.s.mattikalli@boeing.com, rschulth@ford.com, ruspini@cs.stanford.edu, rwatson@centricsoftware.com, schang@oh.hra.com, uhinze@ford.com, xji@uncc.edu, zhu@motion-factory.com Subject: PQP release Precedence: bulk Status: RO Content-Length: 1432 Lines: 37 PQP: Proximity Query Package We announce the release of a new proximity query package called PQP. It is a library for performing three types of proximity queries on a pair of geometric models composed of triangles. They are: 1. Collision detection - detecting whether the two models overlap, and optionally, all of the triangles that overlap. 2. Separation distance computation - computing the minimum distance between a pair of models, i.e., the distance between the closest pair of points. 3. Tolerance verification and approximate distance queries - determining whether two models are closer or farther than a tolerance distance. It uses OBBs for collision detection and family of swept sphere volumes for distance computation and tolerance verification. It has been successfully applied to virtual prototyping, dynamic simulation, path planning and other applications. It is applicable to all triangulated polygonal models, including polygon soups. It is free for non-commercial use. More information about the package, new proximity query algorithms, MPEG demonstrations and related publications can be found at: http://www.cs.unc.edu/~geom/SSV ------------- 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 compgeom-owner@research.bell-labs.com Mon Jul 5 17:30:02 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id RAA27848; Mon, 5 Jul 1999 17:30:00 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id RAA19362; Mon, 5 Jul 1999 17:26:10 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Jul 5 10:02:34 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Sat Jul 3 03:55:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Sat Jul 3 03:54:17 EDT 1999 Received: from mail.dia.uniroma3.it ([193.204.161.133]) by dusty; Sat Jul 3 03:54:16 EDT 1999 Received: from dia.uniroma3.it (brunello.dia.uniroma3.it [193.204.161.165]) by mail.dia.uniroma3.it (8.8.7/8.8.7) with ESMTP id JAA29973; Sat, 3 Jul 1999 09:54:05 +0200 Message-ID: <377DC08A.2BB29645@dia.uniroma3.it> Date: Sat, 03 Jul 1999 09:49:31 +0200 From: The QueryViewer Team Organization: Department of Computer Science and Automation - University of Rome "RomaTre" X-Mailer: Mozilla 4.5 [en] (Win95; I) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: QueryViewer: A Java System for drawing the result of a Query Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 1191 Lines: 38 QUERY VIEWER Beta Version for Windows 95/98/NT QueryViewer is a system designed to display the data contained into a database by means of graphical representations. You can open your database with QueryViewer, you can execute queries on the tables and then you can obtain a graph-like representation of the results of the query. CAPABILITIES QueryViewer gives you a following features: - Exploring a MS Access database - Writing and executing a query on a database - Selecting a subset of the table's field as interesting fields for the analysis - Selecting a model for drawing the binary relation among selected fields with a graphical representation - Manipulating the obtained graph with several graphical functions - Saving and loading the obtained result for the future reuse DOWNLOAD QueryViewer may be downloaded from the site: http://www.dia.uniroma3.it/~lenti/QueryViewer Enjoy QueryViewer, The QueryViewer Team ------------- 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 compgeom-owner@research.bell-labs.com Fri Jul 9 02:46:14 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id CAA23272; Fri, 9 Jul 1999 02:46:13 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id CAA28589; Fri, 9 Jul 1999 02:42:17 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Jul 8 19:32:02 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Thu Jul 8 16:27:07 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Jul 8 16:26:15 EDT 1999 Received: from cs.sfu.ca ([142.58.111.1]) by dusty; Thu Jul 8 16:26:14 EDT 1999 Received: from giansar.cs.sfu.ca (sjungic@giansar [199.60.4.247]) by cs.sfu.ca (8.9.1/8.9.1) with ESMTP id NAA11667; Thu, 8 Jul 1999 13:24:57 -0700 (PDT) From: Sadika Jungic Received: (from sjungic@localhost) by giansar.cs.sfu.ca (8.9.1/8.9.1) id NAA06320; Thu, 8 Jul 1999 13:24:55 -0700 (PDT) Date: Thu, 8 Jul 1999 13:24:55 -0700 (PDT) Message-Id: <199907082024.NAA06320@giansar.cs.sfu.ca> To: THEORYNT@LISTSERV.NODAK.EDU, compgeom-announce@research.bell-labs.com, wanka@uni-paderborn.de, jeffe@cs.duke.edu, ian@silo.csci.unt.edu, rozenber@wi.leidenuniv.nl, infoinfo@iro.umontreal.ca, parva@uni-paderborn.de, dennis@cs.cmu.edu, meinel@uni-trier.de, weidmann@informatik.tu-muenchen.de, DMA-LIST@NIC.SURFNET.NL Subject: Workshop on Algorithms and Data Structure - WADS'99 X-Sun-Charset: US-ASCII Precedence: bulk Status: RO Content-Length: 1361 Lines: 54 Dear potential participant, Here is our reminder about the Subject: 1999 Workshop on Algorithms And Data Structures (WADS'99) August 11 - August 14, 1999 Harbour Center, Simon Fraser University, Vancouver, BC, Canada Sponsored by The Pacific Institute for Mathematical Sciences. Organizing Comm.: B. Bhattacharya, A. Gupta, A. Liestman, T. Shermer e-mail: wads@cs.sfu.ca Conference Information: http://www.pims.math.ca/sections/activities/wads99.html Conference Program: http://www.pims.math.ca/wads99/programme.html Registration: http://www.pims.math.ca/wads99/register.html REGISTER NOW! EARLY REGISTRATION DEADLINE: July 9 ---------------------------------------------------------- Please do not hesitate to contact me if there is anything about the Workshop that I can help you with. Regards. -- Sadika Jungic Administrative Assistant for PIMS/MITACS Simon Fraser University 8888 University Drive Burnaby, B.C. V5A 1S6 Tel: (604) 291-5808 Fax: (604) 291-4947 ------------- 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 compgeom-owner@research.bell-labs.com Fri Jul 9 02:56:26 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id CAA23426; Fri, 9 Jul 1999 02:56:25 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id CAA29014; Fri, 9 Jul 1999 02:52:33 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Jul 8 19:34:55 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Thu Jul 8 16:31:06 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Jul 8 16:29:31 EDT 1999 Received: from math.jmu.edu ([134.126.22.204]) by dusty; Thu Jul 8 16:29:29 EDT 1999 Received: from maple.math.jmu.edu (maple.math.jmu.edu [134.126.22.74]) by math.jmu.edu (8.8.7/9.9.9) with SMTP id QAA24610 for ; Thu, 8 Jul 1999 16:29:27 -0400 Date: Thu, 8 Jul 1999 16:29:27 -0400 (EDT) From: Alade Tokuta To: compgeom-announce@research.bell-labs.com Subject: North Cartolina Central University Faculty Positions Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 2176 Lines: 62 NORTH CAROLINA CENTRAL UNIVERSITY DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE The Department of Mathematics and Computer Science at North Carolina Central University invites applications for two Assistant Professor position (tenure-track) for the 1999-2000 academic year. We seek applicants able to teach introductory and core courses in computer science and mathematics. Salary is competitive. We encourage applicants with research interests that align with those of the department. QUALIFICATIONS: Ph.D. in computer science with strong preparation in mathematics (preferred), minimum of three years experience teaching at the college/university level, scholarly research/publications. INSTRUCTIONAL DUTIES: Duties include teaching 12 hours per semester of Computer Science and Mathematics courses distributed among undergraduate and graduate level courses, academic and thesis advising, providing leadership in the development of a strong Computer Science curriculum, serving on departmental and University committees, recruitment of students and assistance in proposal writing. Teaching schedule will include evening assignments. Applicant materials should include vitae, cover letter, academic transcripts, names of three references to: Professor Alade Tokuta Chair, Department of Mathematics and Computer Science P.O. Box 19796 North Carolina Central University Durham, NC 27707 References should address both teaching and research ability. Inquiries may be directed to Professor Tokuta by email (tokuta@sci.nccu.edu) or phone (919-560-6315). Application deadline is July 15. The screening committee will begin screening of candidates by July 20, 1998. Applications will be accepted until the positions are filled. Anticipated staring date is August 13, 1999. Fall classes begin on August 17, 1999. ------------- 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 compgeom-owner@research.bell-labs.com Sat Jul 10 23:25:29 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id XAA17114; Sat, 10 Jul 1999 23:25:28 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id XAA23325; Sat, 10 Jul 1999 23:21:34 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Jul 10 16:14:49 EDT 1999 To: compgeom-announce@research.bell-labs.com Received: from grubby.research.bell-labs.com by netlib2; Fri Jul 9 15:39:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Jul 9 15:38:25 EDT 1999 Received: from turing.siam.org ([192.108.225.52]) by dusty; Fri Jul 9 15:38:24 EDT 1999 Received: from venn.siam.org (dns.siam.org [192.108.225.1]) by turing.siam.org (8.9.1b+Sun/8.9.1) with SMTP id PAA21067 for ; Fri, 9 Jul 1999 15:38:22 -0400 (EDT) From: flores@siam.org Received: from ccMail by venn.siam.org (ccMail Link to SMTP R8.00.00) id AA931549100; Fri, 09 Jul 99 15:38:22 -0500 Message-Id: <9907099315.AA931549100@venn.siam.org> X-Mailer: ccMail Link to SMTP R8.00.00 Date: Fri, 09 Jul 99 15:38:19 -0500 To: Subject: PLEASE POST MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 665 Lines: 25 SODA 2000 The DEADLINE for submission of 10-page abstracts is TUESDAY, July 13, 1999, no later than 5:00 PM EDT. Instructions and information about electronic submissions can be found at http://www.sigact.acm.org/~soda2ka/SODA2000.html The SODA 2000 Call for Papers can be found at www.siam.org/meetings/da00/ ------------- 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 compgeom-owner@research.bell-labs.com Wed Jul 14 16:22:09 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA01623; Wed, 14 Jul 1999 16:22:08 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA03726; Wed, 14 Jul 1999 16:18:11 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Jul 14 09:10:07 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Tue Jul 13 12:03:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Tue Jul 13 12:01:31 EDT 1999 Received: from math.fu-berlin.de ([160.45.40.10]) by dusty; Tue Jul 13 11:58:20 EDT 1999 Received: (qmail 13058 invoked from network); 13 Jul 1999 15:57:10 -0000 Received: from sahib.inf.fu-berlin.de (HELO inf.fu-berlin.de) (160.45.111.13) by leibniz.math.fu-berlin.de with SMTP; 13 Jul 1999 15:57:10 -0000 Sender: rote@research.bell-labs.com Message-ID: <378B61D6.BF660127@inf.fu-berlin.de> Date: Tue, 13 Jul 1999 17:57:10 +0200 From: Guenter Rote X-Mailer: Mozilla 4.5 [en] (X11; I; SunOS 5.6 sun4u) X-Accept-Language: de-AT, de, en MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: Assistant position at FU Berlin References: <199802040835.JAA13500@blabla.inf.ethz.ch> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 1470 Lines: 39 At the Free University of Berlin, a position of Assistant Professor (Wiss. Assistent/in C1) is available at the department of Computer Science, starting October 1, 1999, for a duration of at most six years. Area: design and analysis of efficient algorithms, especially in computational geometry. Formal requirement: Ph.D. in computer science or mathematics The applicant should have research experience in the field of algorithms, combinatorial or computational geometry, discrete mathematics, or optimization. The position involves both research and teaching at an advanced level. A knowledge of German is not mandatory. It is possible to work towards a "Habilitation". Further information can be obtained on the Web at http://www.inf.fu-berlin.de/~rote/joboffer.html or by contacting Prof. Guenter Rote, rote@inf.fu-berlin.de, Freie Universitaet Berlin, Institut fuer Informatik, Takustrase 9, D-14195 Berlin, Germany, Tel. (49)30-838-75150, fax (49)30-838-75109 Applications citing the number "WA24" should be sent by August 10, 1999 to Freie Universitaet Berlin Fachbereich Mathematik und Informatik, Fachbereichsverwaltung, Arnimallee 2-6, D-14195 Berlin, Germany. ------------- 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 compgeom-owner@research.bell-labs.com Tue Jul 20 16:43:45 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA14636; Tue, 20 Jul 1999 16:43:44 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA08377; Tue, 20 Jul 1999 16:39:45 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jul 20 09:31:45 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Thu Jul 15 13:19:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Jul 15 13:18:28 EDT 1999 Received: from largo.eecs.tufts.edu ([192.138.177.99]) by dusty; Thu Jul 15 13:18:26 EDT 1999 Received: from u8.eecs.tufts.edu (u8 [192.138.178.69]) by largo.eecs.tufts.edu (8.9.1a/8.9.1) with ESMTP id NAA12923 for ; Thu, 15 Jul 1999 13:14:51 -0400 (EDT) Received: from localhost (jlindy@localhost) by u8.eecs.tufts.edu (8.9.1a/8.9.1) with ESMTP id NAA11769 for ; Thu, 15 Jul 1999 13:14:59 -0400 (EDT) X-Authentication-Warning: u8.eecs.tufts.edu: jlindy owned process doing -bs Date: Thu, 15 Jul 1999 13:14:59 -0400 (EDT) From: Seg Fault X-Sender: jlindy@u8 To: compgeom-discuss@research.bell-labs.com Subject: in search of R.L. Ogniewicz Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 614 Lines: 19 I am in search of contact information for Robert L. Ogniewicz, who was a postdoc at the Harvard Robotics Laboratory. When contacted, HRL had no idea of his whereabouts or current email address. I have downloaded and am attempting to install his MAT-1.0.3 software for generating medial axes. Thanks, Jeff Lindy Tufts University Medford, MA, USA ------------- 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 compgeom-owner@research.bell-labs.com Tue Jul 20 16:51:31 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA14836; Tue, 20 Jul 1999 16:51:30 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id QAA09155; Tue, 20 Jul 1999 16:47:31 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jul 20 09:34:00 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Mon Jul 19 11:01:08 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Jul 19 10:59:26 EDT 1999 Received: from miraculix.biba.uni-bremen.de ([134.102.96.29]) by dusty; Mon Jul 19 10:59:25 EDT 1999 Received: from biba.uni-bremen.de ([134.102.96.151]) by miraculix.biba.uni-bremen.de (Netscape Messaging Server 3.6) with ESMTP id AAA1CE6 for ; Mon, 19 Jul 1999 16:58:48 +0200 Message-ID: <37933D68.D2515284@biba.uni-bremen.de> Date: Mon, 19 Jul 1999 16:59:52 +0200 From: "Antonio Torrealba Olivares" X-Mailer: Mozilla 4.51 [en] (WinNT; I) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com Subject: Help for boolean operations Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 643 Lines: 20 Hi all, for my diploma thesis I want to program boolean-operations for triangulated facet models used in Rapid Prototyping applications. Since such models often contains more than 100000 triangles, especially the fast performance of the algorithms is important. Does anyone know where I can find some good articles or literature for this "problem". Thanks in advance, Antonio ------------- 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 compgeom-owner@research.bell-labs.com Wed Jul 21 03:51:07 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id DAA02828; Wed, 21 Jul 1999 03:51:05 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id DAA02485; Wed, 21 Jul 1999 03:47:07 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jul 20 20:41:56 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Wed Jul 14 16:17:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Jul 14 16:16:47 EDT 1999 Received: from indigo.cs.bgu.ac.il ([132.72.42.23]) by dusty; Wed Jul 14 16:16:46 EDT 1999 Received: from cyan.cs.bgu.ac.il (klara@cyan.cs.bgu.ac.il [132.72.42.12]) by indigo.cs.bgu.ac.il (8.9.2/8.9.2) with ESMTP id XAA15735; Wed, 14 Jul 1999 23:16:42 +0300 (IDT) From: klara kedem Received: (klara@localhost) by cyan.cs.bgu.ac.il (8.9.0/8.6.9) id XAA02277; Wed, 14 Jul 1999 23:16:42 +0300 (IDT) Date: Wed, 14 Jul 1999 23:16:42 +0300 (IDT) Message-Id: <199907142016.XAA02277@cyan.cs.bgu.ac.il> To: compgeom-announce@research.bell-labs.com Subject: Euro-CG 2000 Call for papers Cc: klara@CS.bgu.ac.il Precedence: bulk Status: RO Content-Length: 4458 Lines: 128 ####################################################################### C A L L F O R P A P E R S 16TH EUROPEAN WORKSHOP ON COMPUTATIONAL GEOMETRY March 13-14-15 2000 Eilat Club Hotel, Eilat, Israel http://www.cs.bgu.ac.il/~cg2000 Sponsored by Ben-Gurion University of the Negev, Beer-Sheva, Israel ######################################################################## The European Workshop on Computational Geometry will be held in March 13-14-15 2000, at Eilat Club Hotel, Eilat, Israel. The European Workshop on Computational Geometry is an important scientific event in which established researchers from academia, R&D people from industry, and research students and postdocs meet and present their current work, establishing a scientific interaction and international collaboration. ------------------------------------------------------------------------ TOPICS: The topics of interest include but are not limited to: Analysis of geometric algorithms and data structures, theoretical issues arising from implementations, geometric optimization, analysis of geometric configurations And applications of computational geometry to robotics and virtual worlds, computer graphics, simulation and visualization, image processing, geometric and solid modeling, computer aided geometric design, manufacturing, geographical information systems, and structural molecular biology. ------------------------------------------------------------------------ SUBMISSIONS: A title and a brief abstract (2-4 pages) should be submitted (either PS files by email to cg2000@cs.bgu.ac.il or camera-ready papers by regular mail to the address below) before January 7th, 2000. The abstracts will be collected and distributed among the participants at the Workshop. Deadline for submissions : January 7th, 2000 A special issue of ``Computational Geometry: Theory and Applications'' will be dedicated to outstanding works presented at the workshop. ------------------------------------------------------------------------ FINANCIAL SUPPORT: The most important goal of the workshop is to allow as many young researchers -- European and Israeli PhD students and postdocs -- to participate and intellectually profit from the workshop. We are trying to get financial support to cover part of the travel from Europe to Israel, and perhaps some of the hotel expences. See below for deadline for support application. ------------------------------------------------------------------------ PROGRAM COMMITTEE: Gill Barequet, Technion Danny Halperin, Tel-Aviv University Matthew Katz, Ben-Gurion University Klara Kedem, Ben-Gurion University (chair) Micha Sharir, Tel-Aviv University Ayellet Tal, Technion ------------------------------------------------------------------------ ADDRESS: CG 2000 16th European Workshop on Computational Geometry Department of Mathematics and Computer Science Ben-Gurion University of the Negev P.O.Box 653 Beer-Sheva 84105 E-mail: cg2000@cs.bgu.ac.il Phones: (972)-7-6477869 and (972)-7-6461628 Fax: (972)-7-6472909 ------------------------------------------------------------------------ IMPORTANT DATES January 7th, 2000: Deadline for submissions January 15th, 2000: Program available from this web page January 25th, 2000: Last day of applying for support February 25th, 2000: Deadline for registrations March 13th, 2000: Beginning of the conference ------------------------------------------------------------------------ EILAT Eilat is a diving and snorkeling resort town, with wonderful beaches, food and atmosphere. The hotel is a new, large and luxurious five-star hotel, located in the North beach of Eilat. It is close to the town center and has many recreation facilities. PETRA If there is a large enough number of people interested in going to ancient Nabattian town, Petra, in the red mountains of Jordan, we will organize a one-day excursion on the day following the meeting. ######################################################################## ------------- 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 compgeom-owner@research.bell-labs.com Wed Jul 21 04:00:26 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id EAA03125; Wed, 21 Jul 1999 04:00:24 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id DAA02811; Wed, 21 Jul 1999 03:56:25 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jul 20 20:45:19 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Wed Jul 14 16:49:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Jul 14 16:48:22 EDT 1999 Received: from blaze.cs.jhu.edu ([128.220.13.50]) by dusty; Wed Jul 14 16:48:19 EDT 1999 Received: from chitra.cs.jhu.edu (chitra.cs.jhu.edu [128.220.13.59]) by blaze.cs.jhu.edu (8.8.5/8.8.7) with ESMTP id QAA22003 for ; Wed, 14 Jul 1999 16:48:19 -0400 (EDT) From: Subodh Kumar Received: (from subodh@localhost) by chitra.cs.jhu.edu (8.9.3/8.8.5) id UAA03448 for compgeom-announce@research.bell-labs.com; Wed, 14 Jul 1999 20:48:18 GMT Date: Wed, 14 Jul 1999 20:48:18 GMT Message-Id: <199907142048.UAA03448@chitra.cs.jhu.edu> To: compgeom-announce@research.bell-labs.com Subject: CGC'99: Call for participation Precedence: bulk Status: RO Content-Length: 3705 Lines: 108 Call for Papers 4th CGC Workshop on Computational Geometry Johns Hopkins University, Baltimore, MD, October 15-16, 1999 We are pleased to announce the fourth annual fall Workshop on Computational Geometry, sponsored by the Center for Geometric Computing, continuing a tradition established by the Mathematical Sciences Institute at SUNY-Stony Brook. The Center for Geometric Computing is a collaborative center of Brown, Duke, and Johns Hopkins Universities, and is funded by the U.S. Army Research Office. Scope and Format The aim of this workshop is to bring together researchers from academia, industry, and the Army to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to: Algorithmic methods in geometry I/O-scalable geometric algorithms Animation of geometric algorithms Computer graphics Solid modeling Geographic information systems Computational metrology Graph drawing Experimental studies Geometric data structures Implementation issues Robustness Computer vision Robotics Computer-aided design Mesh generation Following the tradition of the previous MSI and CGC Workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. Registration will be on-site, and will include the abstract booklet, coffee breaks, lunches, and a reception. There will be a registration fee of $75. Invited speakers To be Announced Submissions Authors are invited to submit abstracts for talks to be given at the workshop. Please send an abstract (up to 2 pages) and a draft of a paper (if you have one). E-mail submissions are encouraged; send to cgc@cs.jhu.edu. Ideally, the abstract should be a PDF, PostScript, or LaTeX, file, for ease in assembling the abstract booklet. Abstracts can also be sent by regular mail to: Subodh Kumar Department of Computer Science Johns Hopkins University 224 NEB, 3400 N. Charles St. Baltimore, MD 21218 Submissions should arrive by September 10, 1999. Authors will be notified of acceptance by September 20, 1999. A booklet of abstracts will be distributed at the workshop and made available electronically on the Web. There will be no formal proceedings for this workshop, but selected papers will be invited to a special issue of the journal "Computational Geometry: Theory and Applications". Program Committee Pankaj K. Agarwal (Duke University), Lars Arge (Duke University), Michael T. Goodrich (Johns Hopkins University), S. Rao Kosaraju (Johns Hopkins University), Subodh Kumar (Johns Hopkins University), Joseph S. B. Mitchell (State University of New York at Stony Brook), Franco P. Preparata (Brown University), Roberto Tamassia (Brown University), Jeffrey S. Vitter (Duke University). Note: For more information about the workshop, send mail to cgc@cs.jhu.edu . Further information will be posted to our web site: http://www.cs.jhu.edu/labs/cgc/cgc99 as soon as it is available. Important Dates Deadline for submission Sep 10 Notification of acceptance Sep 20 Conference Oct 15-16 Subodh Kumar ------------- 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 compgeom-owner@research.bell-labs.com Wed Jul 21 04:13:15 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id EAA04268; Wed, 21 Jul 1999 04:13:14 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id EAA03375; Wed, 21 Jul 1999 04:09:15 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jul 20 20:48:02 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Thu Jul 15 07:07:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Jul 15 07:05:18 EDT 1999 Received: from amirani.ams.sunysb.edu ([129.49.6.2]) by dusty; Thu Jul 15 07:05:17 EDT 1999 Received: from voronoi.ams.sunysb.edu (voronoi.ams.sunysb.edu [129.49.6.26]) by amirani.ams.sunysb.edu (8.9.1a/8.9.1) with SMTP id HAA05056 for ; Thu, 15 Jul 1999 07:05:16 -0400 (EDT) Date: Thu, 15 Jul 1999 07:05:16 -0400 (EDT) From: Joseph Mitchell Message-Id: <199907151105.HAA05056@amirani.ams.sunysb.edu> To: compgeom-announce@research.bell-labs.com Subject: visiting position or postdoc opportunity Precedence: bulk Status: RO Content-Length: 1663 Lines: 46 Postdoctoral or Visiting Position starting Fall, 1999 Computational Geometry Lab University at Stony Brook We anticipate having a postdoctoral or visiting position available at the University at Stony Brook, in the Department of Applied Mathematics and Statistics, starting in the fall of 1999. Duties would include: 1. Conducting research, in collaboration with Stony Brook faculty and students, in support of various projects in the areas of algorithms and computational geometry, with applications in computer graphics, visualization, manufacturing, and GIS. 2. Assisting in the supervision of graduate students in the Lab. 3. Modest teaching (one course in the first semester; 1-2 in the second, depending on involvement in research projects). Faculty in the algorithms/geometry area include Estie Arkin, Joe Mitchell, Michael Bender, Steve Skiena, Amitabh Varshney, and adjuncts Martin Held, Claudio Silva, Karel Zikan. In addition, there are opportunities to collaborate with the Center for Visual Computing (Ari Kaufman, director) at Stony Brook. To be considered for the position, send a notice of intent, and a vita (in ascii, latex, or ps) to Joe Mitchell (jsbm@ams.sunysb.edu), by July 22, 1999. (original closing date of July 15 has been extended, due to a delay in the first posting) The University at Stony Brook is an Equal Opportunity employer. ------------- 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 compgeom-owner@research.bell-labs.com Wed Jul 21 04:22:28 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id EAA04405; Wed, 21 Jul 1999 04:22:27 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id EAA03669; Wed, 21 Jul 1999 04:18:29 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Jul 20 20:47:09 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Wed Jul 14 20:21:05 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Jul 14 20:20:35 EDT 1999 Received: from pedigree.cs.ubc.ca ([142.103.6.50]) by dusty; Wed Jul 14 20:20:34 EDT 1999 Received: from cascade.cs.ubc.ca (snoeyink@cascade.cs.ubc.ca [142.103.7.7]) by pedigree.cs.ubc.ca (8.8.8/8.6.9) with ESMTP id RAA26874; Wed, 14 Jul 1999 17:20:29 -0700 (PDT) Message-Id: <199907150020.RAA26874@pedigree.cs.ubc.ca> X-Mailer: exmh version 2.0.2 2/24/98 To: THEORYNT@listserv.nodak.edu, compgeom-announce@research.bell-labs.com, wanka@uni-paderborn.de, ian@silo.csci.unt.edu, rozenber@wi.leidenuniv.nl, infoinfo@iro.umontreal.ca, parva@uni-paderborn.de, dennis@cs.cmu.edu, meinel@uni-trier.de, weidmann@informatik.tu-muenchen.de, DMA-LIST@nic.surfnet.nl Subject: 11th Canadian Conference on Computational Geometry Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Wed, 14 Jul 1999 17:20:27 -0700 From: Jack Snoeyink Precedence: bulk Status: RO Content-Length: 1433 Lines: 35 -------------------------------------------------------- Eleventh Canadian Conference on Computational Geometry University of British Columbia, Vancouver, Canada August 15-18, 1999 http://www.cs.ubc.ca/conferences/CCCG -------------------------------------------------------- CCCG'99 will be held at UBC, Vancouver, Canada, August 15-18, 1999, immediately following WADS '99 which is in downtown Vancouver. More details can be found on the web page http://www.cs.ubc.ca/conferences/CCCG Please note that the deadline for arranging accommodations on campus is July 15. There are forms that can be downloaded from the web page, filled in, and faxed to the UBC Conference Centre. Registration will occur on-site, although we would appreciate a message through the web pages or directly to efong@cs.ubc.ca stating your intention to come. There is an opportunity to order tickets to "Bard on the Beach" performances through the web pages. Hope to see you in Vancouver. o Jack _/\_. snoeyink@cs.ubc.ca (')>-(`) http://www.cs.ubc.ca/spider/snoeyink/ ------------- 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 compgeom-owner@research.bell-labs.com Thu Jul 22 00:01:47 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA03583; Thu, 22 Jul 1999 00:01:45 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id XAA25932; Wed, 21 Jul 1999 23:57:45 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Jul 21 16:51:56 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Wed Jul 21 12:35:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Jul 21 12:33:31 EDT 1999 Received: from largo.eecs.tufts.edu ([192.138.177.99]) by dusty; Wed Jul 21 12:33:30 EDT 1999 Received: from u8.eecs.tufts.edu (u8 [192.138.178.69]) by largo.eecs.tufts.edu (8.9.1a/8.9.1) with ESMTP id MAA07170 for ; Wed, 21 Jul 1999 12:29:48 -0400 (EDT) Received: from localhost (jlindy@localhost) by u8.eecs.tufts.edu (8.9.1a/8.9.1) with ESMTP id MAA01161 for ; Wed, 21 Jul 1999 12:30:04 -0400 (EDT) X-Authentication-Warning: u8.eecs.tufts.edu: jlindy owned process doing -bs Date: Wed, 21 Jul 1999 12:30:04 -0400 (EDT) From: Seg Fault X-Sender: jlindy@u8 To: compgeom-discuss@research.bell-labs.com Subject: geometric Medial Axis Transform software In-Reply-To: Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 1154 Lines: 28 I am doing work this summer in the area of the Firehydrant Problem as posed by Freeman. Developing a software implementation of a medial axis tranform (not necessarily a very fast one; there is an algorithm by Yao and Rokne '91 that is O(n^2) which is simple enough) is part of my efforts. In searching, I have found a few programs to do medial axis transform (in particular Anthony Lau's Java program and R.L. Ogniewicz's in C.) However, all of the software that I have found has used finite point sets to approximate the segments of the simple polygon, rather than instances of geometric classes such as those found in LEDA (the software package I am working in). Does anyone know of an implementation of the medial axis transform that uses geometric objects (segments, rays, et ceteras...) rather than approximating the figures? -Jeff Lindy Tufts University EECS class of 2001 ------------- 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 compgeom-owner@research.bell-labs.com Thu Jul 22 00:07:54 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA05249; Thu, 22 Jul 1999 00:07:30 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id AAA26984; Thu, 22 Jul 1999 00:03:30 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Jul 21 16:49:44 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Wed Jul 21 10:05:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Jul 21 10:05:01 EDT 1999 Received: from gemma.inria.fr ([138.96.16.98]) by dusty; Wed Jul 21 10:04:59 EDT 1999 Received: from gemma.inria.fr by gemma.inria.fr (8.8.8/8.8.5) with ESMTP id QAA02321 for ; Wed, 21 Jul 1999 16:04:47 +0200 (MET DST) Message-Id: <199907211404.QAA02321@gemma.inria.fr> X-Mailer: exmh version 2.0.2 2/24/98 To: compgeom-discuss@research.bell-labs.com Subject: Painter's algorithm Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Wed, 21 Jul 1999 16:04:46 +0200 From: Carine Bonetto Precedence: bulk Status: RO Content-Length: 456 Lines: 14 I'm in search of any kind of information concerning the painter's algorithm, more exactly concerning a depth-Sort Algorithm (source code, URL...) Thanks Carine Bonetto INRIA Sophia-Antipolis ------------- 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 compgeom-owner@research.bell-labs.com Sat Aug 7 06:10:34 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id GAA02776; Sat, 7 Aug 1999 06:10:32 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id GAA05106; Sat, 7 Aug 1999 06:06:37 +0300 (IDT) Message-Id: <199908070306.GAA05106@post.tau.ac.il> Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Aug 6 23:00:24 EDT 1999 Date: Fri, 6 Aug 1999 22:53:55 -0400 From: Bernard Philippe X-Mailer: Mozilla 4.03 [fr] (WinNT; I) MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: Workshop in France Status: RO Precedence: bulk WORKSHOP ANNOUNCE : (This announce is in French because most of the talks will be given in French) Outils pour un calcul numerique fiable Appel a communications http://www-sop.inria.fr/prisme/fiable/workshop.html 22-24 septembre 1999 a Paris (Campus Jussieu) Theme des journees : ------------------- La notion de fiabilite des calculs recouvre deux situations differentes : - dans le premier cas, on suppose que les donnees du probleme sont exactement representees et on recherche une reponse s=FBre (c'est-a-dire prouvee). C'est le cas des calculs de geometrie tels que le placement d'un point par rapport a une droite, un cercle, un plan, etc. Ce domaine contient aussi la recherche de procedures de localisation de racines de polyn=F4me= s dans le plan complexe. - dans le deuxieme cas au contraire, on admet l'existence d'une incertitude sur les donnees. Il s'agit alors au minimum d'estimer l'incertitude sur le resultat et dans le meilleur des cas de prouver des bornes sur cette incertitude. La formulation du probleme pour avoir un sens doit alors supposer la continuite du resultat en fonction des donnees. Dans les deux cas, on a recours a des techniques qui reposent sur des outils communs. En particulier les arithmetiques peuvent =EAtre des aritmetiques entieres sur des nombres de longueur variable et non bornee, des arithmetiques flottantes de precision classique ou de precision arbitraire, des arithmetiques d'intervalle, etc. Les preuves d'encadrement reposent aussi sur les encadrements des fonctions elementaires ce qui n'est pas encore etabli pour toutes les fonctions usuelles. Dans le cas des calculs approches, il est necessaire de qualifier le comportement des algorithmes ; cela peut se faire formellement par une analyse inverse des erreurs ou a posteriori sur un jeu de donnees par une analyse statistique. L'action Fiable (action cooperative financee par l'Inria) a ete lancee en juin 1996 sur ces themes. L'un de ses enjeux etait de confronter le savoir-faire de la communaute utilisateurs des calculs exacts a celle des calculs avec arrondis. Les algorithmes sont differents mais la connaissance d'un domaine rejaillit sur l'autre. Les journees feront le point sur les resultats de la confrontation. Elles seront organisees autour d'exposes de trois sortes : - des exposes invites - des etats-de-l'art decrits par les membres de l'action - des exposes techniques de resultats de l'action ou des communications exterieures Exposes invites : - Torbjorn Grandlund (GMP) : Current developments of the GNU MP library - Jean-Claude Berges (CNES) : - Joris van der Hoeven (CNRS Orsay) - Andre Lieutier (Dassault Syst) - Famanta Randimbivololona (Aerospatiale) - Siegfried M. Rumps (U. Hambourg) - M. Vrahatis (U. Patras) Organisateurs : - Jean-Marie Chesneaux (LIP6, Univ. Pierre et Marie Curie, Paris) - Jocelyne Erhel (Inria, Rennes) - Olivier Devillers (Inria, Sophia A.) - Bernard Mourrain (Inria, Sophia A.) - Jean-Michel Muller (ENS, Lyon) - Bernard Philippe (Inria, Rennes) - Paul Zimmermann (Inria, Nancy) ------------- 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 compgeom-owner@research.bell-labs.com Sat Aug 7 06:11:54 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id GAA03172; Sat, 7 Aug 1999 06:11:51 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id GAA05207; Sat, 7 Aug 1999 06:07:56 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Aug 6 22:58:37 EDT 1999 To: compgeom-announce@research.bell-labs.com Received: from grubby.research.bell-labs.com by netlib2; Fri Jul 30 04:47:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Jul 30 04:46:38 EDT 1999 Received: from ori.zcu.cz ([147.228.52.11]) by dusty; Fri Jul 30 04:46:37 EDT 1999 Received: from uk426pc04-kiv.fav.zcu.cz (uk426p03-kiv.fav.zcu.cz [147.228.43.54]) by ori.zcu.cz (8.9.1a/8.9.1) with SMTP id JAA06161; Fri, 30 Jul 1999 09:46:01 +0200 (MET DST) Message-ID: <000a01beda61$d5f5ef20$362be493@uk426pc04-kiv.fav.zcu.cz> From: "Vaclav Skala" To: Subject: WSCG - Int.conf. on Computer Graphics, Visualization and Digital Media - close to Prague, Czech Republic Date: Wed, 28 Jul 1999 17:30:44 +0200 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 4.72.3110.5 X-MimeOLE: Produced By Microsoft MimeOLE V4.72.3110.3 Precedence: bulk Status: RO Content-Length: 4118 Lines: 114 WSCG'2000 Call for Papers ========================= The First Announcement Deadline for papers: October 13, 1999 Conference dates: February 7. - 11., 2000 Information: http://wscg.zcu.cz W S C G'2000 The 8-th International Conference in Central Europe on Computer Graphics, Visualization and Digital Interactive Media 2000 in cooperation with EUROGRAPHICS and IFIP working group 5.10 on Computer Graphics and Virtual Worlds will be held in February 7 - 11, 2000 in Plzen close to PRAGUE, the capital of the Czech Republic ----------------------------------------------------------------------- >> If you are willing to help us as a REVIEWER, please, << >> fill in the form at the http://wscg.zcu.cz/reviewer.htm << ----------------------------------------------------------------------- Conference Chairs ================= Nadia Magnenat Thalmann, MIRALab-CUI, Univ. of Geneva, Switzerland Vaclav Skala, Univ. of West Bohemia, Czech Republic Sponsors and supporting organizations ===================================== (Preliminary) Digital Equipment, Hewlett Packard, IBM, Silicon Graphics, Intergraph, Bentley Systems, Microsoft Topics included --------------- Fundamental algorithms, rendering and visualization, virtual reality, animation and multimedia, medical imaging, geometric modelling and fractals, graphical interaction, object-oriented graphics, WWW technologies, standards, computer vision, parallel and distributed graphics, computational geometry, computer aided geometric design, CAD/CAM, DTP and GIS systems, educational aspects of related fields, usage of graphics within mathematical software (Maple, Mathematica, MathCAD etc.) in education The program includes international books exhibition and video show, too. --------------------------------------------- W S C G '2000 International Exhibition ------------------------------------ Information for exhibitors: Please contact the organiser as soon as possible -------------------------- for detailed information and conditions. The WSCG98 Exhibition will be held in parallel. Top leading European and Czech companies active in computer graphics, visualization and computer vision, CAD/CAM and GIS systems, virtual reality, multimedia systems and others will be presenting their latest products. Special programme will be available, too. ----------------- Accepted papers will be published in the Conference proceedings with ISBN. They are reviewed by INSPEC, Cambridge Scientific Abstracts, InfoStore, IEEE , ISI , AIMS , INIST and others for citations index and other purposes. The best papers will be considered for possible publication in the Journal of Visualisation and Computer Animation, Computers&Graphics, The Visual Computer, Machine Graphics & Vision and others journals. Organizer and conference secretariat ------------------------------------ Vaclav Skala c/o Computer Science Dept., Univ.of West Bohemia Univerzitni 8, Box 314, 306 14 Plzen, Czech Republic e-mail: skala@kiv.zcu.cz Subject: INFO WSCG tel.:+420-19-7491-188 fax:+420-19-7822-578 The latest information is available at: http://wscg.zcu.cz select WSCG'2000 Information on all WSCG conferences: http://wscg.zcu.cz In case of any problems use: http://147.228.63.9 or send a mail to maxvs@bath.ac.uk ------------- 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 compgeom-owner@research.bell-labs.com Tue Aug 17 01:06:51 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id BAA23036; Tue, 17 Aug 1999 01:06:50 +0300 (GMT+0300) Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by post.tau.ac.il (8.9.1a/8.9.1) with SMTP id BAA28166; Tue, 17 Aug 1999 01:02:49 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Aug 16 17:56:03 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Fri Aug 13 09:21:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Aug 13 09:19:12 EDT 1999 Received: from mail.cs.uu.nl ([131.211.80.32]) by dusty; Fri Aug 13 09:19:11 EDT 1999 Received: from otterlo (otterlo.cs.uu.nl [131.211.80.180]) by mail.cs.uu.nl (Postfix) with SMTP id 0F8694523 for ; Fri, 13 Aug 1999 15:19:07 +0200 (MET DST) Message-Id: <3.0.5.32.19990813151825.00e965c0@pop.cs.uu.nl> X-Sender: remcov@pop.cs.uu.nl (Unverified) X-Mailer: QUALCOMM Windows Eudora Pro Version 3.0.5 (32) Date: Fri, 13 Aug 1999 15:18:25 +0200 To: compgeom-announce@research.bell-labs.com From: cgal Subject: CGAL Tutorial Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Precedence: bulk Status: RO Content-Length: 530 Lines: 17 Please be advised that the slides and example files of Lutz Kettner's tutorial 'Programming with CGAL', presented at the Symposium on Computational Geometry '99, are now available via http://www.cs.uu.nl/CGAL/Information/index.html Kind regards, cgal@cs.uu.nl ------------- 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 compgeom-owner@research.bell-labs.com Mon Aug 30 00:36:31 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id AAA13386; Mon, 30 Aug 1999 00:36:28 +0300 (GMT+0300) Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by post.tau.ac.il (8.9.3/8.9.1) with SMTP id AAA26573; Mon, 30 Aug 1999 00:32:19 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sun Aug 29 17:29:23 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Fri Aug 27 08:55:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Aug 27 08:54:21 EDT 1999 Received: from esr.phys.chem.ethz.ch ([129.132.43.71]) by dusty; Fri Aug 27 08:54:19 EDT 1999 Received: from phys.chem.ethz.ch (altshuler [129.132.43.89]) by esr.phys.chem.ethz.ch (8.9.1a/8.9.1) with ESMTP id OAA07368 for ; Fri, 27 Aug 1999 14:54:16 +0200 (MET DST) Sender: stoll@esr.phys.chem.ethz.ch Message-ID: <37C68A78.61A9C9EA@phys.chem.ethz.ch> Date: Fri, 27 Aug 1999 14:54:16 +0200 From: Stefan Stoll X-Mailer: Mozilla 4.6 [en] (X11; U; SunOS 5.6 sun4u) X-Accept-Language: de, en, it, ru, fr MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com Subject: Newcomer's question Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 1581 Lines: 41 Dear All, I am a physical chemist working in the field of magnetic resonance. The following problem seems to be solvable by geometric computations: Given three functions B,L and W over some closed subregion K over (theta,phi) where theta=0..pi and phi=0..2*pi, calculate the distribution of function B values weighted by W and "broadened" by L. Let w be a point of K. L(w) is a scalar and defines the width of a Gaussian distribution with which the distribution of B values of an infinitesimal region dK around w have to be convoluted (in the Fourier sense). If the domain of the function was 1D, the problem would be easy to solve, since the requested distribution can be obtained starting from B's inverse function's first derivative. Three more remarks: - The function B can only be evaluated numerically over a grid covering the region K. It may have a couple of minima and maxima, but is well-behaved (smooth, continuous and differentiable). - Using contouring methods is possible for the problem if L is constant over K. But unfortunately it is not. I hope I was clear enough. Any suggestions extremely welcome! Stefan -- Stefan Stoll Fon [41](1) 632 61 39 Physical Chemistry Lab Fax [41](1) 632 10 21 ETH Zurich, Switzerland E-mail stoll@phys.chem.ethz.ch ------------- 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 compgeom-owner@research.bell-labs.com Mon Aug 30 01:04:27 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id BAA13933; Mon, 30 Aug 1999 01:04:26 +0300 (GMT+0300) Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by post.tau.ac.il (8.9.3/8.9.1) with SMTP id BAA27950; Mon, 30 Aug 1999 01:00:17 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Aug 29 17:54:30 EDT 1999 To: compgeom-announce@research.bell-labs.com Received: from grubby.research.bell-labs.com by netlib2; Wed Aug 25 18:49:02 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Aug 25 18:48:02 EDT 1999 Received: from smtp2.andrew.cmu.edu ([128.2.10.82]) by dusty; Wed Aug 25 18:48:01 EDT 1999 Received: from heaven0 (HEAVEN.ME.CMU.EDU [128.2.48.123]) by smtp2.andrew.cmu.edu (8.9.3/8.9.3) with SMTP id SAA02437 for ; Wed, 25 Aug 1999 18:47:58 -0400 (EDT) From: "Kenji Shimada" To: Subject: 8TH INTERNATIONAL MESHING ROUNDTABLE Date: Wed, 25 Aug 1999 18:47:22 -0400 Message-ID: MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2910.0) X-Mimeole: Produced By Microsoft MimeOLE V5.00.2314.1300 In-Reply-To: <000a01beda61$d5f5ef20$362be493@uk426pc04-kiv.fav.zcu.cz> Importance: Normal Precedence: bulk Status: RO Content-Length: 8713 Lines: 218 *************************************************************** ** Announcement ** ** ** ** 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. Information and registration forms for the 8th International Meshing Roundtable can be found on our website at: http://www.cfd.sandia.gov/8imr.html Registration packets are also in the mail. IMPORTANT DATES --------------- August 1, 1999 Acceptance/rejection notices sent to authors August 22, 1999 Final, camera-ready papers due September 10, 1999 Early conference registration due September 10, 1999 Hotel reservation due Oct. 10-13, 1999 8th International Meshing Roundtable South Lake Tahoe, California, USA CONFERENCE LOCATION AND HOTEL RESERVATIONS ------------------------------------------ ACTION: Reserve your room at the Embassy Suites Resort BY SEPTEMBER 10TH 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. RESERVE YOUR ROOM TODAY! 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) $100 Short Course 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. 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 * Pre-conference Short Course on Sunday, October 10 (See web for bios) * Vendor Exhibits (see web for information to participate) More information on the Roundtable can be found on the International Meshing Roundtable WWW page at: http://www.cfd.sandia.gov/8imr.html SHORT COURSE ------------ A new addition to the Roundtable for 1999 is the optional short courses, to be held the day before the opening of the Conference. Three courses will be offered, taught by internationally known experts in the field of Mesh Generation. Each short course will be two hours in length and include course notes and coffee breaks. Instructors will be addressing practical issues in the design and implementation of both structured and unstructured mesh generation codes. The courses are ideal for students just entering the field needing a foundation for research, or for seasoned professionals who would like to expand their current skill-set in the development of mesh and grid generation algorithms. To register for the short courses, mark the appropriate boxes on the registration form. The price is $100 per attendee which includes course materials. Enrollment for short courses is limited to the first 30 paid registrants. If insufficient enrollment, short courses may be subject to cancellation. In event of cancellation or over-enrollment, all tuition will be refunded. 10:00-12:00 Basics of Structured Grid Generation 1:00 - 3:00 New Advances and Open Issues in Unstructured Meshing 3:30 - 5:30 Parallel Meshing and CAD Interface FOR MORE INFORMATION SEE OUR WEBSITE: http://www.cfd.sandia.gov/8imr.html POSTER SESSION -------------- Major Shared Resource Centers (MSRC) and the International Society of Grid Generation (ISGG) are pleased to sponsor this year's poster session. The poster session will be held at the top of Heavenly Mountain in the ski lodge facility (via tram) on Monday, October 11th, beginning at 5:30 p.m. In past years the poster session has featured demonstrations of meshes from participants of the roundtable, from which the best mesh or "meshing maestro" award was selected. In addition to this successful event, all 8IMR participants are invited to display technical exhibits of current research in mesh and grid generation. This is an ideal forum for authors who would prefer not to submit a formal technical paper, but would like to illustrate state-of-the-art techniques and procedures in which they are currently involved. Session speakers are also invited to display practical results of their work at the poster session. 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. 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-2582 Fax: (513) 576-2840 E-Mail: glen.mccann@sdrc.com --------------------------------------------- _ ______ | \ HOPE TO SEE YOU AT THE \ / \___-=O`/|O`/__| \ 8th International Meshing Roundtable \_______\ / | / ) \ South Lake Tahoe, California / `/-==__ _/__|/__=-| / October 10-13th, 1999 / * \ | | / http://cfd.sandia.gov/8imr.html / (o) --------------------------------------------- ------------- 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 compgeom-owner@research.bell-labs.com Mon Aug 30 01:09:08 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id BAA14030; Mon, 30 Aug 1999 01:09:07 +0300 (GMT+0300) Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by post.tau.ac.il (8.9.3/8.9.1) with SMTP id BAA28283; Mon, 30 Aug 1999 01:04:58 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sun Aug 29 17:57:26 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Thu Aug 26 04:07:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Aug 26 04:05:17 EDT 1999 Received: from mo.math.nat.tu-bs.de ([134.169.53.1]) by dusty; Thu Aug 26 04:05:16 EDT 1999 Received: (from marco@localhost) by mo.math.nat.tu-bs.de (8.9.3/8.9.3 Spammers shall be dealt with severely!) id KAA27025; Thu, 26 Aug 1999 10:04:46 +0200 (METDST) From: Marco Luebbecke MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <14276.62749.699702.662667@mo.math.nat.tu-bs.de> Date: Thu, 26 Aug 1999 10:04:45 +0200 (METDST) To: compgeom-announce@research.bell-labs.com Subject: 0/1 Vertex Enumeration Code: zerOne 1.81 X-Mailer: VM 6.53 under Emacs 19.34.1 Reply-To: m.luebbecke@tu-bs.de Precedence: bulk Status: RO Content-Length: 1800 Lines: 44 SOFTWARE ANNOUNCEMENT VERTEX ENUMERATION CODE FOR 0/1 POLYTOPES zerOne 1.81 NOW AVAILABLE Given the linear description P = {x | Ax <= b} of an arbitrary polytope P contained in the unit hypercube {0 <= x <= 1}, zerOne lists all vertices with all coordinates equal to zero or one. This is a frequent (sub-)task when designing models or analyzing the associated (integral) polytopes in combinatorial optimization and is usually done by listing all vertices and filtering out the integral ones. The linear description of the polytope P is provided in CPLEX' LP format. The output is in PORTA's POI or POLYMAKE format in order to facilitate the subsequent generation of the convex hull of all 0-1 vertices. zerOne itself is not made for listing facets! Since zerOne is a special purpose implementation it is much faster than general codes. The major benefit, however, is its memory usage being independent of the output vertices. This remedies a drawback inserting algorithms like the Double Description Method usually suffer from. For further information on algorithm, input/output, and download please check the zerOne web page at http://www.math.tu-bs.de/mo/research/zerone.html Best regards, Marco E. Luebbecke -- Department of Mathematical Optimization Phone: +49 531 391 7560 Braunschweig University of Technology Fax: +49 531 391 7559 Pockelsstrasse 14 Email: m.luebbecke@tu-bs.de D-38106 Braunschweig, Germany WWW: http://www.math.tu-bs.de/~marco ------------- 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 compgeom-owner@research.bell-labs.com Mon Aug 30 01:18:22 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id BAA14217; Mon, 30 Aug 1999 01:18:21 +0300 (GMT+0300) Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by post.tau.ac.il (8.9.3/8.9.1) with SMTP id BAA28734; Mon, 30 Aug 1999 01:14:13 +0300 (IDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sun Aug 29 17:58:33 EDT 1999 Received: from grubby.research.bell-labs.com by netlib2; Thu Aug 26 11:03:03 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Aug 26 11:02:58 EDT 1999 Received: from rug104.cs.rug.nl ([129.125.5.104]) by dusty; Thu Aug 26 11:02:57 EDT 1999 Received: from localhost (gert@localhost) by rug104.cs.rug.nl (8.8.6 (PHNE_14041)/8.8.6) with ESMTP id RAA24524; Thu, 26 Aug 1999 17:02:55 +0200 (METDST) Date: Thu, 26 Aug 1999 17:02:55 +0200 (METDST) From: Gert Vegter To: compgeom-announce@research.bell-labs.com cc: Gert Vegter Subject: PhD position at Groningen University Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Precedence: bulk Status: RO Content-Length: 1891 Lines: 54 PhD Position (four years) available at the Department of Mathematics and Computing Science Groningen University for the project COMPUTATION AND MANIPULATION OF IMPLICIT SURFACES A PhD position starting this fall (ultimately January 2000) is available at the Department of Mathematics and Computing Science of Groningen University, The Netherlands, in the group Scientific Computing and Imaging. Funding will be for four years. The research program is concerned with the development of fast methods for representation, manipulation and visualization of implicit surfaces. This type of shapes has become an alternative to classical spline-surfaces in the design and animation of free-form and deformable objects. The development of these techniques will be based on theoretical results from well-established mathematical disciplines like differential geometry and Morse theory, to obtain algorithms that are adaptive to geometric features like curvature. This work will be carried out in close cooperation with groups at the Ecole Normale Superieure in Paris (M. Pocchiola) and INRIA Rocquencourt/Paris (A. Verroust). Applicants should have a degree in in computer science, with a strong background in mathematics, or a degree in mathematics, with a strong background in computer science. Experience in geometric computing or computer graphics will be appreciated. To get further information, or to apply, please contact Dr. Gert Vegter Department of Mathematics and Computing Science Groningen University P.O. Box 800 9700 AV Groningen The Netherlands e-mail: gert@cs.rug.nl ------------- 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 compgeom-owner@research.bell-labs.com Fri Sep 3 16:05:04 1999 Return-Path: Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id QAA24418; Fri, 3 Sep 1999 16:05:01 +0300 (GMT+0300) Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by post.tau.ac.il (8.9.3/8.9.1) with SMTP id PAA11654; Fri, 3 Sep 1999 15:04:57 +0200 (IST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Sep 3 08:58:34 EDT 1999 Received: from scummy.research.bell-labs.com by netlib2; Thu Sep 2 13:49:04 EDT 1999 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Sep 2 13:47:26 EDT 1999 Received: from blaze.cs.jhu.edu ([128.220.13.50]) by dusty; Thu Sep 2 13:47:25 EDT 1999 Received: from condor.cs.jhu.edu (subodh@condor.cs.jhu.edu [128.220.13.86]) by blaze.cs.jhu.edu (8.8.5/8.8.7) with ESMTP id NAA21622; Thu, 2 Sep 1999 13:46:54 -0400 (EDT) From: Subodh Kumar Received: (from subodh@localhost) by condor.cs.jhu.edu (8.8.5/8.8.5) id NAA23179; Thu, 2 Sep 1999 13:46:54 -0400 (EDT) Message-Id: <199909021746.NAA23179@condor.cs.jhu.edu> Subject: CGC Workshop on Computational Geometry, 2nd call To: compgeom-announce@research.bell-labs.com, jeffe@cs.uiuc.edu Date: Thu, 2 Sep 1999 13:46:54 -0400 (EDT) X-Mailer: ELM [version 2.4 PL13] MIME-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Precedence: bulk Status: RO Content-Length: 3769 Lines: 112 Call for Papers 4th CGC Workshop on Computational Geometry Johns Hopkins University, Baltimore, MD, October 15-16, 1999 We are pleased to announce the fourth annual fall Workshop on Computational Geometry, sponsored by the Center for Geometric Computing, continuing a tradition established by the Mathematical Sciences Institute at SUNY-Stony Brook. The Center for Geometric Computing is a collaborative center of Brown, Duke, and Johns Hopkins Universities, and is funded by the U.S. Army Research Office. Scope and Format The aim of this workshop is to bring together researchers from academia, industry, and the Army to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to: Algorithmic methods in geometry I/O-scalable geometric algorithms Animation of geometric algorithms Computer graphics Solid modeling Geographic information systems Computational metrology Graph drawing Experimental studies Geometric data structures Implementation issues Robustness Computer vision Robotics Computer-aided design Mesh generation Following the tradition of the previous MSI and CGC Workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. Registration will be on-site, and will include the abstract booklet, coffee breaks, lunches, and a reception. There will be a registration fee of $75. Invited speakers To be Announced Submissions Authors are invited to submit abstracts for talks to be given at the workshop. Please send an abstract (up to 2 pages) and a draft of a paper (if you have one). E-mail submissions are encouraged; send to cgc@cs.jhu.edu. Ideally, the abstract should be a PDF, PostScript, or LaTeX, file, for ease in assembling the abstract booklet. Abstracts can also be sent by regular mail to: Subodh Kumar Department of Computer Science Johns Hopkins University 224 NEB, 3400 N. Charles St. Baltimore, MD 21218 Submissions should arrive by September 10, 1999. Authors will be notified of acceptance by September 20, 1999. A booklet of abstracts will be distributed at the workshop and made available electronically on the Web. There will be no formal proceedings for this workshop, but selected papers will be invited to a special issue of the journal "Computational Geometry: Theory and Applications". Program Committee Pankaj K. Agarwal (Duke University), Lars Arge (Duke University), Michael T. Goodrich (Johns Hopkins University), S. Rao Kosaraju (Johns Hopkins University), Subodh Kumar (Johns Hopkins University), Joseph S. B. Mitchell (State University of New York at Stony Brook), Franco P. Preparata (Brown University), Roberto Tamassia (Brown University), Jeffrey S. Vitter (Duke University). Note: For more information about the workshop, send mail to cgc@cs.jhu.edu . Further information will be posted to our web site: http://www.cs.jhu.edu/labs/cgc/cgc99 as soon as it is available. Important Dates Deadline for submission Sep 10 Notification of acceptance Sep 20 Conference Oct 15-16 - Subodh ######################################################################## Computer Sc., JHU, Baltimore MD 21218 Tel: (410)516-0060, Fax: 6134 http://www.cs.jhu.edu/~subodh ------------- 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 dmanet-owner@Octopussy.MI.Uni-Koeln.DE Thu Apr 6 06:32:52 2000 Received: from Octopussy.MI.Uni-Koeln.DE (Octopussy.MI.Uni-Koeln.DE [134.95.166.20]) by duke.cs.duke.edu (8.9.3/8.9.3) with ESMTP id GAA03965; Thu, 6 Apr 2000 06:32:49 -0400 (EDT) Received: (from majordom@localhost) by Octopussy.MI.Uni-Koeln.DE (8.9.1/8.9.1) id LAA28405 for dmanet-outgoing; Thu, 6 Apr 2000 11:09:42 +0200 (MET DST) Date: Fri, 7 Apr 2000 03:43:19 +0530 Message-Id: <200004062213.DAA00773@cse.iitd.ernet.in> X-Authentication-Warning: localhost.localdomain: sanjiva set sender to sanjiva@sanjiva.cse.iitd.ernet.in using -f From: Sanjiva Prasad To: aad@cse.iitb.ernet.in, acclaim@sics.se, acl2@cs.utexas.edu, afp@cs.chalmers.se, agents@cs.umbc.edu, akscs@uohyd.ernet.in, algolog@hd1.vsnl.net.in, alp-list@intellektik.informatik.th-darmstadt.de.cse.iitd.ernet.in, amast@CS.UTWENTE.NL, amitava-mukherjee@india.notes.pwa.co.in, angelica@dmat.uevora.pt, anji@ncst.ernet.in, appsem@cs.chalmers.se, arpanet-bboards@mc.lcs.mit.edu, aruano@mozart.si.ualg.pt, aruncs@uohyd.ernet.in, asci@TWI.TUDELFT.NL, as@cse.iitb.ernet.in, ashok@pune.tcs.co.in, asish@cs.sfu.ca, babu@cse.iitb.ernet.in, bhabani@isical.ernet.in, bhargab@isical.ernet.in, bhatkar@parcom.ernet.in, bkb111@ncmrwf.ernet.in, bnj@cse.iitd.ernet.in, bob@wins.uva.nl, bra-types@cs.chalmers.se, brics-vip@daimi.aau.dk, bspanda@bits-pilani.ac.in, caml-list@inria.fr, categories@MTA.CA, cav-all@csa.cs.technion.ac.il, cbm@cmch.ernet.in, ccl@dfki.uni-sb.de, ccp@sics.se, cevm@csa.iisc.ernet.in, cipher@itd.nrl.navy.mil, clics@doc.ic.ac.uk, clp@comp.nus.edu.sg, clp@iscs.nus.sg.cse.iitd.ernet.in, colibri@let.uu.nl, comct@mat.uc.pt, compgeom-announce@RESEARCH.BELL-LABS.COM, comprox@doc.ic.ac.ukcompunode@compulog.org, compunode@dfki.de, comsci%bic-mku@imtech.ernet.in, concurrency@CWI.NL, concurrency-request@CWI.NL, conf@FIZ-Karlsruhe.DE, coq-club@pauillac.inria.fr, crs@gmrt.ernet.in, csl@dbai.tuwien.ac.at, cs-logic@cs.indiana.edu, csp@carlit.toulouse.inra.fr, csp-list@saturne.cert.fr.cse.iitd.ernet.in, cvr@pune.tcs.co.in, das@silo.csci.unt.edu, dataloger@cs.chalmers.se, datta@cs.unlv.edu, dbp@cse.iitb.ernet.in, dbworld@cs.wisc.edu, deedee@cse.iitkgp.ernet.in, deepak@ssf.ernet.in, deshu@miel.mot.com, dey@cse.iitkgp.ernet.in, dgd@jadav.ernet.in, dma-list@nic.surfnet.nl, DMANET@MATH.UTWENTE.NL, dmanju@ee.iitb.ernet.in, dmd@cse.iitb.ernet.in, docentes@noe.ubi.pt, ds@cse.iitkgp.ernet.in, dss@cs.auc.dk, dung@cs.ait.ac.th, dvh@iist.unu.edu, eacsl@dimi.uniud.it, eapls@mailbase.ac.uk, eapls-request@mailbase.ac.uk, eatcs-it@cs.unibo.it, eccc@eccc.uni-trier.de, ecoop-info@ecoop.org, ecoopws@cui.unige.ch, elsa@gia.ist.utl.pt, engsc@uma.pt, erlang-questions@erlang.org, etaps99-list@CWI.NL, facs@lboro.ac.uk, farn@iis.sinica.edu.tw, farooqui@pune.tcs.co.in, FMICS2000@fokus.gmd.de, fm-info@air16.larc.nasa.gov, formal-methods@cs.uidaho.edu, forte-pstv-2000-people@mail.iat.cnr.it, forum@jsoftware.com, fournet@microsoft.com, fp@cs.cmu.edu, fr-sem@frmug.org, fsdm@it.uq.edu.au, gberry@post.club-internet.fr, gb@iitg.ernet.in, Gerard.Berry@sophia.inria.fr, ghosh@cdotd.ernet.in, gilles.kahn@inria.fr, girishp@pune.tcs.co.in, gn@cse.iitb.ernet.in, gore@ganga.mnrec.ernet.in, goto@goto.info.waseda.ac.jp, goutam@soft.iwate-pu.ac.jp, gpb@maths.iitkgp.ernet.in, gulp@di.unipi.it, gv@cse.iitb.ernet.in, haskell@haskell.org, hise-safety-critical@minster.cs.york.ac.uk, hk@cse.iitk.ac.in, hmcs@uohyd.ernet.in, hn@bhairav.ee.ernet.in, hsaran@cse.iitd.ernet.in, hthrad@hth01.bhel.ernet.in, i3s@i3s.unice.fr, ifmsig@cs.tcd.ie, info-hol@jaguar.cs.byu.edu, innagraj@inccmail.snads.philips.nlisabel@dei.uc.pt, isabelle-users@cl.cam.ac.uk, jam@imsc.ernet.in, jean-jacques.levy@inria.fr, joxan@comp.nus.edu.sg, kamal@imsc.ernet.in, Kanchana.Kanchanasut@ait.ac.th, kanni@gricc.uunet.in, kathail@hpl.hp.com, kbcs!bbc@ncst.ernet.in, ketan@cse.iitb.ernet.in, kgs@logic.tuwien.ac.at, kokichi@jaist.ac.jp, ksb@iitk.ac.in, kumar@ssf.ernet.in, kvnori@pune.tcs.co.in, kv@ssf.ernet.in, lambda-usergroup@DCS.ED.AC.UK, larc-swe@larc.nasa.gov, lego-club@DCS.ED.AC.UK, lfcs-interest@DCS.ED.AC.UK, lics-request@RESEARCH.BELL-LABS.COM, lics-request@sun5.mathematik.uni-freiburg.de, lics@RESEARCH.BELL-LABS.COM, licsr@sun7.mathematik.uni-freiburg.de, limsoon@krdl.org.sg, llf@di.fc.ul.pt, lmp@di.fct.unl.pt, logic@cs.cornell.edu, logic@cs.stanford.edu, logic-ml@logic.jaist.ac.jp, logic-request@cs.cornell.edu, logic@theory.lcs.mit.edu, lotos-world@sanson.dit.upm.es, lprolog@cis.upenn.edu, luis@ncc.up.pt, lyu@cse.cuhk.edu.hk, madhavan@ssf.ernet.in, madhu@cbme.iitd.ernet.in, madhu@imsc.ernet.in, maharaj@ece.iitkgp.ernet.in, major@cmch.ernet.in, mangal@maths.iitkgp.ernet.in, math-phys_sem@bebop.math.ist.utl.pt, mccmath@imsc.ernet.in, mchauser@ptmat.lmc.fc.ul.pt, meena@imsc.ernet.in, mehtre@cmch.ernet.in, mercury-users@cs.mu.oz.au, mfpsmail@math.tulane.edu, mickey@ncst.ernet.in, mlnet@swi.psy.uva.nl, mohan@vigyan.ernet.in, mrs@cse.iitb.ernet.in, msg@sasi.com, mukul@mahavir.doe.ernet.in, nandysc@isical.ernet.in, ncn@pune.tcs.co.in, nls@cse.iitb.ernet.in, nqthm-users@cli.com, nswami@pune.tcs.co.in, nuprllist@cs.cornell.edu, objecttypes@daimi.aau.dk, om-announce@lars.math.fsu.edu, pabitra@isical.ernet.in, pallabk@cse.iitkgp.ernet.in, pande@pune.tcs.co.in, papm@DCS.ED.AC.UK, patkar@math.iitb.ernet.in, pavan@cair.ernet.in, pb@cse.iitb.ernet.in, pbhaduri@darkstar.tulbom.unisys.com, pept%yl.is.s.u-tokyo.ac.jppvs@csl.sri.com, PetriNets@daimi.aau.dk, pijush@saathi.ncst.ernet.in, pjs@cs.mu.oz.au, pkm@stpbhu.stpbh.soft.net, ppchak@cse.iitkgp.ernet.in, ppdas@cse.iitkgp.ernet.in, ppp!isical@shakti.ernet.in, prakash@gsits.ernet.in, pranay@cairo.eng.kuniv.edu.kw, prasad@cair.ernet.in, prasanta_mishra@yahoo.com, prasant@cse.msu.edu, pravir@iitk.ac.in, procos-list@comlab.ox.ac.uk, prog-logique@irisa.fr, prolog@mch.sni.de, prolog-vendors@sics.se, proof-request@cs.chalmers.se, p_sahu@hotmail.com, pst@smi.ernet.in, pvrcs@uohyd.ernet.in, pvs@csl.sri.com, qed@mcs.anl.gov, rajib@cse.iitkgp.ernet.in, raj@pune.tcs.co.in, ramana@oslo.cmc.stph.net, ramani@ncst.ernet.in, ramesh@cair.ernet.in, ramesh@cse.iitb.ernet.in, rana@isical.ernet.in, ranjit@maths.iitkgp.ernet.in, reddy@tk1.iis.u-tokyo.ac.jp.cse.iitd.ernet.in, reflection@p300.cpl.uiuc.edu, reliable_computing@interval.usl.edu, res9513@isical.ernet.in, rewriting@ens-lyon.fr, rewriting@loria.fr, rkg@cse.iitk.ac.in, rmenezes@mat.ua.pt, sagar@cair.ernet.in, sak@cse.iitb.ernet.in, samar@cse.iitd.ernet.in, samik@ssf.ernet.in, sanjiva@cse.iitd.ernet.in, sattar@cit.gu.edu.au, sbiswas@cse.iitb.ernet.in, scd@cse.iitkgp.ernet.in, sdd@magnum.barc.ernet.in, secretaria@di.fct.unl.pt, seworld@cs.colorado.edu, sharat@cse.iitb.ernet.in, shastri@bv.ernet.in, shyam@tcs.tifr.res.in, sicstus-users@sics.se, sikdar@isical.ernet.in, sisal-info@sisal.llnl.gov.cse.iitd.ernet.in, sivanand@cse.iitb.ernet.in, skapoor@cse.iitd.ernet.in, skm@cs.unipune.ernet.in, slm@iitb.ernet.in, smriti@agnigrah.tezu.ernet.in.cse.iitd.ernet.in, snm@cse.iitd.ernet.in, softverf@xsun.sdct.itl.nist.gov, softverf@jaguar.cs.byu.edu, softverf@xsun.sdct.itl.nist.gov, sohoni@cse.iitb.ernet.in, sona%jnuniv@shakti.ernet.in, sri@cse.iitb.ernet.in, srikantapatnaik@hotmail.com, srini@ssf.ernet.in, srin@RESEARCH.BELL-LABS.COM, ssen@cse.iitd.ernet.in, ssrao@imsc.ernet.in, ssspr@cse.iitb.ernet.in, stochver@cs.bham.ac.uk, sudeshna@cse.iitkgp.ernet.in, sundar@cse.iitb.ernet.in, supratik@cair.ernet.in, Surisuru@hotmail.com, surjya@ocac.ernet.in, svc@cse.iitb.ernet.in, svn@imsc.ernet.in, swarup@imsc.ernet.in, system-safety@listserv.gsfc.nasa.gov, tfm-list@doc.ic.ac.uk, theorem-provers@ai.mit.edu, theorem-provers@mc.lcs.mit.edu, theory-a@listserv.nodak.edu, theory-logic@cs.cmu.edu, THEORYNT@listserv.nodak.edu, types@cis.upenn.edu, uday@jadhav.ernet.in, ueda@ueda.info.waseda.ac.jp, uma@duettech.com, users@mozart-oz.org, uttam@iimcal.ac.in, vasan@cmch.ernet.in, vasu@cse.iitb.ernet.in, vdm-forum@mailbase.ac.uk, venkatesh@pune.tcs.co.in, venus@cse.iitkgp.ernet.in, vinod@imsc.ernet.in, vkt@cse.iitd.ernet.in, vmd@surya.trddc.ernet.in, vmm@probitas.cs.utas.edu.au, vraman@imsc.ernet.in, vrk@vishak.recal.ernet.in, yjoyang@csie.ntu.edu.tw, zcc@iist.unu.edu, zeves@ora.on.ca, zforum@prg.ox.ac.uk Sender: owner-dmanet@zpr.uni-koeln.de Precedence: bulk Status: RO Content-Length: 6051 Lines: 168 Subject: Second Call for Papers *********************************************************************** * * * FST TCS 2000 * * * * Foundations of Software Technology and Theoretical Computer Science * * December 13--15, 2000 * * New Delhi, India * * * *********************************************************************** * Call for Papers * *********************************************************************** IARCS, the Indian Association for Research in Computing Science, announces the 20th Annual FST TCS Conference in New Delhi. Two satellite workshops are planned: on Computational Geometry and on Advances in Programming Languages. Authors are invited to submit papers presenting original and unpublished research on **any** theoretical aspects of Computer Science. Papers in applied areas with a strong foundational emphasis are also welcome. The proceedings of the last six years' conferences (Springer-Verlag Lecture Notes in Computer Science volumes 880, 1026, 1180, 1346, 1530, 1738) give an idea of the kind of papers typically presented at FST TCS. Typical areas include (but are not restricted to): Automata, Languages and Computability Randomized and Approximation Algorithms Computational Geometry Computational Biology Combinatorial Optimization Graph and Network Algorithms Complexity Theory Parallel and Distributed Computing New Models of Computation Concurrent, Real-time and Hybrid Systems Logics of Programs and Modal Logics Database Theory and Information Retrieval Automated Reasoning, Rewrite Systems, and Applications Logic, Proof Theory, Model Theory and Applications Semantics of Programming Languages Static Analysis and Type Systems Theory of Functional and Constraint-based Programming Software Specification and Verification Cryptography and Security Protocols For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. Important Dates --------------- Deadline for Submission 31 May, 2000 Notification to Authors 15 August, 2000 Final Version of Accepted Papers due 15 September, 2000 Deadline for Early Registration 15 November, 2000 Submission Guidelines - --------------------- Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 A4-size pages, with 1.5 inch top margin and other margins 1 inch wide with 11 point or larger font. Authors who feel that more details are necessary may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should contain a short abstract. If available, e-mail addresses and fax numbers of the authors should be included. Electronic Submissions - ---------------------- Electronic submission is strongly encouraged. Self-contained uuencoded gzipped Postscript versions of the paper may be sent by e-mail to fsttcs20@cse.iitd.ernet.in In addition, the following information in ASCII format should be sent to this address in a **separate** e-mail: Title; authors; communicating author's name, address, and e-mail address and fax number if available; abstract of paper. Hard-Copy Submissions - --------------------- If electronic submission is not possible, authors may submit five (5) hard-copies of the paper by post to the following address: FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas New Delhi 110 016 INDIA Invited Speakers ---------------- Invited Speakers who have confirmed participation include: Peter Buneman (U Penn) Bernard Chazelle (Princeton) E. Allen Emerson (U Texas, Austin) Jose Meseguer (SRI) Philip Wadler (Bell Labs) Organized by ------------ Indian Institute of Technology, Delhi Hauz Khas, New Delhi 100 016. Organizing Committee ------------------- Sandeep Sen (chair) Naveen Garg (treasurer) S N Maheshwari Conference Site --------------- The Conference will take place at the India International Centre, 40 Lodhi Estate, Max Mueller Marg, New Delhi 110 003. Correspondence Address ---------------------- All correspondence regarding submissions may be addressed to FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas, New Delhi 110 016, INDIA Email: fsttcs20@cse.iitd.ernet.in Fax: +91 11 686 8765 Phone: +91 11 659 1294 / 659 1286 URL: http://www.cse.iitd.ernet.in/~fsttcs20 -- Sanjiva Prasad Associate Professor Department of Computer Science and Engineering sanjiva@cse.iitd.ernet.in Indian Institute of Technology, Delhi (Off) +91 11 659 1294 Hauz Khas, New Delhi 110016 (Res) +91 11 659 1684 INDIA (Fax) +91 11 686 8765 http://www.cse.iitd.ernet.in/~sanjiva ********************************************************** * * 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 sariel@taurus.math.tau.ac.il Fri Apr 7 11:46:26 2000 Received: from taurus.math.tau.ac.il (sariel@taurus.math.tau.ac.il [132.67.64.4]) by duke.cs.duke.edu (8.9.3/8.9.3) with ESMTP id LAA11166 for ; Fri, 7 Apr 2000 11:46:07 -0400 (EDT) Received: (from sariel@localhost) by taurus.math.tau.ac.il (8.8.3/8.8.3) id RAA10897 for sariel@cs.duke.edu; Fri, 7 Apr 2000 17:47:52 +0200 (GMT+0200) Received: from post.tau.ac.il (post.tau.ac.il [132.66.16.11]) by taurus.math.tau.ac.il (8.8.3/8.8.3) with ESMTP id RAA10781; Fri, 7 Apr 2000 17:41:58 +0200 (GMT+0200) Received: from renyi.hu (hexagon.math-inst.hu [193.224.79.1]) by post.tau.ac.il (8.9.3/8.9.3) with ESMTP id RAA08489; Fri, 7 Apr 2000 17:40:06 +0200 (IST) Received: from localhost (intuit@localhost) by renyi.hu (8.8.8/8.8.8/3s) with SMTP id RAA03518; Fri, 7 Apr 2000 17:28:30 +0200 (MET DST) Date: Fri, 7 Apr 2000 17:28:29 +0200 (MET DST) From: Conference on Intuitive Geometry X-Sender: intuit@hexagon.math-inst.hu To: someone@cs.duke.edu' Subject: Conference on Intuitive Geometry Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Status: RO Content-Length: 5699 Lines: 201 Dear Colleague, The fifth Intuitive Geometry Conference organized by J\'anos Bolyai Mathematical Society, together with the Alfr\'ed R\'enyi Institute of Mathematics will take place June 5-9, 2000. We have already tried to send the first announcement to you. We are not sure whether you have received it, as some of the addresses turned out to be wrong; therefore we attempt to reach you again. With best regards, The Organizers ************************************************************************* %\nopagenumbers \magnification =\magstep 1 \font\kicsi=cmr8 \font\ss=cmssdc10 %\voffset -13 true mm %\vsize 26truecm \parindent 0pt {\ss J\'ANOS BOLYAI MATHEMATICAL SOCIETY} Budapest, F\H{o} utca 68., 1027 {\kicsi phone: (361) 201 - 7656}, {\kicsi phone/fax: (361) 201 - 6974} {\kicsi e-mail address of the Conference:} {\tt intuit\@renyi.hu} \medskip\hrule\vskip 1.7truecm \centerline {\bf INTUITIVE GEOMETRY} \bigskip \centerline{Balatonf\"oldv\'ar, Hungary, June 5 -- 9, 2000} \bigskip\bigskip \centerline{\ss Announcement} \vskip 1 truecm Dear Colleague, \medskip\medskip The J\'anos Bolyai Mathematical Society, together with the Alfr\'ed R\'enyi Institute of Mathematics is organizing a Conference on Intuitive Geometry from June 5 to 9, 2000 at Balatonf\"oldv\'ar, Hungary. \medskip The subject ``Intuitive Geometry'' does not occur in the AMS classification. The word was coined by L\'aszl\'o Fejes T\'oth to denote the area of geometry dealing with problems, which were described by Hilbert as being explainable to the man in the street. It includes great parts of combinatorial geometry, the theory of packing, covering and tiling, convexity, computational geometry, rigidity theory, the geometry of numbers, crystallography and classical differential geometry. The meeting next year will be the fifth on this topic organized by the Bolyai Society. With it, we would like to celebrate the year of mathematics as well as the fiftieth anniversary of the foundation of the R\'enyi Institute (earlier Mathematical Institute of the Hungarian Academy of Sciences). The organizing committee of the conference is: Imre B\'ar\'any, K\'aroly B\"or\"oczky, K\'aroly B\"or\"oczky Jr. (Secretary), G\'abor Fejes T\'oth, and J\'anos Pach. We are pleased to report that Franck Barthe, Nikolai Dolbilin, Zolt\'an F\"uredi, Gil Kalai, Nati Linial, L\'aszl\'o Lov\'asz, Ji\v{r}\'{\i} Matou\v{s}ek, G\'eza T\'oth and Emo Welzl have accepted our invitation to give plenary talks at the conference. \medskip Balatonf\"oldv\'ar is a resort area at lake Balaton, about 130 km (80 miles) from Budapest. The conference is held at Hotel JOGAR, where many successful international conferences have been organized the last decade. \medskip Arrival: Sunday, June 4, Departure: Saturday, June 10. \medskip Registration will take place at the Hotel on Sunday from 4.00 p.m. to 10.00 p.m., and Monday morning before the opening. An excursion will be organized for Wednesday afternoon. More details on how to get to Hotel JOGAR, on the excursion and on the scientific program will be given in the Third Announcement around May 8. If you plan to give a 20 minute {\it contributed talk}, please send the title and abstract (not longer than one page) in \TeX format to "intuit\@renyi.hu" by April 28, 2000. \bigskip Do not hesitate to forward this announcement to your colleagues and students, if you think they are interested in ``Intuitive Geometry.'' \noindent Please visit our home page \centerline{ http://www.renyi.hu/~intuit} for the latest information on the conference. \bigskip We are looking forward to seeing you at the meeting. \vskip1truecm \hskip10truecm{The Organizing Committee} \bigskip April 6, 2000 \vfill\eject \voffset 22truemm {\bf Registration:} \smallskip\noindent Please complete the attached form and return it along with a certified check - bank draft - money order (but not a personal check) covering the registration fee, payable to "J\'anos Bolyai Mathematical Society". ({\kicsi{Paying by bank transfer our bank's data: ABN AMRO Bank Rt., \ \ Budapest, Gerl\'oczy utca 11., H - 1052 \ \ Account number: 10200830 - 32310243 - 00000000 -- "Intuitive Geometry" Please note that we will not accept bank charges, those are at the sender's expense.}}) \vskip 1mm \noindent\settabs 3\columns {\it \+ & Registration fee & Late fee (after April 28) \cr \+ Regular: & USD 120 & USD 140 \cr \+ Accompanying person: & USD \ 40 & USD \ 40 \cr} \medskip \noindent The rates at the Hotel (with full board and for the whole period) are the following: \smallskip \item{} Single room: \ \ \ \ USD 260/person \item{} Double room: \ \ \ USD 180/person \smallskip\noindent The registration fee covers the conference materials and a reception. The registration fee for non academic accompanying persons includes a reception ticket. \noindent Accommodation and meals are to be paid upon arrival at the conference registration desk. \vskip 1.8truecm \centerline{\hbox to 150truemm{\hrulefill}} \vskip 1.8truecm \centerline{\bf REGISTRATION FORM} \medskip \centerline {\bf INTUITIVE GEOMETRY V.} \bigskip You may register by returning this form by e-mail to {\bf intuit\@renyi.hu}, by mail or fax to \bigskip J\'ANOS BOLYAI MATHEMATICAL SOCIETY Budapest, F\H{o} utca 68., 1027 Phone/fax: (36--1)--201--6974 \bigskip Family name: \bigskip First name: \bigskip The title of the lecture (if you intend to give one): \bigskip Number of accompanying persons: \bigskip Please, indicate if you wish to be accommodated in a single room \end From compgeom-owner@research.bell-labs.com Sat Apr 15 16:23:56 2000 Received: from crufty.research.bell-labs.com (ns2.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA20609 for ; Sat, 15 Apr 2000 16:23:55 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sat Apr 15 16:19:26 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Fri Apr 14 16:35:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Apr 14 16:33:07 EDT 2000 Received: from convex.cs.unb.ca ([131.202.33.93]) by dusty; Fri Apr 14 16:33:06 EDT 2000 Received: (from bremner@localhost) by convex.cs.unb.ca (8.10.0/8.10.0) id e3EKYg024274; Fri, 14 Apr 2000 17:34:42 -0300 From: David Bremner MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <14583.32994.504715.465532@convex.cs.unb.ca> Date: Fri, 14 Apr 2000 17:34:42 -0300 (ADT) To: compgeom-announce@research.bell-labs.com Subject: CCCG00 Third Call for Papers X-Mailer: VM 6.71 under 21.1 (patch 4) "Arches" XEmacs Lucid Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 5269 Lines: 140 Humble apologies to those of you who know already, and are sick of hearing about it. David ------------------------------------------------------------------------ 12th Canadian Conference on Computational Geometry Fredericton, New Brunswick August 16-19, 2000 Third Call for Papers April 14, 2000 Introduction Computational Geometry is a discipline concerned with algorithms, software, and mathematical foundations for the treatment of geometric data by computer. The Canadian Conference on Computational Geometry (CCCG) reflects this diversity of interest, with invited speakers and contributed papers on topics ranging from geometric applications in industry to the frontiers of pure mathematics. The technical program will be from August 16-18, with an optional outing on August 19. Invited Speakers * Gil Kalai, Hebrew University of Jerusalem The Paul Erdos Memorial Lecture on Discrete Geometry * Naoki Kato, University of Kyoto Applications of Computational Geometry in Architecture Contributions Papers are solicited on both experimental and theoretical topics within computational geometry. An illustrative, but not exclusive list of topics follows: Applications of computational geometry Art gallery problems Discrete and combinatorial Geometry Geometric data structures Graph drawing Lower bounds for geometric problems Motion planning Robustness in geometric algorithms Authors should [1]submit a 4 page extended abstract (in English or French) by the submission deadline given below. Accepted papers will be allocated approximately twenty minutes for presentation at the conference. The preferred method of submission is electronic; PostScript (TM) or PDF (TM) files will be accepted via the conference web site [2]conference web site. If you are unable to submit electronically, please ensure a paper copy of your extended abstract reaches Canadian Conference for Computational Geometry c/o David Bremner Faculty of Computer Science University of New Brunswick P.O. Box 4400 Fredericton, NB E3B 5A3 by the submission deadline. Special Issue The program committee will invite the authors of approximately 6 of the accepted papers to submit a final version to a special issue of Computational Geometry: Theory and Applications. These papers will go through a full refereeing process for the journal, but have the advantage of relatively speedy publication. Deadlines 2000/05/01 Extended abstracts due. Note: Deadline extended. 2000/06/01 Notification of acceptance or rejection 2000/07/03 Proceedings version (10 pages) of the paper due 2000/08/01 Special issue papers due Location and Dates CCCG 2000 will be held at the Sheraton Hotel in Fredericton, New Brunswick from August 16 to August 19 of 2000. The technical program will take place August 16-18, with an optional excursion on August 19. Personnel Conference Chair: David Bremner Program Committee: Prosenjit Bose Carleton University David Bremner University of New Brunswick Claudia Iturriaga University of New Brunswick Mark Keil University of Saskatchewan Alex Lopez-Ortiz University of New Brunswick Anna Lubiw University of Waterloo Barry Monson University of New Brunswick David Rappaport Queen's University Godfried Toussaint McGill University Stephen Wismath University of Lethbridge Organizing Committee: David Bremner, Joe Horton, Claudia Iturriaga, Alex Lopez-Ortiz, Barry Monson, Brad Nickerson, (all at University of New Brunswick) Questions? For more information see the conference web site at http://www.cs.unb.ca/conf/cccg Or contact us by email: cccg@unb.ca _________________________________________________________________ References 1. http://www.cs.unb.ca:8086/submit.html 2. http://www.cs.unb.ca/conf/cccg ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Sat Apr 15 16:23:57 2000 Received: from crufty.research.bell-labs.com (ns2.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA20613 for ; Sat, 15 Apr 2000 16:23:56 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sat Apr 15 16:20:05 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon Mar 20 07:45:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Mar 20 07:43:22 EST 2000 Received: from awalnet3.awalnet.net.sa ([212.93.192.3]) by dusty; Mon Mar 20 07:43:21 EST 2000 Received: from awalnet ([212.26.75.87]) by awalnet3.awalnet.net.sa (Netscape Messaging Server 4.04) with SMTP id FRQ0K900.ILN for ; Mon, 20 Mar 2000 15:40:57 +0300 Message-ID: <000a01bf9268$e90f2080$574b1ad4@awalnet.net.sa> From: "Hijer" To: Subject: request Date: Mon, 20 Mar 2000 15:36:22 +0300 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_0007_01BF9282.0B82F9C0" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2314.1300 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300 Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1646 Lines: 50 This is a multi-part message in MIME format. ------=_NextPart_000_0007_01BF9282.0B82F9C0 Content-Type: text/plain; charset="windows-1256" Content-Transfer-Encoding: quoted-printable hello Can i get the algorithms that deal with nearest nieghbor search problem = in two dimintion? and how to analyize them time and space ?=20 if any one can help me please do that. hijer al-badrani=20 ------=_NextPart_000_0007_01BF9282.0B82F9C0 Content-Type: text/html; charset="windows-1256" Content-Transfer-Encoding: quoted-printable

hello
Can i get the algorithms that deal with = nearest=20 nieghbor search problem in two dimintion?
and how to analyize them time and space = ?=20
if any one can help me please do = that.
 
       =20     hijer al-badrani 
------=_NextPart_000_0007_01BF9282.0B82F9C0-- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Mon Apr 17 13:09:55 2000 Received: from crufty.research.bell-labs.com (ns2.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id NAA11602 for ; Mon, 17 Apr 2000 13:09:54 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Apr 17 13:03:43 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon Apr 17 06:19:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Apr 17 06:18:07 EDT 2000 Received: from cssvr17.cs.ust.hk ([143.89.41.167]) by dusty; Mon Apr 17 06:18:06 EDT 2000 Received: from csz094.cs.ust.hk (csz094.cs.ust.hk [143.89.128.56]) by cssvr17.cs.ust.hk (8.10.1/8.10.1) with ESMTP id e3HAHxF12176; Mon, 17 Apr 2000 18:17:59 +0800 (HKT) Date: Mon, 17 Apr 2000 18:17:59 +0800 (HKT) Message-Id: <200004171017.e3HAHxF12176@cssvr17.cs.ust.hk> From: Otfried Cheong To: compgeom-announce@research.bell-labs.com Subject: SoCG 2000 Program & Registration Information MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Mailer: GNU Emacs 20.3.1 Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 7699 Lines: 300 The conference website for the 16th ACM Symposium on Computational Geometry in Hong Kong is open, with the preliminary program (an ASCII version is attached below), general information about the conference and the conference site, and the registration form. The early registration deadline is May 14. We would encourage you not to wait that long, since our supply of hotel-quality housing on campus is limited, and accomodation is reserved on a first-come-first-serve basis. (To be to the point, there are not enough hotel-quality rooms for all participants. Once they are gone you'll have to stay in a dormitory room or off-campus.) You can find the conference website at the following URL: http://www.cs.ust.hk/tcsc/scg00.html The organizing team Siu-Wing Cheng, Otfried Cheong Hong Kong University of Science and Technology PRELIMINARY PROGRAM ------------------- Sunday, June 11 6:00 Reception Monday, June 12 Session 1, Applied Track Session Chair: 9:00 Mesh Generation for Domains with Small Angles Jonathan Richard Shewchuk, UC Berkeley 9:20 Triangulations in CGAL J. D. Boissonnat, INRIA, O. Devillers, INRIA, M. Teillaud, INRIA, and M. Yvinec, INRIA 9:40 Improving the Surface Cycle Structure for Hexahedral Mesh Generation Matthias Mueller-Hannemann, Technische U. Berlin 10:00 Computing with Minkowski sums Ioannis Z Emiris, INRIA 10:20 Break 10:50 Invited Talk Fred Richards, Yale U. 11:50 Lunch Session 2, Theory Track Session Chair: Pankaj Agarwal 1:30 Point sets with many k-sets Geza Toth, MIT 1:50 An Improved bound for $k$-Sets in Three Dimensions Micha Sharir, Tel Aviv U., Shakhar Smorodinsky, Tel Aviv U., and Gabor Tardos, Hungarian Academy 2:10 Origin-Embracing Distributions or A Continuous Analogue of the Upper Bound Theorem Uli Wagner, ETH Zurich and Emo Welzl, ETH Zurich 2:30 A Helly-type theorem for hyperplane transversals to well-separated convex sets Boris Aronov, Poly U., Jacob E. Goodman, CUNY, Richard Pollack, Courant Inst., and Rephael Wenger, Ohio State 2:50 A Trace Bound for the Hereditary Discrepancy Bernard Chazelle, Princeton and Alexey Lvov, Princeton 3:10 Break Session 3, Theory/Applied Track Session Chair: Herbert Edelsbrunner 3:40 On the continuous Weber and k-means problems S.P. Fekete, Tech. U., J.S.B. Mitchell, SUNY Stony Brook, and K. Weinbrecht, U. K\"oln, 4:00 The 2-Center Problem with Obstacles Dan Halperin, Tel Aviv U., Micha Sharir, Tel Aviv U., and Ken Goldberg, UC Berkeley 4:20 Random Sampling in Geometric Optimization: New Insights and Applications Bernd Gaertner, ETH Zurich and Emo Welzl, ETH Zurich 4:40 The Analysis of a Simple k-Means Clustering Algorithm T. Kanungo, U. Maryland, D. M. Mount, U. Maryland, N. S. Netanyahu, U. Maryland, C. Piatko, Johns Hopkins, R. Silverman, U. of the District of Columbia, and A. Y. Wu, American U. 5:00 An Efficient, Exact, and Generic Quadratic Programming Solver for Geometric Optimization Bernd Gaertner, ETH Zurich and Sven Schoenherr, Freie U. 5:20 Exact and Efficient Unions of balls. Nina Amenta, UT Austin and Ravi Kolluri, UT Austin 8:00 Business meeting ----------------------------- Tuesday, June 13 Session 4, Applied Track Session Chair: 9:00 Fast Software for Box Intersections Afra Zomorodian, UI Urbana Champaign and Herbert Edelsbrunner, Duke U. and Raindrop Geomagic 9:20 Algebraic methods and arithmetic filtering for exact predicates on circle arcs Olivier Devillers, INRIA, Alexandra Fronville, INRIA, Bernard Mourrain, INRIA, and Monique Teillaud, INRIA 9:40 Pitfalls in Computing with Pseudorandom Determinants Bernd Gaertner, ETH Zurich 10:00 LOOK - A Lazy Object-Oriented Kernel for Geometric Computation Stefan Funke, MPI 10:20 Break 10:50 Invited Talk Andrew Frank, Technical U. 11:50 Lunch Session 5, Theory Track Session Chair: Mark de Berg 1:30 When Crossings Count - Approximating the Minimum Spanning Tree Sariel Har-Peled, Duke U. and Piotr Indyk, Stanford U. 1:50 Linear Programming Queries Revisited Edgar A. Ramos, MPI 2:10 Point Set Labeling with Specified Positions Srinivas Doddi, U. New Mexico, Madhav V. Marathe, Los Alamos, and Bernard M.E. Moret, U. New Mexico 2:30 I/O-Efficient Dynamic Planar Point Location Lars Arge, Duke U. and Jan Vahrenhold U. M\"unster 2:50 Linear-Time Polygon Triangulation Made Easier Via Randomization Nancy M. Amato, Texas A&M, Michael T. Goodrich, JHU, and Edgar A. Ramos, MPI 3:10 Break Session 6, Applied/Theory Track Session Chair: 3:40 A simple algorithm for homeomorphic surface reconstruction Nina Amenta, UT Austin, Sunghee Choi, UT Austin, Tamal K. Dey, Ohio State, and Naveen Leekha, Ohio State 4:00 Smooth shape reconstruction Jean-Daniel Boissonnat, INRIA, and Frederic Cazals, INRIA 4:20 Reconstructing curves with sharp corners Tamal K. Dey, Ohio State and Rafe Wenger, Ohio State 4:40 Voronoi-based interpolation with higher continuity Hisamoto Hiyoshi, U. Tokyo, and Kokichi Sugihara, U. Tokyo 7:00 Conference Banquet ---------------------------- Wednesday, June 14 Session 7, Applied/Theory Track Session Chair: 9:00 Reachability by paths of bounded curvature in convex polygons Hee-kap Ahn, HKUST, Otfried Cheong, HKUST, Jiri Matousek, Charles U., and Antoine Vigneron, HKUST 9:20 An algorithm for searching a polygonal region with a flashlight Steven M. Lavalle, Iowa State, Borislav Simov, Iowa State, and Giora Slutzki, Iowa State 9:40 Computing Approximate Shortest Paths on Convex Polytopes Pankaj K. Agarwal, Duke U., Sariel Har-Peled, Duke U., and Meetesh Karia, Trilogy 10:00 Densest Translational Lattice Packing of Non-Convex Polygons Victor J. Milenkovic, U. Miami 10:20 Break Session 8, Theory Track Session Chair: Franz Aurenhammer 10:50 Deterministic Algorithms for 3-D Diameter and some 2-D Lower Envelopes Edgar A. Ramos, MPI 11:10 Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus Timothy M. Chan, U. Waterloo 11:30 Testing the congruence of $d$-dimensional point sets Peter Brass, Freie U. and Christian Knauer, Freie U. 11:50 Lunch 1:30 Invited Talk Jean-Clause Latombe, Stanford U. 2:30 Break Session 9, Theory Track Session Chair: Hazel Everett 3:00 Multivariate regression depth Marshall Bern, Xerox and David Eppstein, UC Irvine 3:20 Kinetic Collision Detection for Simple Polygons David Kirkpatrick, UBC, Jack Snoeyink, UNC Chapel Hill, and Bettina Speckmann, UBC 3:40 Kinetic Connectivity for Unit Disks Leonidas Guibas, Stanford U., John Hershberger, Mentor Graphics, Subhash Suri, Washington U., and Li Zhang, Stanford U. 4:00 Break Session 10, Theory Track Session Chair: Jeff Erickson 4:20 Delaunay Triangulations and Voronoi Diagrams for Riemannian Greg Leibon, Dartmouth and David Letscher, Oklahoma State 4:40 Sweep Algorithms for Constructing Higher-Dimensional Constrained Delaunay Triangulations Jonathan R. Shewchuk, UC ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Mon Apr 17 13:10:39 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id NAA11636 for ; Mon, 17 Apr 2000 13:10:38 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Apr 17 13:02:46 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Sun Apr 16 21:17:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sun Apr 16 21:16:13 EDT 2000 Received: from amirani.ams.sunysb.edu ([129.49.6.2]) by dusty; Sun Apr 16 21:16:12 EDT 2000 Received: from voronoi.ams.sunysb.edu (voronoi.ams.sunysb.edu [129.49.6.26]) by amirani.ams.sunysb.edu (8.9.1a/8.9.1) with SMTP id VAA29516 for ; Sun, 16 Apr 2000 21:16:10 -0400 (EDT) Date: Sun, 16 Apr 2000 21:16:10 -0400 (EDT) From: Joseph Mitchell Message-Id: <200004170116.VAA29516@amirani.ams.sunysb.edu> To: compgeom-announce@research.bell-labs.com Subject: postdoc/visiting positions at Stony Brook Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2451 Lines: 54 Postdoctoral/Visiting Positions starting Fall, 2000 University at Stony Brook We anticipate having at least one postdoctoral or visiting position available at the University at Stony Brook, in the Department of Applied Mathematics and Statistics, starting in the fall of 2000. We expect to have a one-year visiting position available for strong candidates in the areas of operations research, algorithms, computational geometry, optimization, etc. The visiting position would include some modest teaching. We also expect to appoint one Postdoctoral Fellow under a Vertical Integration of Research and Education in the Mathematical Sciences (http://www.nsf.gov/cgi-bin/getpub?nsf9916) grant from the National Science Foundation. Applicants must be U.S. citizens or permanent residents. VIGRE Fellows are expected to have and demonstrate a strong commitment to the integration of mathematics with the outside world or to the educational mission of the university and to participate in the university's outreach effort to either industry, financial institutions, or other educational establishments. The postdoc and visitor are expected to conduct research, both independently and in collaboration with Stony Brook faculty and students, in support of various projects, which include the areas of computational geometry and algorithms, with applications in computer graphics, optimization, visualization, manufacturing, and GIS. Many of the applications projects require facility with software and algorithm development. Faculty in the algorithms/geometry area include Estie Arkin, Joe Mitchell, Michael Bender, Steve Skiena, and adjuncts Martin Held, Claudio Silva, Karel Zikan. In addition, there are opportunities to collaborate with the Center for Visual Computing (Ari Kaufman, director) at Stony Brook. Faculty in the operations research area include Eugene Feinberg, Jadranka Skorin-Kapov, Michael Taksar, and Alan Tucker. To be considered for the position, send a notice of intent, and a vita (in ascii, latex, or ps) to Joe Mitchell (jsbm@ams.sunysb.edu), at your earliest convenience. The University at Stony Brook is an Equal Opportunity employer. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Mon Apr 17 13:10:41 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id NAA11640 for ; Mon, 17 Apr 2000 13:10:40 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Apr 17 13:03:12 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon Apr 17 03:39:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Apr 17 03:38:30 EDT 2000 Received: from matesco.unican.es ([193.144.183.40]) by dusty; Mon Apr 17 03:38:27 EDT 2000 Received: from hall.matesco.unican.es (hall.matesco.unican.es [193.144.183.40]) by matesco.unican.es (8.8.8+Sun/8.8.8) with SMTP id JAA20543 for ; Mon, 17 Apr 2000 09:32:18 +0100 (WET DST) Date: Mon, 17 Apr 2000 09:32:18 +0100 (WET DST) From: Francisco Santos To: compgeom-announce@research.bell-labs.com Subject: triangulations in Santander Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3718 Lines: 101 Announcing a summer course: TRIANGULATIONS OF POLYHEDRA AND POINT SETS Santander (SPAIN), July 3-7, 2000 Course length: 20 hours Lecturers: Jesus A. de Loera, assistant professor, U. of California at Davis. Joerg Rambau, scientific assistant, Konrad-Zuse-Zentrum fuer Informationstechnik, Berlin. Francisco Santos, associate professor, U. de Cantabria, Santander. A short description of the course and tentative program is included below. For more information, including travel hints, registration, accomodation, etc. see: http://matsun1.matesco.unican.es/~santos/triancourse SHORT DESCRIPTION OF THE COURSE: ------------------------------- The topic are optimization and enumeration problems in the set of all triangulations of a polytope or point configuration. The course is addressed to graduate students and researchers in mathematics (specially algebra, geometry and applied mathematics), computer science (complexity theory, algorithmics) and some parts of engineering (those related to GIS, CAD, etc). On the theoretical side, the core of the course is the theory of secondary and universal polytopes, and the notion of geometric bistellar flip. The pre-requisites from the student are, basically, linear algebra and affine geometry. Some familiarity with projective geometry, theoretical combinatorics and complexity of algorithms would be desirable, but not strictly necessary. For the applications in algebraic geometry and topology mentioned in the last day (see the program below) some knowledge of these areas is needed, but the rest of the course can be followed without them. TENTATIVE PROGRAM: ----------------- Monday, July 3: 09:00 h. - 09:30 h. WELCOME. 09:30 h. - 11:30 h. FUNDAMENTAL NOTIONS AND MOTIVATION. JESUS DE LOERA 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. LIFE IN TWO DIMENSIONS. FLIPS. FRANCISCO SANTOS Tuesday, July 4 09:30 h. - 11:30 h. COMBINATORICS OF POLYHEDRAL SUBDIVISIONS. GALE DIAGRAMS AND CHAMBERS. JORG RAMBAU 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. SECONDARY POLYTOPES. BISTELLAR FLIPS. JORG RAMBAU Wednesday, July 5 09:30 h. - 11:30 h. THE UNIVERSAL POLYTOPE: A TOOL FOR OPTIMIZATION. JESUS DE LOERA 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. OPTIMIZATION. MINIMAL AND MAXIMAL TRIANGULATIONS. JESUS DE LOERA Thursday, July 6 09:30 h. - 11:30 h. THE BEST OF WORLDS: CYCLIC POLYTOPES. JORG RAMBAU 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. A CRUCIAL EXAMPLE: PRODUCTS OF SIMPLICES. TRIANGULATIONS WITHOUT FLIPS. FRANCISCO SANTOS Friday, July 7 09:30 h. - 11:30 h. FIBER POLYTOPES AND BEYOND. JORG RAMBAU 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. APPLICATIONS IN ALGEBRAIC GEOMETRY. JESUS DE LOERA 14:00 h. - 14:15 h. DELIVER OF DIPLOMAS +--------------------------------------------------------+ | Francisco Santos santos@matesco.unican.es | | Departamento de Matematicas, Estadistica y Computacion | | Universidad de Cantabria, Tel: +34-942-201522 | | E-39005 Santander, SPAIN Fax: +34-942-201402 | | http://www.matesco.unican.es/~santos | +--------------------------------------------------------+ ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Tue Apr 18 12:51:28 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id MAA14551 for ; Tue, 18 Apr 2000 12:51:26 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Apr 18 12:50:14 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Mon Apr 17 13:59:04 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Apr 17 13:57:17 EDT 2000 Received: from duke.cs.duke.edu ([152.3.140.1]) by dusty; Mon Apr 17 13:57:15 EDT 2000 Received: from polya.cs.duke.edu (polya.cs.duke.edu [152.3.140.71]) by duke.cs.duke.edu (8.9.3/8.9.3) with ESMTP id NAA13192 for ; Mon, 17 Apr 2000 13:56:11 -0400 (EDT) From: Pankaj Kumar Agarwal Received: (pankaj@localhost) by polya.cs.duke.edu (8.8.5/8.6.9) id NAA13562 for compgeom-announce@research.bell-labs.com; Mon, 17 Apr 2000 13:56:10 -0400 (EDT) Date: Mon, 17 Apr 2000 13:56:10 -0400 (EDT) Message-Id: <200004171756.NAA13562@polya.cs.duke.edu> To: compgeom-announce@research.bell-labs.com Subject: Workshop announcement Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1263 Lines: 49 Computational Geometry Workshop: Sharir Fest (in honor of Micha Sharir's 50th birthday) June 11, 2000 Hong Kong University of Technology, Hong Kong A workshop to celebrate Micha Sharir's 50th birthday is being held on June 11, immediately before the 16th Annual Symposium on Computational Geometry. More details will be available at http://www.cs.ust.hk/tcsc/sharirfest.html. Organizers: Pankaj K. Agarwal, Duke University (pankaj@cs.duke.edu) Otfried Cheong, HKUST (otfried@cs.ust.hk) Dan Halperin, Tel Aviv University (halperin@math.tau.ac.il) TENTATIVE PROGRAM ----------------- 10:45 Opening Remarks 11:00 Historical Perspective of Arrghs Herbert Edelsbrunner, Duke University 12:00 Lunch 1:30 TBA Boris Aronov, Polytechnic University 2:30 The various incarnations of Inverse-Ackermann Bernard Chazelle, Princeton University 3:30 Coffee break 4:00 Geometry and motion Leonidas J. Guibas, Stanford University 5:00 Micha Sharir, Tel Aviv 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/maillist.html. From compgeom-owner@research.bell-labs.com Wed Apr 26 19:10:30 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id TAA12821 for ; Wed, 26 Apr 2000 19:10:29 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Apr 26 19:04:37 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Thu Apr 20 11:25:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Apr 20 11:24:10 EDT 2000 Received: from core.inf.ethz.ch ([129.132.178.196]) by dusty; Thu Apr 20 11:24:08 EDT 2000 Received: from shadow.inf.ethz.ch (emo@shadow-medoc.inf.ethz.ch [129.132.11.67]) by core.inf.ethz.ch (8.9.3/8.9.3) with ESMTP id RAA13752; Thu, 20 Apr 2000 17:24:05 +0200 (MET DST) From: Emo Welzl Received: (from emo@localhost) by shadow.inf.ethz.ch (8.8.8/8.8.8) id RAA14946; Thu, 20 Apr 2000 17:24:02 +0200 (MET DST) Date: Thu, 20 Apr 2000 17:24:02 +0200 (MET DST) Message-Id: <200004201524.RAA14946@shadow.inf.ethz.ch> To: compgeom-announce@research.bell-labs.com Subject: Pre-Doc Program, Combinatorics, Geometry, and Computation, ETH Zurich Cc: emo@inf.ethz.ch X-Sun-Charset: US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 5788 Lines: 150 First Call for Applications Pre-Doc Program Combinatorics, Geometry, and Computation October 2000 -- March 2001 (At ETH Zurich; part of Berlin/Zurich European 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; Algorithms Design, Analysis and Implementation; Optimization and Mathematical Programming. 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 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/Z"urich 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 masters 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, theses, areas of interest, a letter of recommendation of the last advisor, should be sent to: Emo Welzl Institut Theoretische Informatik ETH Zentrum CH-8092 Zurich Switzerland (Applications that arrive before before May 19 will be notified of acceptance by June 5. There is a second round with deadline June 16 with notification July 3.) For further information use tel: ++41-1-63 273 92, email , or (starting May 4). SCHEDULE (Courses, lecturers, and abstracts below) --------------------------------------- Oct 1 Reading assignments --------------------------------------- Oct 23 Courses -Nov 24 Mo&Tu RandAlgs Th&Fr CombGeom Nov 27 Exams --------------------------------------- Nov 30 Projects, reading assignments -Dec 20 and presentations --------------------------------------- Jan 8 Courses -Feb 9 Mo&Tu GraphVis Th&Fr ApproxAlgs Feb 12 Exams --------------------------------------- Feb 15 Preparation of Ph.D. proposal -Mar 31 and presentations --------------------------------------- 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 (Emo Welzl) Randomized algorithms have by now emerged in many fields, and have lead to several improvements compared to determinisitic methods. We will discuss several basic methods in several areas, including graph algorithms and geometry, 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. CombGeom Combinatorial Geometry (Komei Fukuda, Juergen Richter-Gebert) Geometric objects (like polytopes or arrangements of hyperplanes) carry two layers of information. First of all they are described by the coordinates of the parts involved. On the other hand there is also a combinatorial description that cares only about the relative position of the elements. This course is about the subtle interplay of coordinates and combinatorics. We introduce the "theory of oriented matroids" as the primary framework for the study. This theory allows us to get deep structural insight in topics like "polytope theory", "linear optimization", "automatic geometric theorem proving", "quasicrystals" and many more. GraphVis Advanced Topics in Vision and Graphics (Luc van Gool, Markus Gross, Bernt Schiele, Gabor Szekeley) Although being two separate disciplines we observe that Graphics and Vision are increasingly converging. Methods and algorithms developed independently are more and more getting combined or merged to sophisticated frameworks covering a wide range of applications. In this course we will present a selection of advanced topics in Vision and Graphics illustrating the tight relationship between the two disciplines. We will discuss recent research results and developments in both areas with a special emphasis on modeling and geometry. Topics include the notion of invariance, methods for 3D reconstruction, learning and statistical modeling, mesh signal processing, image based rendering, deformable templates and FEM. The course will be organized into separate modules each of which consisting of lectures and practical or theoretical exercises. ApproxAlgs Approximation: Theory and Algorithms (Johannes Bloemer, Maurice Cochand, Bernd Gaertner, Peter Widmayer) 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, derandomization, and semidefinite programming; inapproximability and the PCP concept. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Apr 26 19:12:08 2000 Received: from dirty.research.bell-labs.com (ns1.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id TAA12884 for ; Wed, 26 Apr 2000 19:12:06 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Apr 26 19:05:29 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Wed Apr 26 11:43:03 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Apr 26 11:42:55 EDT 2000 Received: from himmelsborg.cs.lth.se ([130.235.16.11]) by dusty; Wed Apr 26 11:42:54 EDT 2000 Received: from hannar.cs.lth.se (andrzej@hannar [130.235.16.102]) by himmelsborg.cs.lth.se (8.9.3/8.9.3/perf-jw-tr) with ESMTP id RAA23259 for ; Wed, 26 Apr 2000 17:42:51 +0200 (MET DST) From: Andrzej Lingas Received: (from andrzej@localhost) by hannar.cs.lth.se (8.9.3+Sun/8.9.3) id RAA25140 for compgeom-announce@research.bell-labs.com; Wed, 26 Apr 2000 17:42:50 +0200 (MET DST) Date: Wed, 26 Apr 2000 17:42:50 +0200 (MET DST) Message-Id: <200004261542.RAA25140@hannar.cs.lth.se> To: compgeom-announce@research.bell-labs.com Subject: Vacant position for female PhD Student in Computer Science X-Sun-Charset: US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1043 Lines: 31 Vacant position for female PhD Student in Computer Science Reference no: 2082 Vacant from: Immediately Information: Please contact Christos Levcopoulos, 46 46-222 80 36, Christos.Levcopoulos@cs.lth.se, or Eric Astor, 46 46-222 96 43, Eric.Astor@cs.lth.se Applications, quoting the reference number, and including a curriculum vitae, copies of certificates and other documents considered pertinent by the applicant, should be addressed to Lund University Faculty of Science the Registrar Lund University PO Box 117 SE-221 00 Lund Sweden and must be received not later than May 10 2000. All copies must be attested. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Tue May 2 14:59:47 2000 Received: from dirty.research.bell-labs.com (ns1.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id OAA29768 for ; Tue, 2 May 2000 14:59:46 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue May 2 14:55:20 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Thu Apr 27 16:13:04 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Apr 27 16:12:31 EDT 2000 Received: from paul.rutgers.edu ([128.6.5.53]) by dusty; Thu Apr 27 16:12:30 EDT 2000 Received: (from gperkins@localhost) by paul.rutgers.edu (8.8.8/8.8.8) id QAA09818 for compgeom-discuss@research.bell-labs.com; Thu, 27 Apr 2000 16:12:22 -0400 (EDT) Date: Thu, 27 Apr 2000 16:12:22 -0400 (EDT) From: Greg Perkins Message-Id: <200004272012.QAA09818@paul.rutgers.edu> To: compgeom-discuss@research.bell-labs.com Subject: a question Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 531 Lines: 19 Let T be a triangulation and define x \subset T as simple if the union of all triangles in x forms a simple polygon with no holes. Let X be the set of all simple subsets of T. What is the size of X? Has an upper-bound been proven for this? Thanks, Greg Perkins ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed May 10 13:38:24 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id NAA03950 for ; Wed, 10 May 2000 13:38:23 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed May 10 13:35:33 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon May 8 10:07:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon May 8 10:05:20 EDT 2000 Received: from mserver.wlu.ca ([192.54.242.16]) by dusty; Mon May 8 10:05:20 EDT 2000 Received: from localhost (pchin@localhost) by mserver.wlu.ca (8.8.8+Sun/8.8.6) with SMTP id KAA01617; Mon, 8 May 2000 10:05:18 -0400 (EDT) Date: Mon, 8 May 2000 10:05:17 -0400 (EDT) From: Paulina Chin To: compgeom-announce@research.bell-labs.com, na.digest@na-net.ornl.gov, symbolicnet@mcs.kent.edu Subject: ISSAC 2000 Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3182 Lines: 82 CALL FOR POSTERS and CALL FOR PARTICIPATION ISSAC 2000 International Symposium on Symbolic and Algebraic Computation St Andrews University, Scotland, August 6-9, 2000 http://www-gap.dcs.st-and.ac.uk/issac2000 Held concurrently with CALCULEMUS-2000 Sponsored by ACM ISSAC provides an opportunity to learn of new developments and to present original research in all areas of symbolic and algebraic computation. ISSAC 2000 will be held at St. Andrews University Aug. 7-9, preceded by a day of tutorials on Aug. 6. It will be held concurrently with CALCULEMUS-2000 (www.mathweb.org/calculemus/meeting/standrews00). Planned activities include invited presentations, research and survey papers, poster sessions, tutorial courses, vendor exhibits and software demonstrations. CALL FOR POSTERS The poster sessions are an ideal venue for presenting recent research results or ongoing research projects that might not be complete, but whose preliminary results are already interesting nonetheless. Posters describing computer algebra systems and applications are also especially welcome. A best poster prize will be awarded. *** The deadline for poster submission is May 25, 2000. *** For a list of conference topics and submission instructions, please see our Web page (www-gap.dcs.st-and.ac.uk/issac2000/posters.shtml) or send e-mail to the Poster Committee Chair at A.M.Cohen@tue.nl. CALL FOR PARTICIPATION We encourage you to register and book accommodation on-line at www-gap.dcs.st-and.ac.uk/issac2000/registration.shtml. *** Fees will increase after June 1, 2000. *** Please note that a third tutorial, "Application of Computer Algebra in Mathematics Education," given by M. Rayes, has been added. This tutorial is free of charge as a result of the generous support of Texas Instruments. Advance registration is required. FURTHER INFORMATION For more information, please refer to the conference Web page, http://www-gap.dcs.st-and.ac.uk/issac2000. E-mail inquiries may be sent to issac2000@dcs.st-and.ac.uk or to one of the conference committee members listed below: General Chair: Tomas Recio, recio@matesco.unican.es Local Arrangements Chair: Steve Linton, sal@dcs.st-and.ac.uk Program Committee Chair: Chandrajit Bajaj, bajaj@cs.utexas.edu Tutorial Chair: Josef Schicho, josef.schicho@risc.uni-linz.ac.at Exhibitor Chair: Marc Moreno Maza, Numerical Algorithms Group, marc@nag.co.uk Poster Session Chair: Arjeh Cohen, amc@win.tue.nl Editor: Carlo Traverso, traverso@posso.dm.unipi.it Treasurer: Colin Campbell, cmc@st-andrews.ac.uk Publicity Chair: Paulina Chin, pchin@wlu.ca SPONSORS ISSAC 2000 is sponsored by ACM-SIGSAM and is supported by the Edinburgh Mathematical Society, the London Mathematical Society, the Numerical Algorithms Group and Texas Instruments. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed May 10 13:39:04 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id NAA03965 for ; Wed, 10 May 2000 13:39:03 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed May 10 13:36:05 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Mon May 8 19:05:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon May 8 19:03:21 EDT 2000 Received: from ares.cs.Virginia.EDU ([128.143.137.19]) by dusty; Mon May 8 19:03:16 EDT 2000 Received: from viper.cs.Virginia.EDU (viper.cs.Virginia.EDU [128.143.137.17]) by ares.cs.Virginia.EDU (8.9.2/8.9.2/UVACS-2000040300) with ESMTP id TAA17481 for ; Mon, 8 May 2000 19:03:15 -0400 (EDT) Received: (from gd2000@localhost) by viper.cs.Virginia.EDU (8.9.2/8.9.2) id TAA09904; Mon, 8 May 2000 19:03:14 -0400 (EDT) Date: Mon, 8 May 2000 19:03:14 -0400 (EDT) Message-Id: <200005082303.TAA09904@viper.cs.Virginia.EDU> From: Graph Drawing 2000 Conference To: compgeom-announce@research.bell-labs.com Subject: CFP: Symposium on Graph Drawing (GD 2000) Final Call for Papers Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 5398 Lines: 136 Please forward this CFP to any of your colleagues who might be interested. ........................................................................ Graph Drawing 2000 Final Call for Papers Colonial Williamsburg (Virginia, USA) September 20-23, 2000 http://www.cs.virginia.edu/~gd2000/ * Deadlines: ---------- o Submissions: May 24, 2000 o Notification of acceptance: July 19, 2000 o Early Registration: July 31, 2000 (Late registration TBA.) o Camera-ready copies of accepted papers: September 20, 2000 * Location: Colonial Williamsburg offers a peaceful retreat atmosphere. Located on the grounds of the 18th-century Historic Area Visitor Center, the conference is also conveniently located to shopping, restaurants, golf and more, all within walking distance. Colonial Williamsburg is located 150 miles south of Washington, D.C. on Interstate 64. Richmond International Airport is less than 50 minutes away -- rental car and shuttle service is available. Train and bus service are available from Washington, D.C. For more information on Colonial Williamsburg, visit: http://www.history.org/ * 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, geometry, topology, visual languages, visual perception, information visualization, computer-human interaction, and graphic design. Much research in graph drawing is motivated by applications to systems for viewing and interacting with graphs. 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 12 pages in the conference proceedings, and short papers 6 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 May 24, 2000. 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/~gd2000/gd2000.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: ------------------ Therese Biedl, University of Waterloo Peter Eades, University of Newcastle Wendy Feng, Tom Sawyer Software Ashim Garg, SUNY Buffalo Michael Goodrich, Johns Hopkins Michael Kaufmann, University of Tubingen Jan Kratochvil, Charles University Giuseppe Liotta, University of Perugia Joe Marks (chair), MERL Stephen North, AT&T Research Kathy Ryall, University of Virginia Kozo Sugiyama, JAIST Roberto Tamassia, Brown University Robin Thomas, Georgia Tech. Dorothea Wagner, University of Konstanz Stephen Wismath, University of Lethbridge * Organizing Committee: --------------------- Renee Carabajal, MERL Joe Marks, MERL Janet O'Halloran, MERL Kathy Ryall (chair), University of Virginia * Contest Committee: ------------------ Franz Brandenburg (chair), University of Passau * Contact Information: -------------------- o Conference URL: http://www.cs.virginia.edu/~gd2000/ o Conference Organization: gd2000@cs.virginia.edu o Electronic Submission: http://sigact.csci.unt.edu/~gd2000/gd2000.html o Hard-copy Submission: Joe Marks MERL, 201 Broadway Cambridge, MA 02139, USA Phone: 617-621-7534 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed May 10 13:39:11 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id NAA03973 for ; Wed, 10 May 2000 13:39:10 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed May 10 13:36:39 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Wed May 10 03:57:04 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed May 10 03:56:07 EDT 2000 Received: from gem.dcs.warwick.ac.uk ([137.205.224.9]) by dusty; Wed May 10 03:56:07 EDT 2000 Received: (from msp@localhost) by gem.dcs.warwick.ac.uk (8.9.3/8.9.1) id IAA27321; Wed, 10 May 2000 08:56:04 +0100 (BST) Date: Wed, 10 May 2000 08:56:04 +0100 (BST) From: Mike Paterson Message-Id: <200005100756.IAA27321@gem.dcs.warwick.ac.uk> To: compgeom-announce@research.bell-labs.com Cc: emo@inf.ethz.ch, msp@dcs.warwick.ac.uk Subject: ESA - accepted papers Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 4487 Lines: 129 List of papers accepted for ESA 2000 (Saarbruecken, Sept 5-8) ============================================================= Polygon Decomposition for Efficient Construction of Minkowski Sums --- Pankaj K. Agarwal and Eyal Flato and Dan Halperin An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts --- Alexander A. Ageev and Maxim I. Sviridenko Offline List Update is NP-hard --- Christoph Ambuehl Computing the LCP of two Point Sets under Approximate Congruence --- Christoph Ambuehl and Samarjit Chakraborty and Bernd Gaertner Online Algorithms for Caching Multimedia Streams --- Matthew Andrews and Kamesh Munagala On Recognizing Cayley Graphs --- Lali Barriere and Pierre Fraigniaud and Cyril Gavoille and Bernard Fast algorithms for even/odd minimum cuts and generalizations --- Andras A. Benczur and Otilia Fulop Efficient algorithms for centers and medians in interval and --- S. Bespamyatnikh and B. Bhattacharya and J. Mark Keil and D. Exact point pattern matching and the number of congruent triangles in a three-dimensional pointset --- Peter Brass Range Searching Over Tree Cross Products --- Adam L. Buchsbaum and Michael T. Goodrich and Jeffery R. Westbrook A 2 1/10 Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem --- Robert Carr and Toshihiro Fujito and Goran Konjevod and Ojas Parekh The Minimum Range Assignment Problem on Linear Radio Networks --- A.E.F. Clementi, A. Ferreira, P. Penna, S. Perennes and R. Silvestri Property Testing in Computational Geometry --- Artur Czumaj and Christian Sohler and Martin Ziegler On R-trees with low stabbing number --- M. de Berg, J. Gudmundsson, M. Hammar, M. Overmars K-D Trees are Better When Cut on the Longest Side --- Matthew Dickerson and Christian A. Duncan and Michael T. Goodrich On multicriteria online problems --- M. Flammini and G. Nicosia Online scheduling --- Rudolf Fleischer and Michaela Wahl Constant ratio approximation algorithms for the rectangle --- Daya Ram Gaur and Toshihide Ibaraki and Ramesh Krishnamurti Almost Delaunay triangulation --- J. Gudmundsson and M. Hammar and M. van K On Representations of Algebraic-Geometric Codes for List Decoding --- Venkatesan Guruswami and Madhu Sudan Minimizing a convex cost closure set --- Dorit S. Hochbaum and Maurice Queyranne Preemptive scheduling with rejection --- H. Hoogeveen, M. Skutella, G.J. Woeginger Simpler and Faster Vertex-Connectivity Augmentation Algorithms --- Tsan-sheng Hsu Scheduling Broadcasts in Wireless Networks --- Bala Kalyanasundaram, Kirk Pruhs, and Mahe Velauthapillai Jitter Regulation in an Internet Router with Delay Consideration --- Hisashi Koga Approximation of Curvature-constrained Shortest Paths through a Sequence of Points --- Jae-Ha Lee, Otfried Cheong, Woo-Cheol Kwon, Sung Yong Shin and Kyung-Yong Chwa I/O-Efficient Well-Separated Pair Decomposition and its Applications --- Tamas Lukovszki and Anil Maheshwari and Norbert Zeh Resource Constrained Shortest Paths --- Kurt Mehlhorn and Mark Ziegelmann On the Competitiveness of Linear Search --- J. Ian Munro Maintaining a Minimum Spanning Tree Under Transient Node Failures --- Enrico Nardelli, Guido Proietti and Peter Widmayer Minimum Depth Graph Embedding --- Maurizio Pizzonia and Roberto Tamassia New Algorithms for Two-Label Point Labeling --- Zhongping Qin and Alexander Wolff and Yinfeng Xu and Binhai Zhu Analyzing the cache behaviour of non-uniform distribution sorting algorithms --- Naila Rahman and Rajeev Raman How Helpers Hasten h-Relations --- Peter Sanders and Roberto Solis-Oba Computing optimal linear layouts of trees in linear time --- Konstantin Skodinis Coloring sparse random graphs in polynomial average time --- C.R. Subramanian Restarts can help in the on-line minimization of the maximum delivery time on a single machine --- J.M. van den Akker and J.A. Hoogeveen and N. Vakhania Collision Detection Using Bounding Boxes: Convexity Helps --- Yunhong Zhou and Subhash Suri ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed May 10 13:39:15 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id NAA03978 for ; Wed, 10 May 2000 13:39:14 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed May 10 13:34:14 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu May 4 00:33:04 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu May 4 00:32:18 EDT 2000 Received: from cssvr17.cs.ust.hk ([143.89.41.167]) by dusty; Thu May 4 00:32:17 EDT 2000 Received: from csz094.cs.ust.hk (csz094.cs.ust.hk [143.89.128.56]) by cssvr17.cs.ust.hk (8.10.1/8.10.1) with ESMTP id e444WDi15640; Thu, 4 May 2000 12:32:14 +0800 (HKT) Date: Thu, 4 May 2000 12:32:13 +0800 (HKT) Message-Id: <200005040432.e444WDi15640@cssvr17.cs.ust.hk> From: Otfried Cheong To: compgeom-announce@research.bell-labs.com Subject: SoCG 2000 Early Registration Deadline MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Mailer: GNU Emacs 20.3.1 Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 835 Lines: 26 The SoCG 2000 Early Registration deadline is approaching quickly. If you plan to attend this unique event---the first ACM Symposium on Computational Geometry held in Asia---please make sure your complete registration arrives by May 14. We still have some hotel-quality housing on campus available, so be quick and reserve before only dormitory rooms are left! You can find the conference website at the following URL: http://www.cs.ust.hk/tcsc/scg00.html The organizing team Siu-Wing Cheng, Otfried Cheong Hong Kong University of Science and Technology ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed May 10 13:39:20 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id NAA03986 for ; Wed, 10 May 2000 13:39:19 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed May 10 13:35:03 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon May 8 07:15:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon May 8 07:13:11 EDT 2000 Received: from concave.cs.wits.ac.za ([146.141.27.66]) by dusty; Mon May 8 07:13:01 EDT 2000 Received: from [146.141.27.215] (oconee.cs.wits.ac.za [146.141.27.215]) by concave.cs.wits.ac.za (8.8.8/8.8.8) with ESMTP id NAA02213 for ; Mon, 8 May 2000 13:09:46 +0200 (SAT) X-Sender: ian@mail.cs.wits.ac.za Message-Id: Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Date: Mon, 8 May 2000 13:11:47 +0200 To: compgeom-announce@research.bell-labs.com From: Ian Sanders Subject: Vacant Posts -- University of the Witwatersrand, Johannesburg, SA Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3315 Lines: 87 Department of Computer Science University of the Witwatersrand, Johannesburg, South Africa ============================== Looking to fill positions at the following levels Senior Lecturer / Lecturer / Senior Tutor / Tutor Description ----------- The Department is one of the premier departments in the country. We are playing a leading role in curriculum development internationally and we have developed international research links in a number of areas. We have a challenging environment as an important discipline in our transforming society. Our mission is to address our dynamic African needs both in developing highly educated students and research in computer science. The University has recognised this by giving us additional posts to help us grow our important discipline. We currently have four positions available two at senior lecturer and two at lecturer / senior tutor level. We would welcome applications at tutor level for an appointment against a lecturer level post. Duties ------ An important aspect of these posts will be to undertake teaching in our undergraduate, higher diploma and postgraduate programmes. We encourage all staff to undertake research but those wishing to apply for senior lecturer and lecturer are required to. Senior tutors and tutors will be expected to help more with student support if their career path is more focused on teaching. Qualifications -------------- Minimum requirement for lecturer and senior lecturer is a PhD. We will be happy to consider a candidate who is close to completion of a PhD. We would like to see evidence of research and teaching -- in the case of an application for senior lecturer this will be essential. For the tutor track a postgraduate qualification as well as teaching experience is necessary. Salary Range ------------ Senior lecturer: R93 672-R12 4392 Lecturer / Senior tutor R68 052 - R109 944 Tutor R43 608-R70 080 Benefits -------- Possibility of salary subvention (in the region of 10% of salary), annual bonus, generous leave, retirement fund, medical aid, housing subsidy (if eligible), relocation allowance, 100% financial assistance towards dependants' University studies (if applicable) Submit a detailed CV with names, addresses and contact numbers of three referees and certified copies of degrees/diplomas to: The personnel Office (Academic), University of the Witwatersrand, Private Bag 3, WITS, 2050. Closing Date: 30 June 2000. For more information email conrad@cs.wits.ac.za or reply to this posting. ---------------------------------------------------------------- Ian Sanders Telephone: (2711) 717-6187 Department of Computer Science Fax: (2711) 717-6199 University of the Witwatersrand Private Bag 3 email: ian@cs.wits.ac.za 2050 WITS SOUTH AFRICA http://www.cs.wits.ac.za/~ian ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed May 10 13:39:21 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id NAA03990 for ; Wed, 10 May 2000 13:39:20 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed May 10 13:34:41 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu May 4 14:45:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu May 4 14:44:50 EDT 2000 Received: from matesco.unican.es ([193.144.183.40]) by dusty; Thu May 4 14:44:47 EDT 2000 Received: from hall.matesco.unican.es (hall.matesco.unican.es [193.144.183.40]) by matesco.unican.es (8.8.8+Sun/8.8.8) with SMTP id UAA22215 for ; Thu, 4 May 2000 20:38:24 +0100 (WET DST) Date: Thu, 4 May 2000 20:38:24 +0100 (WET DST) From: Francisco Santos To: compgeom-announce@research.bell-labs.com Subject: summer course, second announcement Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 4261 Lines: 107 Second announcement of the course TRIANGULATIONS OF POLYHEDRA AND POINT SETS Santander (SPAIN), July 3-7, 2000 The Web page http://matsun1.matesco.unican.es/~santos/triancourse has been updated, including information on registration and scholarships. There are two urgent things that students willing to come should do: - reserve accomodation (you can get information on the web page and can contact F. Santos santos@matesco.unican.es for help). - apply for a fee reduction from University of Cantabria. Deadline for this is MAY 20 and some documentation has to be snail-mailed. Instructions on the web page. Lecturers: Jesus A. de Loera, assistant professor, U. of California at Davis. Joerg Rambau, scientific assistant, Konrad-Zuse-Zentrum fuer Informationstechnik, Berlin. Francisco Santos, associate professor, U. de Cantabria, Santander. A short description of the course and tentative program is included below. For more information, including travel hints, registration, accomodation, etc. see: http://matsun1.matesco.unican.es/~santos/triancourse SHORT DESCRIPTION OF THE COURSE: ------------------------------- The topic are optimization and enumeration problems in the set of all triangulations of a polytope or point configuration. The course is addressed to graduate students and researches in mathematics (specially algebra, geometry and applied mathematics), computer science (complexity theory, algorithmics) and some parts of engineering (those related to GIS, CAD, etc). On the theoretical side, the core of the course is the theory of secondary and universal polytopes, and the notion of geometric bistellar flip. The pre-requisites from the student are, basically, linear algebra and affine geometry. Some familiarity with projective geometry, theoretical combinatorics and complexity of algorithms would be desirable, but not strictly necessary. For the applications in algebraic geometry and topology mentioned in the last day (see the program below) some knowledge of these areas is needed, but the rest of the course can be followed without them. TENTATIVE PROGRAM: ----------------- Monday, July 3: 09:00 h. - 09:30 h. WELCOME. 09:30 h. - 11:30 h. FUNDAMENTAL NOTIONS AND MOTIVATION. JESUS DE LOERA 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. LIFE IN TWO DIMENSIONS. FLIPS. FRANCISCO SANTOS Tuesday, July 4 09:30 h. - 11:30 h. COMBINATORICS OF POLYHEDRAL SUBDIVISIONS. GALE DIAGRAMS AND CHAMBERS. JORG RAMBAU 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. SECONDARY POLYTOPES. BISTELLAR FLIPS. JORG RAMBAU Wednesday, July 5 09:30 h. - 11:30 h. THE UNIVERSAL POLYTOPE: A TOOL FOR OPTIMIZATION. JESUS DE LOERA 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. OPTIMIZATION. MINIMAL AND MAXIMAL TRIANGULATIONS. JESUS DE LOERA Thursday, July 6 09:30 h. - 11:30 h. THE BEST OF WORLDS: CYCLIC POLYTOPES. JORG RAMBAU 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. A CRUCIAL EXAMPLE: PRODUCTS OF SIMPLICES. TRIANGULATIONS WITHOUT FLIPS. FRANCISCO SANTOS Friday, July 7 09:30 h. - 11:30 h. FIBER POLYTOPES AND BEYOND. JORG RAMBAU 11:30 h. - 12:00 h. BREAK 12:00 h. - 14:00 h. APPLICATIONS IN ALGEBRAIC GEOMETRY. JESUS DE LOERA 14:00 h. - 14:15 h. DELIVER OF DIPLOMAS +--------------------------------------------------------+ | Francisco Santos santos@matesco.unican.es | | Departamento de Matematicas, Estadistica y Computacion | | Universidad de Cantabria, Tel: +34-942-201522 | | E-39005 Santander, SPAIN Fax: +34-942-201402 | | http://www.matesco.unican.es/~santos | +--------------------------------------------------------+ ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu May 18 17:48:48 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id RAA27621 for ; Thu, 18 May 2000 17:48:47 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu May 18 17:48:33 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Thu May 11 04:19:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu May 11 04:18:40 EDT 2000 Received: from core.inf.ethz.ch ([129.132.178.196]) by dusty; Thu May 11 04:18:38 EDT 2000 Received: from shadow.inf.ethz.ch (emo@shadow-byebye.inf.ethz.ch [129.132.11.131]) by core.inf.ethz.ch (8.9.3/8.9.3) with ESMTP id KAA09294; Thu, 11 May 2000 10:18:36 +0200 (MET DST) From: Emo Welzl Received: (from emo@localhost) by shadow.inf.ethz.ch (8.8.8/8.8.8) id KAA22850; Thu, 11 May 2000 10:18:35 +0200 (MET DST) Date: Thu, 11 May 2000 10:18:35 +0200 (MET DST) Message-Id: <200005110818.KAA22850@shadow.inf.ethz.ch> To: compgeom-announce@research.bell-labs.com Subject: CATS 2001 CfP Cc: emo@inf.ethz.ch X-Sun-Charset: US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 5301 Lines: 147 Call for Papers CATS 2001 - Computing: The Australasian Theory Symposium Computing: The Australasian Theory Symposium (CATS) is the premier theoretical computer science conference in Australasia. It is held annually as part of Australasian Computer Science Week (ACSW). CATS 2001 will be the seventh in the series. The symposium will consist of invited speakers and research paper presentations. DATE AND LOCATION CATS 2001 will be held over two days during Australasian Computer Science Week. ACSW 2001 will take place at Bond University, Gold Coast, Queensland, Australia, from 29th January to 2nd February 2001. SCOPE CATS covers all aspects of theoretical computer science. Some representative, but not exclusive, topics include the following: - logic, reasoning and verification - formal specification techniques and program semantics - formal development methods, program refinement, synthesis and transformation - concurrent, parallel and distributed system theory - theory of algorithms and data structures - complexity and computability - automata, number and category theory - tools for automated reasoning, and program analysis and development KEYNOTE ADDRESSES Prof Mathai Joseph, Tata Research Development and Design Centre, Pune, India Prof Carroll Morgan, Software Engineering Research Group, Department of Computer Science and Engineering, University of New South Wales CALL FOR PAPERS Research paper submissions to CATS 2001 should be prepared according to the formatting requirements below and sent to the Programme Chair, to arrive no later than August 4, 2000. Submissions must be original work, not published or submitted elsewhere. All submissions will be refereed. PROCEEDINGS The proceedings of CATS 2001 will be published by Elsevier Science in their series Electronic Notes in Theoretical Computer Science. ENTCS is an electronic series associated with the journal Theoretical Computer Science, and published by Elsevier Science B. V. (Institutions subscribing to TCS can access full papers in ENTCS on-line.) ENTCS offers rapid, worldwide dissemination of research results, an absence of page limits, and long-term accessibility through the electronic archives that Elsevier maintains. (The proceedings of last year's CATS 2000 conference appeared as ENTCS Volume 31.) A hardcopy preliminary proceedings will be provided to conference attendees. Authors of selected papers from the CATS 2001 proceedings will be invited to submit extended versions of their papers to a Special Issue of the journal Theoretical Computer Science. FORMATTING REQUIREMENTS To ensure a uniform format for papers, all submissions to CATS 2001 must be prepared in LaTeX using the ENTCS macros. Papers in other formats cannot be accepted. Further information is available via the ENTCS home page: http://www.elsevier.nl/locate/entcs/. (Follow the links for "Instructions for Submissions" and "Technical Requirements".) Complete papers should be e-mailed as PostScript files, preferably as MIME attachments. Although there is no strict page limit on submissions to CATS 2001, authors are strongly encouraged to be as concise as possible. Papers between 10 and 15 pages are considered ideal. If necessary, definitions and proofs not essential to understanding the paper should be relegated to appendices to appear only in the electronic version. CALL FOR POSTERS A poster session will be arranged to give CATS attendees the opportunity to give informal presentations of their work. Expressions of interest, briefly outlining the poster's topic, should be e-mailed to the Programme Chair by November 10, 2000. IMPORTANT DATES Friday 4 August 2000: Deadline for submissions Friday 6 October 2000: Notification of acceptance Friday 27 October 2000: Final versions of accepted papers due Friday 10 November 2000: Deadline for author registrations Monday 29 January to Friday 2 February 2001: Australasian Computer Science Week, incorporating CATS 2001 PROGRAMME COMMITTEE Mariangiola Dezani-Ciancaglini, Universita di Torino, Italy Rod Downey, Victoria University of Wellington, New Zealand Colin Fidge (Chair), The University of Queensland, Australia Lance Fortnow, NEC Research Institute, USA Joseph Goguen, University of California at San Diego, USA Andrew Martin, Oxford University, United Kingdom Ian Mason, University of New England, Australia Janos Pach, New York University, USA Igor Shparlinski, Macquarie University, Australia Mark Utting, University of Waikato, New Zealand Emo Welzl, ETH Zurich, Switzerland ACSW GENERAL CHAIR Gopal Gupta, Bond University UPDATES AND NEWS Up to date information about the CATS 2001 conference can be found at its web site: http://www.csee.uq.edu.au/~cats01/ ENQUIRIES AND SUBMISSIONS Dr Colin Fidge (CATS 2001 Programme Chair) Software Verification Research Centre The University of Queensland Queensland 4072 Australia Fax: +61 7 3365 1533 Email: cats01@svrc.uq.edu.au ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu May 18 18:13:09 2000 Received: from crufty.research.bell-labs.com (ns2.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id SAA27864 for ; Thu, 18 May 2000 18:13:08 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu May 18 17:49:23 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Wed May 17 06:11:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed May 17 06:09:14 EDT 2000 Received: from cssvr17.cs.ust.hk ([143.89.41.167]) by dusty; Wed May 17 06:09:12 EDT 2000 Received: from csz094.cs.ust.hk (csz094.cs.ust.hk [143.89.128.56]) by cssvr17.cs.ust.hk (8.10.1/8.10.1) with ESMTP id e4HA8rC16835; Wed, 17 May 2000 18:08:54 +0800 (HKT) Date: Wed, 17 May 2000 18:08:53 +0800 (HKT) Message-Id: <200005171008.e4HA8rC16835@cssvr17.cs.ust.hk> From: Otfried Cheong To: compgeom-announce@research.bell-labs.com Subject: SoCG 2000 Last Call For Participation MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit X-Mailer: GNU Emacs 20.3.1 Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 844 Lines: 27 The 16th ACM Symposium on Computational Geometry 2000 is held from June 12 to 14 in Hong Kong. Please consider attending this unique event---the first ACM Symposium on Computational Geometry held in Asia! We still have hotel-quality housing on campus available. However, it must be reserved by May 22. We will not be able to provide any accomodation after that date. You can find the conference website at the following URL: http://www.cs.ust.hk/tcsc/scg00.html The organizing team Siu-Wing Cheng, Otfried Cheong Hong Kong University of Science and Technology ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu May 18 18:25:21 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id SAA28126 for ; Thu, 18 May 2000 18:25:20 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu May 18 17:45:21 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu May 11 19:45:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu May 11 19:44:55 EDT 2000 Received: from mail.cs.byu.edu ([128.187.101.9]) by dusty; Thu May 11 19:44:54 EDT 2000 Received: from cs.byu.edu (IDENT:nathan@conqueror.cs.byu.edu [128.187.171.43]) by mail.cs.byu.edu (8.9.1/8.9.1) with ESMTP id RAA05379 for ; Thu, 11 May 2000 17:44:53 -0600 (MDT) Sender: nathan@cs.byu.edu Message-ID: <391B4758.4EB8AC65@cs.byu.edu> Date: Fri, 12 May 2000 06:50:48 +0700 From: Nathan Moon X-Mailer: Mozilla 4.72 [en] (X11; U; Linux 2.2.14-12 i686) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com Subject: removing points from a 3-D Delaunay tetrahedralization Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 766 Lines: 20 I have been looking for an algorithm for removing a point from a Delaunay tetrahedralization, and haven't had any luck. I have found where a few authors have conjectured that 2-D algorithms would extend to 3-D, but have been unable to find where anyone has actually implemented something. Could anyone point me towards literature or anything describing such an algorithm? Or even just tell me if they know one exists, so that I know to keep searching. Thanks in advance! Nathan Moon moonn@cs.byu.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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed May 24 09:43:49 2000 Received: from crufty.research.bell-labs.com (ns2.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id JAA15852 for ; Wed, 24 May 2000 09:43:47 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed May 24 09:34:58 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Fri May 19 12:35:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri May 19 12:33:18 EDT 2000 Received: from disi.unige.it ([130.251.61.19]) by dusty; Fri May 19 12:33:12 EDT 2000 Received: from disi.unige.it (orsobianco [130.251.61.122]) by disi.unige.it (8.8.8/8.8.8) with ESMTP id SAA10511; Fri, 19 May 2000 18:33:14 +0200 (MET DST) Sender: puppo@disi.unige.it Message-ID: <34AC4FA1.3D64AB90@disi.unige.it> Date: Wed, 24 May 2000 03:23:29 +0100 From: Enrico Puppo Organization: DISI X-Mailer: Mozilla 4.5 [en] (X11; I; Linux 2.0.35 i686) X-Accept-Language: en MIME-Version: 1.0 To: general@eg.org, compgeom-announce@research.bell-labs.com, ldv@cs.ucdavis.edu CC: Leila De Floriani Subject: young visiting researcher positions Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2602 Lines: 73 YOUNG VISITING RESEARCHER POSITIONS AVAILABLE Department of Computer and Information Sciences University of Genova Both Pre- and Post-doctoral positions for young visiting researchers are available in the Department of Computer and Information Sciences at the University of Genova (Genova, Italy) under the supervision of Prof. Leila De Floriani and Prof. Enrico Puppo. Positions are funded by the EU in the context of the Research Network MINGLE. In order for a young researcher to be appointed in the project, some conditions (laid down by the EU) must be satisfied (see Eligibility below). The young researcher will carry out research in collaboration with members of the local research group, and will interact with other research groups in the context of the Research Network. Dates: Appointments will start in September 2000 and can last for a period between six months and one year. Applications will be accepted until positions are filled. Research subject: Multiresolution geometric modeling (for more information see http://www.disi.unige.it/research/Geometric_modeling/). Salary: - Pre-Doc: 1880 EURO per month - Post-Doc: 2700 EURO per month Eligibility: - age 35 years or less at the time of his appointment; - for Pre-Doc appointment: MS or equivalent degree in Computer Science, Computer Engineering or Mathematics; - for Post-Doc: PhD or equivalent degree in Computer Science, Computer Engineering or Mathenatics; - nationality of a Member State of the European Community (except Italy) or of an Associated State (see list below) or have resided in the European Community for at least five years prior to appointment; - must not have carried out her/his normal activities in Italy for more than 12 of the 24 months prior to his appointment. Associated States: Bulgaria, the Czech Republic, the Republic of Cyprus, Estonia, Hungary, Iceland, Israel, Latvia, Liechtenstein, Lithuania, Norway, Poland, Romania, Slovakia, and Slovenia. Fluent English is required. Background in Computer Graphics and/or Geometric Modeling is desired but not required. Application: Applicants must submit a letter of interest and CV, preferably by email or fax, to Leila De Floriani DISI - Universita' di Genova Via Dodecaneso 35 16146 Genova ITALY Email: deflo@disi.unige.it Phone: +39-0103536704 Fax: +39-0103536699 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed May 24 09:45:24 2000 Received: from dirty.research.bell-labs.com (ns1.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id JAA15986 for ; Wed, 24 May 2000 09:45:23 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed May 24 09:32:45 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Fri May 19 03:31:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri May 19 03:30:59 EDT 2000 Received: from perle.inria.fr ([138.96.16.76]) by dusty; Fri May 19 03:30:59 EDT 2000 Received: from perle.inria.fr by perle.inria.fr (8.8.8/8.8.5) with ESMTP id JAA15541 for ; Fri, 19 May 2000 09:26:23 +0200 (MET DST) Message-Id: <200005190726.JAA15541@perle.inria.fr> X-Mailer: exmh version 2.1.1 10/15/1999 To: compgeom-discuss@research.bell-labs.com Subject: removing points from a 3-D Delaunay tetrahedralization Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Fri, 19 May 2000 09:26:23 +0200 From: Olivier Devillers Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1957 Lines: 56 The following paper works in 3D (I have imlemented it even if it is not written in the paper. I ghave done it afterwards). @inproceedings{d-ddt-99 , author = "Olivier Devillers" , title = "On Deletion in {Delaunay} Triangulation" , booktitle = "Proc. 15th Annu. ACM Sympos. Comput. Geom." , year = 1999 , pages = "181--188" , url = "http://www-sop.inria.fr/prisme/publis/d-ddt-99.ps.gz" , archive = "XXX:cs.CG/9907023" , succeeds = "d-ddt-98" , cites = "agss-ltacv-89, a-pdpaa-87, bbp-iayed-98scg, bd-irgo-95, bm-sdcs -71, c-bvdcp-86, ads-rdppw-98, d-iirdt-98, dmt-ssgtu-92i, dp-papaf-98, es-itfwr- 96, gs-cdtp-78, h-taatm-90, l-tdam-97, m-smdnt-93, msz-frplw-96, obs-stcav-92, p -gcc-70, s-chdch-86, s-nmpgc-98" , update = "99.11 bibrelex+devillers, 99.07 devillers" , abstract = "This paper present how space of spheres and shelling can be use d to delete efficiently a point from d-dimensional triangulation. In 2-dimension , if k is the degree of the deleted vertex, the complexity is $O(k\log k)$, but we notice that this number apply only to low cost operations; time consuming com putations are done only a linear number of times. This algorithm can be viewed a s a variation of Heller algorithm which is popular in the geographic information system community. Unfortunately Heller algorithm is false as explained in this paper." } ---------------------------------------------------------------------- ----- O. Devillers, INRIA, 2004 route des Lucioles, BP 93, 06902 Sophia Antipolis Olivier.Devillers@sophia.inria.fr, +33 4 92 38 77 63, Fax +33 4 92 38 76 43 http://www-sop.inria.fr/prisme/personnel/devillers/ ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed May 24 09:45:28 2000 Received: from dirty.research.bell-labs.com (ns1.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id JAA16000 for ; Wed, 24 May 2000 09:45:26 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed May 24 09:34:37 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Fri May 19 08:41:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri May 19 08:40:41 EDT 2000 Received: from desh.cse.iitd.ernet.in ([202.141.68.3]) by dusty; Fri May 19 08:34:34 EDT 2000 Received: from cse.iitd.ernet.in (root@sanjiva.cse.iitd.ernet.in [10.20.2.48]) by desh.cse.iitd.ernet.in (8.8.7/8.8.7) with ESMTP id RAA22230; Fri, 19 May 2000 17:39:31 +0530 Received: (from sanjiva@localhost) by cse.iitd.ernet.in (8.9.3/8.9.3) id IAA07183; Sat, 20 May 2000 08:15:05 +0530 Date: Sat, 20 May 2000 08:15:05 +0530 Message-Id: <200005200245.IAA07183@cse.iitd.ernet.in> X-Authentication-Warning: localhost.localdomain: sanjiva set sender to sanjiva@sanjiva.cse.iitd.ernet.in using -f From: Sanjiva Prasad To: skapoor@cse.iitd.ernet.in Subject: FSTTCS 2000: revised Call for Papers Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 7045 Lines: 206 --text follows this line-- *********************************************************************** * * * FST TCS 2000 * * * * Foundations of Software Technology and Theoretical Computer Science * * December 13--15, 2000 * * New Delhi, India * * * *********************************************************************** * Call for Papers * *********************************************************************** New: Electronic Submission Guidelines Revised list of Invited Speakers ********************************************************************** IARCS, the Indian Association for Research in Computing Science, announces the 20th Annual FST TCS Conference in New Delhi. Tentatively planned satellite events include include two workshops: on Computational Geometry and on Advances in Programming Languages. Authors are invited to submit papers presenting original and unpublished research on **any** theoretical aspects of Computer Science. Papers in applied areas with a strong foundational emphasis are also welcome. The proceedings of the last six years' conferences (Springer-Verlag Lecture Notes in Computer Science volumes 880, 1026, 1180, 1346, 1530, 1738) give an idea of the kind of papers typically presented at FST TCS. Typical areas include (but are not restricted to): Automata, Languages and Computability Randomized and Approximation Algorithms Computational Geometry Computational Biology Combinatorial Optimization Graph and Network Algorithms Complexity Theory Parallel and Distributed Computing New Models of Computation Concurrent, Real-time and Hybrid Systems Logics of Programs and Modal Logics Database Theory and Information Retrieval Automated Reasoning, Rewrite Systems, and Applications Logic, Proof Theory, Model Theory and Applications Semantics of Programming Languages Static Analysis and Type Systems Theory of Functional and Constraint-based Programming Software Specification and Verification Cryptography and Security Protocols For an accepted paper to be included in the proceedings, one of the authors must commit to presenting the paper at the conference. Important Dates --------------- Deadline for Submission 31 May, 2000 Notification to Authors 15 August, 2000 Final Version of Accepted Papers due 15 September, 2000 Deadline for Early Registration 15 November, 2000 Submission Guidelines - --------------------- Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 A4-size pages, with 1.5 inch top margin and other margins 1 inch wide with 11 point or larger font. Authors who feel that more details are necessary may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should contain a short abstract. If available, e-mail addresses and fax numbers of the authors should be included. Electronic Submissions - -------------------- Electronic submission is very strongly encouraged. You may submit your paper using Rich Gerber's system START by visiting the URL for the conference and following the appropriate links. The URL for submissions is http://www.cse.iitd.ernet.in/~fsttcs20/START/www/submit.html In case you ar eunable to submit using START, self-contained uuencoded gzipped Postscript versions of the paper may be sent by e-mail to fsttcs20@cse.iitd.ernet.in In addition, the following information in ASCII format should be sent to this address in a **separate** e-mail: Title; authors; communicating author's name, address, and e-mail address and fax number if available; abstract of paper. Hard-Copy Submissions - --------------------- If electronic submission is not possible, authors may submit five (5) hard-copies of the paper by post to the following address: FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas New Delhi 110 016 INDIA Invited Speakers ---------------- Invited Speakers who have confirmed participation include: Peter Buneman (U Penn) Bernard Chazelle (Princeton) E. Allen Emerson (U Texas, Austin) Martin Groetschel (ZIB) Jose Meseguer (SRI) Philip Wadler (Bell Labs) Programme Committee ------------------- Pankaj Agarwal (Duke) Manindra Agrawal (IIT, Kanpur) Tetsuo Asano (JAIST) Vijay Chandru (IISc, Bangalore) Rance Cleaveland (Stony Brook) Anuj Dawar (Cambridge) Sampath Kannan (AT&T Research) Sanjiv Kapoor (IIT, Delhi) (Co-chair) Kamal Lodaya (IMSc, Chennai) Madhavan Mukund (CMI, Chennai) Gopalan Nadathur (Loyola) Seffi Naor (Bell Labs and Technion) Tobias Nipkow (TU Munich) Luke Ong (Oxford) C. Pandu Rangan (IIT, Chennai) Paritosh Pandya (TIFR) Benjamin Pierce (U Penn) Sanjiva Prasad (IIT, Delhi) (Co-chair) Sridhar Rajagopalan (IBM, Almaden) Abhiram Ranade (IIT, Mumbai) Dave Sands (Chalmers) A Prasad Sistla (U Illinois, Chicago) Michiel Smid (Magdeburg) Mandayam K. Srivas (SRI) Organized by ------------ Indian Institute of Technology, Delhi Hauz Khas, New Delhi 100 016. Organizing Committee ------------------- Sandeep Sen (chair) Naveen Garg (treasurer) S N Maheshwari Conference Site --------------- The Conference will take place at the India International Centre, 40 Lodhi Estate, Max Mueller Marg, New Delhi 110 003. Correspondence Address ---------------------- All correspondence regarding submissions may be addressed to FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas, New Delhi 110 016, INDIA Email: fsttcs20@cse.iitd.ernet.in Fax: +91 11 686 8765 Phone: +91 11 659 1294 / 659 1286 URL: http://www.cse.iitd.ernet.in/~fsttcs20 -- Sanjiva Prasad Associate Professor Department of Computer Science and Engineering sanjiva@cse.iitd.ernet.in Indian Institute of Technology, Delhi (Off) +91 11 659 1294 Hauz Khas, New Delhi 110016 (Res) +91 11 659 1684 INDIA (Fax) +91 11 686 8765 http://www.cse.iitd.ernet.in/~sanjiva ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed May 24 09:45:29 2000 Received: from dirty.research.bell-labs.com (ns1.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id JAA16005 for ; Wed, 24 May 2000 09:45:28 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed May 24 09:35:37 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon May 22 19:05:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon May 22 19:04:30 EDT 2000 Received: from amirani.ams.sunysb.edu ([129.49.6.2]) by dusty; Mon May 22 19:04:29 EDT 2000 Received: from ams.sunysb.edu (IDENT:jsbm@joepc.ams.sunysb.edu [129.49.6.238]) by amirani.ams.sunysb.edu (8.9.1a/8.9.1) with ESMTP id TAA29163; Mon, 22 May 2000 19:04:19 -0400 (EDT) Message-Id: <200005222304.TAA29163@amirani.ams.sunysb.edu> Date: Mon, 22 May 2000 19:04:17 -0400 (EDT) From: jsbm@ams.sunysb.edu Subject: Business meeting agenda To: compgeom-announce@research.bell-labs.com cc: jsbm@ams.sunysb.edu MIME-Version: 1.0 Content-Type: TEXT/plain; CHARSET=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 840 Lines: 30 Dear Members of the Computational Geometry Community, The annual SoCG business meeting will be held on Monday, June 12 (8pm). We are currently collecting business agenda items for the meeting. Please let me know if you have announcements, bids to host SoCG'2002, or discussion items to raise. In particular, if you would like to make a bid for hosting SoCG'2002 but are not attending the meeting in Hong Kong, we can arrange for your bid to be presented (if you have not already found a proxy). Thanks, Joe Mitchell Chair, Steering Committee jsbm@ams.sunysb.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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed May 24 09:45:35 2000 Received: from dirty.research.bell-labs.com (ns1.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id JAA16013 for ; Wed, 24 May 2000 09:45:33 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed May 24 09:35:58 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Tue May 23 18:35:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue May 23 18:33:05 EDT 2000 Received: from duke.cs.duke.edu ([152.3.140.1]) by dusty; Tue May 23 18:33:05 EDT 2000 Received: from polya.cs.duke.edu (polya.cs.duke.edu [152.3.140.71]) by duke.cs.duke.edu (8.9.3/8.9.3) with ESMTP id SAA05120; Tue, 23 May 2000 18:32:55 -0400 (EDT) From: Pankaj Kumar Agarwal Received: (pankaj@localhost) by polya.cs.duke.edu (8.8.5/8.6.9) id SAA05692; Tue, 23 May 2000 18:32:54 -0400 (EDT) Date: Tue, 23 May 2000 18:32:54 -0400 (EDT) Message-Id: <200005232232.SAA05692@polya.cs.duke.edu> To: compgeom-announce@research.bell-labs.com Cc: jsbm@ams.sunysb.edu, scg00@cs.ust.hk Subject: Student funding for SCG'00 Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 861 Lines: 20 Raindrop Geomagic has provided funds to partially support the travel expenses of a few students for the 16th ACM Symposium on Computational Geometry to be held June 12--14, 2000 in Hong Kong. See http://www.cs.ust.hk/tcsc/scg00.html for details. If you are interested, please send mail to Pankaj Agarwal (pankaj@cs.duke.edu) and conference organizers (scg00@cs.ust.hk) as soon as possible, but no later than May 26, 2000. Please include the amount you need and whether you are an author of a paper to be presented at the conference. A committee would decide the allocation of funds. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Mon Jun 5 19:52:54 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id TAA19586 for ; Mon, 5 Jun 2000 19:52:53 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Jun 5 19:46:21 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Tue May 30 08:31:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue May 30 08:29:23 EDT 2000 Received: from desh.cse.iitd.ernet.in ([202.141.68.3]) by dusty; Tue May 30 08:29:19 EDT 2000 Received: from cse.iitd.ernet.in (root@sanjiva.cse.iitd.ernet.in [10.20.2.48]) by desh.cse.iitd.ernet.in (8.8.7/8.8.7) with ESMTP id RAA06493; Tue, 30 May 2000 17:56:34 +0530 Received: (from sanjiva@localhost) by cse.iitd.ernet.in (8.9.3/8.9.3) id RAA02069; Tue, 30 May 2000 17:44:10 +0530 Date: Tue, 30 May 2000 17:44:10 +0530 Message-Id: <200005301214.RAA02069@cse.iitd.ernet.in> X-Authentication-Warning: localhost.localdomain: sanjiva set sender to sanjiva@sanjiva.cse.iitd.ernet.in using -f From: Sanjiva Prasad To: skapoor@cse.iitd.ernet.in Subject: FST TCS 2000: One week extension on the submission deadline Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3381 Lines: 87 Anticipating down time at our site, and to give interested authors the benefit of a weekend, we are extending the deadline for submission to June 6, 2000. We also encourange authors to submit using the START program that can be accessed from the home page of the FST TCS 2000 conference http://www.cse.iitd.ernet.in/fsttcs20 *********************************************************************** * * * FST TCS 2000 * * * * Foundations of Software Technology and Theoretical Computer Science * * December 13--15, 2000 * * New Delhi, India * * * *********************************************************************** * Call for Papers * *********************************************************************** Submission Guidelines - --------------------- Authors may submit drafts of full papers or extended abstracts. Submissions are limited to 12 A4-size pages, with 1.5 inch top margin and other margins 1 inch wide with 11 point or larger font. We advise authors to employ Springer-Verlag's LNCS style file "llncs.sty". Authors who feel that more details are necessary may include a clearly marked appendix which will be read at the discretion of the Programme Committee. Each paper should contain a short abstract. If available, e-mail addresses and fax numbers of the authors should be included. Electronic Submissions - -------------------- Electronic submission is very strongly encouraged. You may submit your paper using Rich Gerber's system START by visiting the URL for the conference and following the appropriate links. The URL for submissions is http://www.cse.iitd.ernet.in/~fsttcs20/START/www/submit.html In case you ar eunable to submit using START, self-contained uuencoded gzipped Postscript versions of the paper may be sent by e-mail to fsttcs20@cse.iitd.ernet.in In addition, the following information in ASCII format should be sent to this address in a **separate** e-mail: Title; authors; communicating author's name, address, and e-mail address and fax number if available; abstract of paper. Hard-Copy Submissions - --------------------- If electronic submission is not possible, authors may submit five (5) hard-copies of the paper by post to the following address: FST TCS 2000 Department of Computer Science and Engineering I.I.T., Delhi Hauz Khas New Delhi 110 016 INDIA -- Sanjiva Prasad Associate Professor Department of Computer Science and Engineering sanjiva@cse.iitd.ernet.in Indian Institute of Technology, Delhi (Off) +91 11 659 1294 Hauz Khas, New Delhi 110016 (Res) +91 11 659 1684 INDIA (Fax) +91 11 686 8765 http://www.cse.iitd.ernet.in/~sanjiva ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Jun 14 13:17:28 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id NAA07737 for ; Wed, 14 Jun 2000 13:17:25 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Jun 14 13:12:47 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Wed Jun 14 00:51:04 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Jun 14 00:49:51 EDT 2000 Received: from blaze.cs.jhu.edu ([128.220.13.50]) by dusty; Wed Jun 14 00:49:50 EDT 2000 Received: from peregrine.cs.yp (peregrine.cs.jhu.edu [128.220.13.85]) by blaze.cs.jhu.edu (8.9.3/8.9.3) with SMTP id AAA19784 for ; Wed, 14 Jun 2000 00:49:48 -0400 (EDT) Received: by peregrine.cs.yp (SMI-8.6/SMI-SVR4) id AAA03887; Wed, 14 Jun 2000 00:49:07 -0400 Date: Wed, 14 Jun 2000 00:49:07 -0400 From: subodh@cs.jhu.edu (Subodh Kumar) Message-Id: <200006140449.AAA03887@peregrine.cs.yp> To: compgeom-discuss@research.bell-labs.com Subject: Incremental CDT Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 397 Lines: 12 Do you know of incremental constrained Delaunay triangulation code that allows both addition and deletion of points and edges? Thanks. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Jun 23 16:40:44 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA07066 for ; Fri, 23 Jun 2000 16:40:43 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Jun 23 16:35:43 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Jun 22 20:37:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Jun 22 20:35:21 EDT 2000 Received: from convex.cs.unb.ca ([131.202.33.93]) by dusty; Thu Jun 22 20:35:20 EDT 2000 Received: (from bremner@localhost) by convex.cs.unb.ca (8.10.0/8.10.0) id e5N0eTa03137; Thu, 22 Jun 2000 21:40:29 -0300 From: David Bremner MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <14674.45565.330920.729139@convex.cs.unb.ca> Date: Thu, 22 Jun 2000 21:40:29 -0300 (ADT) To: compgeom-announce@research.bell-labs.com Subject: 12th Canadian Conference on Computational Geometry X-Mailer: VM 6.72 under 21.1 (patch 8) "Bryce Canyon" XEmacs Lucid Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3395 Lines: 83 12th Canadian Conference on Computational Geometry Fredericton, New Brunswick August 16-19, 2000 First Call for Participation June 22, 2000 Introduction Computational Geometry is a discipline concerned with algorithms, software, and mathematical foundations for the treatment of geometric data by computer. The Canadian Conference on Computational Geometry (CCCG) reflects this diversity of interest, with invited speakers and contributed papers on topics ranging from geometric applications in industry to the frontiers of pure mathematics. The technical program will be from August 16-18, with an optional outing on August 19. Invited Speakers * Gil Kalai, Hebrew University of Jerusalem The Paul Erdos Memorial Lecture on Discrete Geometry * Naoki Kato, University of Kyoto Applications of Computational Geometry in Architecture * Colin Ware, University of New Hampshire. The Structure of Visual Space: Implications for Information Display. Registration Registration for CCCG '00 includes one copy of the proceedings and admission for one person to the banquet/social at Old Government House on the evening of August 17th. Additional proceedings and banquet tickets can be ordered as part of the online registration process. Registration rates are as follows: Regular Students and Postdocs Up to July 24 $120 $60 After July 24 $140 $80 Online registration is available on the web site http://www.cs.unb.ca/conf/cccg. Contacts web Abstracts of accepted papers, information about accomodation, and online registration is available at http://www.cs.unb.ca/conf/cccg email cccg@unb.ca Postal Canadian Conference for Computational Geometry c/o David Bremner Faculty of Computer Science University of New Brunswick P.O. Box 4400 Fredericton, NB E3B 5A3 ---------------------------------------------------------------------- Thanks The organizers would like to thank PIMS, CRM, the Fields Institute, and the University of New Brunswick for financial support for CCCG'00 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Jun 23 16:40:55 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA07071 for ; Fri, 23 Jun 2000 16:40:54 -0400 (EDT) Message-Id: <200006232040.QAA07071@duke.cs.duke.edu> Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Jun 23 16:35:45 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Jun 22 13:25:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Jun 22 13:24:16 EDT 2000 Received: from math.fu-berlin.de ([160.45.40.10]) by dusty; Thu Jun 22 13:24:15 EDT 2000 Received: (qmail 17118 invoked from network); 22 Jun 2000 19:24:13 +0200 Received: from fubinf.inf.fu-berlin.de (HELO inf.fu-berlin.de) (160.45.110.10) by leibniz.math.fu-berlin.de with SMTP; 22 Jun 2000 19:24:13 +0200 Received: (qmail 15207 invoked from network); 22 Jun 2000 17:24:21 -0000 Received: from sahib.inf.fu-berlin.de (HELO sahib) (160.45.111.13) by fubinf.inf.fu-berlin.de with SMTP; 22 Jun 2000 17:24:21 -0000 Date: Thu, 22 Jun 2000 19:24:15 +0200 (MET DST) From: Helmut Alt Reply-To: Helmut Alt Subject: Free Positions in the European Graduate Program "Combinatorics, Geometry, and Computation" To: compgeom-announce@research.bell-labs.com MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: P33HUawha4asQaaqKx32rA== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4p_5 SunOS 5.7 sun4u sparc Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2768 Lines: 64 ---------------------------------------------------------------------------- European Graduate Program Berlin ------------------------------------------ Zurich Combinatorics, Geometry, and Computation ---------------------------------------------------------------------------- In the newly established graduate program two-year scholarships for Ph.D.students are available in Berlin starting October 1st, 2000. Applicants should have a degree in mathematics, computer science, or a related area equivalent to the German university diploma (e.g. M.S.) with grades significantly above average. Furthermore a postdoctoral position is available for at most two years. The program is a joint initiative of the ETH Zurich, the three universities of Berlin - Free University, Technical University, Humboldt-University - and the Konrad-Zuse-Research Center. The German partners are financially suppor- ted by the German Research association (Deutsche Forschungsgemeinschaft, DFG). The amount of the scholarships in Berlin is calculated according to the guidelines of the DFG and is up to DM 2690 per month, tax free (family supplement DM 400). The scientific program ranges from theoretical fundamentals to applications. The areas of research are combinatorics, geometry, optimization, algorithms and computation. In Berlin the students are supervised by the professors Aigner, Alt, Rote, Schulz (FU), Moehring, Ziegler (TU), Proemel (HU) and Groetschel (ZIB). Applications with curriculum vitae, copies of certificates, theses, a letter of recommendation of the last advisor, a brief description of the proposed research and, especially for applicants for the postdoctoral position, re- prints of publications should be sent in until July 14, 2000 to the speaker of the program in Berlin: Prof. Dr. Helmut Alt Institut fuer Informatik Freie Universitaet Berlin Takustrasse 9 D-14195 Berlin Further information can be obtained from Bettina Felsner Tel. ++49-30-838 75 104 bfelsner@inf.fu-berlin.de Internet: http://www.inf.fu-berlin.de/gk-cgc --------------------------------------------------------------------------- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Jun 23 16:41:30 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA07084 for ; Fri, 23 Jun 2000 16:41:29 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Jun 23 16:31:33 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Wed Jun 14 15:05:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Jun 14 15:03:25 EDT 2000 Received: from graphics.lcs.mit.edu ([18.24.2.30]) by dusty; Wed Jun 14 15:03:24 EDT 2000 Received: from graphics.lcs.mit.edu (dialup-3169.lcs.mit.edu [18.23.3.169]) by graphics.lcs.mit.edu (8.10.1/8.10.1) with ESMTP id e5EJ3L9193094; Wed, 14 Jun 2000 15:03:22 -0400 (EDT) Message-ID: <39492767.92BDEDF@graphics.lcs.mit.edu> Date: Thu, 15 Jun 2000 14:58:47 -0400 From: Seth Teller X-Mailer: Mozilla 4.7 [en] (Win98; I) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com Subject: Re: Incremental CDT References: <200006140449.AAA03887@peregrine.cs.yp> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 839 Lines: 25 dani lischinski (now at hebrew U) wrote a nice (i.e., fast, robust) library to do this: http://www.cs.huji.ac.il/~danix/code/cdt.tar.gz Subodh Kumar wrote: > > Do you know of incremental constrained Delaunay triangulation code that > allows both addition and deletion of points and edges? > Thanks. > > ------------- > The compgeom mailing lists: see > http://netlib.bell-labs.com/netlib/compgeom/readme.html > or send mail to compgeom-request@research.bell-labs.com with the line: > send readme > Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Jun 23 16:42:05 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA07122 for ; Fri, 23 Jun 2000 16:42:05 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Jun 23 16:31:43 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Jun 15 03:21:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Jun 15 03:19:16 EDT 2000 Received: from procyon.inria.fr ([138.96.83.3]) by dusty; Thu Jun 15 03:19:16 EDT 2000 Received: from procyon.inria.fr by procyon.inria.fr (8.10.0/8.10.0) with ESMTP id e5F7JEp30289 for ; Thu, 15 Jun 2000 09:19:14 +0200 Message-Id: <200006150719.e5F7JEp30289@procyon.inria.fr> X-Mailer: exmh version 2.1.1 10/15/1999 To: compgeom-discuss@research.bell-labs.com Subject: Re: Incremental CDT (fwd) Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Thu, 15 Jun 2000 09:19:14 +0200 From: Mariette Yvinec Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 798 Lines: 28 The constrained Delaunay triangulation in the library CGAL (see http://www.cs.uu.nl/CGAL/) allows addition and deletion of points and edges - --------------------------------------------------------------------- Mariette Yvinec INRIA Sophia-Antipolis email: yvinec@sophia.inria.fr 2004, Route des Lucioles BP 93 phone: +33 4 92.38.77.49 06902 Sophia-Antipolis Cedex (France) fax : +33 4 92.38.76.43 http://www.inria.fr/prisme/personnel/yvinec/yvinec.html ------- End of Forwarded Message ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Jun 23 16:42:20 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA07173 for ; Fri, 23 Jun 2000 16:42:19 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Jun 23 16:32:13 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Jun 15 04:23:04 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Jun 15 04:22:27 EDT 2000 Received: from eerie.site-eerie.ema.fr ([146.19.2.1]) by dusty; Thu Jun 15 04:22:26 EDT 2000 Received: from maileerie.site-eerie.ema.fr (maileerie [146.19.1.3]) by eerie.site-eerie.ema.fr (8.9.3/8.9.1) with ESMTP id KAA01329 for ; Thu, 15 Jun 2000 10:22:24 +0200 (MET DST) Received: from site-eerie.ema.fr (gate-gw [146.19.1.21]) by maileerie.site-eerie.ema.fr (8.9.3/8.9.1) with ESMTP id KAA23755; Thu, 15 Jun 2000 10:30:48 +0200 (MET DST) Message-ID: <394892B3.FA1549B0@site-eerie.ema.fr> Date: Thu, 15 Jun 2000 10:24:19 +0200 From: aupetit X-Mailer: Mozilla 4.61 [en] (WinNT; I) X-Accept-Language: en MIME-Version: 1.0 To: "compgeom-discuss@research.bell-labs.com" , Michael.Aupetit@eerie.site-eerie.ema.fr Subject: Catmull-Rom cubic spline... Content-Type: text/plain; charset=iso-8859-1 X-MIME-Autoconverted: from 8bit to quoted-printable by eerie.site-eerie.ema.fr id KAA01329 Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by duke.cs.duke.edu id QAA07173 Status: RO Content-Length: 659 Lines: 22 Hi, I would like a (hyper-)surface to pass through some given points. I am looking for a simple way to compute the gradient (tangente hyperplane) at a point knowing the "height" of its neighbors. The Catmull-Rom approach works for curves (intrinsic 1D) but does it exist some similar methods for surface (intrinsic 2D) and even hyper-surface (more than intrinsic 2D)? Thank you Michaël Aupetit ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Mon Jun 26 18:09:26 2000 Received: from crufty.research.bell-labs.com (ns2.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id SAA25344 for ; Mon, 26 Jun 2000 18:09:26 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Jun 26 18:06:38 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Sun Jun 25 19:29:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sun Jun 25 19:28:59 EDT 2000 Received: from postoffice.srv.cs.cmu.edu ([128.2.181.62]) by dusty; Sun Jun 25 19:28:58 EDT 2000 Received: from KRUNCH.GRAPHICS.CS.CMU.EDU by postoffice.srv.cs.cmu.edu id aa12601; 25 Jun 2000 19:28 EDT Sender: ph@postoffice.srv.cs.cmu.edu Message-ID: <395695A3.A18BB8A6@cs.cmu.edu> Date: Sun, 25 Jun 2000 19:28:35 -0400 From: Paul Heckbert Organization: Computer Science Dept., Carnegie Mellon University X-Mailer: Mozilla 4.08 [en] (X11; U; IRIX 6.2 IP22) MIME-Version: 1.0 To: "compgeom-discuss@research.bell-labs.com" CC: Michael.Aupetit@eerie.site-eerie.ema.fr Subject: Re: Catmull-Rom cubic spline... References: <394892B3.FA1549B0@site-eerie.ema.fr> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1098 Lines: 27 aupetit wrote: > > I would like a (hyper-)surface to pass through some given points. > I am looking for a simple way to compute the gradient (tangente > hyperplane) > at a point knowing the "height" of its neighbors. > The Catmull-Rom approach works for curves (intrinsic 1D) but does > it exist some similar methods for surface (intrinsic 2D) ... If you want a function z(x,y) that interpolates a set of (x,y,z) points, this is called "scattered data interpolation". Try radial basis functions for this. See the paper http://www.gvu.gatech.edu/people/faculty/greg.turk/morph/morph.html and specifically see the paper by Jean Duchon that they cite. Paul Heckbert, Associate Professor Computer Science Dept., Carnegie Mellon University 5000 Forbes Ave, Pittsburgh PA 15213-3891, USA ph@cs.cmu.edu http://www.cs.cmu.edu/~ph ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Jul 5 19:32:11 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id TAA29090 for ; Wed, 5 Jul 2000 19:32:10 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Jul 5 19:27:51 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Thu Jun 29 13:49:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Jun 29 13:47:29 EDT 2000 Received: from swarm.cs.wustl.edu ([128.252.165.116]) by dusty; Thu Jun 29 13:47:28 EDT 2000 Received: (from roman@localhost) by swarm.cs.wustl.edu (980427.SGI.8.8.8/980728.SGI.AUTOCF) id MAA20224 for compgeom-announce@research.bell-labs.com; Thu, 29 Jun 2000 12:46:22 -0500 (BLT) Date: Thu, 29 Jun 2000 12:46:22 -0500 (BLT) From: roman@swarm.cs.wustl.edu (Catalin Roman) Message-Id: <200006291746.MAA20224@swarm.cs.wustl.edu> To: compgeom-announce@research.bell-labs.com Subject: COORDINATION 2000 (Call for PartciParticipation) Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1900 Lines: 52 ||||||| CALL FOR PARTICIPATION ||||||||||||||||||||||||||||| COORDINATION 2000 Fourth International Conference on Coordination Models and Languages Limassol, Cyprus 11-13 September 2000 http://www-gloc.di.fct.unl.pt/coord00/ Early registration deadline: 15 July 2000 ||||||| CALL FOR PARTICIPATION ||||||||||||||||||||||||||||| On behalf of the organizing committee we would like to extend to you a warm invitation to join us this September for an exciting program and wonderful intellectual debates in the unique setting provided by Cyprus, a beautiful mythical island whose wonders are best revealed in the early days of fall. Because Cyprus is a popular vacation spot, early registration is advised. As in the past, this year's program brings together a broad range of themes associated with the development of coordination models and languages, their theoretical underpinning, and pragmatic implications. Topics receiving extended coverage include tuple space languages and their application, coordination styles and policies, migration and reconfiguration, agent systems, software architectures, dependability, etc. The single track program punctuated by ample opportunities for socializing and critical evaluation of the field allows the participants to evaluate trends, to examine a broad range of issues, and to engage each other in spirited discussions that, as previous conferences have shown, actually reshaped research agendas and led to novel developments. Antonio Porto and Catalin Roman ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Jul 7 10:49:51 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id KAA01134 for ; Fri, 7 Jul 2000 10:49:49 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Jul 7 10:44:09 EDT 2000 Received: from grubby.research.bell-labs.com by netlib2; Fri Jul 7 08:53:04 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Jul 7 08:52:30 EDT 2000 Received: from convex.cs.unb.ca ([131.202.33.93]) by dusty; Fri Jul 7 08:52:30 EDT 2000 Received: (from bremner@localhost) by convex.cs.unb.ca (8.10.0/8.10.0) id e67Cw5P31904; Fri, 7 Jul 2000 09:58:05 -0300 From: David Bremner MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <14693.54237.724555.407603@convex.cs.unb.ca> Date: Fri, 7 Jul 2000 09:58:05 -0300 (ADT) To: compgeom-announce@research.bell-labs.com Subject: CCCG00 Hotel Deadline July 15; early registration July 24 X-Mailer: VM 6.72 under 21.1 (patch 8) "Bryce Canyon" XEmacs Lucid Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3950 Lines: 96 12th Canadian Conference on Computational Geometry Fredericton, New Brunswick August 16-19, 2000 Second Call for Participation July 7, 2000 ========================================================================== Changes since the first call for participation For those of you who read the first call for papers, this message is merely to call your attention to the following two dates: July 15 Deadline for booking accomodation at the conference hotel. Our block of rooms will be released at this date. July 24 Deadline for early registration discount. ========================================================================== Introduction Computational Geometry is a discipline concerned with algorithms, software, and mathematical foundations for the treatment of geometric data by computer. The Canadian Conference on Computational Geometry (CCCG) reflects this diversity of interest, with invited speakers and contributed papers on topics ranging from geometric applications in industry to the frontiers of pure mathematics. The technical program will be from August 16-18, with an optional outing on August 19. Invited Speakers * Gil Kalai, Hebrew University of Jerusalem The Paul Erdos Memorial Lecture on Discrete Geometry * Naoki Kato, University of Kyoto A.pplications of Computational Geometry in Architecture * Colin Ware, University of New Hampshire. Mapping Data to Dimensions of Visual Space Registration Registration for CCCG '00 includes one copy of the proceedings and admission for one person to the banquet/social at Old Government House on the evening of August 17th. Additional proceedings and banquet tickets can be ordered as part of the online registration process. Registration rates are as follows: Regular Students and Postdocs Up to July 24 $120 $60 After July 24 $140 $80 Online registration is available on the web site http://www.cs.unb.ca/conf/cccg. Contacts web Abstracts of accepted papers, information about accomodation, and online registration is available at http://www.cs.unb.ca/conf/cccg email cccg@unb.ca Postal Canadian Conference for Computational Geometry c/o David Bremner Faculty of Computer Science University of New Brunswick P.O. Box 4400 Fredericton, NB E3B 5A3 Thanks The organizers would like to thank PIMS, CRM, the Fields Institute, and the University of New Brunswick for financial support for CCCG'00 _________________________________________________________________ ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Jul 7 10:50:57 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id KAA01173 for ; Fri, 7 Jul 2000 10:50:55 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Jul 7 10:44:52 EDT 2000 Received: from grubby.research.bell-labs.com by netlib2; Fri Jul 7 04:51:04 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Jul 7 04:50:09 EDT 2000 Received: from mail.mpi-sb.mpg.de ([139.19.1.1]) by dusty; Fri Jul 7 04:50:09 EDT 2000 Received: from mpii01704.ag1.mpi-sb.mpg.de (mpii01704.ag1.mpi-sb.mpg.de [139.19.10.157]) by mail.mpi-sb.mpg.de (8.8.7/8.8.8) with ESMTP id KAA26268 for ; Fri, 7 Jul 2000 10:50:35 +0200 From: jopsi@mpi-sb.mpg.de Received: (from jopsi@localhost) by mpii01704.ag1.mpi-sb.mpg.de (8.9.3/8.9.3) id KAA00064 for compgeom-announce@research.bell-labs.com; Fri, 7 Jul 2000 10:50:05 +0200 (MET DST) Message-Id: <200007070850.KAA00064@mpii01704.ag1.mpi-sb.mpg.de> Subject: CALL FOR PARTICIPATION: ESA 00, WAE 00, APPROX 00 To: compgeom-announce@research.bell-labs.com Date: Fri, 7 Jul 2000 10:50:05 +0200 (MET DST) X-Mailer: ELM [version 2.4ME+ PL52 (25)] MIME-Version: 1.0 Content-Type: text/plain; charset=ISO-8859-1 X-MIME-Autoconverted: from 8bit to quoted-printable by mail.mpi-sb.mpg.de id KAA26268 Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by duke.cs.duke.edu id KAA01173 Status: RO Content-Length: 914 Lines: 26 ----------------------------------------------------------------------- CALL FOR PARTICIPATION: ESA 00, WAE 00, APPROX 00 ESA (on algorithm theory) APPROX (on the theory of approximation) WAE (on algorithm engineering) will be jointly organized at the Max-Planck-Institute for Computer Science in Saarbrücken, Germany from September 5-8 2000. The programs of these conferences are available at http://www.mpi-sb.mpg.de/~conf2000/ The deadline for early registration is 10 July, so please register now. After this date you will have to pay 50 DM more. ----------------------------------------------------------------------- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Jul 12 19:20:13 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id TAA17888 for ; Wed, 12 Jul 2000 19:20:12 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Jul 12 19:13:49 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon Jul 10 06:27:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Jul 10 06:26:10 EDT 2000 To: compgeom-announce@research.bell-labs.com Received: from ada.cs.ucy.ac.cy ([194.42.7.2]) by dusty; Mon Jul 10 06:26:09 EDT 2000 Received: from ada.cs.ucy.ac.cy (ada.cs.ucy.ac.cy [194.42.7.2]) by ada.cs.ucy.ac.cy (8.8.8/8.8.8) with ESMTP id NAA04284; Mon, 10 Jul 2000 13:35:15 +0300 Date: Mon, 10 Jul 2000 13:35:15 +0300 (WET) From: George Angelos Papadopoulos Reply-To: george@cs.ucy.ac.cy Subject: *** Faculty Positions: University of Cyprus *** Message-ID: Organization: Department of Computer Science - University of Cyprus Address: 75 Kallipoleos Str. -- POB 20537 -- CY-1678 -- Nicosia -- Cyprus Tel: +357-2-892242 -- Fax: +357-2-339062 URL: http://www.cs.ucy.ac.cy/~george MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3008 Lines: 95 *** ANNOUNCEMENT OF ACADEMIC POSITIONS *** The University of Cyprus announces the following non permanent posts (Assistant Professor or Lecturer): DEPARTMENT OF COMPUTER SCIENCE 2 non permanent posts in the following fields of study: * Computer Networks * Database Systems * Programming Languages * Software Engineering 2 non permanent posts in the following fields of study: * Data Mining * Electronic Commerce * Intelligent Systems for the Internet * Internet Technologies * Mobile Computing * Multimedia Systems For all academic ranks, a Ph.D. from a recognized University is required. PLEASE NOTE: The languages of instruction are Greek and Turkish. Applicants need not be citizens of the Republic of Cyprus. The annual salaries for these positions (including the 13th salary) are: Assistant Professor (Scale A13-A14) CY21,485 - CY28,981 Lecturer (Scale A12-A13) CY18,145 - CY26,575 (At present 1 CY = 1.002 sterling and 1 CY = 1.6631 dollars) Interested individuals must submit the following items by Friday 29th of September 2000: I A letter stating the department, the academic rank or ranks for which the applicant is interested in, the field or fields of study and the date when he/she may be able to assume duties in the event of selection. II A Curriculum Vitae (6 copies). III A brief summary (not exceeding three pages) of their research work as well as a description of plans for future research (6 copies). IV A list of publications (6 copies). V Copies of representative publications (6 copies if possible). VI Copies of their qualifications. In addition, the applicants must request three academic referees to send letters of recommendation directly to the University; the names and addresses of these referees must be submitted with the application. Additional confidential information may be sought. The Curriculum Vitae and the brief summary of the research work should be written in Greek or Turkish and in one international language, preferably English. Applications, other documents and reference letters submitted in the past will NOT be considered and must be re-submitted. Applications that are not complete will not be considered. The above must reach the University by 2 pm Friday 29th of September 2000 at the following address: The Registrar University of Cyprus P O Box 20537 CY-1678 Nicosia CYPRUS Tel: 02-892000 Fax: 02-892100 For more details and other information interested individuals may contact the Head of the Department of Computer Science, Associate Professor Antonis Kakas: Tel: +357-2-892231 Fax: +357-2-339062 E-mail: antonis@cs.ucy.ac.cy ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Jul 26 22:18:23 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id WAA13655 for ; Wed, 26 Jul 2000 22:18:20 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Jul 26 22:12:02 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Wed Jul 19 02:17:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Jul 19 02:15:09 EDT 2000 To: compgeom-announce@research.bell-labs.com Date: Wed, 19 Jul 2000 02:15:07 -0400 Message-ID: <000901bff148$a5c42de0$4e3fe493@fav.zcu.cz> From: "Vaclav Skala" Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 5278 Lines: 148 9-th WSCG'2001 CALL for PAPERS and PARTICIPATION Please, forward to colleagues of yours CALL for PAPERS and PARTICIPATION Conference dates: February 5 - 9, 2001 Deadline for authors: October 10, 2000 Information: http://wscg.zcu.cz on forthcoming and passed even= ts, on-line papers Accepted papers will be published in the Conference proceedings with ISBN and processed by INSPEC, ISI, Cambridge Scientific Abstracts and others f= or citations index. ---------------------------------------------------------- >> Nice opportunity >> to visit the Golden City Prague - visit, please http://www.czechsite.com/ >> to drink the best beer - the original Pilsener Urquell >> visit the Plzen Information Center http://www.plzen-city.cz ---------------------------------------------------------- W S C G ' 2001 The 9-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2001 in cooperation with EUROGRAPHICS, IFIP WG 5.10 Computer Graphics Society to be held in February 5 - 9, 2001 in Plzen very close to PRAGUE, the capital of the Czech Republic ------------------------------------------------------------------ >> If you are willing to help us as a REVIEWER, please, << >> fill in the form at the http://wscg.zcu.cz/reviewer.htm << ------------------------------------------------------------------ Conference Chairs =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D Nadia Magnenat Thalmann, MIRALab-CUI, Univ. of Geneva, Switzerland Vaclav Skala, Univ. of West Bohemia, Czech Republic Topics included --------------- Fundamental algorithms, rendering and visualization, computer vision, pattern recognition and image processing, virtual reality, medical imaging, geometric modelling and fractals, parallel and distributed graphics, computational geometry, graphical interaction and standards, object-oriented graphics, WWW technologies, animation and multimedia, computer aided geometric design, CAD/CAM, DTP and GIS systems, educational aspects of related fields, usage of graphics within mathemati= cal software (Maple, Mathematica, MathCAD etc.) in education. >>> Papers on all aspects of computer graphics are encouraged <<< The program includes international books exhibition and video show, too. --------------------------------------------- W S C G '2001 International Exhibition ------------------------------------ Information for exhibitors: Please contact the organiser as soon as possi= ble -------------------------- for detailed information and conditions. The WSCG Exhibition will be held in parallel. Top leading European and Cz= ech companies active in computer graphics, visualization and computer vision, CAD/CAM and GIS systems, virtual reality, multimedia systems and others will be presenting their latest products. Special programme will be available, too. ----------------- Accepted papers will be published in the Conference proceedings with ISBN. They are reviewed by INSPEC, Cambridge Scientific Abstracts, InfoStore, IEE, ISI, AIMS, INIST and others for citations index and other purposes. The best papers will be considered for possible publication in the Journa= l of Visualisation and Computer Animation, Computers&Graphics, The Visual Computer, Machine Graphics & Vision, High Performace Computer Graphics an= d others journals. Organizer and Conference secretariat ------------------------------------ Prof.Ing.Vaclav Skala, CSc. c/o Computer Science Dept., Univ.of West Bohemia Univerzitni 8, Box 314, 306 14 Plzen, Czech Republic e-mail: skala@kiv.zcu.cz Subject: INFO WSCG tel.:+420-19-7491-188 fax:+420-19-7822-578, 799 include your e-mail!!= ! The latest information is available at (please reload the pages all the time to get the latest information): http://wscg.zcu.cz select WSCG'2001 Information on all WSCG conferences: http://wscg.zcu.cz --- Odchoz=ED zpr=E1va neobsahuje viry. Zkontrolov=E1no antivirov=FDm syst=E9mem AVG (http://www.grisoft.cz). Verze: 6.0.167 / Virov=E1 b=E1ze: 80 - datum vyd=E1n=ED: 29.6.2000 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Sun Aug 6 21:34:10 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id VAA04011 for ; Sun, 6 Aug 2000 21:34:09 -0400 (EDT) Message-Id: <200008070134.VAA04011@duke.cs.duke.edu> Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Aug 6 21:33:30 EDT 2000 Received: from grubby.research.bell-labs.com by netlib2; Thu Aug 3 12:09:03 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Aug 3 12:08:34 EDT 2000 Received: from math.fu-berlin.de ([160.45.40.10]) by dusty; Thu Aug 3 12:08:33 EDT 2000 Received: (qmail 822 invoked from network); 3 Aug 2000 18:08:34 +0200 Received: from sahib.inf.fu-berlin.de (HELO sahib) (160.45.111.13) by leibniz.math.fu-berlin.de with SMTP; 3 Aug 2000 18:08:34 +0200 Date: Thu, 3 Aug 2000 18:08:32 +0200 (MET DST) From: Helmut Alt Reply-To: Helmut Alt Subject: CG01 To: theorynt@vm1.nodak.edu, compgeom-announce@research.bell-labs.com MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: whF+xOP1TccWI8dOFlAIRw== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.4p_5 SunOS 5.7 sun4u sparc Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 909 Lines: 28 Preliminary Announcement Euro-CG 2001 17th European Workshop on Computational Geometry March 26 - 28, 2001 Institute of Computer Science Freie Universitaet Berlin, Germany A detailed Call for Papers will be circulated in about two months, submission deadline will be January 7, 2001. For more information see our preliminary webpage http://www.inf.fu-berlin.de/~cg01 or contact cg01@inf.fu-berlin.de (effective August 8, 2000). ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From dmanet-admin@zpr.uni-koeln.de Tue Aug 15 03:12:11 2000 Received: from Octopussy.MI.Uni-Koeln.DE (Octopussy.MI.Uni-Koeln.DE [134.95.166.20]) by duke.cs.duke.edu (8.9.3/8.9.3) with ESMTP id DAA03926; Tue, 15 Aug 2000 03:12:00 -0400 (EDT) Received: from Octopussy (localhost [127.0.0.1]) by Octopussy.MI.Uni-Koeln.DE (8.9.1/8.9.1) with ESMTP id JAA14263; Tue, 15 Aug 2000 09:07:09 +0200 (MET DST) Received: (from dmalist@localhost) by Octopussy.MI.Uni-Koeln.DE (8.9.1/8.9.1) id JAA14218 for dmanet@zpr.uni-koeln.de; Tue, 15 Aug 2000 09:06:58 +0200 (MET DST) Received: from math.uni-muenster.de (MATH.UNI-MUENSTER.DE [128.176.182.85]) by Octopussy.MI.Uni-Koeln.DE (8.9.1/8.9.1) with ESMTP id OAA21064 for ; Tue, 8 Aug 2000 14:31:55 +0200 (MET DST) Received: from voronoi.uni-muenster.de (voronoi [128.176.182.122]) by math.uni-muenster.de (8.9.1a/8.9.0) with ESMTP id OAA14446; Tue, 8 Aug 2000 14:31:23 +0200 (MET DST) Received: (from jan@localhost) by voronoi.uni-muenster.de (8.9.1a/8.9.0) id OAA12483; Tue, 8 Aug 2000 14:31:18 +0200 (MET DST) From: Jan Vahrenhold MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Message-ID: <14735.64913.67406.228329@math.uni-muenster.de> Date: Tue, 8 Aug 2000 14:31:13 +0200 (MET DST) To: DMANET@zpr.uni-koeln.de, compgeom-announce@research.bell-labs.com, fg012@gremlin.fernuni-hagen.de, fg-db@informatik.uni-rostock.de X-Mailer: VM 6.72 under 21.1 (patch 3) "Acadia" XEmacs Lucid Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by Octopussy.MI.Uni-Koeln.DE id OAA21065 Subject: [DMANET] Job Announcement (in German) Sender: dmanet-admin@zpr.uni-koeln.de Errors-To: dmanet-admin@zpr.uni-koeln.de X-BeenThere: dmanet@zpr.uni-koeln.de X-Mailman-Version: 2.0beta5 Precedence: bulk List-Id: DISCRETE MATHEMATICS AND ALGORITHMS Status: RO Content-Length: 2507 Lines: 76 --- Apologies if you recieve this message more than once! --- Am Institut für Informatik des Fachbereichs Mathematik und Informatik der Westfälischen Wilhelms-Universität Münster ist zum 01.10.2000 eine Teilzeitstelle (28 Stunden 52 Minuten) als wissenschaftliche/r Mitarbeiter/in Verg.-Gr. IIa BAT zu besetzen. Die Stelle ist zunächst für die Dauer von zwei Jahren befristet. Von den Bewerber/-innen wird die Mitarbeit in Forschung und Lehre sowie die Beteiligung an der Selbstverwaltung erwartet. Es besteht die Möglichkeit zur Promotion. Voraussetzung für eine Bewerbung ist ein abgeschlossenes Informatikstudium oder ein vergleichbares Studium an einer wissenschaftlichen Hochschule. Erwartet werden zudem vertiefte Kenntnisse in den Bereichen Algorithmische Geometrie und/oder Datenbanken bzw. die Bereitschaft, sich in eines der genannten Themengebiete einzuarbeiten. Bewerbungsschluss: 15.09.2000 Schwerbehinderte werden bei gleicher Qualifikation bevorzugt. Die Westfälische Wilhelms-Universität will eine Erhöhung des Frauenanteils dort erreichen, wo Frauen unterrepräsentiert sind und fordert deshalb besonders Frauen auf, sich zu bewerben.   Bewerbungen werden erbeten an: Herrn Prof. Dr. Klaus Hinrichs Westfälische Wilhelms-Universität Münster Fachbereich Mathematik und Informatik Institut für Informatik Einsteinstr. 62 48149 Münster Tel.: 0251 / 83 - 3 37 52 Fax: 0251 / 83 - 3 37 55 E-Mail: khh@informatik.uni-muenster.de -- ---------------------------------------------------------------------------- Dr. Jan Vahrenhold Westfaelische Wilhelms-Universitaet Institut fuer Informatik Einsteinstr. 62, 48149 Muenster, Germany mailto:jan.vahrenhold@math.uni-muenster.de Tel.: +49-251/83-38444 http://www.uni-muenster.de/informatik/users/jan/ FAX : +49-251/83-33755 ********************************************************** * * 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 compgeom-owner@research.bell-labs.com Thu Aug 31 16:11:34 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA12506 for ; Thu, 31 Aug 2000 16:11:32 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Aug 31 16:09:25 EDT 2000 Received: from grubby.research.bell-labs.com by netlib2; Tue Aug 8 08:33:04 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Tue Aug 8 08:31:59 EDT 2000 Received: from math.uni-muenster.de ([128.176.182.85]) by dusty; Tue Aug 8 08:31:58 EDT 2000 Received: from voronoi.uni-muenster.de (voronoi [128.176.182.122]) by math.uni-muenster.de (8.9.1a/8.9.0) with ESMTP id OAA14446; Tue, 8 Aug 2000 14:31:23 +0200 (MET DST) Received: (from jan@localhost) by voronoi.uni-muenster.de (8.9.1a/8.9.0) id OAA12483; Tue, 8 Aug 2000 14:31:18 +0200 (MET DST) From: Jan Vahrenhold MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Message-ID: <14735.64913.67406.228329@math.uni-muenster.de> Date: Tue, 8 Aug 2000 14:31:13 +0200 (MET DST) To: DMANET@zpr.uni-koeln.de, compgeom-announce@research.bell-labs.com, fg012@gremlin.fernuni-hagen.de, fg-db@informatik.uni-rostock.de Subject: Job Announcement (in German) X-Mailer: VM 6.72 under 21.1 (patch 3) "Acadia" XEmacs Lucid Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by duke.cs.duke.edu id QAA12506 Status: RO Content-Length: 2167 Lines: 67 --- Apologies if you recieve this message more than once! --- Am Institut für Informatik des Fachbereichs Mathematik und Informatik der Westfälischen Wilhelms-Universität Münster ist zum 01.10.2000 eine Teilzeitstelle (28 Stunden 52 Minuten) als wissenschaftliche/r Mitarbeiter/in Verg.-Gr. IIa BAT zu besetzen. Die Stelle ist zunächst für die Dauer von zwei Jahren befristet. Von den Bewerber/-innen wird die Mitarbeit in Forschung und Lehre sowie die Beteiligung an der Selbstverwaltung erwartet. Es besteht die Möglichkeit zur Promotion. Voraussetzung für eine Bewerbung ist ein abgeschlossenes Informatikstudium oder ein vergleichbares Studium an einer wissenschaftlichen Hochschule. Erwartet werden zudem vertiefte Kenntnisse in den Bereichen Algorithmische Geometrie und/oder Datenbanken bzw. die Bereitschaft, sich in eines der genannten Themengebiete einzuarbeiten. Bewerbungsschluss: 15.09.2000 Schwerbehinderte werden bei gleicher Qualifikation bevorzugt. Die Westfälische Wilhelms-Universität will eine Erhöhung des Frauenanteils dort erreichen, wo Frauen unterrepräsentiert sind und fordert deshalb besonders Frauen auf, sich zu bewerben.   Bewerbungen werden erbeten an: Herrn Prof. Dr. Klaus Hinrichs Westfälische Wilhelms-Universität Münster Fachbereich Mathematik und Informatik Institut für Informatik Einsteinstr. 62 48149 Münster Tel.: 0251 / 83 - 3 37 52 Fax: 0251 / 83 - 3 37 55 E-Mail: khh@informatik.uni-muenster.de -- ---------------------------------------------------------------------------- Dr. Jan Vahrenhold Westfaelische Wilhelms-Universitaet Institut fuer Informatik Einsteinstr. 62, 48149 Muenster, Germany mailto:jan.vahrenhold@math.uni-muenster.de Tel.: +49-251/83-38444 http://www.uni-muenster.de/informatik/users/jan/ FAX : +49-251/83-33755 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Aug 31 16:13:18 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA12591 for ; Thu, 31 Aug 2000 16:13:15 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Aug 31 16:11:19 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Fri Aug 18 10:41:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Aug 18 10:40:40 EDT 2000 Received: from cssvr17.cs.ust.hk ([143.89.41.167]) by dusty; Fri Aug 18 10:40:39 EDT 2000 Received: from cssg18.cs.ust.hk (cssg18.cs.ust.hk [143.89.128.204]) by cssvr17.cs.ust.hk (8.10.1/8.10.1) with ESMTP id e7IEeZW15543 for ; Fri, 18 Aug 2000 22:40:35 +0800 (HKT) From: "Dr. George Baciu" Received: (from gbaciu@localhost) by cssg18.cs.ust.hk (8.8.8/8.7.3) id WAA10327 for compgeom-announce@research.bell-labs.com; Fri, 18 Aug 2000 22:40:36 +0800 (HKT) Message-Id: <200008181440.WAA10327@cssg18.cs.ust.hk> Subject: GTEC'01 - First call for papers To: compgeom-announce@research.bell-labs.com Date: Fri, 18 Aug 2000 22:40:36 +0800 (HKT) X-Mailer: ELM [version 2.5 PL0] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 9034 Lines: 212 ----------------------------------------------------------------------------- GTEC'01: THE FIRST INTERNATIONAL GAME TECHNOLOGY CONFERENCE & IDEA EXPO 2001 18 - 21 January 2001 Hong Kong Convention Centre Sponsored by HKDEA In cooperation with The Multimedia Innovation Centre, The Hong Kong Polytechnic University, The Hong Kong University of Science and Technology ----------------------------------------------------------------------------- OBJECTIVES: The commercial success of 3D games attests to one of the most comprehensive technological revolutions of the past decade. It has brought together the latest developments in user interfaces, computer graphics, video and cinematic special effects, simulations, virtual reality, artificial intelligence, expert systems, computer networking, software and hardware design. GTEC is poised to become one of the largest forums for the dissemination of the research and development in 3D games and interactive digital entertainment technology. The IDEA Expo will feature the "Original Pavilion" which aims to educate IT professionals, computer users and the general public on the software development industry and its value in society. The Original Pavilion will be jointly represented by the trade associations, the interactive entertainment industry, public bodies from the HKSAR Government, Japan, Europe and USA. ----------------------------------------------------------------------------- ON THE WEB: Current web server undergoing active changes: http://www.cs.ust.hk/gtec Future server, currently under construction: http://www.gametechnology.org ----------------------------------------------------------------------------- SUBMISSIONS: Submissions of articles, tutorials and panel sessions are sought in artistic 2D and 3D design, user interfaces, 2D and 3D computer graphics and hardware support, artificial intelligence, fast digital networks and protocols, parallel and distributed systems, internet and massively multiplayer game design, video processing, computer vision and speech synthesis, business, marketing and the general impact of on-line entertainment. Papers and proposals should be prepared and submitted in electronic PDF format, maximum 10 pages, single-spaced, with a font size of no less than 10pt. Ftp service for uploading electronic documents will be available shortly on the conference web server. Further information will be available at: http://www.cs.ust.hk/gtec We will soon be moving to: http://www.gametechnology.org ----------------------------------------------------------------------------- DEADLINES: 15 October 2000 Papers and proposals for tutorials and panel sessions 01 December 2000 Notification of acceptance 15 December 2000 Final submissions 18-21 January 2001 GTEC'01 Conference and Expo ----------------------------------------------------------------------------- HONORARY INVITED SPEAKERS INCLUDE: Professor Tosiyatsu L. Kunii, Hosei University, University of Tokyo, Founding President of Aizu University, Japan. Dr. Lily Chiang, President of E1 Media Technology Limited, Hong Kong. Mr. Douglas Lowenstein, President of the Interactive, Digital and Software Association, and owner of the Electronic Entertainment Expo, USA. Mr. Kagemasa Kozuki, President of Computer Entertainment Software Association, Tokyo, Japan. Mr. Roger Bennett, Director of European Leisure Software Publishers Association. ----------------------------------------------------------------------------- PROGRAM COMMITTEE: Ishfaq Ahmad Hong Kong University of Science & Technology Hong Kong Edward Angel University of New Mexico USA Norman Badler University of Pennsylvania USA Gladimir Baranowsky University of Waterloo Canada Kelly Booth University of British Columbia Canada John Buchanan Electronic Arts Canada Grigore C. Burdea Rutgers University USA Alan Chalmers Bristol University UK Osbert Chen DreamForce Studios Taiwan Roland Chin Hong Kong University of Science & Technology Hong Kong Daniel Cohen-OR Tel Aviv University Israel Tharam Dillon Hong Kong Polytechnic University Hong Kong Dieter Fellner TU Brushwick Germany Dave Forsey Radical Entertainment Canada John Funge Sony Computer Entertainment America USA Borko Furht Florida Atlantic University USA Mark Green University of Alberta Canada Wolfgang Heidrich University of British Columbia Canada Andrew Horner Hong Kong University of Science & Technology Hong Kong Hong-Yang Hsu Feng-Chia University Taiwan Horrace Ip City University of Hong Kong Hong Kong Mark Kilgard NVIDIA USA Tosiyatsu L. Kunii Hosei University Japan Paul Lalonde Electronic Arts Canada Rynson Lau City University of Hong Kong Hong Kong Francis Lau Hong Kong University Hong Kong Ming Lin University of North Carolina at Chapel Hill USA Frederick H. Lochovsky Hong Kong University of Science & Technology Hong Kong Hongjun Lu Hong Kong University of Science & Technology Hong Kong Dinesh Manocha University of North Carolina at Chapel Hill USA Dimitris Metaxas University of Pennsylvania USA Harry A. Miller IV Gathering Of Developers USA Jogesh K. Muppala Hong Kong University of Science & Technology Hong Kong Karol Myszkowski Max Plank Institute Germany Bruce Naylor ORCUS USA Adele Newton University of Toronto Canada Kenji Ohmori Hosei University Japan Hans-Peter Siedel Max-Planck-Institut Informatik Germany Philipp Slusallek Universitat Des Saarlandes Germany Wolfgang Strasser Tuebingen University Germany Wim Sweldens Bell Laboratories USA Susumu Tachi University of Tokyo Japan Demetri Terzopoulos New York University USA Andries van Dam Brown University USA Michiel van de Panne University of Toronto/Motion Playground Canada Kees van Overveld TU Eindhoven Netherlands Jack van Wjik TU Eindhoven Netherlands Wenping Wang Hong Kong University Hong Kong Andrew K.C. Wong University of Waterloo Canada Lian Wen Zhang Hong Kong University of Science & Technology Hong Kong Rami Zwick Hong Kong University of Science & Technology Hong Kong ----------------------------------------------------------------------------- ORGANIZING COMMITTEE: Lee Cashell JAFCO Investments Hong Kong Trevor Chan Enlight Software Hong Kong Gary Chan Hong Kong Polytechnic University Hong Kong Boris Cheng Alta Multimedia Hong Kong Jonnathan Cheng IncubAsia Hong Kong Kenneth Cheung Hong Kong Polytechnic University Hong Kong Victor Dao Gameone Ltd. Hong Kong Keith Hui Hong Kong University of Science & Technology Hong Kong Fanny Leung Hong Kong Polytechnic University Hong Kong Gerry Liao SGM Magazine Taiwan Johnny Mak Hong Kong Polytechnic University Hong Kong Cliff K. F. So Hong Kong University of Science & Technology Hong Kong Wingo S. K. Wong Hong Kong University of Science & Technology Hong Kong Russell Yeh Alta Multimedia Hong Kong ----------------------------------------------------------------------------- CONFERENCE ORGANIZERS: George Baciu General Conference and Program Chair, The Hong Kong University of Science and Technology Gino Yu Program Chair, Multimedia Innovation Centre, The Hong Kong Polytechnic University Wen Chuang Vice-chair and Organizing Committee Chair, Indiana University Sunny K.S. Liu Organizing Committee Chair and IDEA Expo Chair ----------------------------------------------------------------------------- IN FURTHER COOPERATION WITH: Multimedia Innovation Centre, Hong Kong Polytechnic University The Hong Kong Digital Entertainment Association (HKDEA) The Hong Kong Polytechnic University The Hong Kong University of Science and Technology The Hong Kong General Chamber of Commerce The Hong Kong Productivity Council The Hong Kong Industry Trade Department The Hong Kong Interactive, Digital & Electronic Entertainment The Hong Kong Education Department, HKSAR The Hong Kong Electronic Industries Association The Hong Kong Industrial Technology Centre Corporation The Hong Kong Industrial Technology Federation Ltd. The Hong Kong Computer Society The Hong Kong Internet Service Providers Association ----------------------------------------------------------------------------- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Aug 31 16:13:24 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA12595 for ; Thu, 31 Aug 2000 16:13:22 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Aug 31 16:10:31 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Aug 10 10:45:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Aug 10 10:43:45 EDT 2000 Received: from internal-gw.email.uncg.edu ([152.13.2.73]) by dusty; Thu Aug 10 10:43:44 EDT 2000 Received: from maggie.uncg.edu (maggie.uncg.edu [152.13.2.75]) by internal-gw.email.uncg.edu (8.9.3/8.9.3) with SMTP id KAA25248; Thu, 10 Aug 2000 10:43:42 -0400 (EDT) Date: Thu, 10 Aug 2000 10:43:42 -0400 (EDT) From: Jie Wang To: compgeom-announce@research.bell-labs.com cc: Jie Wang Subject: COCOON'01 Call For Papers Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3870 Lines: 107 COCOON'01 CALL FOR PAPERS The 7th Annual International Computing and Combinatorics Conference (COCOON'01) will be held in August 20-22, 2001, in Guilin, China. Original research papers in the areas of theoretical computer science and combinatorics related to computing are solicited. In addition to theoretical results, we are particularly interested in submissions that report on experimental and applied research of general algorithmic interest. Special consideration will be given to research that is motivated by real-world problems. Experimental and applied papers are expected to show convincingly the usefulness and efficiency of the algorithms discussed in a practical setting. Typical, but not exclusive, topics of interest include: Algorithms and data structures; Automata, languages, logic, and computability; Combinatorics related to algorithms and complexity; Complexity theory; Computational algebra, biology, geometry, and number theory; Computational learning theory and knowledge discovery; Cryptography, reliability and security, and database theory; Graph drawing and information visualization; Graph theory, communication networks, and optimization; Parallel and distributed computing; Experimental analysis of algorithms. SUBMISSIONS: COCOON'01 will accept only electronic submissions. For detailed instructions on electronic submissions please check http://sigact.acm.org/~cocoon01/COCOON01.html, or send e-mail to cocoon01@sigact.acm.org with the subject HELP. Each submission should start with the title of the paper, the author's name, affiliation, and e-mail address, and a short abstract summarizing the main results of the paper. This should be followed by a scholarly exposition of the ideas, techniques, and a full description of the results achieved. A clear indication of the motivation and comparison with prior or related work should be presented. The paper should not exceed 10 pages using 11 point or larger font. Submissions that deviate significantly from these guidelines and PostScript submissions that are unprintable or formatted for paper size other than 8.5 x 11 inch paper risk rejection without consideration of their merits. The proceedings of the conference will be published by Springer-Verlag in the Lecture Notes in Computer Science series, and will be available for distribution at the conference. The Hao Wang Award will be given to the paper of the best scientific merit judged by the program committee. The program committee may decline to make the award, or may split it among several papers. INVITED SPEAKERS: Bernard Chazelle (Princeton University, USA) Avi Wigderson (The Hebrew University of Jerusalem, Israel) PROGRAM COMMITTEE: Eric Allender (USA), Bernard Chazelle (USA), Danny Chen (USA), Jianer Chen (USA), Francis Chin (Hong Kong), Kyung-Yong Chwa (Korea), Rod Downey (New Zealand), Erich Gradel (Germany), Yuri Gurevich (USA, co-chair), Steven Homer (USA), Toshihide Ibaraki (Japan), Tao Jiang (USA), Ker-I Ko (USA), D.T. Lee (Taiwan), Xuemin Lin (Australia), Maurice Nivat (France), R. Ravi (USA), Rudiger Reischuk (Germany) Seinosuke Toda (Japan), Jie Wang (USA, co-chair), Lusheng Wang (Hong Kong), Guoliang Xue (USA), Mihalis Yannakakis (USA) ORGANIZING COMMITTEE CHAIR: Ding-Zhu Du (USA) IMPORTANT DATES: Deadline for Submission: February 19, 2001 Notification of Acceptance: April 9, 2001 Final Version: May 7, 2001 CONFERENCE WEB SITE: http://cocoon01.uncg.edu Information about the city of Guilin and tours can be found at http://www.chinahighlights.com/cities/guilin.htm. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Aug 31 16:13:33 2000 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA12607 for ; Thu, 31 Aug 2000 16:13:31 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Aug 31 16:11:40 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Sat Aug 26 00:09:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sat Aug 26 00:07:40 EDT 2000 Received: from cs.brown.edu ([128.148.32.100]) by dusty; Sat Aug 26 00:07:39 EDT 2000 Received: from cs.brown.edu (loki.cs.brown.edu [128.148.38.50]) by cs.brown.edu (8.9.3/8.9.3) with ESMTP id AAA12684 for ; Sat, 26 Aug 2000 00:07:02 -0400 (EDT) Sender: jdsl@cs.brown.edu Message-ID: <39A74238.2F5B98A@cs.brown.edu> Date: Sat, 26 Aug 2000 00:06:16 -0400 From: JDSL Team X-Mailer: Mozilla 4.73 [en] (X11; U; SunOS 5.7 sun4u) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: JDSL 2.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1915 Lines: 52 The JDSL 2.0 Team is pleased to announce the release of JDSL, the Data Structures Library in Java, version 2.0. It is available from the JDSL web site http://www.cs.brown.edu/cgc/jdsl/ JDSL 2.0 is a collection of Java interfaces and classes that implement fundamental data structures and algorithms, such as: - sequences, trees, priority queues, search trees, hash tables - sorting and searching algorithms - graphs - graph traversals, shortest path, minimum spanning tree JDSL 2.0 is suitable for use by researchers, professional programmers, educators, and students. It comes with extensive documentation, including detailed javadoc, an overview, a tutorial with seven lessons, and several associated research papers. It is available free of charge for noncommercial use. Commercial licenses are also offered. JDSL 2.0 was developed at the Center for Geometric Computing of Brown University, in collaboration with Algomagic Technologies, Inc. It is based on research and educational work led by Michael Goodrich and Roberto Tamassia. Comments and questions should be addressed to jdsl@cs.brown.edu. The JDSL 2.0 Team: - Roberto Tamassia - Michael T. Goodrich - Luca Vismara - Mark Handy - Robert Cohen - Benoit Hudson - Ryan S. Baker - Natasha Gelfand - Galina Shubina - Michael Boilen - Maurizio Pizzonia - Keith Schmidt - Ulrik Brandes - Lucy Perry - Andrew Schwerin ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Aug 31 16:15:30 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id QAA12646 for ; Thu, 31 Aug 2000 16:15:28 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Aug 31 16:12:23 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Wed Aug 30 17:27:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Aug 30 17:26:00 EDT 2000 Received: from amirani.ams.sunysb.edu ([129.49.6.2]) by dusty; Wed Aug 30 17:25:59 EDT 2000 Received: from ams.sunysb.edu (joepc.ams.sunysb.edu [129.49.6.238]) by amirani.ams.sunysb.edu (8.9.1a/8.9.1) with ESMTP id RAA27655; Wed, 30 Aug 2000 17:25:48 -0400 (EDT) Message-Id: <200008302125.RAA27655@amirani.ams.sunysb.edu> Date: Wed, 30 Aug 2000 15:27:51 -0400 (EDT) From: jsbm@ams.sunysb.edu Subject: Call for papers: 10th Annual Fall Workshop on CG To: compgeom-announce@research.bell-labs.com cc: jsbm@ams.sunysb.edu MIME-Version: 1.0 Content-Type: TEXT/plain; CHARSET=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 4326 Lines: 127 CALL FOR PAPERS/PARTICIPATION TENTH ANNUAL FALL WORKSHOP ON COMPUTATIONAL GEOMETRY October 27--28, 2000 http://www.ams.sunysb.edu/~jsbm/cgworkshop.html We are pleased to announce the tenth in a series of annual fall workshops on Computational Geometry. This workshop series, founded under the sponsorship of the Mathematical Sciences Institute (MSI) at Stony Brook (with funding from the U.S. Army Research Office), has continued during 1996-1999 under the sponsorship of the Center for Geometric Computing, a collaborative center of Brown, Duke, and Johns Hopkins Universities, also funded by the U.S. Army Research Office. This year, for the tenth in the workshop series, the workshop returns to the campus of the University at Stony Brook. Scope and Format The aim of this workshop is to bring together students and researchers from academia and industry, to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to: Algorithmic methods in geometry I/O-scalable geometric algorithms Animation of geometric algorithms Computer graphics Solid modeling Geographic information systems Computational metrology Graph drawing Experimental studies Geometric data structures Implementation issues Robustness Computer vision Robotics Computer-aided design Mesh generation Manufacturing applications of geometry Following the tradition of the previous workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. There will also be an Open Problem Session in order to promote a free exchange of questions and research challenges. We strongly encourage registration in advance, through the workshop web site; registration can also be completed on-site. There will be no registration fee. Students are especially encouraged to attend and participate! We expect to be able to provide free accommodations (couch space, floor space, etc.) for visiting students with some of Stony Brook's local graduate student hosts who are taking part in the organization. Invited speakers To be Announced (Confirmed so far: George Hart, Micha Sharir, Ileana Streinu) Submissions Authors are invited to submit abstracts for talks to be given at the workshop. Please send an abstract (up to 2 pages) and a draft of a paper (if you have one). E-mail submissions are encouraged; send to cgworkshop@ams.sunysb.edu. Ideally, the abstract should be a PDF, PostScript, or LaTeX, file, for ease in assembling the abstract booklet. Abstracts can also be sent by regular mail to: Joseph Mitchell Department of Applied Mathematics and Statistics University at Stony Brook Stony Brook, NY 11794-3600 Submissions should arrive by October 3, 2000. Authors will be notified of acceptance by October 10, 2000. A booklet of abstracts will be distributed at the workshop and made available electronically on the Web. There will be no formal proceedings for this workshop. Program Committee Pankaj K. Agarwal (Duke University), Esther M. Arkin (Stony Brook), Michael A. Bender (Stony Brook), Michael T. Goodrich (Johns Hopkins University), Joseph S. B. Mitchell (Stony Brook), Steven S. Skiena (Stony Brook), Roberto Tamassia (Brown University) Note: For more information about the workshop, send mail to cgworkshop@ams.sunysb.edu. Further information will be posted to our web site: http://www.ams.sunysb.edu/~jsbm/cgworkshop.html as soon as it is available. Important Dates Deadline for submission Oct 3, 2000 Notification of acceptance Oct 10, 2000 Conference Oct 27-28, 2000 Sponsored by the Department of Applied Mathematics and Statistics and the Department of Computer Science and Engineering, State University of New York at Stony Brook, with partial support from the National Science Foundation. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Sun Sep 10 19:37:31 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id TAA17893 for ; Sun, 10 Sep 2000 19:37:30 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Sep 10 19:29:33 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Sat Sep 2 14:21:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sat Sep 2 14:20:54 EDT 2000 Received: from largo.eecs.tufts.edu ([130.64.23.33]) by dusty; Sat Sep 2 14:20:53 EDT 2000 Received: from andante.eecs.tufts.edu (andante [130.64.23.37]) by largo.eecs.tufts.edu (8.9.1a/8.9.1) with ESMTP id OAA18920 for ; Sat, 2 Sep 2000 14:20:34 -0400 (EDT) From: Diane Souvaine Received: (from dls@localhost) by andante.eecs.tufts.edu (8.9.3+Sun/8.9.1) id OAA16373 for compgeom-announce@research.bell-labs.com; Sat, 2 Sep 2000 14:20:51 -0400 (EDT) Date: Sat, 2 Sep 2000 14:20:51 -0400 (EDT) Message-Id: <200009021820.OAA16373@andante.eecs.tufts.edu> To: compgeom-announce@research.bell-labs.com Subject: ACM Symposium on Computional Geometry 2001: Call for Papers Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 6409 Lines: 119 ******************************************************************************* CALL FOR PAPERS Seventeenth Annual Symposium on COMPUTATIONAL GEOMETRY June 3--5, 2001 Tufts University, Medford, Massachusetts http://www.eecs.tufts.edu/EECS/scg01 Sponsored by ACM SIGACT and ACM SIGGRAPH The Seventeenth Annual Symposium on Computational Geometry, featuring an applied track, a theoretical track, and a video review, will be held at Tufts University, Medford, Massachusetts. We invite high-quality submissions in the following areas: * geometric algorithms or combinatorial geometry, for the theoretical track, OR * implementation issues or applications of computational geometry, for the applied track. The proceedings, with the papers of both tracks, will be distributed at the symposium and will subsequently be available for purchase from ACM. A selection of papers will be invited to special issues of journals. During the conference, sessions of presentations will alternate between the two tracks, rather than being in parallel. Topics for the theoretical track include, but are not limited to design and theoretical analysis of geometric algorithms and data structures; lower bounds for geometric problems; and discrete and combinatorial geometry. Topics for the applied track include, but are not limited to experimental analysis of algorithms and data structures; mathematical and numerical issues arising from implementations; and novel uses of computational geometry in other disciplines, such as robotics, computer graphics, geometric and solid modeling, manufacturing, geographical information systems, and molecular biology. Electronic submissions are preferred for the THEORETICAL TRACK (see web page above for instructions), but authors may instead mail 8 copies of an extended abstract to arrive by *****DECEMBER 6, 2000****** to David Eppstein Dept. of Information Computer Science, University of California, Irvine, Irvine, CA 92697-3425 USA. Phone: (949) 824-6384; Email: eppstein@ics.uci.edu Electronic submissions are preferred for the APPLIED TRACK (see web page above for instructions), but authors may instead mail 10 copies of an extended abstract to arrive by *****DECEMBER 6, 2000****** to Dan Halperin School of Computer Science Schreiber Building, Rm 219 Tel Aviv University Tel Aviv 69978 Israel Phone: +972-3-640-6478; Email: halperin@math.tau.ac.il IMPORTANT DATES: December 6, 2000: Papers due, both tracks February 13, 2001: Video submissions due February 15, 2001: Notification of acceptance or rejection of papers March 1, 2001: Notification of acceptance or rejection of videos March 15, 2001: Camera-ready papers due April 15, 2001: Final versions of videos due June 3--5, 2001: Symposium Papers that primarily address practical issues and implementation experience, even if not tied to a particular application domain, should be submitted to the applied track. Papers that primarily prove theorems should be submitted to the theoretical track. Most experimental work should be submitted to the applied track; an exception would be experiments in support of mathematical investigations. Submissions to one track may be forwarded to the other for consideration, unless the authors have explicitly stated interest in one track only. Papers should be submitted in the form of an extended abstract. Papers should begin with the title of the paper, each author's name, affiliation, and e-mail address, followed by a succinct statement of the problems and goals that are considered in the paper, the main results achieved, the significance of the work in the context of previous research, and a comparison to past research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages, using 11 point or larger font and with at least one-inch margins all around. For cases in which the authors consider it absolutely essential to include additional technical details that do not fit into 10 pages, these details may be added in a clearly marked appendix that should appear after the body of the paper and the references; this appendix will not be regarded as a part of the submission and will be considered only at the program committee's discretion. Abstracts in hard copy must be received by December 6, 2000, or postmarked by November 29 and sent airmail. Abstracts in electronic form are due by December 6, 5:00 PM EST. These are firm deadlines: late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 2001. A full version of each contribution in final form will be due by March 15, 2001 for inclusion in the proceedings. Theoretical Track Program Committee: Applied Track Program Committee: Boris Aronov (Polytechnic U, Brooklyn) Nancy Amato (Texas A ) Otfried Cheong (Utrecht U) Karl Bo"hringer (U Washington, Seattle) Jesu's De Loera (UC Davis) Franca Gianini (IMA, Genova) David Eppstein, Chair (UC Irvine) Lutz Kettner (UNC Chapel Hill) Sariel Har-Peled (UI Urbana Champaign) Dan Halperin, Chair (Tel Aviv U) Piotr Indyk (MIT) Kurt Mehlhorn (MPII, Saarbru"cken) Edgar A. Ramos (MPII Saarbru"cken) Mark Overmars (Utrecht U) Ileana Streinu (Smith College) Seth Teller (MIT) Peter Widmayer (ETH Zurich) Conference Chair: Mariette Yvinec (INRIA Sophia-Antipolis) Diane L.Souvaine (Tufts U) ******************************************************************************* ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Sun Sep 10 19:37:33 2000 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by duke.cs.duke.edu (8.9.3/8.9.3) with SMTP id TAA17900 for ; Sun, 10 Sep 2000 19:37:32 -0400 (EDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Sep 10 19:29:20 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Sat Sep 2 13:49:04 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Sat Sep 2 13:48:08 EDT 2000 Received: from largo.eecs.tufts.edu ([130.64.23.33]) by dusty; Sat Sep 2 13:48:07 EDT 2000 Received: from andante.eecs.tufts.edu (andante [130.64.23.37]) by largo.eecs.tufts.edu (8.9.1a/8.9.1) with ESMTP id NAA18630 for ; Sat, 2 Sep 2000 13:47:48 -0400 (EDT) From: Diane Souvaine Received: (from dls@localhost) by andante.eecs.tufts.edu (8.9.3+Sun/8.9.1) id NAA15704 for compgeom-announce@research.bell-labs.com; Sat, 2 Sep 2000 13:48:05 -0400 (EDT) Date: Sat, 2 Sep 2000 13:48:05 -0400 (EDT) Message-Id: <200009021748.NAA15704@andante.eecs.tufts.edu> To: compgeom-announce@research.bell-labs.com Subject: ACM Symposium on Computational Geometry 2001: Call for Videos Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3451 Lines: 71 *********************************************************************************** CALL FOR VIDEOS 10th Annual Video Review of Computational Geometry to be presented at the Seventeenth Annual Symposium on Computational Geometry June 3--5, 2001 Tufts University, Medford, Massachusetts Videos are sought for a video review of computational geometry. BACKGROUND: This video review showcases the use of visualization in computational geometry for exposition and education, as an interface and a debugging tool in software development, and for the visual exploration of geometry in research. Algorithm animations, visual explanations of structural theorems, descriptions of applications of computational geometry, and demonstrations of software systems are all appropriate. Videos that accompany papers or communications submitted to the technical program committee are encouraged. SUBMISSIONS: Authors should send one preview copy of a videotape to the address below by *****FEBRUARY 13, 2001******. The videotape should be at most eight minutes long (three to five minutes, preferred), and be in VHS NTSC or VHS PAL format. Each video tape must be accompanied by a one- or two-page description of the material shown in the video, and where applicable, the techniques used in the implementation. Please format descriptions following the guidelines for ACM proceedings. Additional material describing the contents of the videos, such as the full text of accompanying papers, may also be included. Textual material may be submitted electronically by e-mailing either the URL of a PostScript file (preferred) or the PostScript file itself to . If electronic submission is impossible, authors should include five hardcopies of the accompanying text with their video. Videotapes and accompanying text should be sent to Dinesh Manocha Department of Computer Science University of North Carolina Chapel Hill, NC 27599-3175 USA Phone: (919) 962-1749; Email: dm@cs.unc.edu For customs purposes, it is best to declare a value of $5. If you have questions, please contact the committee chair. NOTIFICATION: Authors will be notified of acceptance or rejection, and given reviewers' comments by March 1, 2001. For each accepted video, the final version of the textual description will be due by March 15, 2001 for inclusion in the proceedings. Final versions of accepted videos will be due April 15, 2001 in the best format available. The accepted videos will be edited onto one tape, which will be shown at the conference and will be distributed to the participants. Video Program Committee: Jonathan Cohen (Johns Hopkins) Herbert Edelsbrunner (Duke) Subodh Kumar (Johns Hopkins) Ming C. Lin (UNC Chapel Hill) Dinesh Manocha, Chair (UNC Chapel Hill) Amitabh Varshney (U of Maryland) ************************************************************************************* ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Sep 21 12:53:20 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id MAA17683 for ; Thu, 21 Sep 2000 12:53:20 -0400 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id MAA23533 for ; Thu, 21 Sep 2000 12:52:49 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Sep 21 13:50:17 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Sep 14 17:39:07 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Sep 14 17:38:46 EDT 2000 Received: from hemi.llnl.gov ([134.9.13.44]) by dusty; Thu Sep 14 17:38:45 EDT 2000 Received: from localhost (pascucci@localhost) by hemi.llnl.gov (980427.SGI.8.8.8/980728.SGI.AUTOCF) via ESMTP id OAA46462 for ; Thu, 14 Sep 2000 14:38:42 -0700 (PDT) Date: Thu, 14 Sep 2000 14:38:42 -0700 From: Valerio Pascucci To: compgeom-discuss@research.bell-labs.com Subject: 3D Sierpinski Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 421 Lines: 15 Does anyone can give a pointer to the 3D definition of the Sierpinski space filling curve? In Sagan book Chapter 5 I have found only the 2D case. Thanks -- Valerio ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Sep 21 12:53:23 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id MAA17687 for ; Thu, 21 Sep 2000 12:53:23 -0400 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id MAA23540 for ; Thu, 21 Sep 2000 12:52:50 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Sep 21 13:51:40 EDT 2000 Received: from grubby.research.bell-labs.com by netlib2; Wed Sep 13 13:33:03 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Sep 13 13:32:23 EDT 2000 Received: from barrichello.cs.ucr.edu ([138.23.169.5]) by dusty; Wed Sep 13 13:32:20 EDT 2000 Received: by barrichello.cs.ucr.edu (Postfix, from userid 2) id DE3A91CDC; Wed, 13 Sep 2000 10:32:17 -0700 (PDT) Received: from wigry.cs.ucr.edu (wigry.cs.ucr.edu [138.23.169.134]) by barrichello.cs.ucr.edu (Postfix) with ESMTP id C92A7101E for ; Wed, 13 Sep 2000 10:32:16 -0700 (PDT) Received: from localhost (marek@localhost) by wigry.cs.ucr.edu (8.9.3/8.8.8) with ESMTP id KAA17618 for ; Wed, 13 Sep 2000 10:32:10 -0700 X-Authentication-Warning: wigry.cs.ucr.edu: marek owned process doing -bs Date: Wed, 13 Sep 2000 10:32:10 -0700 (PDT) From: Marek Chrobak To: compgeom-announce@research.bell-labs.com Subject: FOCS 2000 program and registration info Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-AntiVirus: scanned for viruses by AMaViS perl-6 Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 9458 Lines: 396 FOCS 2000 The 41 st Annual IEEE Computer Society Conference on Foundations of Computer Science http://www.cs.cmu.edu/~FOCS2000 November 12-14, 2000 Redondo Beach, California Sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing In cooperation with ACM SIGACT --------------------------------------------------------- REGISTRATION The deadline for early registration is OCTOBER 16. Instructions on how to register by fax or mail can be found at http://www.cs.cmu.edu/~FOCS2000. The registration desk will be open from 6 pm to 10 pm on Saturday, and during the day on Sunday and Monday. --------------------------------------------------------- HOTEL The conference will take place at the Crowne Plaza Hotel, 300 N. Harbor Drive, Redondo Beach, CA 90277, USA. A block of rooms has been reserved in the hotel at the special rate of $125 per day, single or double. To obtain the room at this price, you need to make a reservation by OCTOBER 16. To reserve a room you can * call the hotel at 310-318-8888 or 800-368-9760, or * fill the hotel reservation form at http://www.cs.cmu.edu/~FOCS2000 and fax it to the hotel at 310-376-1930. If you make the reservation by phone, please specify that you request the special rate for IEEE FOCS 2000. --------------------------------------------------------- CORPORATE SUPPORT FOCS 2000 gratefully acknowledges financial support from IBM Research and Akamai Technologies. ========================================================= CONFERENCE PROGRAM ========================================================= SATURDAY, NOVEMBER 11, 2000 Welcome Reception 7:00 pm - 8:30pm ---------------------------------------------------------- SUNDAY, NOVEMBER 12, 2000 SESSION 1: 8:30 am - 10:10 am, Chair: David Zuckerman Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors, O. Reingold, S. Vadhan, and A. Wigderson Universality and tolerance, N. Alon, M. Capalbo, Y. Kohayakawa, V. Rodl, A. Rucinski, and E. Szemeredi Extracting randomness via repeated condensing, O. Reingold, R. Shaltiel, and A. Wigderson Extracting randomness from samplable distributions, L. Trevisan and S. Vadhan Pseudorandom generators in propositional proof complexity, M. Alekhnovich, E. Ben-Sasson, A.A. Razborov, and A. Wigderson SESSION 2: 10:30am - 12:10pm, Chair: David Williamson Random graph models for the web graph, R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal Optimization problems in congestion control, R. Karp, E. Koutsoupias, C. Papadimitriou, and S. Shenker Fairness measures for resource allocation, A. Kumar and J. Kleinberg On the approximability of trade-offs and optimal access of web sources, C.H. Papadimitriou and M. Yannakakis How bad is selfish routing?, T. Roughgarden and E. Tardos SESSION 3: 1:30pm - 2:50pm, Chair: Sanjeev Arora A polylogarithmic approximation of the minimum bisection, U. Feige and R. Krauthgamer Approximability and in-approximability results for no-wait shop scheduling problems, M. Sviridenko and G. Woeginger Nested graph dissection and approximation algorithms, S. Guha Approximating the single source unsplittable min-cost flow problem, M. Skutella SESSION 4: 3:10pm - 4:30pm, Chair: Michael Sipser Hardness of approximate hypergraph coloring, V. Guruswami, J. Hastad, and M. Sudan "Soft-decision" decoding of Chinese remainder codes, V. Guruswami, A. Sahai, and M. Sudan Super-linear time-space tradeoff lower bounds for randomized computation, P. Beame, M. Saks, X. Sun, and E. Vee On the hardness of graph isomorphism, J. Toran SESSION 5: 4:50pm - 6:10pm, R. Ravi Stable distributions, pseudorandom generators, embeddings and data stream computation, P. Indyk New data structures for orthogonal range searching, S. Alstrup, G.S. Brodal, and T. Rauhe Nearly optimal expected-case planar point location, S. Arya, T. Malamatos and D.M. Mount On levels in arrangements of curves, T.M. Chan FOCS Business Meeting 9:00 pm - 10:00 pm ---------------------------------------------------------- MONDAY, NOVEMBER 13, 2000 SESSION 6: 8:30 am - 10:10 am, Chair: Avrim Blum Detecting a network failure, J. Kleinberg Testing of clustering, N. Alon, S. Dar, M. Parnas, and D. Ron Testing of functions that have small width branching programs, I. Newman Testing that distributions are close, T. Batu, L. Fortnow, R. Rubinfeld, W.D. Smith, and P. White Using upper confidence bounds for online learning, P. Auer SESSION 7: 10:30am - 12:10pm, Chair: Joe Kilian Zaps and their applications C. Dwork and M. Naor Randomizing polynomials: a new representation with applications to round-efficient secure computation, Y. Ishai and E. Kushilevitz Lower bounds on the efficiency of generic cryptographic constructions, R. Gennaro and L. Trevisan Concurrent oblivious transfer, J. Garay and P. MacKenzie The relationship between public key encryption and oblivious transfer, Y. Gertner, S. Kannan, T. Malkin, O. Reingold, and M. Viswanathan SESSION 8: 1:30pm - 2:50pm, Chair: Leonard Schulman The online median problem, R. Mettu and G. Plaxton Polynomial time approximation schemes for geometric k-clustering, R. Ostrovsky and Y. Rabani Clustering data streams, S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan On clusterings: good, bad and spectral, R. Kannan, S. Vempala and A. Vetta SESSION 9: 3:10pm - 4:30pm, Chair: Leonard Schulman Fully dynamic transitive closure: breaking through the O(n^2) barrier, C. Demetrescu and G.F. Italiano Opportunistic data structures with applications, P. Ferragina and G. Manzini Cache-oblivious B-trees, M.A. Bender, E.D. Demaine, and M. Farach-Colton Using expander graphs to find vertex connectivity, H.N. Gabow SESSION 10: 4:50pm - 6:10pm, Chair: M. Szegedy On the boundary complexity of the union of fat triangles, J. Pach and G. Tardos Straighting polygonal arcs and convexifying polygonal cycles, R. Connelly, E.D. Demaine and G. Rote A combinatorial approach to planar non-colliding robot arm motion planning, I. Streinu Topological persistence and simplification, H. Edelsbrunner, D. Letscher, and A. Zomorodian Banquet and Knuth Prize Lecture 7:00 pm ---------------------------------------------------------- TUESDAY, NOVEMBER 14, 2000 SESSION 11: 8:30 am - 10:10 am, Chair: Leslie Goldberg The cover time, the blanket time, and the Matthews bound, J. Kahn, J.H. Kim, L. Lovasz, and V. H. Vu The product replacement algorithm is polynomial, I. Pak Efficient algorithms for universal portfolios, A. Kalai, and S. Vempala Sampling adsorbing staircase walks using a new Markov chain decomposition method, R. Martin and D. Randall The randomness recycler: a new technique for perfect sampling, J.A. Fill and M.L. Huber SESSION 12: 10:30am - 12:10pm, Chair: Umesh Vazirani An improved quantum Fourier transform algorithm and applications, L. Hales and S. Hallgren Fast parallel circuits for the quantum Fourier transform, R. Cleve and J. Watrous Succinct quantum proofs for properties of finite groups, J. Watrous Private quantum channels, A. Ambainis, M. Mosca, A. Tapp, and R. de Wolf The quantum complexity of set membership, J. Radhakrishnan, P. Sen, and S. Venkatesh SESSION 13: 1:30pm - 2:50pm, Leslie Goldberg Randomized rumor spreading, R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking Fast broadcasting and gossiping in radio networks, M. Chrobak, L. Gasieniec and W. Rytter Linear waste of best fit bin packing on skewed distributions, C. Kenyon and M. Mitzenmacher Optimal myopic algorithms for random 3-SAT, D. Achlioptas and G.B. Sorkin SESSION 14: 3:10pm - 4:30pm, Chair: David Williamson Hierarchical placement and network design problems, S. Guha, A. Meyerson, and K. Munagala Building Steiner trees with incomplete global knowledge, D.R. Karger and M. Minkoff Cost-distance: two metric network design, A. Meyerson, K. Munagala, and S. Plotkin Combinatorial feature selection problems, M. Charikar, V. Guruswami, R. Kumar, S. Rajagopalan, and A. Sahai SESSION 15: 4:50pm - 6:10pm, Michael Sipser The common fragment of CTL and LTL, M. Maidl On the existence of booster types, M. Herlihy and E. Ruppert Existential second-order logic over graphs: charting the tractability frontier, G. Gottlob, P. Kolatis and T. Schwentick Computing the determinant and Smith form of an integer matrix, W. Eberly, M. Giesbrecht, and G. Villard ======================================================== COMMITTEES ======================================================== Conference General Chair: Alok Aggarwal, IBM Research. Program Committee Chair: Avrim Blum, Carnegie Mellon. Program Committee: Sanjeev Arora, Avrim Blum, Faith Fich, Leslie Ann Goldberg, Michael Goodrich, Monika Henzinger, Joe Kilian, Yishay Mansour, R. Ravi, Leonard Schulman, Michael Sipser, Mario Szegedy, Umesh Vazirani, David Williamson, David Zuckerman. Local Arrangements: Marek Chrobak and Tao Jiang, University of California, Riverside. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Sep 22 12:51:49 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id MAA21484 for ; Fri, 22 Sep 2000 12:51:49 -0400 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id MAA01733 for ; Fri, 22 Sep 2000 12:51:17 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Sep 22 13:46:05 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Fri Sep 22 13:23:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Sep 22 13:21:06 EDT 2000 Received: from jinai.cs.nyu.edu ([128.122.80.169]) by dusty; Fri Sep 22 13:21:05 EDT 2000 Received: from localhost (exact@localhost) by jinai.cs.nyu.edu (8.9.1/8.9.1) with ESMTP id NAA07062; Fri, 22 Sep 2000 13:21:01 -0400 (EDT) Date: Fri, 22 Sep 2000 13:21:01 -0400 (EDT) From: Chee Yap To: compgeom-announce@research.bell-labs.com cc: yap@cs.nyu.edu, chenli@cs.nyu.edu Subject: Core Library Version 1.3 released. Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3912 Lines: 104 ===================== SOFTWARE RELEASE ANNOUNCEMENT ========================== Core Library Version 1.3 is now available for free download at http://cs.nyu.edu/exact/core/ The Core Library (CORE) is a collection of C/C++ classes to support exact computation with constructible real numbers (+,-,x,/,sqrt). Numerical nonrobustness is a widely acknowledged problem. It has proven particularly intractible in the context of geometric algorithms where numerical data and combinatorial data are intermixed in a strongly constrained manner. Recent research in the computational geometry community has demonstrated a variety of techniques that can address such problems. A basic goal of our library is to make such techniques easily accessible to the wider community of programmers and researchers. Basic CORE Features: -- ease of use: Any C/C++ programmer can now write numerical or geometric code that are fully robust. -- ease of migration: Many existing C/C++ programs can be converted into robust programs with minimal effort. -- natural and novel numerical accuracy model: Users can choose and get the numerical accuracy that best fit their applications. -- state of art technology: Precision-driven approach to exact geometric computation, best known root bounds, etc, will be incorporated into the library as the field progresses. In this way, the user's application program will automatically be upgraded (at the cost of re-compilation). -- small system: Just over 2MB (including source and documentation, compressed). It can serve as the "core" for your own applications. -- tested on Sun Sparc and Linux platforms: Earlier CORE 1.2 was also tested on SGI and Windows. What is new with CORE 1.3 ? -- improved speed: The runtime for all the samples programs in this distribution takes 55.0 seconds under CORE 1.3. Under CORE 1.2.2, the time is 1040.38 seconds. The test was performed on a Sun UltraSPARC 10, 440 MHz machine, -- improved root bounds: This yield great speedups for the important class of expressions expressions with division (e.g., expressions with rational number or floating point number inputs). -- adoption of LiDIA's number kernel: This allows the easy plug-in of alternative big number packages such as Gnu's gmp. CORE Distribution comes with CLN, one of the fastest big number packages (it implements the Schonhage-Strassen multiplication). Because of the move to LiDIA, we now support only the g++ compiler. -- improved numerical output: Only significant digits are printed, and a choice of scientific or positional formats. -- improved numerical input: With input from strings, the user can control precision of conversion, including forcing exact input. Again, choice of scientific or positional formats. -- more sample programs: Examples show how one can easily use CORE to compute transcendental constants (Pi) or functions (e.g., sin, log) to any an desired precision. An improved randomized prover for ruler-and-compass theorems, etc. For further information http://cs.nyu.edu/exact/ mailto://exact@cs.nyu.edu. We welcome your comments and input. -- Chee Yap (yap@cs.nyu.edu) Chen Li (chenli@cs.nyu.edu) September 22, 2000 | Department of Computer Science | Courant Institute of Mathematical Sciences | New York University | 251 Mercer Street | New York, NY 10012, USA ===================== SOFTWARE RELEASE ANNOUNCEMENT ========================== ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Tue Sep 26 16:32:56 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id QAA16748 for ; Tue, 26 Sep 2000 16:32:56 -0400 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id QAA07322 for ; Tue, 26 Sep 2000 16:32:22 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Sep 26 17:27:13 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon Sep 25 11:33:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Sep 25 11:31:40 EDT 2000 Received: from raven.ecs.soton.ac.uk ([152.78.70.1]) by dusty; Mon Sep 25 11:31:39 EDT 2000 Received: from penelope.ecs.soton.ac.uk (penelope.ecs.soton.ac.uk [152.78.68.135]) by raven.ecs.soton.ac.uk (8.9.3/8.9.3) with ESMTP id QAA09759 for ; Mon, 25 Sep 2000 16:31:37 +0100 (BST) Received: from ecs.soton.ac.uk (gonzales [152.78.68.136]) by penelope.ecs.soton.ac.uk (8.9.1a/8.9.1) with ESMTP id QAA01574 for ; Mon, 25 Sep 2000 16:31:37 +0100 (BST) Sender: A.J.B.Barragan-Guaymare@ecs.soton.ac.uk Message-ID: <39CF6FD8.76DAC996@ecs.soton.ac.uk> Date: Mon, 25 Sep 2000 16:31:37 +0100 From: Antonio Barragan-Guaymare X-Mailer: Mozilla 4.06 [en] (X11; I; SunOS 5.6 sun4u) MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com Subject: question Content-Type: multipart/alternative; boundary="------------2BFAE484598674DACC1F7C35" Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2636 Lines: 90 --------------2BFAE484598674DACC1F7C35 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Dear All I have come across the following problem: A set of points, each given by its (x,y,z) coordinates in 3D is given. These points are known to be coplanar. Then the following two questions arise: - Is there a way to know if these points can be arranged to form a single, closed polygon? - Is there a way to know if these points can be arranged to form several closed polygons? - Is there a way to construct such polygon(s)? This arises when a planar polyhedron, given by a collection of points, faces and edges, is "cut" by an arbitrary plane. Another way of stating the problem is: To determine the closed polygon(s) resulting from the intersection of the polyhedron and the plane. Any suggestion will be greatly appreciated. -- Antonio Barragan University of Southampton Concurrent Computation Group Building 59 Level 3 Room 3237 Highfield Southampton SO17 1BJ Hants UK Fax: 00-44-2380-593903 --------------2BFAE484598674DACC1F7C35 Content-Type: text/html; charset=us-ascii Content-Transfer-Encoding: 7bit  
Dear All

I have come across the following problem:

A set of points, each given by its (x,y,z) coordinates in 3D is given.
These points are known to be coplanar.

Then the following two questions arise:
- Is there a way to know if these points can be arranged to form a single, closed polygon?
- Is there a way to know if these points can be arranged to form several closed polygons?
- Is there a way to construct such polygon(s)?

This arises when a planar polyhedron, given by a collection of points, faces and edges,
is "cut" by an arbitrary plane.

Another way of stating  the problem is:
To determine the closed polygon(s) resulting from the intersection of the polyhedron and the plane.

Any suggestion will be greatly appreciated. 

-- 
Antonio Barragan                
University of Southampton      
Concurrent Computation Group
Building 59 
Level 3 Room 3237
Highfield
Southampton SO17 1BJ
Hants
UK
Fax: 00-44-2380-593903
  --------------2BFAE484598674DACC1F7C35-- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Sep 28 08:45:10 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id IAA19838 for ; Thu, 28 Sep 2000 08:45:10 -0400 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA10362 for ; Thu, 28 Sep 2000 08:44:34 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Sep 28 09:40:54 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Sep 28 09:29:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Sep 28 09:28:13 EDT 2000 Received: from amirani.ams.sunysb.edu ([129.49.6.2]) by dusty; Thu Sep 28 09:28:12 EDT 2000 Received: from ams.sunysb.edu (IDENT:jsbm@joepc.ams.sunysb.edu [129.49.6.238]) by amirani.ams.sunysb.edu (8.9.1a/8.9.1) with ESMTP id JAA25800; Thu, 28 Sep 2000 09:28:04 -0400 (EDT) Message-Id: <200009281328.JAA25800@amirani.ams.sunysb.edu> Date: Thu, 28 Sep 2000 09:28:02 -0400 (EDT) From: jsbm@ams.sunysb.edu Subject: 2nd Call for Papers: Fall CG Workshop To: compgeom-announce@research.bell-labs.com cc: jsbm@ams.sunysb.edu MIME-Version: 1.0 Content-Type: TEXT/plain; CHARSET=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 5979 Lines: 168 SECOND CALL FOR PAPERS TENTH ANNUAL FALL WORKSHOP ON COMPUTATIONAL GEOMETRY October 27--28, 2000 http://www.ams.sunysb.edu/~jsbm/cgworkshop.html ** Please send abstracts (by email) for contributed talks by midnight (New York time), October 3 We will announce the program and accepted papers by October 10. ** Hotels: Three Village Inn and Danford's have been holding some rooms for us through this week, at discounted rates, however these may be expired or filling up fast. See web site for details on how to contact them. We hope/expect a block of rooms at the Holiday Inn Express to become available after October 6. You may want to check with them next week if they do not have rooms available now. We suggest you make hotel reservations ASAP, if you have not done so already! (If you have trouble finding space in the 3 closest hotels, we can suggest some alternatives if you contact us.) ** Grad student accommodations: As in the past, we hope to have local grad students host visiting students. Please email to cgworkshop@ams.sunysb.edu to request that your name be added to the list of students to be hosted for free sofa/floorspace accommodations. ** Transportation: Consider flights into Islip (= Long Island Macarthur airport), if possible. It is closer to Stony Brook than JFK or LaGuardia, and is a smaller, more convenient airport. Southwest Airlines has had some special fares lately. The airport has been recently expanded: see http://www.macarthurairport.com/ for details and which carriers fly into it. SECOND CALL FOR PAPERS TENTH ANNUAL FALL WORKSHOP ON COMPUTATIONAL GEOMETRY October 27--28, 2000 http://www.ams.sunysb.edu/~jsbm/cgworkshop.html We are pleased to announce the tenth in a series of annual fall workshops on Computational Geometry. This workshop series, founded under the sponsorship of the Mathematical Sciences Institute (MSI) at Stony Brook (with funding from the U.S. Army Research Office), has continued during 1996-1999 under the sponsorship of the Center for Geometric Computing, a collaborative center of Brown, Duke, and Johns Hopkins Universities, also funded by the U.S. Army Research Office. This year, for the tenth in the workshop series, the workshop returns to the campus of the University at Stony Brook. Scope and Format The aim of this workshop is to bring together students and researchers from academia and industry, to stimulate collaboration on problems of common interest arising in geometric computations. Topics to be covered include, but are not limited to: Algorithmic methods in geometry I/O-scalable geometric algorithms Animation of geometric algorithms Computer graphics Solid modeling Geographic information systems Computational metrology Graph drawing Experimental studies Geometric data structures Implementation issues Robustness Computer vision Robotics Computer-aided design Mesh generation Manufacturing applications of geometry Following the tradition of the previous workshops on Computational Geometry, the format of the workshop will be informal, extending over 2 days, with several breaks scheduled for discussions. There will also be an Open Problem Session in order to promote a free exchange of questions and research challenges. We strongly encourage registration in advance, through the workshop web site; registration can also be completed on-site. There will be no registration fee. Students are especially encouraged to attend and participate! We expect to be able to provide free accommodations (couch space, floor space, etc.) for visiting students with some of Stony Brook's local graduate student hosts who are taking part in the organization. Invited speakers George Hart Ari Kaufman: "Volume Graphics" Micha Sharir: "Combinatorics of arrangements - recent progress" Ileana Streinu Submissions Authors are invited to submit abstracts for talks to be given at the workshop. Please send an abstract (up to 2 pages) and a draft of a paper (if you have one). E-mail submissions are encouraged; send to cgworkshop@ams.sunysb.edu. Ideally, the abstract should be a PDF, PostScript, or LaTeX, file, for ease in assembling the abstract booklet. Abstracts can also be sent by regular mail to: Joseph Mitchell Department of Applied Mathematics and Statistics University at Stony Brook Stony Brook, NY 11794-3600 Submissions should arrive by October 3, 2000. Authors will be notified of acceptance by October 10, 2000. A booklet of abstracts will be distributed at the workshop and made available electronically on the Web. There will be no formal proceedings for this workshop. Program Committee Pankaj K. Agarwal (Duke University), Esther M. Arkin (Stony Brook), Michael A. Bender (Stony Brook), Michael T. Goodrich (Johns Hopkins University), Joseph S. B. Mitchell (Stony Brook), Steven S. Skiena (Stony Brook), Roberto Tamassia (Brown University) Note: For more information about the workshop, send mail to cgworkshop@ams.sunysb.edu. Further information will be posted to our web site: http://www.ams.sunysb.edu/~jsbm/cgworkshop.html as soon as it is available. Important Dates Deadline for submission Oct 3, 2000 Notification of acceptance Oct 10, 2000 Conference Oct 27-28, 2000 Sponsored by the Department of Applied Mathematics and Statistics and the Department of Computer Science and Engineering, State University of New York at Stony Brook, with partial support from the National Science Foundation. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Sep 28 08:46:22 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id IAA19842 for ; Thu, 28 Sep 2000 08:46:22 -0400 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA11242 for ; Thu, 28 Sep 2000 08:45:48 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Sep 28 09:40:33 EDT 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Sat Sep 23 06:13:04 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Sat Sep 23 06:12:25 EDT 2000 To: compgeom-announce@research.bell-labs.com Date: Sat, 23 Sep 2000 06:12:23 -0400 Received: from ori.zcu.cz ([147.228.52.11]) by dusty; Sat Sep 23 06:12:23 EDT 2000 Received: from uk426p04kiv (uk426p04-kiv.fav.zcu.cz [147.228.63.78]) by ori.zcu.cz (8.9.3/8.9.3) with SMTP id LAA32121; Sat, 23 Sep 2000 11:59:24 +0200 (MET DST) Message-ID: <001101c02545$1c631300$4e3fe493@fav.zcu.cz> From: "Vaclav Skala" Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 5279 Lines: 149 To: Subject: WSCG2001 - Int.Conf.on Graphics, Visualization & Computer Vision - REMINDER Date: Sat, 23 Sep 2000 09:41:18 +0200 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-2" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2919.6600 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2919.6600 Content-Transfer-Encoding: quoted-printable X-MIME-Autoconverted: from 8bit to quoted-printable by ori.zcu.cz id LAA32121 DEADLINE REMINDER ----------------------------- >> Nice opportunity >> to visit the Golden City Prague - visit, please http://www.czechsite.com/ >> to drink the best beer - the original Pilsener Urquell >> visit the Plzen city - Information Center http://www.plzen-city.cz ---------------------------------------------------------- --------------------- Sorry for duplicates and cross-posting --------------------- W S C G ' 2001 The 9-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2001 in cooperation with EUROGRAPHICS, IFIP WG 5.10 & Computer Graphics Society to be held in February 5 - 9, 2001 in Plzen very close to PRAGUE, the capital of the Czech Republic Honorary Chair =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D Jarek Rossignac, GVU Center, Georgia Institute of Technology, USA Conference Chairs =3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D= =3D Nadia Magnenat Thalmann, MIRALab-CUI, Univ. of Geneva, Switzerland Vaclav Skala, Univ. of West Bohemia, Czech Republic >>>> Deadline for authors: October 10, 2000 >>>> Conference dates: February 5 - 9, 2001 Information: http://wscg.zcu.cz Accepted papers will be published in the Conference proceedings with ISBN and processed by INSPEC, ISI, Cambridge Scientific Abstracts and others f= or citations index. ------------------------------------------------------------------ >> If you are willing to help us as a REVIEWER, please, << >> fill in the form at the http://wscg.zcu.cz/reviewer.htm << ------------------------------------------------------------------ Topics included --------------- Fundamental algorithms, rendering and visualization, computer vision, pattern recognition and image processing, virtual reality, medical imaging, geometric modelling and fractals, parallel and distributed graphics, computational geometry, graphical interaction and standards, object-oriented graphics, WWW technologies, animation and multimedia, computer aided geometric design, CAD/CAM, DTP and GIS systems, educational aspects of related fields, usage of graphics within mathemati= cal software (Maple, Mathematica, MathCAD etc.) in education. >>> Papers on all aspects of computer graphics are encouraged <<< The program includes international books exhibition and video show, too. --------------------------------------------- W S C G '2001 International Exhibition ------------------------------------ Information for exhibitors: Please contact the organiser as soon as possi= ble -------------------------- for detailed information and conditions. The WSCG Exhibition will be held in parallel. Top leading European and Cz= ech companies active in computer graphics, visualization and computer vision, CAD/CAM and GIS systems, virtual reality, multimedia systems and others will be presenting their latest products. Special programme will be available, too. ----------------- Accepted papers will be published in the Conference proceedings with ISBN. They are reviewed by INSPEC, Cambridge Scientific Abstracts, InfoStore, IEE, ISI, AIMS, INIST and others for citations index and other purposes. The best papers will be considered for possible publication in the Journa= l of Visualisation and Computer Animation, Computers&Graphics, The Visual Computer, Machine Graphics & Vision, High Performace Computer Graphics an= d others journals. Organizer and Conference secretariat ------------------------------------ Prof.Ing.Vaclav Skala, CSc. c/o Computer Science Dept., Univ.of West Bohemia Univerzitni 8, Box 314, 306 14 Plzen, Czech Republic e-mail: skala@kiv.zcu.cz Subject: INFO WSCG tel.:+420-19-7491-188 fax:+420-19-7822-578, 799 include your e-mail i= n all messages!!! The latest information is available at (please RELOAD the pages all the time to get the latest information): http://wscg.zcu.cz select WSCG'2001 Information on all WSCG conferences: http://wscg.zcu.cz --- Odchoz=ED zpr=E1va neobsahuje viry. Zkontrolov=E1no antivirov=FDm syst=E9mem AVG (http://www.grisoft.cz). Verze: 6.0.191 / Virov=E1 b=E1ze: 91 - datum vyd=E1n=ED: 11.9.2000 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Mon Oct 9 18:43:34 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id SAA17456 for ; Mon, 9 Oct 2000 18:43:34 -0400 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id SAA19002 for ; Mon, 9 Oct 2000 18:43:29 -0500 (CDT) Message-Id: <200010092343.SAA19002@dcs-server1.cs.uiuc.edu> Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Oct 9 19:41:16 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Fri Oct 6 10:01:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Oct 6 10:00:20 EDT 2000 Received: from math.fu-berlin.de ([160.45.40.10]) by dusty; Fri Oct 6 10:00:19 EDT 2000 Received: (qmail 25721 invoked from network); 6 Oct 2000 16:00:17 +0200 Received: from sahib.inf.fu-berlin.de (HELO sahib) (160.45.111.13) by leibniz.math.fu-berlin.de with SMTP; 6 Oct 2000 16:00:17 +0200 Date: Fri, 6 Oct 2000 16:00:17 +0200 (MEST) From: Helmut Alt Reply-To: Helmut Alt Subject: Call For Papers CG01 To: theorynt@vm1.nodak.edu, compgeom-announce@research.bell-labs.com, fg011@inf.fu-berlin.de, adm-all@inf.fu-berlin.de, ti@inf.fu-berlin.de MIME-Version: 1.0 Content-Type: TEXT/plain; charset=ISO-8859-1 Content-MD5: uSqtxjxPHCIUViUMwBKmhw== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from QUOTED-PRINTABLE to 8bit by valis.cs.uiuc.edu id SAA17456 Status: RO Content-Length: 2803 Lines: 80 CALL FOR PAPERS Euro-CG 2001 17th European Workshop on Computational Geometry March 26 - 28, 2001 Institute of Computer Science Freie Universitaet Berlin, Germany The 17th European Workshop on Computational Geometry (CG '01) will take place at the Institute of Computer Science of Freie Universität Berlin, Germany. The European Workshop on Computational Geometry is an important scientific event in which established researchers from academia, R&D people from industry, research students, and postdocs meet and present their current work, establishing scientific interaction and international collaboration. The goal of the workshop is to bring together researchers in Computational Geometry, facilitating - in an informal atmosphere - the spreading of their most recent work. Invited speakers: Heinrich Mueller, Universitaet Dortmund Jack Snoeyink, University of North Carolina at Chapel Hill Emo Welzl, ETH Zuerich Submissions: A title and a brief abstract (2-4 pages) should be submitted before January 7th, 2001 (preferrably as a postscript-file to cg01@inf.fu-berlin.de). The abstracts will be collected and distributed among the participants at the workshop. There will be no other proceedings so that preliminary work can be presented which may later appear in a more complete form at a larger conference. A special issue of ``Computational Geometry: Theory and Applications'' will be dedicated to outstanding results presented at the workshop. In order to provide a consistent layout of the collection of abstracts we encourage authors to write the abstracts in LATEX using our LATEX frame file at http://www.inf.fu-berlin.de/~cg01/frame.tex. Please submit the resulting postscript file via e-mail to cg01@inf.fu-berlin.de . If e-mail is not available, please send 2 copies to EURO CG 2001 c/o Carola Wenk Freie Universität Berlin Institute of Computer Science Takustr. 9 14195 Berlin Germany Important dates: Deadline for submissions: January 7th, 2001 Notification of acceptance: January 19th, 2001 Deadline for hotel registration: January 26th, 2001 Deadline for registration: February 25th, 2001 For more information see our webpage http://www.inf.fu-berlin.de/~cg01 or contact cg01@inf.fu-berlin.de . ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Mon Oct 9 18:43:36 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id SAA17460 for ; Mon, 9 Oct 2000 18:43:36 -0400 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id SAA19006 for ; Mon, 9 Oct 2000 18:43:30 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Oct 9 19:40:57 EDT 2000 Received: from scummy.research.bell-labs.com by netlib2; Tue Oct 3 14:35:09 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Oct 3 14:33:04 EDT 2000 Received: from mailhost.cpsc.ucalgary.ca ([136.159.2.100]) by dusty; Tue Oct 3 14:33:02 EDT 2000 Received: from cpsc.ucalgary.ca (marina.cpsc.ucalgary.ca [136.159.6.17]) by mailhost.cpsc.ucalgary.ca (1.3) id ; Tue, 3 Oct 2000 12:31:40 -0600 (MDT) Message-ID: <39DA28B0.FED99F0A@cpsc.ucalgary.ca> Date: Tue, 03 Oct 2000 12:42:56 -0600 From: Marina Gavrilova Organization: Dept. of Computer Science, University of Calgary X-Mailer: Mozilla 4.06 [en] (WinNT; I) MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: Computational Geometry Session Announcement Content-Type: text/plain; charset=koi8-r Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2659 Lines: 80 ------------------------------------------------------------------------ CALL FOR PAPER TECHNICAL SESSION ON COMPUTATIONAL GEOMETRY AND APPLICATIONS INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE 2001 San Francisco, California, USA May 28 - 30, 2001 http://www.ucalgary.ca/iccs Session Description ------------------- Papers presenting the results of original research in all areas of computational geometry are invited for submission to the session. Topics of interest include, but are not limited to: interpolation and surface reconstruction, mesh generation, image representation, Voronoi diagrams, Delaunay triangulations, convex hulls and nearest-neighbor problems. The design and implementation of algorithms in parallel and distributed environments, and applications of such methods to mechanics and physics, are of special interest. Paper Submission ----------------- We invite you to submit a: full paper of 6 to 10 pages (Letter or A4 paper) for oral presentation short paper of 2 to 4 pages (Letter or A4 paper) for poster presentation. The submitted paper must be camera-ready and formatted according to the rules of LNCS. See http://www.springer.de/comp/lncs/authors.html for formatting information. Please follow the guidelines posted at http://www.ucalgary.ca/iccs for format of your submission. Submission implies the willingness of at least one of the authors to register and present the paper. Proceedings ----------- The proceedings of the Conference will be published in the Springer-Verlag Lecture Notes in Computer Science (LNCS) series. Important Dates ---------------- January 19, 2001: Draft papers due March 1, 2001: Notification of Acceptance March 29, 2001: Camera Ready Papers and Pre-registration due May 28 - 30, 2001: ICCS 2001 Conference Contact Information ------------------ All submissions to Computational Geometry and Applications session can be send directly to Session Chair: Dr. Marina L. Gavrilova, Department of Computer Science, University of Calgary, 2500 University Drive, Calgary, Alberta, Canada, T2N1N4 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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From dmanet-admin@zpr.uni-koeln.de Mon Nov 6 03:26:18 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eA68QIF02696 for ; Mon, 6 Nov 2000 03:26:18 -0500 Received: from Octopussy.MI.Uni-Koeln.DE (Octopussy.MI.Uni-Koeln.DE [134.95.166.20]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id DAA03242 for ; Mon, 6 Nov 2000 03:25:56 -0600 (CST) Received: from Octopussy.MI.Uni-Koeln.DE (localhost [127.0.0.1]) by Octopussy.MI.Uni-Koeln.DE (8.9.1/8.9.1) with ESMTP id KAA05110; Mon, 6 Nov 2000 10:09:06 +0100 (MET) Received: from photon.poly.edu (yjc@photon.poly.edu [128.238.32.22]) by Octopussy.MI.Uni-Koeln.DE (8.9.1/8.9.1) with ESMTP id SAA21107 for ; Wed, 1 Nov 2000 18:48:38 +0100 (MET) Received: from localhost (yjc@localhost) by photon.poly.edu (8.9.0/8.9.0) with ESMTP id MAA03189; Wed, 1 Nov 2000 12:48:29 -0500 (EST) From: Yi-Jen Chiang Reply-To: yjc@poly.edu To: DMANET@zpr.uni-koeln.de, THEORYNT@listserv.nodak.edu, compgeom-announce@research.bell-labs.com, GRAPHNET@listserv.nodak.edu, opt-net@ZIB.DE, dm@INFORMATIK.HU-BERLIN.DE, DMA-LIST@nic.surfnet.nl, THEORY-A@listserv.nodak.edu cc: Yi-Jen Chiang Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Subject: [DMANET] WADS 2001 Call for Papers (slightly modified version) Sender: dmanet-admin@zpr.uni-koeln.de Errors-To: dmanet-admin@zpr.uni-koeln.de X-BeenThere: dmanet@zpr.uni-koeln.de X-Mailman-Version: 2.0beta6 Precedence: bulk List-Help: List-Post: List-Subscribe: , List-Id: discrete mathematics and algorithms List-Unsubscribe: , List-Archive: http://www.zpr.uni-koeln.de/pipermail/dmanet/ Date: Wed, 1 Nov 2000 12:48:29 -0500 (EST) Status: RO Content-Length: 2907 Lines: 79 This is a slightly modified version with some typos corrected. Please ignore the previous version posted about a week ago. Thanks! ------------ PRELIMINARY CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions will be posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: receipt of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) Program Committee: Co-Chairs: F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown) PC-Members: A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer ********************************************************** * * 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 compgeom-owner@research.bell-labs.com Wed Nov 15 07:21:07 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFCL7502856 for ; Wed, 15 Nov 2000 07:21:07 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id HAA14716 for ; Wed, 15 Nov 2000 07:21:02 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Nov 15 08:17:10 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Oct 12 07:27:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Oct 12 07:25:23 EDT 2000 Received: from mail.cs.uu.nl ([131.211.80.32]) by dusty; Thu Oct 12 07:25:23 EDT 2000 Received: from leros.cs.uu.nl (leros.cs.uu.nl [131.211.80.214]) by mail.cs.uu.nl (Postfix) with ESMTP id 43BFE451D; Thu, 12 Oct 2000 13:25:17 +0200 (MET DST) Date: Thu, 12 Oct 2000 13:25:17 +0200 (MET DST) From: Geert-Jan Giezeman To: cgal-discuss-l@postino.mpi-sb.mpg.de, cgal-develop@cs.uu.nl, compgeom-announce@research.bell-labs.com Subject: CGAL 2.2, Computational Geometry Algorithms Library Message-ID: X-Org: phone: +31-30-2531454; telefax: +31-30-2513791 MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1678 Lines: 49 We are pleased to announce release 2.2 of CGAL, the Computational Geometry Algorithms Library. Major additions in this release are: o Support for the Borlnd compiler (5.5) on windows and the KAI compiler on Solaris. o Several optimisation algorithms (smallest enclosing annulus, polytope_distance, width of point sets in 3D) o Additions to 2d and 3d triangulations and 2d arrangements. o Demos showing robustnees problems and their solutions. o and more The CGAL project is a collaborative effort to develop a robust, easy-to-use, and efficient C++ software library of geometric data structures and algorithms. The CGAL library contains: o Basic geometric primitives such as points, vectors, lines, predicates for testing things such as relative positions of points, and operations such as intersections and distance calculation. o A collection of standard data structures and geometric algorithms, such as convex hull, (Delaunay) triangulation, planar map, polyhedron, smallest enclosing sphere, and multidimensional query structures. o Interfaces to other packages, e.g. for visualisation, and I/O, and other support facilities. For further information and for downloading the library and its documentation, please visit the CGAL web page: http://www.cgal.org/ Should you have any questions or comments, please send a message to contact@cgal.org Geert-Jan Giezeman ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 07:21:08 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFCL8502860 for ; Wed, 15 Nov 2000 07:21:08 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id HAA14720 for ; Wed, 15 Nov 2000 07:21:03 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Nov 15 08:19:38 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Tue Oct 10 19:05:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Tue Oct 10 19:04:52 EDT 2000 Received: from gate.cs.rochester.edu ([192.5.53.207]) by dusty; Tue Oct 10 19:04:50 EDT 2000 Received: from crow.cs.rochester.edu (crow.cs.rochester.edu [192.5.53.157]) by gate.cs.rochester.edu (8.8.8+Sun/T--) with ESMTP id TAA16946 for ; Tue, 10 Oct 2000 19:04:48 -0400 (EDT) Received: (from murphy@localhost) by crow.cs.rochester.edu (8.9.1b+Sun/Q++) id TAA08985 for compgeom-announce@research.bell-labs.com; Tue, 10 Oct 2000 19:04:47 -0400 (EDT) Date: Tue, 10 Oct 2000 19:04:47 -0400 (EDT) From: murphy@cs.rochester.edu Message-Id: <200010102304.TAA08985@crow.cs.rochester.edu> To: compgeom-announce@research.bell-labs.com Subject: ASE Special Issue on Software Engineering for Mobility (Call for Papers) Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 5472 Lines: 107 Kluwer Journal of Automated Software Engineering Special Issue on Software Engineering for Mobility http://www.cs.rochester.edu/u/murphy/ase.html Call for papers --------------- The integration between computing and communication represents one of the most important technological developments of the last decade, a phenomenon marked by significant economic and social changes centered mostly on the Internet. The goal of this special issue is to examine the next major wave of technological changes in the computing environment, the integration of computing, communication, and mobility. In its broadest sense, mobility involves the migration of computing components through some logical or physical space. Physical components provide the platform for applications designed to cope with changes in physical location and connectivity to both wired and wireless networks. Physical components can assume a large diversity of forms including sensors, personal digital assistants, laptops, and large computing platforms residing on vehicles including cars, ships, or airplanes. Movement may happen across geographical regions or in the confines of a single building. Applications executing on such platforms may act in isolation, may coordinate with components in close proximity, or may access resources on a fixed network. Mobile components can also come in the shape of logical units such as code fragments or active programs. The latter carry both code and execution state among fixed and mobile hosts, exploiting locality of resources and computation. A feature typical of all mobile environments is the need to adapt to a constantly changing context that is affected by variability of network characteristics, changes in the availability of resources, and heterogeneity among participating platforms. For these and other reasons, mobility is associated with increases in the complexity of the software development process. New software engineering techniques are needed to address the challenges posed by the development of software for physical and logical mobile environments. This special issue is intended to highlight new research that advances the understanding of critical issues in mobility and proposes viable solutions for the software engineering of systems that involve mobility in all its forms. Submissions are not restricted in any way. Topics of special interest include middleware tailored to mobility, tools to aid in the design of mobile systems, models that capture fundamental properties of mobility and enable formal reasoning about mobile systems, coordination techniques which address adaptability and security, and algorithms that solve fundamental problems in mobility. Submission guidelines --------------------- Authors are invited to submit an electronic version of their contribution in PostScript or PDF to murphy@cs.rochester.edu, using ASE2001 in the subject line. Submissions must be received by January 5, 2001. Manuscripts must be in English, single-spaced, 12 point font size, and 15 pages maximum. In addition to the electronic version of the paper, the email submission should include a text-only version of the title, author(s) name and affiliation, abstract, and the name and address (both postal and electronic) for the contact author. Papers submitted for consideration by the special issue must represent original unpublished work. No version of the paper may be submitted concurrently to any other journal or conference. Any manuscript failing to meet this condition will be rejected outright. Important dates ---------------- Publication of the special issue is expected in 2001. January 5, 2001 Submission Deadline March 23, 2001 First round review notification May 18, 2001 Re-submission revised papers July 13, 2001 Second round review notification September 7, 2001 Submission of final revisions Editors of the special issue ----------------------------- Gruia-Catalin Roman Amy L. Murphy Department of Computer Science Department of Computer Science Washington University University of Rochester Campus Box 1045 P.O. Box 270226 Saint Louis, MO 63130 USA Rochester, NY 14627 USA roman@cs.wustl.edu murphy@cs.rochester.edu Kluwer Journal of Automated Software Engineering -------------------------------------------------- http://www.wkap.nl/journalhome.htm/0928-8910 This Journal is an archival, peer-reviewed journal publishing research, tutorial papers, survey and accounts of significant industrial experience in the foundations, techniques, tools and applications of automated software engineering technology. This includes the study of techniques for constructing, understanding, adapting, and modeling software artifacts and processes. Both automatic systems and collaborative systems are within the scope of the journal, as are computational models of human software engineering activities. Knowledge representations and artificial intelligence techniques applicable to automated software engineering are of interest, as are formal techniques that support or provide theoretical foundations. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 07:27:11 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFCRA502864 for ; Wed, 15 Nov 2000 07:27:10 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id HAA15044 for ; Wed, 15 Nov 2000 07:27:05 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Nov 15 08:26:11 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Tue Nov 14 09:13:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Nov 14 09:11:48 EST 2000 Received: from doc.cs.keele.ac.uk ([160.5.89.3]) by dusty; Tue Nov 14 09:11:47 EST 2000 Received: from sarin.cs.keele.ac.uk ([160.5.90.242] helo=cs.keele.ac.uk) by doc.cs.keele.ac.uk with esmtp (Exim 2.12 #1) id 13vgoK-0000rQ-00 for compgeom-announce@research.bell-labs.com; Tue, 14 Nov 2000 14:11:44 +0000 Message-ID: <3A114A8E.1C7321A0@cs.keele.ac.uk> Date: Tue, 14 Nov 2000 14:22:06 +0000 From: John Stell Organization: Keele University X-Mailer: Mozilla 4.08 [en] (WinNT; I) MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: JOB: Research in digital topology and geometry Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2981 Lines: 65 Post-Doctoral Research Assistant: Digital Topology and Geometry Applications are invited for a Post Doctoral Research Assistant at The University of Leeds to work on an EPSRC funded project "Digital Topology and Geometry: An Axiomatic Approach, with Applications to GIS and Spatial Reasoning". This is a joint project with Imperial College, London, where the Principal Investigator is Dr Mike Smyth. The post will be based at the School of Computing, University of Leeds, where there is a well-established research group in spatial reasoning. There will be close collaboration with researchers at Imperial College, and also with the Geographic Information Systems research group at Keele University. The post is available from 1st January 2001, but it may be possible to agree a later starting date. The appointment is for a fixed term of three years. The principal aims of the project are 1. To develop an axiomatic theory of geometry that admits as models discrete spaces as well as classical continuous spaces such as Euclidean spaces. 2. To produce topological and geometric structures which can be used as the basis of computational descriptions of natural phenomena. Applications in the areas of Geographic Information Systems (GIS) spatial reasoning in artificial inteligence (AI) will be investigated. 3. To extend digital topology as used in image analysis to a theory of digital geometry. 4. To design and implement algorithms within the developed digital geometry for tasks such as convex hull and Delauny triangulation. The research assistant will work largely on the applications of the geometric theory including the development of algorithms and the evaluation of the suitablility of the theory to problems in areas such as spatial reasoning in AI, GIS and image analysis. One phase of the project will focus on applications to multi-resolution spatial data: the description of geometric structure at a variety of levels of detail. Candidates should have, or be about to complete a PhD in a relevant area of Computer Science, Mathematics, or Artificial Intelligence. Candidates are not expected to be familiar with all of the application areas mentioned above, but suitable research experience in one of the following areas would be useful: spatial reasoning, computational geometry, theory of image analysis, computer graphics, formal aspects of GIS. Applications are also welcome from candidates whose main experience has been in a relevant area of topology or geometry. Details of the formal aplication procedure will be available shortly, but anyone interested in this post should contact Dr John Stell by email: j.g.stell@cs.keele.ac.uk or by phone: 01782 584083. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 07:39:13 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFCdD502874 for ; Wed, 15 Nov 2000 07:39:13 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id HAA24182 for ; Wed, 15 Nov 2000 07:39:08 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Nov 15 08:34:03 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Wed Oct 11 05:07:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Oct 11 05:05:44 EDT 2000 Received: from mail.cs.uu.nl ([131.211.80.32]) by dusty; Wed Oct 11 05:05:43 EDT 2000 Received: from otterlo (otterlo.cs.uu.nl [131.211.80.180]) by mail.cs.uu.nl (Postfix) with SMTP id 619F74525 for ; Wed, 11 Oct 2000 11:05:41 +0200 (MET DST) Message-Id: <3.0.5.32.20001011110459.009a8680@pop.cs.uu.nl> X-Sender: remcov@pop.cs.uu.nl X-Mailer: QUALCOMM Windows Eudora Pro Version 3.0.5 (32) Date: Wed, 11 Oct 2000 11:04:59 +0200 To: compgeom-announce@research.bell-labs.com From: Remco Veltkamp Subject: postdoc position Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1957 Lines: 42 At Utrecht University, in the Applied Algorithms group (headed by Mark Overmars) we have available a postdoc position for 4 years The goal of the work is to construct a C++ library for shape matching and to do experimental research with it. To this end we want to implement a number of existing shape matching algorithms and, more interesting, work on extending existing algorithms and designing new ones for larger classes of shape matching, and evaluate the performance of these algorithms. This work is part of a larger project on shape matching: SHAME - Shape Matching Environment, on which a PhD student and two postdocs are working together. The library will be developed on top of the Computational Geometry Algorithms Library, CGAL, see http://www.cs.uu.nl/CGAL. The project is part of our larger initiative on shape matching and applications in shape-based image database retrieval, the group consists of 9 persons. See also http://www.cs.uu.nl/groups/AA/shape/. If you are interested, please contact me (Remco.Veltkamp@cs.uu.nl). I am happy to provide more details about the project, and to answer questions about working conditions etc. Remco Veltkamp -------------------------------------------------------------------- Remco Veltkamp | email: Remco.Veltkamp@cs.uu.nl | phone: +31-30-2534091 Dept. Computing Science | fax: +31-30-2513791 Utrecht University | Padualaan 14 | P.O. Box 80089 3584 CH Utrecht | 3508 TB Utrecht The Netherlands | The Netherlands -------------------------------------------------------------------- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 08:02:24 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFD2O502905 for ; Wed, 15 Nov 2000 08:02:24 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA29929 for ; Wed, 15 Nov 2000 08:02:18 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Nov 15 08:59:15 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Fri Oct 13 14:25:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Oct 13 14:23:51 EDT 2000 Received: from convex.cs.unb.ca ([131.202.33.93]) by dusty; Fri Oct 13 14:23:49 EDT 2000 Received: (from bremner@localhost) by convex.cs.unb.ca (8.10.0/8.11.0) id e9DIPkX23146; Fri, 13 Oct 2000 15:25:46 -0300 From: David Bremner MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <14823.21418.310446.191527@convex.cs.unb.ca> Date: Fri, 13 Oct 2000 15:25:46 -0300 (ADT) To: compgeom-announce@research.bell-labs.com Subject: 1 Year Research Position, Starting Jan. 1 2001 X-Mailer: VM 6.72 under 21.1 (patch 12) "Channel Islands" XEmacs Lucid Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2175 Lines: 47 The usual groveling apologies to those of you who receive this too many times. I suppose that could conceptually include once :-) ---------------------------------------------------------------------- Postdoctoral/Visiting Position At UNB CS October 13, 2000 The Faculty of Computer Science at the University of New Brunswick has an opening for a one year visiting research position in the general area of geometric computation. The primary responsibility of the successful applicant will be to conduct research in collaboration with members of the geometric computing group at UNB. There will also be some light teaching responsibilities at the graduate level. Research in geometric computing at UNB is motivated by, and finds application in, a broad set of applications. Of particular interest to researchers here are applications in computational biology, geographical informations systems, robotics, and visualization. Balancing this application driven research is basic research on spatial data structures and optimization. We envision a starting date of January 1 2001. The 12 month salary will be $40,000. Interested researchers should forward a CV, along with reprints/preprints of 3 recent publications to David Bremner Faculty of Computer Science University of New Brunswick P.O. Box 4400 Fredericton, NB E3B 5A3 Electronic applications (plain text or PostScript only!) can be sent to bremner@unb.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://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 08:03:47 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFD3l502909 for ; Wed, 15 Nov 2000 08:03:47 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA02067 for ; Wed, 15 Nov 2000 08:03:42 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Nov 15 09:02:58 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Tue Nov 7 22:37:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Nov 7 22:36:00 EST 2000 Received: from iiserv.iis.sinica.edu.tw ([140.109.20.250]) by dusty; Tue Nov 7 22:35:58 EST 2000 Received: from ccs1.iis.sinica.edu.tw (ccs1 [140.109.20.80]) by iiserv.iis.sinica.edu.tw (8.10.2/8.10.2) with ESMTP id eA83bqT00453; Wed, 8 Nov 2000 11:37:52 +0800 (CST) Received: from localhost (hil@localhost) by ccs1.iis.sinica.edu.tw (8.9.3+Sun/8.9.1) with ESMTP id LAA07073; Wed, 8 Nov 2000 11:36:37 +0800 (CST) X-Authentication-Warning: ccs1.iis.sinica.edu.tw: hil owned process doing -bs Date: Wed, 8 Nov 2000 11:36:37 +0800 (CST) From: Hsueh-I Lu X-Sender: hil@ccs1 To: Undisclosed recipients: ; Subject: ADVANCE PROGRAM OF ISAAC'00, TAIPEI, TAIWAN Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 8169 Lines: 257 11th Annual International Symposium on Algorithms and Computation (ISAAC'00) December 18--20, 2000 Institute of Information Science Academia Sinica Taipei, Taiwan http://www.iis.sinica.edu.tw/isaac00/ ================= Program Committee ================= Co-chair: D. T. Lee, Academia Sinica Co-chair: Shang-Hua Teng, Univ. of Illinois Helmut Alt, Free University of Berlin Nina Amenta, Univ. of Texas at Austin Gen-Huey Chen, National Taiwan Univ. Giuseppe Italiano, University of Rome Kazuo Iwama, Kyoto University Marcos Kiwi, University of Chile Jeff Erickson, University of Illinois Ming-Tat Ko, Academia Sinica Kurt Mehlhorn, Max Planck Institute Michael D. Mitzenmacher, Harvard Univ. Kunsoo Park, Seoul National University Tadao Takaoka, University of Canterbury Takeshi Tokuyama, Sendi University Peng-Jun Wan, Illinois Inst. of Technology Derick Wood, Hong Kong Univ. Sci. and Tech. ============= Invited Talks ============= (1) Voronoi-Based Systems of Coordinates and Surface Reconstruction, Jean-Daniel Boissonnat (INRIA, Unit\'e de Sophia Antipolis) (2) Essentially Every Unimodular Matrix Defines an Expander, Jin-Yi Cai (State University of New York at Buffalo, University of Wisconsin) =============== ADVANCE PROGRAM =============== ------------------- Monday, December 18 ------------------- [9:00--10:00] Invited Talk (1) ------------------------------ [10:30--12:00] 1A: Algorithms and Data Structures ------------------------------------------------- Strategies for Hotlink Assignments (P. Bose, J. Czyzowicz, L. Gasieniec, E. Kranakis, D. Krizanc, A. Pelc, M. Martin) A New Competitive Analysis of Randomized Caching (C. Law and C. E. Leiserson) Online Routing in Convex Subdivisions (P. Bose, A. Brodnik, S. Carlsson, E. Demaine, R. Fleischer, A. Lopez-Ortiz, P. Morin, J. Munro) [12:30--12:00] 1B: Combinatorial Optimization --------------------------------------------- A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors (J. Huang, J. Chen, S. Chen) Classification of Various Neighborhood Operations for the Nurse Scheduling Problem (T. Osogami, H. Imai) Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets (Y. Chen, M.-Y. Kao, H.-I. Lu) [2:30--3:30] 2A: Algorithms and Data Structures ----------------------------------------------- Coping with Delays and Time-Outs in Binary Search Procedures (F. Cicalese, U. Vaccaro) Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm (Z. Chen, B. Zhu) Reasoning with Ordered Binary Decision Diagrams (T. Horiyama, T. Ibaraki) [2:30--3:30] 2B: Approximation and Randomized Algorithms -------------------------------------------------------- On Approximating Minimum Vertex Cover for Graphs with Perfect Matching (J. Chen, I. A. Kanj) 2-Approximation Algorithm for Path Coloring on Trees of Rings (X. Deng, G. Li, W. Zang, Y. Zhou) An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree (Q. S. Wu, C. L. Lu, R. C. T. Lee) [4:00--5:30] 3A: Algorithms and Data Structures ----------------------------------------------- Finding Independent Spanning Trees in Partial $k$-Trees (X. Zhou, T. Nishizeki) On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover (R. Niedermeier, P. Rossmanith) Constructive Linear-Time Algorithms for Small Cutwidth and Carving-Width (D. M. Thilikos, M. J. Serna, H. L. Bodlaender) [4:00--5:30] 3B: Approximation and Randomized Algorithms --------------------------------------------------------- Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits (T. Asano, M. M. Halld\'orsson, K. Iwama, T. Matsuda ) A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane (N. Kubo, K. Muramoto, S. Shimozono) Simple Algorithms for a Weighted Interval Selection Problem (T. Erlebach, F. C.R. Spieksma) -------------------- Tuesday, December 19 -------------------- [9:00-10:00] Invited Talk (2) ----------------------------- [10:30--12:00] 4A: Graph Drawing and Algorithms ----------------------------------------------- Efficient Minus and Signed Domination in Graphs (C. L. Lu, S.-L. Peng, C. Y. Tang) Convex Grid Drawings of Four-Connected Plane Graphs (K. Miura, S.-i. Nakano, T. Nishizeki) An Algorithm for Finding Three-Dimensional Symmetry in Series-Parallel Digraphs (S.-H. Hong, P. Eades) [10:30--12:00] 4B: Automata, Cryptography, and Complexity Theory ---------------------------------------------------------------- Undecidability Results for Monoids with Linear-Time Decidable Word Problems (M. Katsura, Y. Kobayashi, F. Otto) Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures (R. Yoshikawa, S. Guo, K. Motegi, Y. Igarashi) Derandomizing Arthur-Merlin Games under Uniform Assumptions (C.-J. Lu) [2:00--3:30] 5A: Algorithms and Data Structures ----------------------------------------------- A Near Optimal Algorithm for Vertex Connectivity Augmentation (B. Jackson, T. Jordan) Simultaneous Augmentation of Two Graphs to an $\ell$-Edge-Connected Graph and a Biconnected Graph (T. Ishii, H. Nagamochi) Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets (H. Ito, M. Ito, Y. Itatsu, H. Uehara, M. Yokoyama) [2:00--3:30] 5B: Parallel and Distributed Algorithms ---------------------------------------------------- An Intuitive and Effective New Representation for Interconnection Network Structures (J. Chen, W. Jia, L. Liu, S. Chen) Randomized Leader Election Protocols in Radio Networks with no Collision Detection (K. Nakano, S. Olariu) Deterministic Broadcasting Time with Partial Knowledge of the Network (G. De~Marco, A. Pelc) [4:00-5:30] 6A: Algorithms and Data Structures ---------------------------------------------- Minimizing Makespan in Batch Machine Scheduling (C. K. Poon, P. Zhang) Preemptive Parallel Task Scheduling in $O(n)+\mboxpoly(m)$ Time (K. Jansen, L. Porkolab) Compressed Text Databases with Efficient Query Algorithms based on the Comressed Suffix Array (K. Sadakane) [4:00-5:30] 6B: Computational Geometry -------------------------------------- A Better Lower Bound for Two-Circle Point Labeling (A. Wolff, M. Thon, Y. Xu) Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set (D.-S. Kim, D. Kim, K. Sugihara) An Improved Algorithm for Subdivision Traversal without Extra Storage (P. Bose, P. Morin) ---------------------- Wednesday, December 20 ---------------------- [9:00-10:30] 7A: Algorithms and Data Structures ----------------------------------------------- Generalized H-coloring of Graphs (P. Kristiansen, J. A. Telle) Finding a Two-Core of a Tree in Linear Time (B.-F. Wang, J.-J. Lin) Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparsion (M.-Y. Kao, T.-W. Lam, W.-K. Sung, H.-F. Ting) [9:00-10:30] 7B: Computational Geometry --------------------------------------- Optimal Beam Penetrations in Two and Three Dimensions (D. Z. Chen, X. (S.) Hu, J. Xu) Searching a Simple Polygon by a $k$-searcher (X. Tan) Characterization of Rooms Searchable by Two Guards (S.-M. Park, J.-H. Lee, K.-Y. Chwa) [11:00--12:00] 8A: Computational Biology ---------------------------------------- Improved Phylogeny Comparisons: Non-Shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers (W.-K. Hon, M.-Y. Kao, T.-W. Lam) Phylogenetic $k$-Root and Steiner $k$-Root (G.-H. Lin, P. E. Kearney, T. Jiang) [11:00--12:00] 8B: Computational Geometry ----------------------------------------- Maintenance of a Piercing Set for Intervals with Applications (M. J. Katz, F. Nielsen, M. Segal) Optimal Polygon Cover Problems and Applications (D. Z. Chen, X. (S.) Hu, X. Wu) ================== [2:00--] Excursion ================== ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 08:08:35 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFD8Z502917 for ; Wed, 15 Nov 2000 08:08:35 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA05153 for ; Wed, 15 Nov 2000 08:08:29 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Nov 15 09:04:32 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Nov 9 00:13:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Nov 9 00:12:39 EST 2000 Received: from desh.cse.iitd.ernet.in ([202.141.68.3]) by dusty; Thu Nov 9 00:12:37 EST 2000 Received: from cse.iitd.ernet.in (root@sanjiva.cse.iitd.ernet.in [10.20.2.48]) by desh.cse.iitd.ernet.in (8.8.7/8.8.7) with ESMTP id KAA18928; Thu, 9 Nov 2000 10:42:47 +0530 Received: (from sanjiva@localhost) by cse.iitd.ernet.in (8.9.3/8.9.3) id KAA02873; Thu, 9 Nov 2000 10:37:56 +0530 Date: Thu, 9 Nov 2000 10:37:56 +0530 Message-Id: <200011090507.KAA02873@cse.iitd.ernet.in> X-Authentication-Warning: localhost.localdomain: sanjiva set sender to sanjiva@sanjiva.cse.iitd.ernet.in using -f From: Sanjiva Prasad To: DMANET@math.utwente.nl, categories@mta.ca, clp@iscs.nus.sg.cse.iitd.ernet.in, concurrency-request@cwi.nl, eapls@mailbase.ac.uk, logic-request@cs.cornell.edu, logic@theory.lcs.mit.edu, PetriNets@daimi.aau.dk, rewriting@loria.fr, types@cis.upenn.edu, concurrency@cwi.nl, csl@dbai.tuwien.ac.at, theorynt@listserv.nodak.edu, theory-a@vm1.nodak.edu, compgeom-announce@research.bell-labs.com Subject: FST TCS 2000 Call for Participation Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 9367 Lines: 230 [ Apologies for a second message, but there were some errors in the version sent out (including a typo in the URL for registration), as well as a change of date for early registration. -- Sanjiva Prasad ] ******************************************************************* * * * Call for Participation * * * * Foundations of Software Technology * * and * * Theoretical Computer Science * * (FST TCS 2000) * * * * India International Centre * * New Delhi, India * * 13--15 December July, 2000 * * * * REGISTER AT http://www.cse.iitd.ernet.in/~fsttcs20 * * EARLY REGISTRATION DEADLINE IS November 22 * * * ******************************************************************* Invited Speakers: Peter Buneman (U Penn) Bernard Chazelle (Princeton) E. Allen Emerson (U Texas, Austin) Martin Groetschel (ZIB, Berlin) Jose Meseguer (SRI) Philip Wadler (Avaya Labs Satellite Events: Tutorial Workshop on Recent Advances in Programming Languages December 11-12, 2000 at IIT Delhi, Hauz Khas Workshop on Geometry December 16-17, 2000 at IIT Delhi, Hauz Khas FST TCS 2000 Preliminary Programme 13 December 2000 9:00-9:30 Opening 9:30-10:30 Invited Talk: E Allen Emerson Model Checking: Theory into Practice 10:30-11:00 Tea 11:00-12:30 Fast On-line/Off-line Model checking CTL Algorithms for Optimal Properties of Pushdown Systems Reinforcement of a Network Igor Walukiewicz and its Connections with Principal Partition H. Narayanan, Sachin B. Patkar On-Line Edge-Coloring A Decidable Dense with a Fixed Number of Colors Branching-time Temporal Logic Lene Monrad Favrholdt, Salvatore La Torre and Morten Nyhave Nielsen Margherita Napoli On Approximability of the Fair Equivalence Relations Independent/Connected Edge Orna Kupferman, Nir Piterman, Dominating Set Problems Moshe Vardi Toshihiro Fujito 12:30-14:00 Lunch 14:00-15:00 Invited Talk: Philip Wadler An Algebra for XML Query 15:00-15:30 Tea 15:30-17:00 Arithmetic Circuits and Combining Semantics with Polynomial Replacement Systems Non-Standard Interpreter Pierre McKenzie, Heribert Hierarchies Vollmer, Klaus W. Wagner Sergei Abramov, Robert Glueck Depth-3 Arithmetic Circuits Using Modes to Ensure for S(2,n)(X) and Extensions of Subject Reduction for Typed the Graham-Pollack Theorem Logic Programs with Subtyping Jaikumar Radhakrishnan, Pranab Jan-Georg Smaus, Francois Sen, Sundar Vishwanathan Fages, Pierre Deransart The Weak Monadic Quantifier Dynamically Ordered Alternation Hierarchy of Probabilistic Choice Logic Equational Graphs is Infinite Programming Ly Olivier Marina De Vos, Dirk Vermeir 14 December 2000 9:00-10:00 Invited Talk: Bernard Chazelle Irregularities of Distribution, Derandomization, and Complexity Theory 10:10-11:10 Coordinatized Kernels and A Complete Fragment of Catalytic Reductions: Improved Higher-Order Duration FPT Algorithms for Max Leaf $\mu$-Calculus Spanning Tree and Other Problems Dimitar P. Guelev Michael R. Fellows, Catherine McCartin, Ulrike Stege, Frances A. Rosamond Planar Graph Blocking for A Complete Axiomatisation External Searching for Timed Automata Surender Baswana, Sandeep Sen Huimin Lin and Wang Yi 11:10-11:30 Tea 11:30-12:30 Text Sparsification via . Semantic Theory for Local Maxima Heterogeneous System Design Pierluigi Cresceznzi, Alberto Rance Cleaveland, Gerald Del Lungo, Roberto Grossi, Luettgen Elena Lodi, Linda Palgi, Gianluca Rossi Approximate Swapped Matching Formal Verification of the A Amir, M Lewenstein, E. Porat Ricart-Agrawala Algorithm Ekaterina Sedletsky, Amir Pnueli, Mordechai Ben-Ari 12:30-14:00 Lunch 14:00-15:00 Invited Talk: Jose Meseguer Rewriting Logic as a Metalogical Framework 15:00-15:30 Tea 15:30-17:00 On distribution-specific A General Framework for learning with membership queries Types in Graph Rewriting versus pseudorandom generation Barbara Koenig Johannes Köbler, Wolfang Lindner $\Theta_2^p$-completeness: The Ground Congruence for A classical approach for new Chi Calculus results Yuxi Fu, Zhenrong Yang Joel Vogel, Holger Spakowski Is the Standard Proof System Inheritance in the Join for SAT P-optimal? Calculus Johannes Köbler, Jochen Messner Cedric Fournet, Cosimo Laneve, Luc Maranget Didier Remy 15 December 2000 9:00-10:00 Invited Talk: Martin Grötschel Frequency Assignment in Mobile Phone Systems 10:10-11:10 Approximation Algorithms The Fine Structure of for Bandwidth and Storage Game Lambda Models Allocation Problems under Real Pietro Di Gianantonio, Time Constraints Gianluca Franco Stefano Leonardi, Alberto Marchetti-Spaccamela, Andrea Vitaletti Dynamic Spectrum Allocation: Strong Normalisation of The Impotency of Duration Second Order Symmetric Notification Lambda-calculus Bala Kalyanasundaram, Kirk Pruhs Michel Parigot 11:10-11:30 Tea 11:30-12:30 Scheduling to minimize the Keeping Track of the Latest average completion time of Gossip in Shared Memory Systems dedicated tasks Bharat Adsul, Aranyak Mehta, Foto Afrati, Eviripidis Bampis, Milind Sohoni Aleksei V. Fishin, Klaus Jansen Claire Keyon Hunting for Functionally On Concurrent Knowledge Analogous Genes and Logical Clock Abstractions M. T. Hallett, J. Lagergren Ajay Kshemkalyani 12:30-14:00 Lunch 14:00-15:00 Invited Talk: Peter Buneman Data Provenance: Some Basic Issues 15:00-15:30 Tea 15:30-16:30 Decidable Hierarchies of Starfree Languages Christian Glasser, Heinz Schmitz Prefix languages of Church-Rosser Languages Jens R. Woinowski 16:30-17:00 Closing Organization: FST TCS 2000 is being organized by the Indian Institute of Technology, Delhi under the aegis of the Indian Association for Research in Computer Science (IARCS). -- Sanjiva Prasad Associate Professor Department of Computer Science and Engineering sanjiva@cse.iitd.ernet.in Indian Institute of Technology, Delhi (Off) +91 11 659 1294 Hauz Khas, New Delhi 110016 (Res) +91 11 659 1684 INDIA (Fax) +91 11 686 8765 http://www.cse.iitd.ernet.in/~sanjiva ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 08:08:36 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFD8a502921 for ; Wed, 15 Nov 2000 08:08:36 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA05158 for ; Wed, 15 Nov 2000 08:08:31 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Nov 15 09:06:29 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from nslocum.cs.bell-labs.com by netlib2; Tue Nov 14 18:35:51 EST 2000 Received: (from clarkson@localhost) by nslocum.cs.bell-labs.com (8.9.3/8.9.3) id SAA3626730 for compgeom-announce; Tue, 14 Nov 2000 18:35:51 -0500 (EST) Date: Tue, 14 Nov 2000 18:35:51 -0500 (EST) From: Ken Clarkson Message-Id: <200011142335.SAA3626730@nslocum.cs.bell-labs.com> To: compgeom-announce@research.bell-labs.com Subject: List administrivia: apologies Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 849 Lines: 23 Dear compgeom-announce subscriber: The list has been broken for awhile, but should be better now. I'm sorry for the long delay (in some cases past the point of relevance) of some postings to the list. The problem was the local mail system, which would occasionally send out empty messages, as you may also have noticed. Such empty messages then cause various error messages to be generated, with puzzling results for subscribers and especially for those who post to the list. Anyway, I believe it should be better now, and again, sorry. Ken Clarkson (still) maintainer of compgeom-announce ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 08:08:47 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFD8l502925 for ; Wed, 15 Nov 2000 08:08:47 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA05184 for ; Wed, 15 Nov 2000 08:08:42 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Nov 15 09:08:25 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Sun Oct 15 21:33:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sun Oct 15 21:32:26 EDT 2000 Received: from mserve1.acs.ucalgary.ca ([136.159.34.51]) by dusty; Sun Oct 15 21:32:24 EDT 2000 Received: from ucalgary.ca (mserve2.acs.ucalgary.ca [136.159.34.55]) by mserve1.acs.ucalgary.ca (Postfix) with ESMTP id 44A3111B4 for ; Sun, 15 Oct 2000 19:32:23 -0600 (MDT) Received: from 124-76.dialup.ucalgary.ca(136.159.124.76) by mserve2.acs.ucalgary.ca via smap (V2.0) id ZZ578547; Sun, 15 Oct 2000 19:31:21 -0600 From: "Marina Gavrilova" To: Subject: CFP for International Workshop on Computational Geometry, ICCS'2001 Date: Sun, 15 Oct 2000 19:37:05 -0600 Message-ID: MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2910.0) Importance: Normal X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2919.6700 Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 5706 Lines: 205 Dear Colleagues, Attached to this message is the Call for Papers for International Workshop on Computational Geometry and Applications, 2001. The workshop will be held in conjunction with the International Conference on Computational Science ICCS'2001, San Francisco, USA. The proceedings of the workshop will be published in the Springer-Verlag Lecture Notes in Computer Science (LNCS) series. Thank you very much for your time, Marina Gavrilova ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Dr. Marina L. Gavrilova, Program Committee Member, Special Events Committee Member, ICCS'2001 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 ---------------------------------------------------------------------------- CALL FOR PAPERS INTERNATIONAL WORKSHOP on COMPUTATIONAL GEOMETRY AND APPLICATIONS in conjunction with THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE 2001 San Francisco, California, USA May 28 - 30, 2001 http://www.ucalgary.ca/iccs Workshop Description -------------------------------- Papers presenting the results of original research in all areas of computational geometry and related areas, are invited for submission. The workshop web site is accessible by following a link from the ICCS web site http://www.ucalgary.ca/iccs or directly at http://www.cpsc.ucalgary.ca/~marina/Newweb/session.htm. Topics of interest include, but are not limited to: COMPUTATIONAL GEOMETRY ----------------------------------------------- Point Location Range Searching Visibility Graphs Space Partitioning Voronoi Diagrams and Delaunay triangulations Convex Hulls Arrangements of Hyperplanes Nearest-Neighbor Search Proximity Problems Parallel Computational Geometry GIS (Geographical Information Systems) --------------------------------------------------------- Mesh Generation Surface Simplification Interpolation and Surface Reconstruction Data Models and Representation Relational Databases Spacial and Terrain Analysis COMPUTER GRAPHICS AND VISION ------------------------------------------------------- Image Synthesis Image Representation and Rendering Model-Based Recognition Image Segmentation AREAS RELATED TO CG -------------------------------------- Exact Computation Robotics Solid Modeling CAD/CAM Molecular biology Astrophysics Physics Mechanics Other related areas The design and implementation of algorithms in parallel and distributed environments, and applications of such methods to mechanics and physics, are of special interest. Paper Submission ------------------------- We invite you to submit a: full paper of 6 to 10 pages (Letter or A4 paper) for oral presentation short paper of 2 to 4 pages (Letter or A4 paper) for poster presentation. Please include a cover page which lists the following: - name, affiliation, address and e-mail address of each author - name of the presenting author - name of the contact author - a maximum of 5 keywords - 3 nominated referees and contact information of all nominated referees The submitted paper must be camera-ready and formatted according to the rules of LNCS. See http://www.springer.de/comp/lncs/authors.html for formatting information. Please follow the guidelines posted at http://www.ucalgary.ca/iccs to format your submission. Electronic submissions in PS, PDF, LaTex or MS Word format are accepted. Hard copies should be mailed only if electronic submission is not possible. Submission implies the willingness of at least one of the authors to register and present the paper. Proceedings ------------------ The proceedings of the Conference will be published in the Springer-Verlag Lecture Notes in Computer Science (LNCS) series. Important Dates ---------------------- January 19, 2001: Draft papers due March 1, 2001: Notification of Acceptance March 29, 2001: Camera Ready Papers and Pre-registration due May 28 - 30, 2001: ICCS 2001 Conference Contact Information ----------------------------- All submissions to Computational Geometry and Applications Workshop can be send directly to ICCS'2001 Workshop Chair: Dr. Marina L. Gavrilova, Program Committee Member, Special Events Committee Member, ICCS'2001 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 Submissions can be also send to: ICCS 2001 Department of Computer Science University of Reading Reading RG6 6AY United Kingdom Telephone: 44-118-931-6722 Fax: 44-118-975-1994 E-mail: iccs2001@csres.cs.rdg.ac.uk --------------------------------------------------------------------------- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Dr. Marina Gavrilova Dept. Of Computer Science University of Calgary Office: MS 269 Phone: (403) 220-5105 Fax: (403) 284-4707 E-mail: marina@cpsc.ucalgary.ca WWW: www.cpsc.ucalgary.ca/~marina ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 08:14:41 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFDEf502934 for ; Wed, 15 Nov 2000 08:14:41 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA05389 for ; Wed, 15 Nov 2000 08:14:35 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Nov 15 09:13:11 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Oct 19 11:45:06 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Oct 19 11:44:54 EDT 2000 Received: from cis.ohio-state.edu ([164.107.115.5]) by dusty; Thu Oct 19 11:44:53 EDT 2000 Received: from beta.cis.ohio-state.edu (tamaldey@beta.cis.ohio-state.edu [164.107.112.14]) by cis.ohio-state.edu (8.9.1/8.9.1) with SMTP id LAA05594 for ; Thu, 19 Oct 2000 11:44:52 -0400 (EDT) Message-Id: <200010191544.LAA05594@cis.ohio-state.edu> Date: Thu, 19 Oct 2000 11:44:52 -0400 (EDT) From: tamal dey Subject: Call for papers for a special issue of IJFCS on triangulations To: compgeom-announce@research.bell-labs.com MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: FFSiaV1yIDdKnrf36XBp6w== X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4u sparc Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2562 Lines: 71 CALL FOR PAPERS Special Issue of INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE on Volume and Surface Triangulations Triangulation has been used as an important data structure and methodology for many problems in different applications such as finite element methods, computer graphics, geometric modeling, and geographical information systems. The classical Delaunay triangulation and its dual, the Voronoi diagram, has been extensively studied and many beautiful theorems are known. Recently, research in surface reconstruction, simplification, and mesh generation have spurred new combinatorial and algorithmic advances for triangulations. We can expect that the trend will continue, novel methodologies for triangulations will be developed, and further applications will be discovered. Accordingly, we are planning a special issue of IJFCS on new results on volume and surface triangulations in topics of interest that include, but are not limited to: [o] Data structures and algorithms for triangulations [o] Geometric modeling [o] Mesh generation [o] Surface reconstruction and simplification [o] Applications of triangulations A timely publication with a fast refereeing process is planned. Submit five copies of your manuscript by February 15, 2001, to one of the guest editors: Tamal K. Dey Department of Computer and Information Science The Ohio State University 2015 Neil Av., Columbus, OH 43210-1277 U.S.A Email: tamaldey@cis.ohio-state.edu Siu-Wing Cheng Department of Computer Science Hong Kong University of Science Technology Clear Water Bay Hong Kong Email: scheng@cs.ust.hk Instructions for submitting papers: Papers should not exceed 30 pages including figures, tables, etc. Papers should not have been previously published, nor currently submitted elsewhere for publication. Papers should include a title page containing title, authors' names and affiliations, as well as the contact author's name, email and postal addresses, and phone and fax numbers. All submissions should include an abstract of no more than 500 words. All submitted papers will be refereed under the usual criteria of IJFCS. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 08:22:44 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFDMi502945 for ; Wed, 15 Nov 2000 08:22:44 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA05944 for ; Wed, 15 Nov 2000 08:22:35 -0600 (CST) Message-Id: <200011151422.IAA05944@dcs-server1.cs.uiuc.edu> Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Nov 15 09:15:17 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon Oct 23 14:39:05 EDT 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Oct 23 14:37:28 EDT 2000 Received: from math.fu-berlin.de ([160.45.40.10]) by dusty; Mon Oct 23 14:37:27 EDT 2000 Received: (qmail 11700 invoked from network); 23 Oct 2000 20:37:25 +0200 Received: from sahib.inf.fu-berlin.de (HELO sahib) (160.45.111.13) by leibniz.math.fu-berlin.de with SMTP; 23 Oct 2000 20:37:25 +0200 Date: Mon, 23 Oct 2000 20:37:25 +0200 (MEST) From: Helmut Alt Subject: FreePositions in the European Graduate Program "Combinatorics, Geometry, and Computation" To: theorynt@vm1.nodak.edu, DMANET@math.utwente.nl, compgeom-announce@research.bell-labs.com, fg011@inf.fu-berlin.de, cgc-doz-all@inf.fu-berlin.de MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: /INrBKhY7L+9b6a5xpcn3A== X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.4 SunOS 5.8 sun4u sparc Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2573 Lines: 59 ---------------------------------------------------------------------------- European Graduate Program Berlin ------------------------------------------ Zurich Combinatorics, Geometry, and Computation ---------------------------------------------------------------------------- In the newly established graduate program two-year scholarships for Ph.D.students are available in Berlin starting January 1st, 2001. Applicants should have a degree in mathematics, computer science, or a related area equivalent to the German university diploma (e.g. M.S.) with grades significantly above average. The program is a joint initiative of the ETH Zurich, the three universities of Berlin - Free University, Technical University, Humboldt-University - and the Konrad-Zuse-Research Center. The German partners are financially suppor- ted by the German Research association (Deutsche Forschungsgemeinschaft, DFG). The amount of the scholarships in Berlin is calculated according to the guidelines of the DFG and is up to DM 2890 per month, tax free (family supplement DM 400). The scientific program ranges from theoretical fundamentals to applications. The areas of research are combinatorics, geometry, optimization, algorithms and computation. In Berlin the students are supervised by the professors Aigner, Alt, Rote, Schulz (FU), Moehring, Ziegler (TU), Proemel (HU) and Groetschel (ZIB). Applications with curriculum vitae, copies of certificates, theses, a letter of recommendation of the last advisor and a brief description of the proposed research should be sent until November 8, 2000 to the speaker of the program in Berlin: Prof. Dr. Helmut Alt Institut fuer Informatik Freie Universitaet Berlin Takustrasse 9 D-14195 Berlin Further information can be obtained from Bettina Felsner Tel. ++49-30-838 75 104 bfelsner@inf.fu-berlin.de Internet: http://www.inf.fu-berlin.de/gk-cgc --------------------------------------------------------------------------- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 08:26:28 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFDQS502949 for ; Wed, 15 Nov 2000 08:26:28 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA06144 for ; Wed, 15 Nov 2000 08:26:23 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Nov 15 09:23:05 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Wed Nov 1 12:49:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Nov 1 12:48:54 EST 2000 Received: from photon.poly.edu ([128.238.32.22]) by dusty; Wed Nov 1 12:48:53 EST 2000 Received: from localhost (yjc@localhost) by photon.poly.edu (8.9.0/8.9.0) with ESMTP id MAA03189; Wed, 1 Nov 2000 12:48:29 -0500 (EST) Date: Wed, 1 Nov 2000 12:48:29 -0500 (EST) From: Yi-Jen Chiang To: DMANET@zpr.uni-koeln.de, THEORYNT@listserv.nodak.edu, compgeom-announce@research.bell-labs.com, GRAPHNET@listserv.nodak.edu, opt-net@ZIB.DE, dm@INFORMATIK.HU-BERLIN.DE, DMA-LIST@nic.surfnet.nl, THEORY-A@listserv.nodak.edu cc: Yi-Jen Chiang Subject: WADS 2001 Call for Papers (slightly modified version) Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2561 Lines: 70 This is a slightly modified version with some typos corrected. Please ignore the previous version posted about a week ago. Thanks! ------------ PRELIMINARY CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions will be posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: receipt of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) Program Committee: Co-Chairs: F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown) PC-Members: A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 14:02:28 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFJ2R503657 for ; Wed, 15 Nov 2000 14:02:28 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id OAA27621 for ; Wed, 15 Nov 2000 14:02:21 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Nov 15 14:58:47 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Fri Nov 10 01:51:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Nov 10 01:50:08 EST 2000 Received: from cse.unl.edu ([129.93.33.1]) by dusty; Fri Nov 10 01:50:07 EST 2000 Received: from localhost (cterlapu@localhost) by cse.unl.edu (8.9.1/8.9.1) with ESMTP id AAA4584193 for ; Fri, 10 Nov 2000 00:50:05 -0600 (CST) Date: Fri, 10 Nov 2000 00:50:05 -0600 From: Chakravarthy Terlapu To: compgeom-discuss@research.bell-labs.com Subject: minimum bounding box for a convex polygon Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 707 Lines: 22 Hi, I am a graduate student from University Of Nebraska. I am looking for drawing a minimum bounding box for a given set of points. I could draw a convex polygon from the given points, but to draw a minimum bounding box around a convex polygon seems confusing in C. Could you give me a link where I can get the code in C for drawing a minimum bounding box for a convex polygon. It would be great if you could help me with this. Thanks Chak Terlapu ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 14:08:53 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFJ8q503667 for ; Wed, 15 Nov 2000 14:08:53 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id OAA03051; Wed, 15 Nov 2000 14:08:40 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Nov 15 15:03:58 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Wed Nov 15 14:05:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Nov 15 14:03:10 EST 2000 Received: from jardine.math.uwo.ca ([129.100.75.21]) by dusty; Wed Nov 15 14:03:07 EST 2000 Received: from uwo.ca (jardine@localhost [127.0.0.1]) by jardine.math.uwo.ca (8.10.2/8.10.0) with ESMTP id eAFJ4cG17084 for ; Wed, 15 Nov 2000 14:04:38 -0500 Sender: jardine@jardine.math.uwo.ca Message-ID: <3A12DE46.26E62EF7@uwo.ca> Date: Wed, 15 Nov 2000 14:04:38 -0500 From: Rick Jardine Organization: Math. Dept., Univ. of Western Ontario X-Mailer: Mozilla 4.75 [en] (X11; U; Linux 2.2.16 i686) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: conference at Stanford Content-Type: multipart/mixed; boundary="------------7C13F518B67A34C76E87DE34" Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2161 Lines: 72 This is a multi-part message in MIME format. --------------7C13F518B67A34C76E87DE34 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit --------------7C13F518B67A34C76E87DE34 Content-Type: text/plain; charset=us-ascii; name="at-cs.txt" Content-Transfer-Encoding: 7bit Content-Disposition: inline; filename="at-cs.txt" First Announcement: Conference on Algebraic Topological Methods in Computer Science Department of Mathematics Stanford University July 30 - August 3, 2001 The application of algebraic topological methods in areas related to Computer Science is an emerging field that is of interest to both pure and applied mathematical scientists. The aim of this conference is to describe recent advances, and define the fundamental open problems in the field through a mixture of expository and technical lectures. There will be twenty lectures, on a variety of topics in the area. The following is a preliminary list of invited speakers: John Baez (Math, UC Riverside) Marshall Bern (Xerox PARC) Tamal Dey (CS, Ohio State) Herbert Edelsbrunner (CS, Duke) David Eppstein (CS, UC Irvine) Michael Freedman (Microsoft) Philippe Gaucher (CNRS, Strasbourg) Eric Goubault (Commissariat a l'Energie Atomique, France) Jean Goubault-Larrecq (ENS Cachan) Marco Grandis (Dip. di Mat., Genova) Jeremy Gunawardena (HP BRIMS) Joel Hass (Math Dept, UC Davis) Maurice Herlihy (CS, Brown) Reinhard Laubenbacher (NMSU) Laszlo Lovasz (Microsoft) Vaughan Pratt (CS, Stanford) Christian Reidys (Los Alamos National Lab) Bernd Sturmfels (Math Dept, UC Berkeley) Noson Yanofsky (CS, Brooklyn College) All conference announcements and information will be available at the web site: http://www.math.uwo.ca/~jardine/at-cs.html The organizers for this meeting are: Gunnar Carlsson: gunnar@math.stanford.edu Rick Jardine: jardine@uwo.ca --------------7C13F518B67A34C76E87DE34-- ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 16:14:56 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFLEu503828 for ; Wed, 15 Nov 2000 16:14:56 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id QAA17677; Wed, 15 Nov 2000 16:14:39 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Nov 15 17:13:58 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Wed Nov 15 16:47:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Nov 15 16:46:29 EST 2000 Received: from geometry.cims.nyu.edu ([128.122.81.33]) by dusty; Wed Nov 15 16:46:27 EST 2000 Received: (from pollack@localhost) by geometry.cims.nyu.edu (8.9.1/8.9.1) id QAA01362 for compgeom-announce@research.bell-labs.com; Wed, 15 Nov 2000 16:46:22 -0500 (EST) Date: Wed, 15 Nov 2000 16:46:22 -0500 (EST) From: Ricky Pollack Message-Id: <200011152146.QAA01362@geometry.cims.nyu.edu> To: compgeom-announce@research.bell-labs.com Subject: 30th computational geometry day, friday Nov. 17 Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3396 Lines: 92 New York University Courant Institute of Mathematical Sciences THIRTIETH COMPUTATIONAL GEOMETRY DAY Friday, November 17, 2000 Room 109, Warren Weaver Hall 251 Mercer St., New York, NY 10012 0.00--10.30 Coffee (Warren Weaver Hall Lobby 10:30--11:15 Bernard Chazelle, Princeton University and NEC Research Institute The Discrepancy Method 11:30--12:15 Timothy Chan, Waterloo University On Levels in Arrangements of Curves 12:30--2:00 Lunch 2:00--3:00 Open Problem Session 3:00--3:45 Micha Sharir, Courant Institute, NYU and Tel Aviv University New Bounds for Incidences 4:00--5:00 Wine and Cheese Reception (13th floor lounge) For more information contact: Richard Pollack (212) 998-3167 pollack@geometry.nyu.edu *************************abstracts*************************************** The Discrepancy Method Bernard Chazelle Princeton University and NEC Research Institute The discrepancy method, which is the linkage between discrepancy theory and peudorandomness, has been the most powerful tool for understanding randomization as a computational resource. It has also been used for proving lower bounds in circuit complexity and communication complexity. I will review some of the milestones in the story of the discrepancy method and I will discuss what it can do and what it (probably) cannot do. On Levels in Arrangements of Curves Timothy Chan University of Waterloo We discuss a well-known problem: bounding the combinatorial complexity of the $k$-level in an arrangement of $n$ curves in the plane. Subquadratic upper bounds were known for lines (by Dey) and for graphs of quadratic functions (by Tamaki and Tokuyama). In this talk, we extend these results and give the first nontrivial bound, near $O(nk^{1-2/3^s})$, for curves that are graphs of polynomial functions of any constant degree~$s$. The proof is simple and relies on Tamaki and Tokuyama's theorem for cutting pseudo-parabolas into pseudo-segments, as well as a new observation for cutting pseudo-segments into pieces that can be extended to pseudo-lines. New Bounds for Incidences Micha Sharir Courant Institute, NYU and Tel Aviv University We present new upper bounds on the number of incidences between $m$ points and $n$ circles in the plane. The known 10-year-old bound was $O(m^{3/5}n^{4/5}+m+n)$. The new bounds are $O(m^{2/3}n^{2/3}+m)$ for $m\ge n^{3/2}$ and $O(m^{4/7}n^{17/21}+n)$ for $m\le n^{3/2}$. The proof combines Sz\'ekely's technique, which is based on crossing numbers of graphs, with Tamaki and Tokuyama's result on cutting pseudo-parabolas, and with cuttings in dual space. The talk will also review these tools and discuss several open problems and challenges suggested by the new proof. Finally, the new result of Chan, presented in this CG-Day, facilitates the extension of the analysis to obtain improved upper bounds for incidences involving points and graphs of polynomial functions of any fixed maximum degree. (Joint work with Boris Aronov.) ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 15 16:15:38 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAFLFc503834 for ; Wed, 15 Nov 2000 16:15:38 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id QAA17765; Wed, 15 Nov 2000 16:15:29 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Nov 15 17:10:50 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Wed Nov 15 15:53:07 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Nov 15 15:51:12 EST 2000 Received: from flamenco.rutgers.edu ([128.6.112.26]) by dusty; Wed Nov 15 15:51:11 EST 2000 Received: (from rsuneeta@localhost) by flamenco.rutgers.edu (8.10.1/8.10.1) id eAFKpAE01465; Wed, 15 Nov 2000 15:51:10 -0500 (EST) Date: Wed, 15 Nov 2000 15:51:10 -0500 (EST) Message-Id: <200011152051.eAFKpAE01465@flamenco.rutgers.edu> From: Suneeta Ramaswami To: compgeom-announce@research.bell-labs.com Subject: Faculty positions at Rutgers University, Camden Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1636 Lines: 43 The CS department at Rutgers University, Camden has faculty openings. Although we are primarily looking for applicants at the assistant professor level, we will consider applicants for senior positions as well. Please feel free to write to me with questions. - Suneeta Ramaswami ======================================================================== Rutgers University - Camden Department of Computer Science The Department of Computer Science at Rutgers University - Camden invites applications for two tenure-track positions at the assistant professor level beginning September 2001. Candidates in all areas of computer science are encouraged to apply. A Ph.D. in Computer Science is required. Salary is contingent upon qualifications. Rutgers University stands in the top 5% of AAUP rankings of university salary and benefits. Applicants should send a curriculum vitae, statement of research, statement of teaching interests/experience, and three letters of reference to: Chair, Faculty Search Committee Department of Computer Science Rutgers University Camden, NJ 08102 Review of applications will begin immediately and will continue until the positions are filled. Rutgers University is an Equal Opportunity and Affirmative Action Employer and strongly encourages applications from women and members of minority groups. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Nov 16 08:27:21 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAGDRL505297 for ; Thu, 16 Nov 2000 08:27:21 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA14066; Thu, 16 Nov 2000 08:27:08 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Nov 16 09:26:20 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Thu Nov 16 03:55:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Nov 16 03:54:34 EST 2000 Received: from cedar.dcs.shef.ac.uk ([143.167.8.6]) by dusty; Thu Nov 16 03:54:33 EST 2000 Received: from padley.dcs.shef.ac.uk (padley.dcs.shef.ac.uk [143.167.9.77]) by cedar.dcs.shef.ac.uk (8.9.3+Sun/8.9.3) with ESMTP id IAA24236; Thu, 16 Nov 2000 08:54:27 GMT From: Joab Winkler Received: (from joab@localhost) by padley.dcs.shef.ac.uk (8.9.3+Sun/8.9.3) id IAA06677; Thu, 16 Nov 2000 08:54:27 GMT Date: Thu, 16 Nov 2000 08:54:27 GMT Message-Id: <200011160854.IAA06677@padley.dcs.shef.ac.uk> To: compgeom-announce@research.bell-labs.com Subject: Workshop on Geometric Computations Cc: j.winkler@cedar.dcs.shef.ac.uk X-Sun-Charset: US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1460 Lines: 49 Workshop - UNCERTAINTY IN GEOMETRIC COMPUTATIONS SHEFFIELD, UK, 4-6 JULY 2001 ------------------------------------------------ ------------------------------------------------ A workshop 'Uncertainty in Geometric Computations' will be held at The University of Sheffield, 4-6 July 2001. It is sponsored by the EPSRC and LMS (London Mathematical Society) and is of interest to researchers in pattern recognition, computer graphics and computer-aided design. The organisers are particularly keen to attract computer scientists, mathematicians and engineers in order to foster new links for collaboration. More details, including an 'indication of interest' and details of submission of a paper, are on the web page http://www.shef.ac.uk/~geom2001/ Several studentships, supported by the EPSRC, are available to eligible students. For more details, please contact the organisers : Joab Winkler (j.winkler@dcs.shef.ac.uk) Mahesan Niranjan (m.niranjan@dcs.shef.ac.uk) ______________________________________________________________ Dr Joab Winkler Professor Mahesan Niranjan Department of Computer Science The University of Sheffield 211 Portobello Street Sheffield S1 4DP United Kingdom ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Thu Nov 16 08:33:31 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.11.0/8.11.0) with ESMTP id eAGDXU505311 for ; Thu, 16 Nov 2000 08:33:30 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA20146 for ; Thu, 16 Nov 2000 08:33:25 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Nov 16 09:28:13 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Wed Nov 15 18:07:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Nov 15 18:06:08 EST 2000 Received: from perry.geo.berkeley.edu ([128.32.149.11]) by dusty; Wed Nov 15 18:06:06 EST 2000 Received: from geomorph (mcc-356-4.Geo.Berkeley.EDU [128.32.102.156]) by perry.geo.berkeley.edu (8.9.1a/8.9.1) with SMTP id PAA08322; Wed, 15 Nov 2000 15:06:04 -0800 (PST) Message-ID: <009601c04f58$fe4c3f20$9c662080@berkeley.edu.berkeley.edu> From: "Mauro Casadei" To: , References: Subject: Re: minimum bounding box for a convex polygon Date: Wed, 15 Nov 2000 15:08:40 -0800 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2615.200 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2615.200 Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1391 Lines: 44 That's easy: update after reading every point the Xmax,Xmin, Ymax and Ymin for your given set. After reading all your points this coordinates define your bounding box. ----- Original Message ----- From: Chakravarthy Terlapu To: Sent: Thursday, November 09, 2000 10:50 PM Subject: minimum bounding box for a convex polygon > Hi, > > I am a graduate student from University Of Nebraska. I am looking for > drawing a minimum bounding box for a given set of points. I could draw a > convex polygon from the given points, but to draw a minimum bounding box > around a convex polygon seems confusing in C. Could you give me a link > where I can get the code in C for drawing a minimum bounding box for a > convex polygon. It would be great if you could help me with this. > > Thanks > Chak Terlapu > > > > > > ------------- > The compgeom mailing lists: see > http://netlib.bell-labs.com/netlib/compgeom/readme.html > or send mail to compgeom-request@research.bell-labs.com with the line: > send readme > Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. > ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Nov 17 06:33:34 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id GAA01298 for ; Fri, 17 Nov 2000 06:33:34 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id SAA17759 for ; Thu, 16 Nov 2000 18:14:23 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Nov 16 19:11:59 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Nov 16 18:11:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Nov 16 18:11:02 EST 2000 Received: from mailhost3.lanl.gov ([128.165.3.9]) by dusty; Thu Nov 16 18:11:01 EST 2000 Received: from x-mail.lanl.gov (x-mail.lanl.gov [128.165.3.111]) by mailhost3.lanl.gov (8.10.1/8.10.1/(cic-5, 6/12/00)) with ESMTP id eAGNAi431133; Thu, 16 Nov 2000 16:10:44 -0700 Received: from lanl.gov (estefan.lanl.gov [128.165.123.210]) by x-mail.lanl.gov (8.9.3/8.9.3/(cic-5, 2/9/99)) with ESMTP id QAA00494; Thu, 16 Nov 2000 16:10:41 -0700 (MST) Sender: phenning@lanl.gov Message-ID: <3A146973.76D0D59D@lanl.gov> Date: Thu, 16 Nov 2000 16:10:44 -0700 From: Paul Henning Organization: Los Alamos National Laboratory X-Mailer: Mozilla 4.7C-SGI [en] (X11; U; IRIX64 6.5 IP30) X-Accept-Language: en-US, en MIME-Version: 1.0 To: "'Mauro Casadei'" , compgeom-discuss@research.bell-labs.com, John.Dickinson@nrc.ca Subject: Re: minimum bounding box for a convex polygon References: <35C5DD9F60FED21192B00004ACA6E6C7FFF959@nrclonex1.imti.nrc.ca> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1543 Lines: 42 It should be noted that Gottschalk's algorithm produces an _approximate_ minimum bounding box. Unfortunately, it will bound a polygon like [(1,0),(0,1),(-1,0),(0,-1)] by an axis-aligned box, which is not a great bound. All that being said, I haven't found a better approach for 3-D. O'Rourke has an algorithm in: @Article{orourke, author = {O'Rourke, Joseph}, title = {Finding Minimal Enclosing Boxes}, journal = {International Journal of Computer and Information Sciences}, year = 1985, volume = 14, number = 3, pages = {183--199}, } for true minimal boxes, but it is a bit tricky to implement. Paul "Dickinson, John" wrote: > If you want an axis-orientated bounding box that will work and is very easy > to do. If not then search for orientated bounding box algorithms on the > net. S. Gottschalk implemented a 3D orientated bounding box algorithm see > the following paper. and his site: http://www.cs.unc.edu/~geom/OBB/OBBT.html > > OBB-Tree: A Hierarchical Structure for Rapid Interference Detection , S. > Gottschalk, M. C. Lin and D. Manocha (27 pages PostScript, ) 493K, Technical > report TR96-013, Department of Computer Science, University of N. Carolina, > Chapel Hill. Proc. of ACM Siggraph'96. > > John ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Nov 17 06:33:34 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id GAA01304 for ; Fri, 17 Nov 2000 06:33:34 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id PAA17484 for ; Thu, 16 Nov 2000 15:53:29 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Nov 16 16:47:05 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Nov 16 15:37:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Nov 16 15:36:45 EST 2000 Received: from cse.unl.edu ([129.93.33.1]) by dusty; Thu Nov 16 15:36:44 EST 2000 Received: from localhost (cterlapu@localhost) by cse.unl.edu (8.9.1/8.9.1) with ESMTP id OAA6545222 for ; Thu, 16 Nov 2000 14:36:40 -0600 (CST) Date: Thu, 16 Nov 2000 14:36:39 -0600 From: Chakravarthy Terlapu To: compgeom-discuss@research.bell-labs.com Subject: breaking a huge tiff image Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1231 Lines: 39 Hi, I have a huge tiff image, the image info is as follows: Format: TIFF, 8-bit, pallette format (216633880 bytes) Resolution : 13227 * 16378 Cropping : Expansion: 4.6874% * 4.6892% (620*768) Selection: Colors: Got all 250 colors I need to break this huge image into chips of size 3000*3000. Could anyone tell me which tool I could use in Linux to do this. when i try to open the image in Linux using GIMP, it closes. I tried to break them using Adobe photoshop, but when i try to open using XV it shows errors like: Warning : incorrect count for field "MinSampleValue (1, expecting 3)" tag ignored Warning: unknow field with tag 34765 ignored Since this is a color image I needed to run a program that converts it to black and white image. But when i run the program and view the output I get a blurred image. This program has run successfullly on many other color tiff images. It would be great if anyone could help me. Thanks in advance Chak Terlapu ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Nov 17 06:33:35 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id GAA01307 for ; Fri, 17 Nov 2000 06:33:34 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id PAA17480 for ; Thu, 16 Nov 2000 15:53:27 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Nov 16 16:45:56 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Thu Nov 16 15:31:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Nov 16 15:29:18 EST 2000 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.37]) by dusty; Thu Nov 16 15:29:13 EST 2000 Received: by nrclonex1.imti.nrc.ca with Internet Mail Service (5.5.2650.21) id ; Thu, 16 Nov 2000 15:29:22 -0500 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFF959@nrclonex1.imti.nrc.ca> From: "Dickinson, John" To: "'Mauro Casadei'" , compgeom-discuss@research.bell-labs.com, cterlapu@cse.unl.edu Subject: RE: minimum bounding box for a convex polygon Date: Thu, 16 Nov 2000 15:29:17 -0500 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2650.21) Content-Type: text/plain; charset="iso-8859-1" Errors-To: compgeom-owner@research.bell-labs.com Reply-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2458 Lines: 70 If you want an axis-orientated bounding box that will work and is very easy to do. If not then search for orientated bounding box algorithms on the net. S. Gottschalk implemented a 3D orientated bounding box algorithm see the following paper. and his site: http://www.cs.unc.edu/~geom/OBB/OBBT.html OBB-Tree: A Hierarchical Structure for Rapid Interference Detection , S. Gottschalk, M. C. Lin and D. Manocha (27 pages PostScript, ) 493K, Technical report TR96-013, Department of Computer Science, University of N. Carolina, Chapel Hill. Proc. of ACM Siggraph'96. John -----Original Message----- From: Mauro Casadei [mailto:mauro@seismo.berkeley.edu] Sent: November 15, 2000 6:09 PM To: compgeom-discuss@research.bell-labs.com; cterlapu@cse.unl.edu Subject: Re: minimum bounding box for a convex polygon That's easy: update after reading every point the Xmax,Xmin, Ymax and Ymin for your given set. After reading all your points this coordinates define your bounding box. ----- Original Message ----- From: Chakravarthy Terlapu To: Sent: Thursday, November 09, 2000 10:50 PM Subject: minimum bounding box for a convex polygon > Hi, > > I am a graduate student from University Of Nebraska. I am looking for > drawing a minimum bounding box for a given set of points. I could draw a > convex polygon from the given points, but to draw a minimum bounding box > around a convex polygon seems confusing in C. Could you give me a link > where I can get the code in C for drawing a minimum bounding box for a > convex polygon. It would be great if you could help me with this. > > Thanks > Chak Terlapu > > > > > > ------------- > The compgeom mailing lists: see > http://netlib.bell-labs.com/netlib/compgeom/readme.html > or send mail to compgeom-request@research.bell-labs.com with the line: > send readme > Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. > ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Nov 17 09:25:51 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id JAA01524 for ; Fri, 17 Nov 2000 09:25:51 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id JAA14143 for ; Fri, 17 Nov 2000 09:25:49 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Nov 17 10:21:58 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Fri Nov 17 04:35:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Nov 17 04:35:01 EST 2000 Received: from core.inf.ethz.ch ([129.132.178.196]) by dusty; Fri Nov 17 04:35:00 EST 2000 Received: from shadow.inf.ethz.ch (gaertner@shadow-byebye.inf.ethz.ch [129.132.11.131]) by core.inf.ethz.ch (8.9.3/8.9.3) with ESMTP id KAA25041 for ; Fri, 17 Nov 2000 10:34:58 +0100 (MET) From: Bernd Gaertner Received: (from gaertner@localhost) by shadow.inf.ethz.ch (8.8.8/8.8.8) id KAA20449 for compgeom-discuss@research.bell-labs.com; Fri, 17 Nov 2000 10:34:57 +0100 (MET) Date: Fri, 17 Nov 2000 10:34:57 +0100 (MET) Message-Id: <200011170934.KAA20449@shadow.inf.ethz.ch> To: compgeom-discuss@research.bell-labs.com Subject: Re: minimum bounding box for a convex polygon X-Sun-Charset: US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO X-Status: A Content-Length: 761 Lines: 19 > I am a graduate student from University Of Nebraska. I am looking for > drawing a minimum bounding box for a given set of points. I could draw a > convex polygon from the given points, but to draw a minimum bounding box > around a convex polygon seems confusing in C. If you are talking about a point set in the plane, there is C++ code for it in the CGAL library, see www.cgal.org. The algorithm computes the smallest rectangle of any orientation that contains the point set. Best regards, Bernd. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Nov 17 10:34:57 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id KAA01726 for ; Fri, 17 Nov 2000 10:34:57 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id KAA13796 for ; Fri, 17 Nov 2000 10:34:57 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Nov 17 11:27:39 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Fri Nov 17 10:59:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Nov 17 10:57:55 EST 2000 Received: from valis.cs.uiuc.edu ([128.174.244.137]) by dusty; Fri Nov 17 10:57:54 EST 2000 Received: (from sariel@localhost) by valis.cs.uiuc.edu (8.9.3/8.9.3) id JAA01592; Fri, 17 Nov 2000 09:57:52 -0600 Date: Fri, 17 Nov 2000 09:57:52 -0600 From: Sariel Har-Peled To: cterlapu@cse.unl.edu, compgeom-discuss@research.bell-labs.com Subject: Re: minimum bounding box for a convex polygon Message-ID: <20001117095752.A1562@valis.cs.uiuc.edu> References: <200011170934.KAA20449@shadow.inf.ethz.ch> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Disposition: inline User-Agent: Mutt/1.2.5i In-Reply-To: <200011170934.KAA20449@shadow.inf.ethz.ch>; from gaertner@inf.ethz.ch on Fri, Nov 17, 2000 at 10:34:57AM +0100 Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1820 Lines: 53 Hi, For arbitrarily oriented bounding box, people usually use PCA. For guaranteed approximation in 3d (in near linear time), see: @inproceedings{bh-eamvb-99, author = {G.~Barequet and S.~Har-Peled}, title = {Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions}, booktitle = "Proc. 10th ACM-SIAM Sympos. Discrete Algorithms", year = 1999, pages = {82--91} } http://www.uiuc.edu/~sariel/papers/98/bbox.html For source code, see: http://www.uiuc.edu/~sariel/papers/00/diameter/diam_prog.html bye --Sariel On Fri, Nov 17, 2000 at 10:34:57AM +0100, Bernd Gaertner wrote: > > > I am a graduate student from University Of Nebraska. I am looking for > > drawing a minimum bounding box for a given set of points. I could draw a > > convex polygon from the given points, but to draw a minimum bounding box > > around a convex polygon seems confusing in C. > > If you are talking about a point set in the plane, there is C++ code for it > in the CGAL library, see www.cgal.org. The algorithm computes the smallest > rectangle of any orientation that contains the point set. > > Best regards, > Bernd. > > ------------- > The compgeom mailing lists: see > http://netlib.bell-labs.com/netlib/compgeom/readme.html > or send mail to compgeom-request@research.bell-labs.com with the line: > send readme > Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. -- Sariel Har-Peled, CS Dept, UIUC, Urbana, IL, 61801-2987 ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Fri Nov 17 10:35:01 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id KAA01730 for ; Fri, 17 Nov 2000 10:35:01 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id KAA13810; Fri, 17 Nov 2000 10:34:58 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Nov 17 11:29:38 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Fri Nov 17 08:25:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Nov 17 08:24:45 EST 2000 Received: from largo.eecs.tufts.edu ([130.64.23.33]) by dusty; Fri Nov 17 08:24:44 EST 2000 Received: from andante.eecs.tufts.edu (andante [130.64.23.37]) by largo.eecs.tufts.edu (8.9.1a/8.9.1) with ESMTP id IAA29709 for ; Fri, 17 Nov 2000 08:24:29 -0500 (EST) From: Diane Souvaine Received: (from dls@localhost) by andante.eecs.tufts.edu (8.9.3+Sun/8.9.1) id IAA16898 for compgeom-announce@research.bell-labs.com; Fri, 17 Nov 2000 08:24:41 -0500 (EST) Date: Fri, 17 Nov 2000 08:24:41 -0500 (EST) Message-Id: <200011171324.IAA16898@andante.eecs.tufts.edu> To: compgeom-announce@research.bell-labs.com Subject: ACM Symposium on Computational Geometry 2001: CALL FOR PAPERS Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 6427 Lines: 125 ******************************************************************************* PAPERS DUE DECEMBER 6, 2000: Electronic Submission info available on web page. ******************************************************************************* CALL FOR PAPERS Seventeenth Annual Symposium on COMPUTATIONAL GEOMETRY June 3--5, 2001 Tufts University, Medford, Massachusetts http://www.eecs.tufts.edu/EECS/scg01 Sponsored by ACM SIGACT and ACM SIGGRAPH The Seventeenth Annual Symposium on Computational Geometry, featuring an applied track, a theoretical track, and a video review, will be held at Tufts University, Medford, Massachusetts. We invite high-quality submissions in the following areas: * geometric algorithms or combinatorial geometry, for the theoretical track, OR * implementation issues or applications of computational geometry, for the applied track. The proceedings, with the papers of both tracks, will be distributed at the symposium and will subsequently be available for purchase from ACM. A selection of papers will be invited to special issues of journals. During the conference, sessions of presentations will alternate between the two tracks, rather than being in parallel. Topics for the theoretical track include, but are not limited to design and theoretical analysis of geometric algorithms and data structures; lower bounds for geometric problems; and discrete and combinatorial geometry. Topics for the applied track include, but are not limited to experimental analysis of algorithms and data structures; mathematical and numerical issues arising from implementations; and novel uses of computational geometry in other disciplines, such as robotics, computer graphics, geometric and solid modeling, manufacturing, geographical information systems, and molecular biology. Electronic submissions are preferred for the THEORETICAL TRACK but authors may instead mail 8 copies of an extended abstract to arrive by *****DECEMBER 6, 2000****** to David Eppstein Dept. of Information Computer Science, University of California, Irvine, Irvine, CA 92697-3425 USA. Phone: (949) 824-6384; Email: eppstein@ics.uci.edu Electronic submissions are preferred for the APPLIED TRACK but authors may instead mail 10 copies of an extended abstract to arrive by *****DECEMBER 6, 2000****** to Dan Halperin School of Computer Science Schreiber Building, Rm 219 Tel Aviv University Tel Aviv 69978 Israel Phone: +972-3-640-6478; Email: halperin@math.tau.ac.il IMPORTANT DATES: December 6, 2000: Papers due, both tracks February 13, 2001: Video submissions due February 15, 2001: Notification of acceptance or rejection of papers March 1, 2001: Notification of acceptance or rejection of videos March 15, 2001: Camera-ready papers due April 15, 2001: Final versions of videos due June 3--5, 2001: Symposium Papers that primarily address practical issues and implementation experience, even if not tied to a particular application domain, should be submitted to the applied track. Papers that primarily prove theorems should be submitted to the theoretical track. Most experimental work should be submitted to the applied track; an exception would be experiments in support of mathematical investigations. Submissions to one track may be forwarded to the other for consideration, unless the authors have explicitly stated interest in one track only. Papers should be submitted in the form of an extended abstract. Papers should begin with the title of the paper, each author's name, affiliation, and e-mail address, followed by a succinct statement of the problems and goals that are considered in the paper, the main results achieved, the significance of the work in the context of previous research, and a comparison to past research. The abstract should provide sufficient detail to allow the program committee to evaluate the validity, quality, and relevance of the contribution. The entire extended abstract should not exceed 10 pages, using 11 point or larger font and with at least one-inch margins all around. For cases in which the authors consider it absolutely essential to include additional technical details that do not fit into 10 pages, these details may be added in a clearly marked appendix that should appear after the body of the paper and the references; this appendix will not be regarded as a part of the submission and will be considered only at the program committee's discretion. Abstracts in hard copy must be received by December 6, 2000, or postmarked by November 29 and sent airmail. Abstracts in electronic form are due by December 6, 5:00 PM EST. These are firm deadlines: late submissions will not be considered. Authors will be notified of acceptance or rejection by February 15, 2001. A full version of each contribution in final form will be due by March 15, 2001 for inclusion in the proceedings. Theoretical Track Program Committee: Applied Track Program Committee: Boris Aronov (Polytechnic U, Brooklyn) Nancy Amato (Texas A&M ) Otfried Cheong (Utrecht U) Karl Bo"hringer (U Washington, Seattle) Jesu's De Loera (UC Davis) Franca Gianini (IMA, Genova) David Eppstein, Chair (UC Irvine) Lutz Kettner (UNC Chapel Hill) Sariel Har-Peled (UI Urbana Champaign) Dan Halperin, Chair (Tel Aviv U) Piotr Indyk (MIT) Kurt Mehlhorn (MPII, Saarbru"cken) Edgar A. Ramos (MPII Saarbru"cken) Mark Overmars (Utrecht U) Ileana Streinu (Smith College) Seth Teller (MIT) Peter Widmayer (ETH Zurich) Conference Chair: Mariette Yvinec (INRIA Sophia-Antipolis) Diane L.Souvaine (Tufts U) ******************************************************************************* ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Tue Nov 28 16:03:14 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id QAA20557 for ; Tue, 28 Nov 2000 16:03:13 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id QAA24461; Tue, 28 Nov 2000 16:03:05 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Nov 28 16:58:48 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Tue Nov 28 00:29:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Nov 28 00:27:33 EST 2000 Received: from mail.rdc1.va.home.com ([24.2.32.66]) by dusty; Tue Nov 28 00:27:32 EST 2000 Received: from cx344290-c.irvn1.occa.home.com ([24.1.186.155]) by mail.rdc1.va.home.com (InterMail vM.4.01.03.00 201-229-121) with ESMTP id <20001128052731.HUSU23967.mail.rdc1.va.home.com@cx344290-c.irvn1.occa.home.com> for ; Mon, 27 Nov 2000 21:27:31 -0800 Date: Mon, 27 Nov 2000 21:27:34 -0800 From: David Eppstein To: compgeom-announce@research.bell-labs.com Subject: Tenured/tenure track graphics position at UC Irvine Message-ID: <12020600.3184349254@cx344290-c.irvn1.occa.home.com> X-Mailer: Mulberry/2.0.0 (MacOS) X-Face: %L;%tM$D+%zkQ$zp8f/vAx*mr6T79jgxh,SC!$,8.r%HBe}KZ)iMb$tB.Z,30 3QLpj-NoP*NzsIC,boYU]bQ]H'y<#4ga3$21: MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Content-Disposition: inline Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 5090 Lines: 90 University of California, Irvine Information and Computer Science The University of California, Irvine, Department of Information and Computer Science (ICS), is seeking excellent candidates for a tenured or tenure-track position in Computer Graphics. Computer Graphics is a new research area in ICS and is dedicated to grow substantially over the next few years. For more information about the graphics lab at ICS, see the web page http://www.ics.uci.edu/~graphics/. We are particularly interested in graphics for digital arts, but we are open to qualified candidates in other areas who will complement or bolster our current strengths. The position is for Associate or Assistant Professor, but exceptional candidates from all ranks are eagerly sought. We are looking for applicants with a Ph.D. degree in Computer Science or a related field and strong research credentials as evidenced by scholarly publications. Applicants for a senior position must also demonstrate a proven track record in funded research activities. The Department and UCI are poised for exceptional growth in the coming years. The ICS Department (http://www.ics.uci.edu/) is organized as an independent campus unit reporting to the Executive Vice Chancellor. It runs the largest computing program in the University of California system, and has designed an undergraduate honors program that attracts the campus' most qualified students. External funding from government and industrial sponsors exceeded $10 million last year. The Department currently has 38 full-time faculty and 200 Ph.D. students involved in various research areas including analysis of algorithms and data structures, artificial intelligence and machine learning, hardware-software co-design, parallel and distributed processing, embedded systems, communication networks, middleware technology, security and cryptography, databases, information retrieval and visualization, computational biology, computer graphics, human computer interaction and computer supported cooperative work, programming languages, software development and advanced software technology. ICS faculty are at the forefront of research in emerging areas of the computer science discipline such as multimedia/embedded computing, Internet computing and mobile systems, knowledge-discovery in databases, biomedical informatics, the role of information in computer science, and the social aspects of computing technology. The faculty has effective interdisciplinary ties to colleagues in the arts, biology, cognitive science, engineering, management, medicine, and the social sciences. Although UC Irvine is a young university, it has attained remarkable stature in the past 3 decades. Two Nobel prizes were recently awarded to UCI faculty. UCI is located three miles from the Pacific Ocean near Newport Beach, approximately forty miles south of Los Angeles. The climate is ideal year-round avoiding extreme temperatures in winters and summers. Irvine is consistently ranked among the safest cities in the U.S. and has an exceptional public school system. The campus is surrounded by high-technology companies that participate in an active affiliates program. Both the campus and the area offer exciting professional and cultural opportunities. Mortgage and housing assistance are available including newly built, for-sale housing located on campus and within short walking distance from the department. Since ICS is also recruiting applicants in other areas of computer science for additional faculty positions, applications should be accompanied by a cover letter noting that this applicant is for Area A (Graphics), thus ensuring correct routing within our bureaucracy. Applicants should send a CV, three sample papers, and contact information for three or four references to recruit@ics.uci.edu with a cc to recruit-A@ics.uci.edu (PDF, postscript, Word, or ASCII). Applicants are requested to ask their references to send letters of evaluation to recruit@ics.uci.edu by January 12, 2001. Those that insist upon sending hard copy may send it to: ICS Faculty Position [A] c/o Peggy Munhall Department of Information and Computer Science University of California, Irvine Irvine, CA 92697-3425 For more information, prospective applicants are encouraged to contact David Eppstein, Chair, ICS Faculty Position A by email at recruit-A@ics.uci.edu. Application screening will begin immediately upon receipt of curriculum vitae. Maximum consideration will be given to applications received by January 5, 2001. The University of California is an Equal Opportunity Employer, committed to excellence through diversity. -- David Eppstein UC Irvine Dept. of Information & Computer Science eppstein@ics.uci.edu http://www.ics.uci.edu/~eppstein/ ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Nov 29 10:14:35 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id KAA22309 for ; Wed, 29 Nov 2000 10:14:35 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id KAA16816; Wed, 29 Nov 2000 10:14:31 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Nov 29 11:09:27 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Tue Nov 28 19:15:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Nov 28 19:13:44 EST 2000 Received: from ares.cs.Virginia.EDU ([128.143.137.19]) by dusty; Tue Nov 28 19:13:43 EST 2000 Received: from cobra.cs.Virginia.EDU (cobra.cs.Virginia.EDU [128.143.137.16]) by ares.cs.Virginia.EDU (8.9.2/8.9.2/UVACS-2000040300) with ESMTP id TAA28717; Tue, 28 Nov 2000 19:13:40 -0500 (EST) From: Gabriel Robins Received: (from robins@localhost) by cobra.cs.Virginia.EDU (8.9.2/8.9.2) id TAA20113; Tue, 28 Nov 2000 19:13:40 -0500 (EST) Date: Tue, 28 Nov 2000 19:13:40 -0500 (EST) Message-Id: <200011290013.TAA20113@cobra.cs.Virginia.EDU> To: compgeom-announce@research.bell-labs.com Subject: faculty job openings Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1660 Lines: 43 ============================================================================= FACULTY POSITIONS THE UNIVERSITY OF VIRGINIA Department of Computer Science The University of Virginia's Department of Computer Science invites applications for tenure track and tenured faculty positions. Outstanding candidates in all areas of Computer Science will be considered. Research faculty (non tenure- track) openings of all ranks are also available. The Department has a first rate experimental computer science research program and has in place an innovative undergraduate CS curriculum. We are looking for candidates who are or have the potential to become outstanding in both research and teaching. Ph.D. required. Positions will be open until filled, and salary is commensurate with experience. Our Department is a vibrant, exciting research environment. To review our Department's recent accomplishments, please see: http://www.cs.virginia.edu Send a resume and the names of three references to: Professor Jack Stankovic, Chair Department of Computer Science School of Engineering & Applied Science University of Virginia 151 Engineer's Way, P. O. Box 400740 Charlottesville, VA 22904-4740 The University of Virginia is an Equal Opportunity/Affirmative Action Employer. ============================================================================= ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Sun Dec 3 19:49:36 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id TAA02700 for ; Sun, 3 Dec 2000 19:49:36 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id TAA04244; Sun, 3 Dec 2000 19:49:33 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sun Dec 3 20:48:06 EST 2000 Date: Sun, 3 Dec 2000 20:46:01 -0500 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Sat Dec 2 11:13:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sat Dec 2 11:11:08 EST 2000 Received: from moosilauke.cs.dartmouth.edu ([129.170.212.178]) by dusty; Sat Dec 2 11:11:07 EST 2000 Received: (from scot@localhost) by moosilauke.cs.dartmouth.edu (8.9.3/8.9.3) id LAA01506; Sat, 2 Dec 2000 11:11:06 -0500 (EST) From: Scot Drysdale Message-Id: <200012021611.LAA01506@moosilauke.cs.dartmouth.edu> Subject: Faculty Positions at Dartmouth To: THEORY-A@LISTSERV.NODAK.EDUTHEORY-A Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2533 Lines: 58 LISTSERV.dartmouth.edu, compgeom-announce@research.bell-labs.com, sigcse.members@acm.org Date: Sat, 2 Dec 2000 11:11:05 -0500 (EST) Cc: scot@moosilauke.cs.dartmouth.edu (Scot Drysdale) X-Mailer: ELM [version 2.5 PL0pre8] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit DARTMOUTH COLLEGE Faculty Positions in Computer Science The Department of Computer Science anticipates hiring one or more Assistant Professors of Computer Science. We are particularly interested in candidates in the areas of algorithms, graphics, security, and databases. The Department of Computer Science currently includes 14 tenure-track faculty members. In addition, several faculty members in the Thayer School of Engineering and the Department of Mathematics have research interests related to computer science and hold joint or adjunct appointments in Computer Science. Dartmouth College is a highly selective Ivy League university with approximately 4000 undergraduates and 1000 graduate students. It combines the advantages of a small liberal arts college (small class size, excellent students, and close student-faculty interaction) with the research activities of a university. As an indication of this dual commitment, research and teaching both count strongly in decisions on hiring, promotion, and tenure. Persons interested should submit a curriculum vitae and a list of at least four references, at least one of whom can comment on teaching. Review of the applications will begin immediately and will continue until the search is complete. Please send application materials and general inquiries to Delia Mauceli, Computer Science Recruiting, Department of Computer Science, Dartmouth College, 6211 Sudikoff Laboratory, Hanover, NH 03755-3510. Specific questions can be referred to Scot Drysdale, at the same address or at the following email address (facapps@cs.dartmouth.edu). Information on faculty and their research, facilities, graduate students, etc. is available over the World Wide Web at URL http://www.cs.dartmouth.edu. Dartmouth is an equal opportunity/Affirmative Action employer and encourages applications from women and members of minority groups. ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Dec 6 09:28:16 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id JAA13562 for ; Wed, 6 Dec 2000 09:28:16 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id JAA25430; Wed, 6 Dec 2000 09:28:14 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Dec 6 10:23:13 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon Dec 4 16:51:07 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Dec 4 16:49:48 EST 2000 Received: from cse.unl.edu ([129.93.33.1]) by dusty; Mon Dec 4 16:49:47 EST 2000 Received: from localhost (cterlapu@localhost) by cse.unl.edu (8.9.1/8.9.1) with ESMTP id PAA1354223 for ; Mon, 4 Dec 2000 15:49:44 -0600 (CST) Date: Mon, 4 Dec 2000 15:49:43 -0600 From: Chakravarthy Terlapu To: compgeom-discuss@research.bell-labs.com Subject: shrink wrap technique Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 610 Lines: 19 Hi, I have a minimum bounding rectangle around a string(eg. I have a rectangle box around NEBRASKA), but the rectangle is slightly bigger than the string. I have to shrink the rectangle such that it exactly encloses the string. Is there a way I can do this. It would be great if anyone could help me. Thanks in advance Chak Terlapu ------------- 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 compgeom-owner@research.bell-labs.com Wed Dec 6 09:28:24 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id JAA13568 for ; Wed, 6 Dec 2000 09:28:24 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id JAA25427; Wed, 6 Dec 2000 09:28:13 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Dec 6 10:23:12 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Tue Dec 5 21:31:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Dec 5 21:30:48 EST 2000 To: compgeom-announce@research.bell-labs.com Received: from taumsauk.cs.wustl.edu ([128.252.165.15]) by dusty; Tue Dec 5 21:30:46 EST 2000 Received: from siesta.cs.wustl.edu (siesta.cs.wustl.edu [128.252.165.3]) by taumsauk.cs.wustl.edu (8.9.1/8.9.1) with ESMTP id UAA08363; Tue, 5 Dec 2000 20:28:14 -0600 (CST) Received: from localhost (julien@localhost) by siesta.cs.wustl.edu (8.9.1/8.9.1) with SMTP id UAA11779; Tue, 5 Dec 2000 20:28:14 -0600 (CST) X-Authentication-Warning: siesta.cs.wustl.edu: julien owned process doing -bs Date: Tue, 5 Dec 2000 20:28:14 -0600 (CST) From: Catalin Roman X-Sender: julien@siesta.cs.wustl.edu Subject: Faculty Positions at Washington University in Saint Louis Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 4263 Lines: 81 Washington University in Saint Louis Department of Computer Science www.cs.wustl.edu Applications are invited for tenure-track faculty positions at the Assistant, Associate and Full Professor levels. Applicants should hold a doctorate in Computer Science or a closely related field, have a record of accomplishment in research, and demonstrate a strong commitment to teaching. Building upon the impressive recruiting successes of the last two years that included eight new tenure-track faculty, the Department plans to fill three additional faculty positions. The Department continues to seek outstanding candidates likely to develop synergistic relationships with existing areas of research excellence. Academic couples seeking to co-locate are strongly encouraged to apply. Research groups in search of a highly supportive institutional environment may also want to consider relocating to Washington University. With the strong backing of the University and the School of Engineering and Applied Science, the Department is committed to making significant investments in promising new areas of study and to providing the kind of resources and environment that will enable new faculty members to flourish intellectually. Candidates with a strong background in networking (including wireless communication and security), software systems (particularly embedded systems, mobile computing and database), computer engineering, theory, and artificial intelligence will receive special consideration. The Department enjoys a great research reputation and impressive levels of research activity, e.g., annual research expenditures recently reached a record $450,000 per faculty member. Research areas which are well represented in the Department include: networking and communications; distributed software systems; graphics and computer vision; artificial intelligence; computer and system architecture; and computational biology. Our doctoral graduates have been heading for successful careers in academia and industrial research centers while noteworthy entrepreneurial endeavors spearheaded by our faculty and graduates (with the full support of the University) attest to a highly respected technology transfer tradition and culture. Strict limits on University undergraduate enrollments combined with the increasing popularity of Washington University allows the Department to continue to offer small classes and close personal attention to a diverse student body of exceptional quality and to benefit from strong participation by undergraduates on a wide range of research projects. A faculty known for its friendly, accepting and supportive nature provides a welcoming and mentoring environment for new arrivals. Finally, progressive fiscal policies that reward research, teaching, and innovation by the Department have created an environment rich in resources that fosters a readiness to invest in promising new initiatives. Washington University is a leading private national university recognized for its world class intellectual contributions (20 Nobel Prize Laureates have been associated with the University), its exceptional resources (an endowment of $3.5 billion, among the largest in the nation), its ambitious investments in physical facilities, and its commitment to research excellence. The University is located in the midst of a delightful residential community which places much value on education and culture and is very popular with both faculty and students. Qualified applicants should send a curriculum vita and the names and addresses of at least three references to Dr. Catalin Roman, Chairman, Department of Computer Science, Campus Box 1045, Washington University, One Brookings Drive, St. Louis, MO 63130-4899. Applications will be considered as they are received. Those received after February 1, 2001, may not receive full consideration. Washington University is an equal opportunity/affirmative action employer. ------------- 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 compgeom-owner@research.bell-labs.com Fri Dec 8 17:57:15 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA24984 for ; Fri, 8 Dec 2000 17:57:15 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA15099; Fri, 8 Dec 2000 17:57:13 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Dec 8 18:51:46 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Fri Dec 8 15:29:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Dec 8 15:28:30 EST 2000 Received: from mm02snlnto.sandia.gov ([132.175.109.21]) by dusty; Fri Dec 8 15:28:29 EST 2000 Received: from 132.175.109.1 by mm02snlnto.sandia.gov with ESMTP ( WorldSecure Server SMTP Relay(WSS) v4.5); Fri, 08 Dec 2000 13:25:45 -0700 X-Server-Uuid: 7edb479a-fd89-11d2-9a77-0090273cd58c Received: from jal.sandia.gov (sass2248a.jal.sandia.gov [134.253.71.30]) by sass165.sandia.gov (8.10.2/8.10.2) with ESMTP id eB8KPjO11690 for ; Fri, 8 Dec 2000 13:25:45 -0700 (MST) Received: from sandia.gov (sass2286a [134.253.72.24]) by jal.sandia.gov (8.8.8+Sun/8.8.8) with ESMTP id NAA15155 for ; Fri, 8 Dec 2000 13:25:44 -0700 (MST) Sender: samitch@sandia.gov Message-ID: <3A3143C8.9E19A6AC@sandia.gov> Date: Fri, 08 Dec 2000 13:25:44 -0700 From: "Scott Mitchell" X-Mailer: Mozilla 4.61 [en] (X11; U; SunOS 5.6 sun4u) X-Accept-Language: en MIME-Version: 1.0 To: "compgeom-announce" Subject: Meshing Job Opportunity X-WSS-ID: 162F9C43209247-01-01 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 545 Lines: 19 We're actively looking to hire more people in the area of mesh generation and related technologies. Experience with meshing is a plus, but is not a requirement. Please see the following link: http://www.cfd-online.com/Mesh_Jobs/showjob.php3?record_id=29 Thanks - Scott A. Mitchell ------------- 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 compgeom-owner@research.bell-labs.com Tue Dec 12 11:35:02 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id LAA02124 for ; Tue, 12 Dec 2000 11:35:02 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id LAA10443; Tue, 12 Dec 2000 11:34:31 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Dec 12 12:28:52 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Mon Dec 11 04:37:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Dec 11 04:35:15 EST 2000 Received: from ccs1.iis.sinica.edu.tw ([140.109.20.80]) by dusty; Mon Dec 11 04:35:14 EST 2000 Received: from localhost (hil@localhost) by ccs1.iis.sinica.edu.tw (8.11.1/8.11.1) with ESMTP id eBB9YlD16812; Mon, 11 Dec 2000 17:34:48 +0800 (CST) X-Authentication-Warning: ccs1.iis.sinica.edu.tw: hil owned process doing -bs Date: Mon, 11 Dec 2000 17:34:47 +0800 (CST) From: Hsueh-I Lu X-Sender: hil@ccs1 To: Undisclosed recipients: ; Subject: Final Program, ISAAC'00, Taipei, Taiwan Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 9565 Lines: 253 11th Annual International Symposium on Algorithms and Computation (ISAAC 2000) Final Program December 18--20, 2000 Institute of Information Science, Academia Sinica Taipei, Taiwan http://www.iis.sinica.edu.tw/isaac00/ -------- Sponsors -------- Academia Sinica National Science Council of ROC ACM Taipei/Taiwan Chapter The Inst. of Info. and Comput. Mach. (IICM) ----------------- Program Committee ----------------- Co-chair: D. T. Lee, Academia Sinica Co-chair: Shang-Hua Teng, Univ. of Illinois Helmut Alt, Free University of Berlin Nina Amenta, Univ. of Texas at Austin Gen-Huey Chen, National Taiwan Univ. Jeff Erickson, University of Illinois Giuseppe Italiano, University of Rome Kazuo Iwama, Kyoto University Marcos Kiwi, University of Chile Ming-Tat Ko, Academia Sinica Kurt Mehlhorn, Max Planck Institute Michael D. Mitzenmacher, Harvard Univ. Kunsoo Park, Seoul National University Tadao Takaoka, University of Canterbury Takeshi Tokuyama, Sendi University Peng-Jun Wan, Illinois Inst. of Technology Derick Wood, Hong Kong Univ. Sci. & Tech. =================== Sunday, December 17 =================== 6:30--9PM Reception, Western-style Resturant, Academia Sinica (located right behind the Activity Center) =================== Monday, December 18 =================== 9:00--10:00 Invited Talk (Chair: D.T. Lee) Voronoi-Based Systems of Coordinates and Surface Reconstruction, Jean-Daniel Boissonnat (INRIA, Unit\'e de Sophia Antipolis). ------------------------------------------ 10:30--12:00 (Chair: Kunsoo Park) Session 1A: Algorithms and Data Structures ------------------------------------------ Strategies for Hotlink Assignments (P. Bose, J. Czyzowicz, L. Gasieniec, E. Kranakis, D. Krizanc, A. Pelc, M. Martin) A New Competitive Analysis of Randomized Caching (C. Law and C. E. Leiserson) Online Routing in Convex Subdivisions (P. Bose, A. Brodnik, S. Carlsson, E. Demaine, R. Fleischer, A. Lopez-Ortiz, P. Morin, J. Munro) ------------------------------------------ 10:30--12:00 (Chair: Xiaotie Deng) Session 1B: Combinatorial Optimization ------------------------------------------ A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors (J. Huang, J. Chen, S. Chen) Classification of Various Neighborhood Operations for the Nurse Scheduling Problem (T. Osogami, H. Imai) Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets (Y. Chen, M.-Y. Kao, H.-I. Lu) ------------------------------------------ 2:00--3:30 (Chair: Takao Nishizeki) Session 2A: Algorithms and Data Structures ------------------------------------------ Coping with Delays and Time-Outs in Binary Search Procedures (F. Cicalese, U. Vaccaro) Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm (Z. Chen, B. Zhu) Reasoning with Ordered Binary Decision Diagrams (T. Horiyama, T. Ibaraki) ------------------------------------------ 2:00--3:30 (Chair: Kazuo Iwama) Session 2B: Approximation and Randomized Algorithms ------------------------------------------ On Approximating Minimum Vertex Cover for Graphs with Perfect Matching (J. Chen, I. A. Kanj) 2-Approximation Algorithm for Path Coloring on Trees of Rings (X. Deng, G. Li, W. Zang, Y. Zhou) An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree (Q. S. Wu, C. L. Lu, R. C. T. Lee) ------------------------------------------ 4:00--5:30 (Chair: Helmut Alt) Session 3A: Algorithms and Data Structures ------------------------------------------ Finding Independent Spanning Trees in Partial $k$-Trees (X. Zhou, T. Nishizeki) On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover (R. Niedermeier, P. Rossmanith) Constructive Linear-Time Algorithms for Small Cutwidth and Carving-Width (D. M. Thilikos, M. J. Serna, H. L. Bodlaender) ------------------------------------------ 4:00--5:30 (Chair: Yuh-Dauh Lyuu) Session 3B: Approximation and Randomized Algorithms ------------------------------------------ Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits (T. Asano, M. M. Halld\'orsson, K. Iwama, T. Matsuda) A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane (N. Kubo, K. Muramoto, S. Shimozono) Simple Algorithms for a Weighted Interval Selection Problem (T. Erlebach, F. C.R. Spieksma) ==================== Tuesday, December 19 ==================== 9:00-10:00 Invited Talk (Chair: Wen-Lian Hsu) Essentially Every Unimodular Matrix Defines an Expander, Jin-Yi Cai (State University of New York at Buffalo, University of Wisconsin) ------------------------------------------ 10:30--12:00 (Chair: Hsu-Chun Yen) Session 4A: Graph Drawing and Algorithms ------------------------------------------ Efficient Minus and Signed Domination in Graphs (C. L. Lu, S.-L. Peng, C. Y. Tang) Convex Grid Drawings of Four-Connected Plane Graphs (K. Miura, S.-i. Nakano, T. Nishizeki) An Algorithm for Finding Three-Dimensional Symmetry in Series-Parallel Digraphs (S.-H. Hong, P. Eades) ------------------------------------------ 10:30--12:00 (Chair: Takeshi Tokuyama) Session 4B: Automata, Cryptography, and Complexity Theory ------------------------------------------ Undecidability Results for Monoids with Linear-Time Decidable Word Problems (M. Katsura, Y. Kobayashi, F. Otto) Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures (R. Yoshikawa, S. Guo, K. Motegi, Y. Igarashi) Derandomizing Arthur-Merlin Games under Uniform Assumptions (C.-J. Lu) ------------------------------------------ 2:00--3:30 (Chair: Tao Jiang) Session 5A: Algorithms and Data Structures ------------------------------------------ A Near Optimal Algorithm for Vertex Connectivity Augmentation (B. Jackson, T. Jordan) Simultaneous Augmentation of Two Graphs to an $\ell$-Edge-Connected Graph and a Biconnected Graph (T. Ishii, H. Nagamochi) Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets (H. Ito, M. Ito, Y. Itatsu, H. Uehara, M. Yokoyama) ------------------------------------------ 2:00--3:30 (Chair: Kuo-Liang Chung)] Session 5B: Parallel and Distributed Algorithms ------------------------------------------ An Intuitive and Effective New Representation for Interconnection Network Structures (J. Chen, W. Jia, L. Liu, S. Chen) Randomized Leader Election Protocols in Radio Networks with no Collision Detection (K. Nakano, S. Olariu) Deterministic Broadcasting Time with Partial Knowledge of the Network (G. De Marco, A. Pelc) ------------------------------------------ 4:00-5:30 (Chair: Danny Z. Chen) Session 6A: Algorithms and Data Structures ------------------------------------------ Minimizing Makespan in Batch Machine Scheduling (C. K. Poon, P. Zhang) Preemptive Parallel Task Scheduling in O(n)+poly(m) Time (K. Jansen, L. Porkolab) Compressed Text Databases with Efficient Query Algorithms based on the Comressed Suffix Array (K. Sadakane) ------------------------------------------ 4:00-5:30 (Chair: Yaw-Ling Lin) Session 6B: Computational Geometry ------------------------------------------ A Better Lower Bound for Two-Circle Point Labeling (A. Wolff, M. Thon, Y. Xu) Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set (D.-S. Kim, D. Kim, K. Sugihara) An Improved Algorithm for Subdivision Traversal without Extra Storage (P. Bose, P. Morin) ------------------------------------------------- 6:30-10:00 PM Banquet, Business Meeting, Karaokey (Lai Lai Sheraton Hotel, Downtown Taipei) ------------------------------------------------- ====================== Wednesday, December 20 ====================== ------------------------------------------ 9:00-10:30 (Chair: Tadao Takaoka) Session 7A: Algorithms and Data Structures ------------------------------------------ Generalized H-coloring of Graphs (P. Kristiansen, J. A. Telle) Finding a Two-Core of a Tree in Linear Time (B.-F. Wang, J.-J. Lin) Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparsion (M.-Y. Kao, T.-W. Lam, W.-K. Sung, H.-F. Ting) ------------------------------------------ 9:00-10:30 (Chair: Prosenjit Bose) Session 7B: Computational Geometry ------------------------------------------ Optimal Beam Penetrations in Two and Three Dimensions (D. Z. Chen, X. (S.) Hu, J. Xu) Searching a Simple Polygon by a $k$-searcher (X. Tan) Characterization of Rooms Searchable by Two Guards (S.-M. Park, J.-H. Lee, K.-Y. Chwa) ------------------------------------------ 11:00--12:00 (Chair: Kun-Mao Chao) Session 8A: Computational Biology ------------------------------------------ Improved Phylogeny Comparisons: Non-Shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers (W.-K. Hon, M.-Y. Kao, T.-W. Lam) Phylogenetic $k$-Root and Steiner $k$-Root (G.-H. Lin, P. E. Kearney, T. Jiang) -------------------------------------- 11:00--12:00 (Chair: Rudolf Fleischer) Session 8B: Computational Geometry -------------------------------------- Maintenance of a Piercing Set for Intervals with Applications (M. J. Katz, F. Nielsen, M. Segal) Optimal Polygon Cover Problems and Applications (D. Z. Chen, X. (S.) Hu, X. Wu) ----------------- 2:00 -- Excursion ----------------- ------------- 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 compgeom-owner@research.bell-labs.com Tue Dec 12 11:35:12 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id LAA02128 for ; Tue, 12 Dec 2000 11:35:12 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id LAA10833; Tue, 12 Dec 2000 11:34:59 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Dec 12 12:28:33 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Mon Dec 11 09:51:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Dec 11 09:50:39 EST 2000 Received: from fe3.cs.interbusiness.it ([151.99.250.23]) by dusty; Mon Dec 11 09:50:36 EST 2000 Received: from nasdev02 ([194.243.111.34]) by fe3.cs.interbusiness.it (InterMail v4.01.00 201-232-112) with SMTP id <20001211144532.WBML17681.fe3@nasdev02> for ; Mon, 11 Dec 2000 15:45:32 +0100 From: "Philipp Kobler" To: Subject: Volume calculation Date: Mon, 11 Dec 2000 15:50:06 +0100 Message-ID: MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="----=_NextPart_000_0019_01C0638A.08800C20" X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2910.0) Importance: Normal X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400 Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 44139 Lines: 643 Messaggio in formato MIME composto da piů parti. ------=_NextPart_000_0019_01C0638A.08800C20 Content-Type: multipart/alternative; boundary="----=_NextPart_001_001A_01C0638A.08800C20" ------=_NextPart_001_001A_01C0638A.08800C20 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit I'm working on an application that produces two series of parallel bi-dimensional contour points (slices) of an irregularly shaped object (resp. from the left and right scanner - see attached figure). I need to reconstruct two super-imposed solids A and B from the series of slices, find the the intersection C and calculate the volume of the latter. Moreover, I need to find the smallest enclosing rectangle of the projection of C onto the plane. I'm not into Computational Geometry at all; I would like to have a hint at which kind of algorithm may be suited for the above problem and where to look for it (books, articles, internet). Thanks for your help Philipp ------=_NextPart_001_001A_01C0638A.08800C20 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable
I'm = working on an=20 application that produces two series
of = parallel=20 bi-dimensional contour points (slices) of an
irregularly shaped=20 object=20 (resp. from the left and right
scanner - see=20 attached figure).
 
I need = to=20 reconstruct two super-imposed solids A and B
from = the series of = slices, find=20 the the intersection C and
calculate=20 the volume=20 of the latter.
 
Moreover, I need to=20 find the smallest enclosing rectangle
of the = projection of=20 C onto the plane.

I'm not into = Computational=20 Geometry at = all; I would like to=20
have a hint at=20 which kind of algorithm may be suited=20 for =
the above=20 problem and where to look for it = (books,=20 articles,
internet).

Thanks for your=20 help
Philipp

------=_NextPart_001_001A_01C0638A.08800C20-- ------=_NextPart_000_0019_01C0638A.08800C20 Content-Type: image/jpeg; name="laser.jpg" Content-Transfer-Encoding: base64 Content-Disposition: attachment; filename="laser.jpg" /9j/4AAQSkZJRgABAQEASABIAAD/2wBDAAUDBAQEAwUEBAQFBQUGBwwIBwcHBw8LCwkMEQ8SEhEP ERETFhwXExQaFRERGCEYGh0dHx8fExciJCIeJBweHx7/2wBDAQUFBQcGBw4ICA4eFBEUHh4eHh4e Hh4eHh4eHh4eHh4eHh4eHh4eHh4eHh4eHh4eHh4eHh4eHh4eHh4eHh4eHh7/wAARCAE0AVUDASIA AhEBAxEB/8QAHwAAAQUBAQEBAQEAAAAAAAAAAAECAwQFBgcICQoL/8QAtRAAAgEDAwIEAwUFBAQA AAF9AQIDAAQRBRIhMUEGE1FhByJxFDKBkaEII0KxwRVS0fAkM2JyggkKFhcYGRolJicoKSo0NTY3 ODk6Q0RFRkdISUpTVFVWV1hZWmNkZWZnaGlqc3R1dnd4eXqDhIWGh4iJipKTlJWWl5iZmqKjpKWm p6ipqrKztLW2t7i5usLDxMXGx8jJytLT1NXW19jZ2uHi4+Tl5ufo6erx8vP09fb3+Pn6/8QAHwEA AwEBAQEBAQEBAQAAAAAAAAECAwQFBgcICQoL/8QAtREAAgECBAQDBAcFBAQAAQJ3AAECAxEEBSEx BhJBUQdhcRMiMoEIFEKRobHBCSMzUvAVYnLRChYkNOEl8RcYGRomJygpKjU2Nzg5OkNERUZHSElK U1RVVldYWVpjZGVmZ2hpanN0dXZ3eHl6goOEhYaHiImKkpOUlZaXmJmaoqOkpaanqKmqsrO0tba3 uLm6wsPExcbHyMnK0tPU1dbX2Nna4uPk5ebn6Onq8vP09fb3+Pn6/9oADAMBAAIRAxEAPwC9NbWU MBnNlbHYNxAjXAGP/wBVUF1PSWLCXTI1BbA2xIT1Gfr+Nat83+guoTK+W3yEdeDzj8zXCJOrseSS Tzxyf8fxxXmTqWOWCudVDquhB8vZp/36Xg4x/ntViPWPDu/LRRx7eCTbj5fpgcfhXGOw2EnHp9Ov /wCvFMeQhQQ/0J7/AF9M+1L2rK5EehRax4aYkhrTJzw0AAwO/St6wGjz2xu4Y7aWAHiTyxjPoxI9 M9eK8PuNTsbcH7RdxxjOSCw/T1r0vwDeL/wg+pS7/Mjn2mMYOJee3rxWkKt2KUEup1sF14fZsLJp pIOchkyMdh6D6Vp2L6LJt2f2e7Y4C7Pw/Wvnx5N1xM6twXPPpyePbPSiJ8SRgHoc8Dr7/wBKFiNb WK5D6WtoNOJG23tySRgCNSSM/wD661obSwJG22tzwDjYvpXgMc0oUHzW5Xnk88/5HNWodSvY0+S7 uFBHTzGAAx1/Pj0rZVvIWx9CW9nZ5AW2txnvsFWks7QZ/wBFhx/1zFeAReItcjcMmqXft+9OG57j 9OKnTxh4ihbjWJvl6lgCUPcdKpV0+haaPexZ2gz/AKLB7nYKUWlqQD9nix/uV4bB498Uxhh9vJIG cNEvHv0z+dW4fiN4jj5aW3kwOMw/e+uO9V7eKHdHtH2S2B4t4ff5BSLa2xORBF/3wK8ij+J+sqx8 y1tGAOCCrDHqeDzircfxR1AACTTbZsdcMwx/hTVaAcyPVfs1vn/URD/gIoNtb9BBGfT5RXmi/FKX IEmlLjPIWXn1PbtViL4pW7YEmlyjnqsgI46npzgU/awQ+ZHoRtoOphjx7KKctvDjJij4/wBkVxEP xL0kkbra5QZ5OAQvGSD/AJ71bj+IWgleTcoR1VojlfrR7SD6hc6zyIT0jQj/AHacIYQMGJP++a5m Lxz4dJH+luu7pmJuf0q1F4v8PyA/8TOIdskEc+nSmpR7jubogiPWJD9RTliix/qkH/ARWXH4j0SQ fLqdsPq+MfX0q1HqunuBtvYDkA8SDoelUpJgXDFEQfkTP0o8mPB+RfypiXVu2Qs0ZI6/MKesqEDD A596d0IcYY+CET8qURqV+4v5CgMMAjHWnErg7etLcoaEQ5GxfwFO2JtPygcc8UAgd+nWgkfWnYLB sXHKr+VCov8AdX8qDjAo96AsIFTP3aayrn7nFPJAOKjdgDycUBYY6ICOKawQdQDg+lOZwuWz06Co pX+Y4Oc/pQAjCMliOO5quFDAk455FLJgtt4De9QPKrHaTgEnnHT2NBLYPtIboc8cd/xqs23C+gY4 P1P60rSZZ13AKvXHG2oJJAG8sgFWGQB396CWxJ1I5wAfTGc1VnDZGSCD/EO3tT5pV5UksCMMR3/x qpIeNrMVIPT0HpUtk3C7KqV27eefQUVA0ihVHAAGOcHtRSWwXPMpHDW5UAkshHTvg9v0z6V5rMHS 4IBZSXPGeOP516QQux48KSMcDpjHX8PXNcDPEHvZwePnOAeS3+P6V5dS7sTSujH1TXrLS7UzXsm0 DhecMT/Mf55ryvxZ401HV3aCGQ2lsrEiNDgtn6dK7D4peH5rvRH1KJHkaA4dh0wOx98dq8iRT82A AcjjmtsNBNXlubHpvwS03SdY8QyHWmEsyx+ZbrIQUbHUEHgnp3r2HxH4l0+2ij0a1mRHYYWNTycd cevsK+WrOa8hffamUSghlaNmzn1GP6Vt6fp/iea/TUEgnkmWQMLiZuvsS3H4EVrOg3exFkne57Mu QWOc8ZYZ9fT0/CpM4ZCTjGTVGG7LrG0q7HAG4Z4Q+vtzzVkkgjBVSOmO/px29a450pQ+JFKSlojr ojuSMgj5lHXv/ketPUlcqDnHHuDjuc1WtMvbjByCgz/nHPrzVjktjIbIweTyPTOOPX8K0irIze5I Qc9AAo5A6D6en4d6dnLLjaSQMZxgjn+metRnO0fOcbjg+h46+mTzxSHJDAqT0OB368j19efSmkxk hIwAD8oOBn198/14oOQDlRkHrn9P8ccU0biPvBsnrnqPy7+/pSDPy4J57Enn9O/tSsIkJJYbcZzw WP6mnAkYJXAyOMjt0+nqc1Fg4I+/n0ON3t7Z6etOG/IO9R+H3fbkd+nPpRqFiRSQg24PTaSOv1/r Tww2ADp7/wAP69PpUXzYwV3EjLLknd78dc9PwpSzfIS/mZ43E53eo/pxTYEyliApABI/vDB/z/IV JuIClewGCfrwMf49qhUsPYL7/dzwfz6c1J8wODzx05A+vPT0oYiWNxyB26g/5/l2FSZ+bLKvOecj 9arZZgBu9z1/P39OKlDEdGZCc87uv+elPYGWVc/Nkg8/MDgEnPb05qRGbBORkcgjGCP896gUtycn 5eAVB+T2x2xnHNPjLZKsCuBynJI68j1xnGfehMkurcPkYdgvbHX/AOuPSrMV9cAkLPL15xIRn3FZ m98l+QT/AB9dw9PfHSpo5WBYsSApwMMf3ft+H9apOzFzM149U1AHP265Ddtsp/yKu2+v6xGfk1Cd v+B5zz7/AP1qwd7AsCMYB+Ujvjrj2/rUqyjq27H8R/L88ValruHMzoIPFGtKoA1CQ/UA8/lVlPF+ tqCDcggdfkB7/wCelc2shwc9SpGPw/yachYDhihGQrDjHt7frVc3mHPI6lPGmsL8pkgb0yg5FWk8 cajvJaKAjoMAjmuMDEjbsyo+8PQ46/1p7SZySeTw2f4h/nmjma6gqkjtV8dThgZLOLjg4c8/pTm8 cgnL2Iz04k+7+nP4Vw/mYbOcHs2T8o9KR3IGOuOAvrx/k01N9ylUkd0fG1vnJs5AfQEevX2/GpZP GdiWBEUuMdTXn2/5gS2B3Oe+f89aR2OM7QWI5HbGOvvmn7SSD2sj0FvFWlMx3mZMnJBT7v8Aj+FR 6j4m0mwso7y9uTDFLkozKeg+nSuBeQ5G1twJwme/PQ//AFqwPjNJNJp2nLAx8sWqDj+E9/161Mq0 krlRm3uep6X4v0HVbcz2OoJJHu5YqV5H1FTf2tYMP+P2MYGME15B4IeFfDFkkQU7UG/p97PJ/E56 1rM/BCnJIzyPrR7WQnLU9Ce+tW+ZLqLkc4kGB/j602WZMg+chVQDgsPX+h5rzwsR+X5+mcf0prOw Ubn4U9e4OenoPTmh1n2Fc9BeWNmJDA9Pmz14ornPDZf7PKS2G3DK8enXp/nFFbRbaFc59wuVUMQP Qg8nB/P615/rMZXVplTOd+cnk/j6j8q71cYKYDEndtxzj+9j0ri/EiltYmK/P5hHTkP0rzZRukVB pFdL0yaVNp0kKSpKCGDHgDH6fSvHk+HuoSapcvOBbadE27zmH3l68Ad69aiQxhWIwE7n+E9x/wDW qG40Nr7WrbU/t9yqKPmtgfkce4r1Msw/tXft0OXF4p0Y22T6mf4N03w42hudDTcrHDSOvzlh657U yVfJ3fIQy9Qe4rrLa1htYvLhiSFBkqqrgH8BWR4gtCJPPHIIwcflXuYjD2guVao8vB4lzqNP5HmO p+OJLa+e2i08qY32ZkfB4PTA6fnXfaPdw6jYQ3cDZjkQEZHQd/bOcivPPiDpEcEv9ox26/PxLx0P /wCquu+F9rKfB+5lIUTsUGO3r9K8N03iIyi1qj2Z1Y03GXfQ9GsB/ocPzZ+Xg4z37+vpz2qw2NjE gbRy/t9PT8OKp6aXNovBJYbef4+f19OauNlSCpKleAxPCDnj/PrXnJWRq7PUM4fJPzY+nHGT14I9 qUjIC528fl+vP1NNQbSoI2BDnH9zpz7Y9qchznb3PJI64z+ePU+tMYucfKwH3jnHUdM49ce9ITkN 84AyefT9fT0oICsScrzt5zx+OOcc05AykHgbTwR2/L068Z600IUDJOQFI6hcYHHb6U6POU+7kdCM fqf8aAWUlQxVc5552f560hU9WjIB+8P6/h15xSuAoIAJLMF68fwnv74HX60/bySVGcfNjGPqOeuO eO9IvAzkfdxuI6jnr6+vpSgHaAFPB4HcEHj8O/FK+oCrj5Du6DAOR78nPA455p4+VNqkDJB6Y/Tr /TNI24jPTP3j0z/nrzSjJHXoPcbRn35755pth0JBzwB16ccf5+lOXrlefXJ56dfTpmo1+baMZ5+X IPz+/v2PFSfe5Y7ufvd8+n4+ntTuLcmXBK5GCoxjPBHbPp+NOAyNoAIzweMg+h7/ANKajHJOP95T 1X39s9ec9KXnJJVmPt0cf/XpCJP48+pGR1APHPHWpYnK/QYA5/n6fSofvEAkSA8g/wB7pxx1z0/C lB+U5HXqc/5xnpQgsWYmPlgZ3AdyP056e9SRkAnopONvy8Dn9e9V1PfB49B0z1/PpmpYs527S4Iy V/v++O/pVIllhHAjyR8vueQf68j8qnQ/MRnJH3gejDPb0/WqYJK5Zuufn7Hg8fj0p6nPHPB/74ye vt6VV9RFjJOATgnkH0GOhpS2QcdD0HUjp+f+FVw52jOcEf8AfX+1S7s4yCR3/Tj39OaBExb+IA0x nJyDyOrYHb2pm5icDPsPSkzgZAZR2/2aNbDHlwXBHJI+Q9sZ6f8A66Y7qMMM47dznH6imktuO4ZA PKge/X8PehmPLbucYJPfjGPwoCwsjfvHDnJHD4788Y/+tVXUTFeWaWlyQcZMbE9Aeo/Opmxu/iQ5 wD/c5/z0qvIqyIVZNw7juT6+1GrGtDj7+3vvDZm1Gzl3Wxy0sZ+6R6+31ryzxl8X9ZvLl7PRx9ih XP7xcF2P19Dit748+LnsbY+HdPuCXlybjB5Qf3fevCyRvJwBxng0UqSldvY6IrQ99+H/AMW7e+Me neIwtvckAC5HCMT6j+H0r1eOVJUWWORXVsFWQjBGev696+LIhg54X5eOevFeifDDxj4i0vUItKtE k1C2kcbLdnztz1IOOKqdNR2IcD6z8MyrHYN84AL8BhyMAUVDoUZXS4pJIyHkOSOfQUVrBtIyuYQ+ 6WHIGMMoJOfTH6elcv4miA1KUYAYjLD06Zx6n6V0+C8mDgHbuU4yMY9PWub8UKftUUhDcrxnrx2O BzXHK6RcFdmKoO1MMc885/r2+lT2LgfLkqB2Gfl/DPFRR8BiQygDp789KEbY6kZXaM49Pr6V04DE vD1VJ7dTLF4dV6bj1NLO0sMjOD2yOn+fzrP1W5t/KaL78hHyhR901DeXNxKoigHlKeSQMt+AqnBG EYhcsx6sxzu/Gvof7Qp1ZqlHqTkOQ/XMXTp1nZN/Mo3Wjw6jatBdSfu2OXQJljj0Jq7B5VnaJZWa iKGIbUQAcn3x/OpmUK4LDbg8HAJXnv6etIwDhUzg45DA4OB/jnmufH4OrGN6P/BPv8z4I9n+9w95 JdH+huaQR9gjPJAGMgZwf6/pVzlgOQSRwCOvB/L1xVHRwRbhS7HJwOc556e/Y9qukn5yWJxwxzjB /pz2r56zWjPjKkJQk4yVmKT3B5JxnHP068Z9qUHDEgbsAdRwev8AP35oHAwW5Xn6Zxz7ZpcZwCMh udv973Hrn+lNWMxQ24gKxYEjG4dfY/Wl6EHnJ69vy9M98ZpFPzklt7MSCR/H6j8eOPagkcfNwMgE /wAPt+PT8KYkyTLFwQVY9FLDqPQ9vam7gNu04Hbjn/6+eRz2o6t83KDJYL34+8B+lLkn5iwYnOSf 4vX9OOaVkVccrHbjapDdR2PYfrxilMjHgOCSMZx156fnxxTDgLlvoD/d7H/DjinZBO35AO/t/hxx xUu1xXH72yOgCjHP+cdeKdncOMgcYxzz/PrxzUeQAFLe5PHB9f6c08H6AkY68Ht+nv3NN2DoSL0b J4ON+Oo57evpxTwdvUgOP7vQj/Ht60xTtOc8/wAL5+77H6c9PWhCPUqo6jd90/8A1vz5o+YtCwrc BFOVX7vHPXn6c8c0ZG1gw2+oHr7UzPsAf4iDxjp+GPf1pQCDjcF5+UHt6Z9ce3rQBOckkn8WHPHH 549qcr7CcnkHkeg9jUCPz3BOMZOc/l6e3rT1ICMQdoB5OeU9M/z5pWBFgNgbc7QM8he/f/8AXT1k G0lgQpPzY5Kn2HU1WV2HGMY6r/I/1pVJwOoY/c44b6jv61SRLLYYhSdw3EEbe2MHpTmIXjONvQjr 17+n61Wjf5cAEqOOvQ4OPw705GCkquVx1HTjI/L15p2ETKwOACMHkjHfH1pQ33cHk/j+frULEkEc sewAzxz2/wD1UBwxwO/v9/px059aYiVmJOTghR0z19/b6UoYFiAckDvxnjvzxxzUBcAg5IP97pt9 s9s0F+oIBxzt7r/tD0z/AEp2AnJVcYbgnjjnr+oNMcnnoTwCv4dajLHcQHLbjxn+Pn/P5Uxm+Ykg 9MdeOnTpSsFyRjh87zw3H5/pXG+MvEWoWVs40233fIQXYA9uw/rXQavctGnkRuDI33sHoM9vTPH5 Vw3i/Wk0TTRcNbSXO5tmxR1z68V6uGy+M6Lq1XbsefWxrjWUIK58/wCu3V3eatcXN+XNy7ln3A5z VIcJuCrjkEZ56mvbdf8ACNlr+nx38NubW6kj3BCBkE9vfmvKtd8O3+jzOt0gEZz8w6dTj8ayrYed DSWx6GHxMKq03M3Trae9uo7aBA8khCqoJ5J4xXu3hDwfN4RNrfiNLi52guD0UHqB+VeW/Da0lbxH a3wSVYYJFkZ04Ix6e/avpYTCS33SRmSN/mzjk/56Vw123sbOfvWOq8KXH9o6FbzxRSIMHKnAOSea Kl0kQx6VbAeYilOMKf8ACirMTBkbGRg4z9zPOfX6VheK+GiYZfsSed/+fatp05C7lYEZBx045/rz WJ4xUmGIgH75B7846e/bGK5pbGkdznlk45P3R1z93/PSkG3A2jORwOgb8O2enNQA/QcYyMf5/OmP IenUY5OMAZ4z6gVlc3SJpSpyATtA5I79vx9OKYoYy5JIIXkDnH5f54pYiWY55YjIGOv5df0oiAeR PTBAOP612YGaWIiezkD5cwpPzHIAyAheexPAY56UyNRkZZmJHAweDj/I/CrZWMSEugY45HGOvam4 RXUbQoxlPp74+tfXyrKx+wSrqKJ7Z2iQbN6now7Yz2/StOC5EgQNlHPTk8D69senvWTGAVK4XZnj p2qdFJwWYc8EkYH8uK8nFUoVFdnx2c5dQxSvJa9zXLDPGQBknqMepHpj+tICQTjKjPXHTjp749az 4p5I2zt3xofu/wASH1q3HNG5zGQx4OCBz1/X1zXjVKUoPXY+BxeX1MM9dV3JgQCd2cAneB/D06ev rTgcsN3J5z2z/hjrxUSnLKd3BOVY49eAePWnIRjDcYwSOPl546f0zxWSPPHMTnJLKB3xnb+HsOad uOQNnJH3euP8eOefWmEgPjdkjoDg7hnr/WjI3bAAcj2y3P6/jjilYQ8Egjk9O49j+XrStuwcqcjB Pb+vHrSE7udyNkf5Htng4HpSMUHzZxg+g+XpycdM8dO1JjHsegzuzwue/sf55+lOVyq5APAHXqPf 15HP4VE+DkYBzyQAPnPdh+Pr6U4SAkgEHcMhvb06Zz6UCJ9xI2lSW69Thh9e+e+KcCcYBDDsTxkd h14z+fFQrsxgkgFs4HY/l3x29DTwV6tgn1GOc+nGBnp+dPUGTAjgAEE8Ac4HofbPv6UZBI4DYIBI zz6e/wDTio8qeFwcc845/wA9OaB12tyWySR0Yd8YH4UbDROWB46c5I68cdOfr0p27leMk42Z7j37 D8eai3AkEnIJPOensex444pWIXduGNv3hwM+4OMAdueaSuJomDIcHB2g4XjBB/8A10uVGOV9WGcj Ge3PPpxUKgjqRuwTkDqMc8evb0zShsgYHB6DPT9OfTimhWLAw3HscMCOnPH9KVTjIBX0wR0PGe/H XHOahV/4iSp6Z9f89KfkgHccbB2/h6fl6c+tVcViUFVTb90D0HH8+aCRhhgH+8RjI6dOefTioQSF AAIyM7T3HPP4dKXOSWyRu+UNnP4dOcUO4JEgYbsArkjj0I9fwprHB3cKo/PPp14/GmgjBPQKeR0K n64oBIZuoOOc8fpj9T60BYkyuNuQcdRjgc/rj8KhuZljikZ22nqDnrx69/8A69Ku5yTjOW7DPf8A WqWpjdCWMqqgH8Z4J546dR6YrXDxjOolLYUoTlFqCuzMuJGlneVxhixOB2+n0/rUTqGGG2k4PUUL KHbKtyoyefu/WkPytjkk9vWvtocvL7q0PlqlOrTqNTTTOd8R6NqeoalYyWmpyWNtE+6VUJ3YB4/y fWrmt2NneWLi8jSQBeuM5rUJxuIJJOOc9faqMMf9o3pQjdAhIx7/AOFctZU4Qba3N6MpuSt0KHg/ QvMuFlKCO0hPyKRjcR0Fd8Dhwo2qBxgYwMVDbIsMKwIRtUc+/HX+tPGcgDPzdj9ePrXyFeSlN8ux 9DSTUdTrNOObGLawB2jIYj0GOtFPgeJoU8wb/lHIPtRWnMOxzLqGdCSQMDj161l+L0B00PnH7z6k fj39a0/lKKgHzEZHHQdu/wBfas7xOhk0pyNp4BDdc8+3X8Oa52lystbnGNwMqpG1e5x/n1qM4C5Y EDAxwQR/nrmgkH1wBg84I9vb8fWmSNhWB2g4+bB9/wCea5lodBPAMseGYY5HXPU5GOv4VMpxOrAk kA4b+96Cq1uVG844PGSQT/8AX/CpF/1gICrwd2OT74rqwrXtUz08nly4uD7F1W/753Z5PPUfkKa4 VnGAScZyRjn+v/16QEjAx6ZA/u/0NNYkD5sk4/LjBPv2r6D2l0fotTFcyLFuQAWy2TwSO3Tg/l6V OwwT8pyMEAjr9T2qG2KnJLr0yR1DDjJqdmC5JGVx85z0+n6Cp57nnTrOTYQ7c797g87JMYOeu0ip wP3uCPLc/wB3OD/+vPtUIwWPAEhHQ4wy+o/KnKylOCfLY4GcEg55z6/pXPJX2PNrWa0LSTncUkys h424OHHr9e2PapsjuzYA64I//VnpxmqUbBR++w8J48wdQcf54p6SNHtfIdBnpgbf8/zNck6Ke2jP nsTgIT1p6N/c/wDL0Lq5EhRlPP3gB1PQ/wBB60Lk8lm+bgnH4H69hzUEUiurbflPHHGeB6ewqRSN 5PynI4PHPGMe/wCOOa5XFrRnjzhOm+WSsyX7obKnA4IGePcfTpxRzuK7m4HTpnse/wCHHNMVkyMN jB4J/h9jS9F4UZyMjjI46+3HpU6kjW2hQMlRnO7H3f15x7+tcxL45062vZLS6t7iNo5NrFRkHHcE HOe2K6fI3ErjttJXg/X/AOvXi3iYsniC5GDgS4Geqkdvz5rKrKULWKik9z0+Dxn4ekGTf+VjnLqV Axzj06enrWhZ67o13tFvqto5YZwsy8fma8JnbbaySEdIzjPAIx6/TJ/GuJWR1bcu/JGScn/PpWtC Lq3bK5D6+WeNiGR1IJwMH278/wA6kyMY3OoU8jB49xzzj8q+SrHWdSs2DWt9dw4GABKcdPrj3rd0 /wCIPi2zx5WrTOq4wJVDDH4/nWzotC9mfTTFT1Vc7ctz1HX19OeOaXOSDnrna3p9fT8a8CsPjB4g hwt5a2twoPIEZTrz2PeugsvjRbNJi70SUM3GY5B83PoR71DpyXQXIz1zI2nC4wemMYPrj9aXcu3g bgO/970+vrxXnelfFfwvdHbcNPaccGWIkfmufTvW9aeOfCt3GpTXbJWZckSPsJHvnHXjp6VKTW6J cX1OqDgZ7gL3+nr096QvgAAHPbPfpwfT8faqNrf2dypa3u4JgRwUkUn/AAxUpdgHGOAPmB+o5A7f jST8ieXUtgqU5GRnr3zz78/XpTt+ckckr09R2+v4elVHnjjwsskYP8JB69ePcnpVZ71nTEERKjox PfjP1HGO1aQpSnsjsw+Bq1vhX37GjvHykj7xwG6cds+mf6VBJfQoSu/eR2A/l/k1nSzMxcyS7iPv Kpwo5/T0FVd7n0I59wP89Pwrrp4WL+JnvYLIIPWrIvXGoyuQIlC5IwccnnHf3qjdFmJcu7nPc4x+ ZzSfKxKjPPXHO7Jwfr+lI7qyEl8kdweAMfp6V6VKFOnsj7XL8FhcNb2cF6kO8mQsrHrkdt31FSwT ZwrkLzw1M3BRnBH94dx7/wD6qaQu6MncTuHJ9M11/WXBXOLiLIMHmVJzcbTS0a3+YszSyyJbQKS8 nBbHAX1rW06zisolWLdn1PepIooo+iBPmJyOufepVYZzkA9Tk9Ov5YrwcXjp15trY/JKGDjRVnq0 PDgAkLkjrt/p/KnR7jOo3/T0696hDqWIGVxk9fun1x2qe05uI1KhwW5HTdz/AJ/OuHqdTWh1A4RB lY8KMgfSiowYQAQy4IyCTn8M+1FbNozMJcbA5kDnGO/f1/lVPWQx0i4RlYAryT/H68fpxViNhJCG 25GACc+3+TxUWplBYTKVJzGQVJztOP8AJ4rBrRmiOBy4JO7aQMAg52+39OaiPUjaylABt5+U/wBP SpZCDvwucdBkYI/H+vpUJClQOD0wTx/9cVzWOjQdESr4GeevJ+btz64GemKtIGMoyMfKeWz8nt+F VIh+8ACgE4yCR/k59qsQkNKAFLEdOnPp+ddNBe+juy52xKLSECMEhjg9APwz7Ukh4zjawIwCP8+1 MAxFg/N8vGeOf8KQ7UOFKbsg/KvBH9elespH2HtXt0si9p4BkIQOWznkDp9eh7nFWmUKxKDaR8yE ngr9e3rVCx/1jFRyn3ckZxn261fc5GEYBk+dASOQeuD2+hp3OadRrcVVBCJ5rBeqZ6o3p9O9Km/c X2fOP9YpBO8dePWm/K3JChJB8p984/DnjNSACQk8mVAAMnr/APFenFKTOecuv9f13+8VcJ88e4p0 ZecAeh/nT0yo3RAmP+7nr/h696RMbGki4dQPMQ8Bv8ntSL8oM0QO3OXz29sduePpUO9jlqa6P+vJ /oyZo0eTfCx8zIPA+8RzgjvnrmkikZZNs6tknJPJGPXPc98e1IAsmXQfvDztx/TufenI6SOQxw3Q dDn/AB9O1ZNXVmrpfecdWClFqSulv/Mv80WAMg7G3Fjxkkb+e57Z4NISADyQo6MfX+mT/KoW3xhg QzIp+Yg4Kn/Z9O3rT0ZZI+GHqR2x349uRmuaUGtVseZVwrjHni+aPf8AzHZDcE7iWyygdQT198n1 x0rxjxWNniC6ZcMTJ1HcZ/nXsnqRnnuOp9frxjHSvHPFYB8Q3YZiNsnzcfXv+WBXHiNbGNMw7kKb SVivGw4+UDnHX2ya4g7cEgAY9K7W5wbaQ5AAQ7h/d+X9PT/Oa4n+L7pHcc9ff3rqwK0ZoAHLbRgd Dk08HrhepGOKZ68E49DS4wrfKQQeRycf56V3C3FkHzHcCDnB6ZzSrjodxGcHbg4Ht60pII2lSWDf 5z9Kt6fp13fyGG0tppTnouT0xye3A+lIqEHLRK5THXAJyD2HHf8A+tQRJJgjLE+1dV/wikNlGsuu 6rDacAmFG3yH29B29asf25p2mGO38P6MvnFvlnul8yUHHYdvw96L6nZDB2/iyt+L+4zNA8OeILlW uYC1lbjJM80vlLx/P/69dTYeIYvDpRT4o1XV7hcHyLeQiIH6nr36YrPudN1XUVOo+KNX/s+2GMQy uQ7r14UYH50ljf2qym08H6G73B+X7ZNy31GeFoaT6HfSw9OntHXz1f3f5nWWHifxTLMdT1H+z9I0 8H5hdIzOR0yFyCTWra+N7jUZ1kgsS9mmd95OxiQ8dAMc49PeuBvP7PsblJdWuW17Vy21bVT+6jb0 Pr+FWL9CFhuPEkjl3GbbSbXI6/dLeg9v5U07bHoRaT72/D9Pkj0Wy8YadeSSvHb3Asrf71yRthzz 9055x+NXLXxBpt1FA4nKCdtsQdCjP1wcHnB9fevOrmcwG1F9CJrwgfY9Ji+5Cc8F/pweferNozLP ctLerJdKv+mXY+5bp/zyiHr/AIU1UcbHZCr0PS4rq1f/AFVyh+fafm5B/ujnn1prMcNyOgGAcgDn 9favPLSeV5bXywIJJEYWcXTyox96V/8AaP8AX61u6c7wM8zP+6VMRpnovPP4nmtIVzvpYpxep0kf OFUYLHADHp9aUEmQDjBYEDHJrGtruZSFdiWz82TnPHODVprwqCxAJHzY/DNW68WmdNTFqUJLyOsB xjBPzcc9+n50ICWx8xK8df69s1xUPjuFX2T2LYz/AAOP1/LtWlZ+MdImxuaSHII+ZQMfj+NeHGrB 9T8snF3eh0ij7qqWyemRyfrnp9TU9l/x8RjLrlhnA5Bz+tY0Gr6ddYWK5hlY8bQcZ+nv9a2tKyLy I556r0Ix9MfhVxab0Zi9DfMm07VJYgDJ25B9DyevWimBkJPyAj0IH5/59KKt7kWMK3kb7OpB2/KC RnqMZ/D14oly9qyDHKkj6+h/+tUOnk/ZFcufujII6Hp/9apn3tA4IClgQ2VyPqP5VPQo8+nPzyDB +8QR3U59f15qMtlCDtJx2yA309+lT3/yXUqhgADhSRkge/rjpz61XAAJVgEC/eAGSp7n8K5+psiS NsN0DL265+v4n09KnRv36gnIOSQM/Nx2+tVeQ43EDn5uP89KsqCZcAKpXdjj7vA/kP51tQ+M7MC7 YiP9dB8ZLJHnnOV46Y/+v70xZMiIA5zkEZ6n1+lLD/qlGAcSdMdzk/pxTXA2uqnASTPK/dHP+Nd6 k7n0karaT8i1p8jR3CNsGCCrbSW3dO/0z0rSLFQUO0GJtw5+6D1rPsQxmdeAcbwNvC8dR9OtX2bC RSsuGX5Rx1Hp/wDrq4yuZyld2HIQWKKoCyLnHYn1H8qftfdgnLR9Cv8AGOPz9OKaqAqYi42/eTjo fTPp3pw3k7wFEo6qBjI/+vyeKfN0uZc+t/68v8mKHLDz4jg42ujdvX/D8KeHIUzxZXnBGMY/Dtj+ tMTC/vkYurDkHtx/k0/lDvjUlSeVHQ+/6ZqG/wCv0MnLZd9r/wDpL/Rg218ywALtOGTuOO/rj1py bJwedrkfMSeTjtnvj+tNC7SJYRnOM7lxu9j9eakCrMvmxjJI4Hv/AFzU81lf+kZNrR3t2fVeT8gV 2TAkLLtOA/8Adx2J6cUPAT80JKEdAB+uOwH45oifzVIcgOOxIG/8f8aAskSjnzI89cc47DHvS16a P8zFqSlaPuz7dJCCYrLsl+RiSA6gkHH868l8YKP7euSowTIMc+/TNeusEmXKlZATnaR19Pr+Feb+ Ijpk2rXFrcR/Zpt2I5lAw/pu9M9PwrjxEFOy2Zl7KFaTUVyz7dPkcXPEDC6lwq7Wxngnjv6HvXDv j5jgHngZ6c16deaHqAZ7eKAy7lIVkPysD3z2B965j/hH9M04l9c1eJJM5+z2oEjn1GRwP1rXBwlG /MrC+o1ndtWt3OaiRnbaFDNxgDr9K6HS/CeoXUXnzrFZW+QRLdOEGO57/WpP+EmstOGzQdJgt+3n TfvJSP6fhWXNd6rrd3tkmmu5GcYQEnP0H+eldjRcKeHg0tZvsjceHwnpJBLS6xOGwQB5cW788kdf 84psnifVr6M2enRpZRE4WC2TBOfXuaIvDtrYxifxFqMdqeot4m3zH8BwMn8uajbxRHYq8Hh6wis0 JP718NKffP8AhUbnTKUqa998ifRblhPDptf9J8S3kenxdQhYPMfQbfz65pi+IILIfY/C2mbJGG37 RIvmTOfUD+Ht0qtZ6Df6oDqWr3P2K0I5ubgklvoOpzUs2uWOlEW3hu2Il+617KAZG4/hGPlqkraD i/ZxvbkT+cmPk0pEk/tLxhqDh35ECvvmc+47Cp7a81bWYmsNAtE0zTY+ZHDbfl/236nr0qrDo6W8 f9r+KLlvnBdbYt+9m/wFSrNqPiSM2dpHFpmjW+WbHCIPVj3Jplx5o+7az7dX6voiezlt7Gb+zfC9 uL7UXyr37qMp2OAeFHXn371PFKljdmy0wf2trsw/eXbHIiOOduf5+3bpVZLovjw/4VhISQYuLrGH kA6nPZcZqWBUt5v7B8MgTXUikXl+w6L3wew96V7pGibW34fkv8y3YxMlzNYadMJb5lzqGoscrCM8 qp/T/Jxf0pIL2RfKQJolo2FB+9dS+/c89+9Q2ukmaJdGsnaLT1bdeTj7854BwfTqP85PQ2ogbDxo sNnaYWAKn3mA4/QD86wnUXQ6Yzf9f1/w7Jba28qZmuNxurkBrh+6Rjoo9un51akcM0YYnPMrZHRQ OB/L8Kgtw21FmZhLODJODxtUdB7fT3oD+cftCgkzybPlH8Az2/Ck5WOj2llbuS5bcMYyEzjOeW7/ AJVMHXeMtyGYH0+7VaOTzJGcFSr3ART0PHJ/rT4mLFXA6yvwe3Bpc90KNa6uctdkm4fDAYbB9aSN mDH+H0weB/T160+6BFzIQATzxt9f89qapJGF5xkkFeteFa2h8lLdmt4SUNr1oVY7FkznHI47CvX9 J+a4VWAyVORzg+455/CvJ/BEZOvwHA6E8j27+teq6aT53ygYPTGMg5H5/hXfhfhOSozcMrHBDSMM DnYW/CikhQOuFK8D0zx26UV0tGZg6S5azj5JOAFY9B16/wCetWEZQCFLqAeMj7p/zn8az9HO+zCF MgthlBxu9/x61dVgZDmQEAfe/ve340L4Rs4nVUK6hNk4O85I/i/zzVQA5BU46bSTjHpn+tX9f2/2 lNnu3TPTv+OTWczEjPEnuON3/wCv+lc7vc2WwvO4DgYIAGPwB/xqxAT58YXk47jOfrVfIKk4zg5z 6n/6/wDSpLf5po8jfuJ4Hfjn/CtaHxnZgf46/roSxkCGQAE/vBxn5uvT+dPkVjI64A3Jkc/zqKMg LL8y7fX19vxxjn0p5fEsLH5gQcjPQ+v8unpXVFto9iD9yP8AW6JLWXbcW86hAPucn37j61rhFWdo jnbKvTPftj/PSse3QsShZWIbLHjn8P0rZ3M1vHISPkJwD1XHBz69hVxbsEpJ2fR/r/wRq58nCDEk RwD22/5z+VSZVJA6oGRsZBPPJ7/iB+FAIV1kB+V1wRnHH+ePwoQHLRSMGUjcD6eoFU5a+Ri5Wd2t Lbfn/mCjypjklkfGT2z7dvT8KdHlEKkDyyTt/wBkZ68+tRRZIaBgqEdOOg/rjOPxpyMxUQux3A4R vUfX296V+j/rzCT0kpO9rX810kvQmz5UrFgHRzkj19SPxFKxw4kiIKtxw2Qw9PT2pgfKmKUgEHkn JI/Xn8PWo/tCwSGNyMYyRnPb+gyfWkuZ7b/mKEas5cqV5W+Ul/mWXAlXIXBXJJHBXPXHp+PvSI6A bZCEc9ieCO5/lVcvMG3RqqLnAb0+v0681IsKyRhpH3MP0/wx1qrRjH39vxRc8NThG1aXu9OrTGM+ JD5CtIScMvr+P+FcL4khtrTUJL6eze6lfBG5vk78fXsAea7yM+SwjcCPn5X7fT34549a4HXJr9fE k8dvbG8hY4lhK7l57n0wKyqyWkba9GWqq5lBR16S3uY6eIpwzLLDHJbBdvlKCuAB2IPB4x6VyN/4 ci1JH1DQJ/tB3fvbZv8AWRt378j3rvn0PTy8lwXdolGWt4yNwJHQkHgD8fyrgNS8TXVnK9po8UOl wq+CY1/eNg8Fm6nv/KqoKcXaoOs+VcuNd10tv/kInh2x06BZvEF+LZ85FtD80h47nOB/9em3Xig2 8bWmg2UemQHhnxulb3JP+eatWM9n4sYWuowmPUjxHcwR53+zr/X+VPn8N6f4cQXWvObstkR28Gdr HOMs3YVu19xm6U+Tmw6UYfzdfmYGnabqmuXbFFaZj80ksrEKOOpJrZWTQfDRJQJq2pJ3KjyIm9v7 1Zus+JL/AFOBLKIRWdkpwlvANoHpn1qfStBijgGo6/ObK06qmP3svH8I/rR6HPTtd+xV31kyFTrn inUQhdpiCTgnEcQ/kBgf/rrT+06R4V+Sw8vUtVH/AC3YfJCcfwjufeqGqa/NcRDTNIgWysSdqxIc s/P8R6nPHFWrTSbXQ7aPU9fQPKyhreyzy565f0H+fak+60Kpy1coO76yfT0GWOmS6j5mu+Ibp4bU NksfvzH0Qfh+FSS3t74kmj0fSbVbTTox9wHAwP4nPf1+v4VWLar4u1T52RIYwST0jhT+XA/GtZYG uIDonhxNlocCe6bAaZvY46Z7VMpRitRxkuW+vK/vk/8AIgabyl/4Rvw0m+Z32z3WcO5+vZea63Sd Jg0e1XTrLbPeSnM02MbuOg9FHPI+tM07TbLw7aC3tBvu5eJZc8jpwDzjn2rQWT+zrQyHAvJMg5H3 B/TP+fSuSrWTuunX/I3j7q957b+XkvMldQrjTbNOXb99IepIxz9BT9sUt0LeFQLa3GZOeHP/ANc/ 19KhRvsNl5zgG6lPynrheDUoTyIoLLJEszbpTnkdyOKyiu+/9WXyN4N3s9/6svluxbiWRrfcpYS3 ZKxH/Zzx9M9eKVn2XDjb8lrFtxjqx7578D9aEKtfu6YWG1U4wenpj8P6VA7O1gACQ9zJuUAgAjOO n0H603Lr/XYPaN/18l95JZ7ttnE4LMUaTbzgEjP9alhIP2RuWDSSHHcfeoDqNQuCvAjh7dvp+AFN gZozp2MKpByccnI/+vQpK4+Z62Ma6VWunDAkZyzcYPH5Co0VdpbIA/z+fb/OKnvl23cuTghjkD+H +gqAI6IW3Lgrke4ryZOzPnpfEzofAUf/ABOyShJEZyuTz27V6dpWC785IGA2T83Pf37cV5v8P1B1 KfJOPK+96HPp/T1r0fSTkSnKbsAkHoBz/TPA716GG+BHJPc0X80MVCbsHn72c/h/niikgdWyX2I2 B15z+VFdKehmc9orARMGYqFYZYfwn0/PitBAm989QOgOQPUj154rL0STDugZgRjGTwMZ/Uf1rTBQ SblzGM4BH8J/+tzUrYb3OW8UIiagwLHlQQcdfX8qysAg7zgZwdo6ew/z3rY8TLtu1O4glen04/QV kZwfkJXnPb5ef6dawbaZqrWEDAEDdyOmR0Hf/wCtT4SolQM2Aueg5NR8FuuAeg/z6dfxp9uT5kTK 3HOOM7fb/PrV0m+c7ME/36f9bEkGczZYHIy2OhA9KNwaCAMSCBjkdB7/AIUlucSuNp+6SAe3+etJ HuNoRxj/AHfvcZ/+vW/M1G56EJfu0+yX4Mt2+I78BjhWxkYxg+o/DmtdVIkkjwuCN3Xr7/571gyv sMM/QADOfT0/rW5KxVYpQSQevGc59a1p3d4ja5rwXmv1QQjfE8THdg8ZHGO3+fWpDmSNWXiRD2xg 46f16VGZAsu7cGDenByT/j2pJDKsrLtEaSAZ/wA9s1pyOSubRw9SorvS+uvfqh8pAxcRbQQejAfh /k0jOZV3xdfvMe354pqQ4uxu/fbjlT2PqPx4/KpbYlCY1IClsqT1B/wPv6UXhHVK/YSlRppOHvNK 67W6r5EZSS4CyZGSAAB39j/9b2qWJI5VJA5LYxtwc/4UjAo7Ejcj/ex3PqD7+1K5McoKFXLjB46/ l3PShyc1ZfITqVa6UKbst426eTHBnVijHaf4WzgH26evrTXPkkFACDztHXvjit3R/C2sa0okWIW8 BGQ8o6+v+HND+FtQgvWsWjR7gjcjFseaB1wT+FJcq97r1RHuRTqTd5faiupg5e4AVfuNx8xGW56f n6Vx3iHzLia4sbW6eK4jbdjI/eD2P9OtelXug63auzvp0zJ/GAu7b05GOvpxXmHibTr241yW5XME aEBpXAAU/wCNZVJS5UoLRl060mrUY/u396+ZyVrLdWV2+HkjnUng5JY89j171Ld6Daa/HDeain9l 3EknyogGbgdiFPIauiW7s7h9lu0Ul8qEfaHUYY4xj2PH615N4kbVE1m4W+eZZ1kP38gj6enQdKeH goPe6FzU8LD3n7RP8P8AgmrrmtPpLSaTpNh/Zir8rykfvpB6k9vwqv4V1LV5pv7OjiOo2srZlgkG V5PJz2+tbejwrq2kD/hKcW9uoAtrxyEkPbGMZcY7+1UPFNzcaTbJZaRb/ZNOkXIuIzlp/ct1/Cuq 1lccozp/v3P3e3X0aNdtH0ixe7utEhi1HUIcEW7ShlgPcgfxYPFcXcNrWuausc/nXF4x2hGGCPbH al8OWGoX97us2Mfl/M8xbaEA9TXazeINHknm077YYbyWMRSamkYAZvcDt70WTdyrU8VHmfuLt3ML dZeFEYAw3ms8YbOVg45+prO0fT9R8Sak7zTHYPmmnkztQd//ANXvWlYeC9RuNQxM6PafeN0hDIw9 veuzRLW0tItPsYhDboeD3Y+p/HFc9esqSu92c9WDVnVVoraPcy1sEa2XSrSF4rHcN2M77gjucdu1 bsMCaPa5AxcNwgXonHT3/SpIFSwhMsyBrhjlE44Hr9agghku7j7RcbjEMl39eDx7/SuCUpy6+8/w RpHn5v77+6KHWimJTqFxnIb90hHU9z7fSksUN1dfarhz5cfzHIOc88Cm3ckt9dRxRptVWIC9h7+3 apLuRUVLC2TJ3c4PLE9v/wBVQnHdbLbzYlKKs47LbzfcktWN5evdTlmhTOQR1OOP8/SnpLJFHNeO 2x5RshIP8P171HPmOKDTI1UMxG5sZOff1HX8qLpvPvYLKIYjjUJx0wOSfy7Vom1ovT59WaNuK5Vv t83u/kLIfK0mGJQ264y233P41JPGH1K3ttzYiUFiOnyjI/Wkjk+0atEBzHENwx0GP5c4qO2mZpry 5OchML6dev6Uc2v9dCVNfj+C/wCCKj74L+VTwflBA6AA/n+PrUuNk1hkgnaByPUVVRtmisSMiSQ8 /gPz71buGUXtmjEZUDI4GKV22l6DjLRL0M27CrdSY6A5Ax0/Kq21dh46jJO3/Ofxq3fZ+0yAZy2C SfT/ABqFV5x/ICvNlfmZ5FT4mdL4BCia6bJOUA/3hnv+h6V6BpwO2RQxIGCoI4z/AE9ePSuJ8BAq LlyRjIBzzmuytFUQtJISpDfwn39P8M16ND4Ecc9y7uQKBsLt1JJP9KKj89R9+VgO2wf4UVunoQYW kbVu3BYHgex/A+/9K13I6L82T8u79M/WsLTGb7UQSOVGF9fp6Z6/hW1uIcsZN478ff8AX86lDkzB 8Tjc8TA7gRj0z/8AWNYgLBl2yLgDg+vseK3/ABOd0cbEFQM/UZ6/n+lYL5yAwLBsnAP3sj+tZzWp rDYa3UYbAHIyOR/npUluCZY8AMSDgYI/Go8DDHOewPqPT+VTQRudhwducEdCfp/jWlGLc1od2Boz qVlyoW3Y+eBksCp6dOvQ/wAqdAN0bqNp28jjkew/z0p0aoJEDNuY55zgfjSxtvLfKCu0/KCc/wCe a2UYpLm8z06dKnCnH2j1s9gMOYtsvBU5U9Qef09K1oog1qS8mNp5HPbv71Fo+jXmoS+UqBPMyyu4 wHx2H8q310G7guxaq8bsY9wI4x2PB+uK1hJ2bghSxqjf2atomZIVTCrAbWVcZ/n+PSnTMZYFG7BX njqGGM/qO1XP7PvYZJbdrdwyYJVeePXP6VTRSjvH95h0x345HHpT5XJv7zD95OcuXVp8y9HuBBkj LMu05yQPXnOKHYOgKj5ugOOnqD/TNWNK067vbk2dpbySSZyEXnHb9M16P4V+HSRILnWH3NuDLChw Bjpk9TUtxg77jqSoYaV3K73SXn5nC6JoOp644S2hYRhvmYDCr+P+FejeGPA2n6YsT3K/arkc7mX5 VPsP8812MNpDbRiKCFIo16BFwF/CpAhzwpHGCP6+1TKbei0PPrY2pNOEPdj2RVMeE6cY6f5/rUUt qjurSohZOhIzjjtV8rtUNxnHX0ppTKYK4GcgA9PWsrHJdp3KNxbLND5LM+GGBhsH8cf0rHtfDNjZ zPJaqFgkAEsLqGVyM4Jz35NdI6jcc9T+vTio9gz06eh7VSclGyehcK84RcIvR9DlL/wH4TviTceH 7Fm/vCLYR78c1w/ij4RaTdalBdR6dHNbw4UJu3S4Hf5gc8/WvX2ZY4yzlVVeeeB+vT8a878bfEOC 3D2mhss8xyrXHVUP+yO/1FSqvstTXC4qWHk3FXv0PJPif8HtIhtX1ObxddrM0e+C2mgVjxnCjGMA f4+teTeFIZYLO6/tl4l0LLBklB+ds4BQdQQfevW9Uu57t5ru8d55CpLbjnPU9f1xXhGt31/ruqtE BuVHKQxIuFQfTt75rWhVbu7nXRqqh++bvJ9P8za8Uq0+jA+GnRtFjwJoowQ6t/ecdap+E/CNxqka 3t432eyGDkj5pPZR/Wur8B+GJdHQ6lfTOqspBiHR+vBHeulnC36YtmCkDHlZADfT1/D0q6la0fd3 O90o1P30vi6R/wAvLyKtpcxWcIs7S2WOzQbRF1xn3981bj0+JglzBHIJAuVhc4IPY/1qvb2whQ3N wGVUJCI38X19vaoZpZp5xtMhbcAoU889MenauJ12re11b/AccRKnb26vJ7d1/XYYYp7u6KyK2d5L A5xjPU/zp2oTgQ/Y4BthBwcD7575rVeaIRtazuqSsuGlVQOfQj9KoR6e6Ss0o3RAFt3UEY/xpTou zUXe+7Jq4ZpclN3v8T/QjiH2S1EzhvPf5UyTlF9/TNJp0arG93J/APlU929aZcO93cAjkF8KB2Ge ntUl+RmGyhXKrwNvc1kpN6rpov8AMy5r+9HZaR9e4lmGzNeudxHCkjqe9NsAI0mvJCd2Cgz6n/IF P1LChLVTxHnJHc98+tJe4hghtN5+7ls+vX/P0qm7N+Wi+YpPlu19nT1bG2q+VY3E24ncNgYUKoj0 liCcyNnt/n1pbk7LOG3AYHZuKjjnk9PxpL/93bW0OBnZuJB6k9f61D0uuysE3yqSXRJfeE6MNPt4 mY7nbcR16+9TXoYapEoXG3HJXpzjn9f85pt6uJ7WAH7oUHnvTrzP9rqeCNy9DnPNNuz+ZTev/by/ IqX2Ptki8gAgn8uoNRA8N8349f8A9dWL1f8ATJGYrgHOBxjioQhySCozzz0I9ff/ABriqfEeZNXl I67wOrCymf8AiZhye2OPqe4+v4111qoa3bJxuICn14/yOK5XweEOkkhsAytznkH+f+fxrp41XyNu VU4ywHJHofy7DvXpUUlFHFLVljJPyhkUJwMoTj24FFMLO5BWFX+Uclv8KK1WxJz9gAl6DuKgA/N3 B9Pw6VvFTuzt46kDt6kfyrnbUlbuLbjdkAZ6e2f896341GRsLKFYbc/w46Z/XNZxdxyMzxKhNohJ P3zj8Ov5Vzx2qrH5lwcHH8PsPp/Wus8QW3/EvlYKMKRnn8vy6n61yyRHIIIz2JHTnv8AzqZfEXCT WwoOOFhUEDk+nc06EO0yF8gc9s/X9OafHGQBtQgZzgdfauj8M6TbT2iX0jK5W5SII33cE9x3/wAK 2pOU5JI7qGJqSqxTf+Wxiabpd3dSefHbsYVbaXA+Uk9B7118Pha30o2tzLJ5rmYKxPCKD2x27da6 nX7eOLRZ1iRY1QA7R2AIIH/6qz9d1KKWwEdujXDoVZmUfKMHnntXVSo2tc2wkZ1Yw5V1f4ljWIo7 e4spAoiVZdhXGNgI647euap6xdwfb7WS1C3FwjbWAGVbcOAT0NS6vY3t1pJuLu5Uqo3JEnAHQ89z V/U7OJtCkFvGqDZ5ihR365HrmtoxjE0gqNJQv7z1j5GTeWV1JfW9xfS7I5v3TqjEbeOFJ79K1V0i 2hv7DyYBEizqrheu1jgn696L5TfaGk8eNwjEikeoGcfWtfRWFw1rKvzbirc/h1/GpnJ2v2Ma+KqK MZdFeLS2O507RrKwRltLeOPccswUZY+p9asNDgZwPwqdS2OO5xQ59Mf4VyPc89oqmN1JJHPbPT8a bt28EHj2watHByOvtnrTWbPbPof6UCsVmQ7SSAcjn0x/Wo9mByOBxnpVvau3j8Ae1RugIHPU80gK 5XngDHY4x6VieJNe0vQ7Qy30wV+qRg/M/wCH+NZ3xK8UXHhuyijtIVknnBwzHITGOcdz0/OvEL+/ ur+4e4vZ3mmckkuecd8enWsalVR0QktTc8YeMtS1+Rog32ez/wCeKkgsOmT3/OuXKjkbFII4HYj3 9/pSsVwDu46AgdD/AE49abnORyT3UDn6/wD6q5HNvcOpDcxB7Vs/ddCoOef8P68Vy+gaBYab5ly0 YwxzvP3n57HsK7KOLzpRGXAZyBnrnP6cfnWjqnw78RAs8JtZ1wdqq+wjpxg8dAPzrem3GN92d1J0 6EeeWr6Lt6nFX0slw4DfIq42qARgc9RRp8WFNywdEVsqV6v9P8itNvDepwTtBd2rqFGWAG4t9ADn +lUdQebcYXjkiRGwFZcEYxUKTg/aSep0Qn7P99N+89l+o4zQX0hS4PlyHhXBwv0PvTPs/wDZ/mPM o83+AD+D1P5d/eksYACbpwEReFB7nt/k077XvJSdAyE4Bxgp/h+Nb86kuaekn1OxVVJc9TSo9n/m UVEksmxVLux46nd7/hVxrj7IiWwUSqv3wwyGPepjDHaI064k3Z2YHYjr/KqEam4nXLElyCWHORUe /R91bsySrYaSpx+KW5dht1MTXFsrbnBHlseV57DvVOxtWDvPIpHlgkBs8HHen30ziQLC77YiFU9C Og69utXJ5oZFigvHJcjJcDAzj/HvzWt4z20a27HQ3Sq3lHRx0XZszLaET3hMmdnLt1O78aBGLjUF 4GDx36Dtn9auPaGztpWLq/m8B17jt9ag0vjzZnBOxOh9/ft0rFxcXGD6as5vZuEo05dNWMuE+06i I1OAW2jP8IpdQUSXYUcDgY65HH+fwp+nx+beIxJJwTnH4c/nSKofUE27m+fccjpz/wDrrJPmt5u5 nCXMo33k7j5l36tFjCgMoz/Q+tNnUtqiE7xhh1z04qTb/wATJDnI35zjrjPNJKf+JkTvJxIApI9/ 0olJOzfcpO6i+8iveqRcOQNuPujHTp1/nWRrF4llC4QbpGzwRnt1/rWprlytu8j7sk4xkc9P8/nX n2uXsk0pUHLv97B6f56fnWUKXtahw1k1KR7H8N3WXwrHMGzvZyWzkNz06de9djFtSJMoCc5wf4cn 6dzzxXH/AAzQReCLJBt2lCxVfqeRj34/ya68ufLA5POGbPXB6deOeOM13pJaI4WWICQ8gORg9FLA fUY9aKr7gnMkjc8ccYPccelFaLYjU52IfvkxluRkDgnPf8f6V2FtE2Fwxff0c/xZ7fj/AErlLe2n lnVIYmdgxwE6jHX9K7SLd9n+ZR1y65zg4HT+VZwTHOxna5Ez6VJlSR1wOqn059cYrksDBRvmY9if vf8A6+n4V3eqKx02VTydh/iHSuJYL0YZABzg8j6fhxSqR1LptbDXKAjLEYGMj/PfpXQ+GZbhLFoo 7d5ZBcowJ4UH3+vT8659VdD82PUZ9v8AI/Guk8IgGOVWB5nhJAHQhsHpzj+tb0FFTR6WG9jCon8T /A67U9LurjTZpb+9ZyELJHGCFBx39fSrj2yS+E2CIiK1vkqOADjJ/Xjmti/jaSxn6EmJgcY547e/ 071T0FVm0C15GRFtUnGOmMHjt712amaxFSVJNvRSWiIbWP7ToqAru823HGOvHXHqOlJoZFxo0APX aUbjrjj8fTipvDaq2kQpkgRsUORyCDjtWzpWnW+nxyIjMzO7OWf354/+tUTmo3MakuXng+kroyPD umzrYG3ukaNY3dVJbquePw5FbWn2cFhFHDbqFRCMAnpz71NNcRxn5TlhgbfQe5qhLLJJIpc4xyAK 46lZu9jGc3NtvqdurfLyQM8//XpGPHWmRH90uSMEd+1PIxx+fFO9xgSN2emf0oxnquOOlNY/NnP5 0qnOD0+tNiGnGOxB/wDHqazLjOenHXge1K3KknB9fT8KacjgdvSkwPKPjwM/2ZjaD84HPQ8c/wD6 q8oUbeeGC/e9R7/15r1n48DCacc5+/1JOeleVYcqQecjAP4HiuKs3ziSRC4AHzAfd5z0NKqbmGBk t93HXOen5+lXdN0651C4S2s4GllY4CjPy++e3PrXpPhvwxaaIn2m723F6Rxj7ig+n+IqYxvuDkjn /CnhIsFvtXLRKD8kGfmb0J9B+tdPq15OtuRbxeYc4UY4bnAJ/wDr+lXZPMkY7mLcEiuQ8XeKrfSl kt7MrNeHhuflT61op2CE+WSk1ewapqNh4esmnvZBNezfPtHVvYeg615rq2p3viG/82dlWFSdqDhU X+pqDVJbvVL4yylppmbg456+n513nwv8EWfiQX9rcy3ESQBT5sWPmY5z164x2pRTqS5pHfCW9epq eeXUpb92g2xxnau01HbQiWRg7javLkHAx/n1r13W/gzLbRPcWWuQ7EBJ+0R4wPcg1z4+G/iaXRop 7KxSVHJOUkCsfwYjH4+taeylfnkh06t269RafqcSb11mDKA0R42n7uKnWBI7Vri2jIaVeUPBA9B6 1au/DesWN0sWoaZcwZLbvMjOGA64PQn6VQuGkF0NuY2XgE4/LrWqnZP2mtzto4r93eq7823dd2V7 WEmZpJCMRZY89OmBz/WoZmkmnJy25z0Pbk89P/rVsTRxy2yplUnccqBjcaoW9qVnfzQVES98jnms qtCzS3Q6uH5XGCd47t+Y+5maCQQIFkRVClOcN/8AX/Lr+T2t45bHdbHgjcV3YIrPlUyztuX5mPYj qcdOfpVy9JSaNEYIyIAOQAPbPrTVW8ZOauhU8VzQk6iunp5jbGMxQTu25WVMHJ+77j07VHYqWu92 SflJH+e9Xi8cligu5GXJIDKOnuR1/HmmpZSQPLLgMpTCsp+9+H0pSpWknHZGjw/LKLg7xSKVic6g ScAEnC568Hp/KmXE8cd95jnADgbsnA5GB+H41Z09cXO4kYClmOBwPr+tafg3wnNrrza5fRsunQ7j bxtx5reuewHWsYU3UcUjiUrRp+b/AFPMvGN7IuszI0mdpCqQMBeOv+c1y7BpCWOOc49/Xnoa+ydP 0TS77RrP7Zp9pcAxKB5sSnJx05/PNZOrfDHwZeq4k0OGI4wTCShAz14PNd6pcjdjz61ZqpJW7nHe BIhF4Q01R8g8gYbsCRnk4roThdyqMbTkhjwPp6fhmqNraR2MCWcH+qiARBnOQBjGfwq8pI3AndyB k9jnp7Z9qysYjwwChjIItwyDkjP5dSKKkhG5PubhnjnHHr75oqo2sI9I0rRbHS4/Ls7dYiVwW6l/ x9uv41x92jJcT/Ns2scHH3fb+teh4BODk8Y5HArgdcjZNUuI14Bcn/e+tdFaOisZepSuSfsbxqNv yMOeQvof6/jXEYO4ctnnGex/+tya7V2yjrglTxjvXEzswlYHkk9c8H5v8cfhXJUuaQAf7pJxyP8A P51u+EJNs8iq5Ukx7c/xDeOD/P8AGsHLK4OGA6j2P/6/0rX8KyBNVRAOGZAeOvzr09+30p0fjR14 a3tUezyoTbupXqpwOmDis3wlhtDiQ7WKllwCBnDHv/j6VsD5l6knbx6EVleFsjTpo/7lxIvA6Dd2 9Pxr0b6Ch/Al5NEXhoeW97CGz5dywX05wcfjW3kDA5Ptn+frn29Ky9MTb4i1GHHzSBJc9jxgn9K1 zbSjk9zyAOorkxVWELXYsUm6rkutjJ1JsTrtbjjvgk+lV1mdWyPlOPy9xnpz61a1SG480t5LHC4B A4x6VnnjCkHjoDxj6+lee6ibdmcupu2viC8iO1kSb+7xjcM9f0q9D4mgYgywsB6g5B9q5MvywIOC 2WwD1z29qUMxXPys/r2/+vWiqyHzWO8ttWsbgsFlAx94Nxtq2JomHyup47HtXC6awM7DLAAcZ7c9 /T8a0VkYHGWX1+tbQqXQ+c6st7jGOKY5B59a5uO9uF24kft17VY/tWcJkqrEfhV86uNTRw/x3ZfK 00HgbnJGPu9K4Xwz4cvtbuGWFPLhX70pA249vU16p4rsLTxBPZteMyQ2+47F/jyBwT2pVntooUtb cCCBONgXGCM4rnqRTldivcraRptho1obexQFj9+cj5mPcfQelLcsqR+Y7hAv3ix/1f402/1C1sLJ 7m8nWGNepJ6jr+Jrx/xz42utZZ7ay3Q2CNtGQQz/AF/Os5zUUOMLm74u8cIzSWWjMhI+VpwePw/G uFz5oZ3bcxPLd/w/+vVWyDPMV2t2455/z1r2P4W/DOS9Cat4hhaO3BDxW7cM/HVx2HtUU4uoynZa GJ8NvAN5r8q3s6taWWRmUrzIAc4X/H8q960rS7LSrKOzsbdIIUGAqj88+pPrV2G3jghEMMYiRRhV VcAD2pxXLEk/j613xikkjWU5TSUuhyusA63q/wDYkTN9mt8PekdGzyqfpn8K6FY1ji2gAIowMdCB TNN061sI3W2jYeYxkdjyxJz1NRa5b3V3pdxb2cqxSyqU3MOFB4OMd60dmaznGbjBaRRgaSg1vxDN q74NraFre1yBhj/E39KpfEeHQ4dH23VraCa4PlRPIgynPLZx2HNdGxsPD2h5ldYre2j+Zjxn/wCu TXg3xJ8XP4kvcxKUtI8rEmOWXuce9Kc4xVzeElOo5292O36HNeNrnSp9QP8AY9kLW2iXYHDEGQj+ I+lU1lDW0aXTMSwzux0HbPr+FVJ0ZpIlUFmYjn0FF+wMxRQwVRwM5x7/ANK41NxTk+ptQrSpU3J6 833Mclk0N8gJLKPmDDuPy/l6VWuctJK6kgH9f0q7ZS7YJGdCy8DGevrg002okdXhfem4cZwV+v5f zp1KXNFKGxtPDxnGCp+rQ2bMccKnnYmcc8f4VNZMYbWViGMYx8pGc+v86r3hZrhj04/yataXpd54 geHTbDcVmf8A0iULkRKMZP8AQe+KmnzucnEyjXcJzqXLfhe3sdT1SOUyMtmshimyDtJ4ON3cY/n6 17FNDZxaHJDZhEto4iqhQMKB6eg/pWTFotjpH9kaNaW+23jJ3DrvO3kk45NW77Tbm0hdrCQeWVbd CwyuOc49K9SFKMV5kylSxDptvll+G5b0HnR7XI58kdPTHX61buF3QMBlmYEL/tc9Pf0rL8LXlrJp cNur4kRAGVuoOOuO4/xraUkHnjPBxznnH49fapnGz1PJxdOcK0uZdWec3en3sDvLLBJGo64HA9gf 896hCs3zMCAMliOw/p/+uu719tmlTHOAFxjkbe36f1rhH/1pwrqc7iOe3fHbFc04KJlFtkrFdoBm dO/ynGff3FFRNuJ3LKIx07g/Tgc4z+tFJPQo9sCfdzljjseo/wA8VwXiiJhrdwvJDYP+9wM/n0r0 ZUBABAGeuKz9R0axvmaWeIiXGC6kjHHauypByVkZtXR5moJUs7FRzk4+7ng/n0rj7qMi8lCxZxnI z+Gf6V7DdeDlU7ra9YMDwsg4P1IqjoPgG3S7a51SUTZPyxR52/U568VzSozk7DjKzOA8N+GdT1qV BbRtHB3ncHbj09z2ru38J2Gh6XDMkZkvDPGDOxxs+YdB2x0/Gu6tbaKGIRQRJHGuAFVcKv0/n9aJ 4IZ0CyoH2kMAfUdzXRToqFm9zWjU5JqTI9mBzxxypHt1rJ8MIqy6gjuE23j5yfUDoPxrfIwSew59 /aucvLT7LdzSeZuFw+9VxgJxj+lZY2tKlSco7mlKceSafWx0SW0Ku0ioodv4h1I9z7f1qSQdsgA9 z2NcxHeTR8pLIAOCM/rVqHV7lTtcLJgdxjNfLyquesmPmT3N0KpOQMHocY4PrUUkETrtkjDjGTkD kVTi1qElVkjcZPUHI7deeKsxajZvjMu04A54xSU/MXusrTaVaOSyRmMk8YPT2rP1DTra1t3uZLpY IEXkynAHHXP61J4q8TaXoFqZJ5hJKwPlwocs5/z3ryS+1HxD481eO0tY5nWRv3dtEfkUdiT/AFNd FKU27ITijrtO8X6KL14pLp8K20OUOJOe3p+NdokM7QJL5EoVwGUlTjHr/Wj4b/DGx0ApqGplLzUM DGV+SL/d9T7/AMq9F2IV27Rg17VClPk94jkPNnAJOOVPC5Od3tTWwpDbiACBknG0+leiXGnWU4Pm 28Zz1O2s658N2TjMe+I44xyK1dNpk+zZxLjaoU9erAdP/rViz7i7KDuy3H+1yfzrvbjwtINxguAx PRWXHP1rmrzw3q8EjMbMsueTHg569u9c9WnLsJJo8y+K+TokRVxtEvfntx19/btXmljZzXlxHbQQ tNLIwVURcknsB/nFexePNA1bU4LTTbOxnkuZJ8AGM4HA5JxwK9D+GPw207wpbi7nxc6m6jdMwyE9 VX/GueOHc5bGkJXVjm/hT8KYdLjj1bX41mvTh44CPlh6Hn1b+VeqmE8gDPt6/wCNWNrAH9KQZzzk c/5xXfGmoqyLSIWByMkgdM1Hn2A55z2qa4dI4jLKyoqjLEnAAxXl918QxqnjXT9F0Vh9j+0BJpsc ykDoPQUNpbieh6SDweuP51V1O9ttOsJ7y7mWKCFSzuTgAVOrZXAznGPp1rjvi+//ABQV/uOMlOf7 vzDmlJ8quFzyP4keN5vFF2ttCXh02M4WPP3/AHbHeuNnO+RSAdvTjnGPSkboVAzjOR34/wA54qN8 geZ/s9fX29/0OK891JSXKdCqXj7NdxMEF5iTmMbR83H+enX1qowLHkYb1IPX3q5cFooRDtGfvNtP Kn+nfr6VDCPMkAIBDdD685qp3clHsdc43nGiun9MfKhWCOEqQSN3PPv/AI0tiwE7vk9PmGevsf8A 6/8AhS3hMkzEhiOAMdfp+fP4VGTOsTi2iMk8pEUSKeSx9PxIP+eCnKXtLx6FRq2ruontf8AuIhqt x9j0+aGK7fBZZW2hVzgkH071638KdDi0bR57eOTz2EzDzGGPMxnJ+neovhx4FtvD+lyXGqRJNqVw m6dnGREP7gyOBWhoSX1hpyXsETT2szF5IAPmHzHDL69Ace1epQpJLmas2TzQxVKbWkn+Jfv8v4l0 9MkqFdueecVe1HizuCQAfLOR6cH39P1rOtruHUfFFtPBLvQWzZ59xxj174rYvUX7LLjONjYx2yOf pn3rbVOxx1oOE6UZLVJHP6TpkV7oFm+WWdYsJIowf/1VJFe3OnOIdSQvEWwtwo4P+96/hV7wsC+g 2YwMeX2H17VfdEkjKsuVbqD3Gfpz+GKHJ31CpivfcKqvH8V6GL4llSXRXkhIkWTaFbI6/XtXFvsy 3Kg5wRj1PBHPHv16V1Gu6ctjF5trK6xSHDQ87Tx2PbpXOtksMtxnKHp9fpn+lcta19DmqRhF+47o iwqKodkQbflywXI9ehyaKnO7+JSW/i+bHPr/AJ9KKS2M7HtyKoTaAef15/yacF+XvgYwc9PQf1qW JQY1xzwM8c05Y8E4HPofSu/qJFcLgcKcY6Z7UgUg8Dtgc9R/nmrAQHPp1BFNKYHAIPJPHT6etCCx HGvbJb0x6/55o2goc5IJyee/X/69TBcDGACeuKCuTwuMfpQFiEKOTgn029v/ANf9KxvEQ2iNsbu4 H96t4IMEAHueP8/55rD8T7NkYDBTuOdp5A+npXFmFvYSHYxMggHd0H3ux46f0pQ2SDjHUYz09zx3 6VEGJQ8DI4I5wBjqOaXcd3DA4+7z94+/NfLdCk7kjP8Ae4z/ADb3H+e1NDLxjII6Ht7jpTDguBgb epPcH0puCcA7c+g9PWjoO5578UAE1i3lwctFng+5/Wu3+BNz5OiXjRNtfz8E45I2jH4f41xXxPAF 9aMc8xsB+ddR8DZA2l6grKDiVT/46R/Su3BfxBt6Hr0OszI+JEVgM5xxjn+VX4dYgYgMrKf51zSl RJn1bgk9KcCOpXGfTrn1969tVGhczOujvIJRlJB+J6VYDZGB+PNcSXORtAJxx/tVJFdzpt2zuB67 v0p+1GpnYjjnJ4pCORxgjkCubi1q6UDdskGep7Vbi16LgSxMv0Oc1XtIspSRrvGDyRmlI+XAz/hV WLU7KTGJlH14q0siOPkKnPoaehXoMI9qq3k0VtDJNcOEiQbmZjgAU/U7u1sbSW7u5VhhjGWdjgAd a+dfin8RLnxFPJp+ms8OloSG2nmf3Pt6etZVakaauD0LXxU+Is2uSPpOkzGLTkOHkHDT49x2rmfh pk+OdJzlv33b6H+tcyjE4BKkduf849K6b4Zlf+E30kqT/rvz4PIrzozcp3YmfSiHpt+b6HtXF/GN seAbw+pQYPR+Rwf/AK9dkpyMADn0rivjIQPAF6SOMoeuCeR0Nd8/hZJ88EZU5PIXr6f56cVasbV5 b2C2UF5522pCDg9fvfTPFRRjY0ZMPmySttggUHdKx6fhz19q7rwL4bksdUN3ekTXqwh5SP8AlmTn ag9AB+teL7V83kjuw0Vz8z6anOeL9L0bQrWK03S3GryfPNMJMKo9MdvQZrn7WM75JJBhUHrjBqDV ZJbjXbuWQs0nnMCXJIHJ49qsTyLbac80gCAnIPP4f5962wsm1zsujdylUZQ1C7jtImlfnI+UHqSf b8e1enfBDQ99nLq2pWxNyZD5at1i4IJHoeg9a5z4UeEpNbvH8UaxBjT7bLWsMgOJWHG4+oHtXrvg uPbpCytgNLK7k9hyQK9TCUXGPPLdnPdeylL5FzWJhFpVzJkHEbE4P3hj+f1pmhxLFo1rGCQPKXDb eR7e/pxUPi0gaFcAqBuATHQ5yK07OIrbRrtGVQDB6Nx/T2ruMX7tBebOVvLSYeK5X0yOOGSOAOUx w5yM/wBK0rXUo7m3lhdPIulRt8TdSfb2p1im7xXfHoFgjC5PI68H/PpUmt6bFeQvJjZKoO2RTgrx yM/41Seup3TrQnUhCqtbLUi8KD/in7bIZcpnPt6jvWm3fggfw89PXPrj2rm/Bup/Z9OtbW8jMKtn yJTna3J6/Q/hXUhcg5+YZ/FvT6+vFTJas4sdQlSrO63Oc8YEfY0/hAcng8g4PT0rlHXDDfnduyR2 I4PHpiup8aE+VCilF5O056cdK5cKitkKdufunop/zzXJVfvHMtgTa2WdsA/dJfaf/r0UkocsAhxg YJB6/mP85opc1gPekUbFJHAH4LSqo4OML3+vrT4wDGvHQdPX3/rTiBnjkdj616LWo+hGeNxIy2eS e9RkYzxg9j/j9P61M4Vf4cY7Z+6f/r03ZkcAc/8Aj31/z2oQhnBGQMjsPemsUA3H5QOpJHH49qlw P4iDjv6+1cP8RdXvbeVLOxUkrzKp4BU9O/4c1y4rErD03NlRjd2NPWtfjhVoLNlkkHVicha5ZLp3 naVmZnc4UsevI9uaw4td2DF1ayRt90MM4/8ArVQv9a1DVLz+xfDFo1zeMv7yVshYwe+c4r4TE47F YureTtY7FTjFWOhufEGk2t1Fa3F3FDKR8is3I+vH44PrWhGyOvHI6sAeo9uOKh8GfDmw01Ptmrv/ AGlqUmGaV87VPcL+Pc1r6vp2mWsZfzpInJOxVbO0/nwK1lVlBJsz9jfYoH5jjJOfu/SglSM7WII+ UHqT/nmqQlZTkkHHVf6//Xoe7jiRmnKpGvzNIW4AqIYyEnYl0ZI5D4njMloQS3DA5781t/A2QhNS jPPKMAD0HIrn9eu4PFtzDb6OC/kuwldgQqAkc57/AE613fw20m10mG4SIkyPt3u3DMefyH+Nejha 8I1ox6snkfKdsCC5ON+TwB/EKarepwAPvHp06fpUeQWboADzj+Hp09aUctjChsHjtjBr3VsZslzk kMO/zAdfr/Kk3Ht3469ajyd2QRyMA9zSHjPAwOPpTEPVgTnGOcjnvQzHPIHXP40xug5HToehpHxx gAdjU2GGcKACeD0J6cU9JpEO5GZSeflbGeeoqFm+UfxAnj34NJzkngKD1/unNK9mK7OF+OGr3zWF hZtcuYGYkgdCQOh9cV5CT8xHIwOmPu+n68/jXpvxr5+wAr1DE/415mobGVPJ6En73bmuSu3zWNYu +4K24Dqd2eAOD3/+vWp4Za6j1m3mtC6yQtu3LwUHr/WqNlZT3l0tvbr8x7k8L059q73SNOisLYRx rvcjczdNxPr6fj2FeRjsYqEWl8RtCN2dPB4o1qAKgmVsHGJU3cZ/Wsj4j+NIrnwpLZX9sC8xXyhE 2DIw7e9Zut6nb6ZZPcTEsv8ACndznj9azrHRnjto/EviecRXdw2LS0ZchAcAD/e/lmuHC4zFOLk5 PlRcooTwfZy6fPJrepW8bXjKcRkcW6dcL6HvmtCLxpYaPIYry3klvLs+ZIYsHapHGQT+P41l+L9Z i02wMC4luZgViXPzDJ5J/lXERRODJPM+ZH5kOc5+n0PH5+9dmBU6sG5dTfnjGlyrd/kSTrH9omkX 7ryFlzjIyTwa2fCfhC68Ya+sdwrJotmw+0N/z2brsGP1rA0mKbXfE9rplsjvCJ1EzjOOT92vpvRd Ms9J09bWyhSGNc528HPc/X+lfSYSguVO2hz1JuNKy+0Z+vJBpfhmaK3hWOOOERoFGAoPAAHarmkW 4tdMtYFQZWJRjHXjkn+dU/FiiY2OnYx59ypKr2VeT/StoqNmGHHfHU816d7aGM7RoRXfU5/xZueG zgUEma6QBupPOcfT/CtsDAPHGOc9uv8AP2rH1obtf0mAhRhmkbHfC/0zW2AMjgADhT3Ht7dsUdAq +7TgvK/3mDo+X8Ras2d/Ma5I+9xn+tasiDy2BTd8pP1+v196y/DaiTUtYk6ZuQDj2A5ArYkAKnjO Rzg9v6/jihFYh2r/AHHPeGYLe88NrBPDvQu2Vbv8x79vT8KbF9r0F8SF59Pzw/V4f8RVrwWqjRdp ycSODzyPmNbcigrggEYP096ad9GaTr+zqShJXj2OQ8W3UFwtvJCBNGyFl2nO73rm1zgYI2ryM/X/ AD1rX8UWlrY34EStGjfMQp4B74Hpj9ayQykONq7hkMT2+n0FcNR+8ck1C/ubApYZKZ5POP8AP+cU UhJKgBUULwCep/X+VFQ9yLHv8I/dL2+UZOORTipPXr3GOopYBm3XnIAHPrTh0Izt5zn+7XrS6jGE ccYb09TUZAxwD7+3tU7AjOQOevaoyAAe1IdhgGTwPwNeeeP8JrQOP+WQxgc/h/8AXrd8a+M9N8Ow skjrNdlcpArDP1PoBwa8avvF2p6lq5vr6VSCSqxrwiL2Ax+PX1rzMzcZUnFblQR0jLGQVIVuMn5T jpyPrU+l3E2mlmsysJkPzlVHJ6fN68Vg2/iC0kBDoUOccHOPfHX3p1z4g0mC5jga6+eTp8pww9/1 6V8pHWVram2p21t4puUytxHHKo4bnaa5vV9Q1WTUZriMb4S5ZAey/wB38B/Om291bzBGjnSTj7wP 3evFSAjjaSOc7T29/bNKtQ9orMftGiouvrEjfabZ1AG7I56A+uO2apaFoes+O7v7TfeZpugK3yof vz49On5/zrVcI6EsgOfbO7/61XbHVb+zULb3TBVXAXqMeg4/SsaWEjT1sP2l9zsrPw/o9hYpaW1l DFFEAqgKM/ieprH1aHT7aUx2kjCXGWAbgDmqv/CT3bW8sMsaMWUgOpK4JHf05xXKLdatCTuxOo56 cj3qMTTdlyrXuWpROoivLuKVWS4ZGJ43HgdOtGo+LRpFi91fMmxeig4Yn0Hr61zF14k+zQTyTWcp ZV+6p4c5HT17dKs+D/Bd/rV/Hr/i5WKgZtbNj8qjsWH9Pz9KWDqYmLu5Owmos6vwr4stdctPtf2e a0Vu0y/eHqvt71vR3EMoUrKjemCKfJZWkqqrW0bAYIGMbenPTiuQ8R2tlLMsVtNMqq+6VVY4frgf hXpPNKtL40mjN0E9jr94YYGG/DrSFyT159xwK4yK8uYQSrugA5AJwPpn8qbqPi99Hs/tV86OqdFx y1a0M6o1JWcWiZUHE7PnOMA8dAO2DQpztA2kn9Rmuf0HxPBqemR3U1tPYu/ISTr/APqrXF5A/Kyx kMeMHgc9fw/rXqQxNKfwyMnFrc8/+NABWxJOACx6dDx/9b8q87tLOa6ulggXcDwfp0yf5V6X8Wre e8fTooAWdiwwPQAZyfbrVTRNLTTIRGufMzmWQj/PAry8xxsaDdtzalG6I9K0yHTrdFhCs7KDIzYy xxz9B2pdX1C30ywkurtgqgc4/jPTA/lVjU7yKys3uLlhHGv8XPp0+tc1o9rL4nvV1bVAYdNhP+iW 5BO7/aOe3evnYQdeTlN6G/w7FjwhZXWp6qPE2sxKYkJ+xwP0QdNxHr6e/Nch4t8SX1/4mkupwXW1 lxFB0VAD6euOCa9eeRUQBUUHHC54b/8AUOa8Xlty2o3M0pyTKSvbPJ6/UZr2qNNT0WxnzMA9xdXM l9fSF55Tkk9APQfy/wA5qB477VdUi0PSEL3lw20bf+WQ75+g70t/dTCaGwsEaS9nbbGg65PQ/wBa 91+E3gSHwno/2q8UTavdKGuHJBK5/gB9B1+te3hMOpOy2RnUnYg8F+DY/DbaZpkUQZYVae5uNn+t l6An1xk4Fd7kcHA46H04/p0qUgcDcDzzx1PpTMHBzjPbnHbjNe0klojOpUdRLyOdnBn8aQR7Qwtr dnIPYkgfhxit1jjtg5wDjp9f8abFaW0d9NeBf3rqFZieeOn+fpTyASP4ieue/oaYVqina3RGC+2f xhDGQCtvZs2D/ASRzW6c7icgdAff6elZtjaSjXbu8kjURyRJHCwOd45P6mtNzwxBBHbPb0+lLU0r SUnFLpYwPB53HU5MBWa9bnH3cADn1xjNbRHykDtyvH+f8msnwYC2nTSEg+ZcyMpx97nGT+IrZIJU gcgjnvn/ABoDEO9dnPeDAv8AZTuHUjz3O70O7p/X8a3FBBAwMjqPTvn+tZHg4f6FOEwdtzIo44Iz +npW0oUjcCQo+72INJE4r+NI4LxoxGsZ3D5YwBkcEf55rFQLvO1cAfmv+eTWx4tZn1uYYDAKM9Ov t6/jWLxGrDcVZhzz1+v8q4pP3jJCRrkHlD9R/j+fHrRTQI2yXLAdgpxRRcNT6JQfKOAflHGOBxTx wMcHjPPf60Qj90o5XgEDPSsrxLr2m6DYtdajcheMqg++564Ud69OTWtyrGhcyJFE0kjqsaDLM3AA /wAK8p8ffE2OMvp/h4q0gJV7lhwD6L/j0rkfHXjvU/Echt4zJa6fk7YUblx/tEdc9cVxuSASSWIG MDp9Pbp0rgr4nS0SoofdXE93PJNPM00shBZ35J/z7VGCT/GB2AOPm9vc0KueVJ4OQenf+vtTVRdu 0Hd3IA6+49f06Vwtc2pd2IeBwQw3YznkH+dAAZtzt838h7en4UBA2e5PHtj+fNKM9dwJzyMf5x+G azcFvYa1FVnQhkJUk4GDj6ZFbmja+YYVhmUTYOAzH5uT2P4d6wW5OApUZ7jOaTbngnOR1x0/xrOr ho1VZivY7mHWdOlwzSPFgZ5G4D24Of0qtp+v6ZesyxzFdpIO9SP/ANf4VyC5YjnJx931/wAO3SkU AdBxjrjj/P0rljgHHdjbuehpIj5aN0kz0weoz1H/ANenqQckEDAIHPB+teeW080Ll45HTb2VuE/p +ddNaeIlMapMqEdSQSM+9Y18PKlayuJI39q+YCyqSrZOByOf1/CtGy1vUbc4judwxwHO4dPXNc4+ sWIhluGldAASdwJ/Djr/APXostasr1AYLoHIwA52k9fWsYJyXuorVM6288S3U+nXMDRIkrLtSSM4 wfXH+etcst/rEJG+KOfb0OByKuK3JKEBV5HXg5pcHZgqSW5I5OffHeuerh1U+JDU2ULjxFBbW5le 2lVkBKIBnn39au+CfCVzrl+nibxMgI3BrWyIwqjszD19qY6q0iSModiflJXJfH9RWrZ69qdu/wDx 8uwU4/eZOMnpz0qKNBUW7ItO+52k9lZuMPBESRgEoBjj+dcV4z0LTp762P2m5XyG3GJZAEzn+Lua 0W8UzyWxiktvm2kqYyRyRweenrXHf2lq8cpM0Zn3HliDljn9c/0qMQpw96C1Lumbkp3KAdpIHByO OP8AOar3d3Da2sl1O6pGnJJx8uKow69ASBNFJEduM8kH/J7e1Z+k2U3jbUXvL0vD4asHOA/y/aWB 5z6e/wBK56dGpVnqK9loUreGXxberf3IMWkQHEEP3TMR3PTjNdJqV9a6ZYtPO0ccEQyuQM5649zV M+K7LUNXubexEVtpVjCNrKuNxBA3fTtXB+IdTuPEepGaUEafESY0JOJMZG4/yrdYWVaryJ2SFeyG 32p3Wtak19MzxwrnyYlbGB6/XvVTVr37JBuI3zSYCKO5+nuak1G5isrdpZGKqFxHxjn0/XFdn8EP Ac+r3o8Ya/ABACWsYGGQ3+2R6en1zX0+GwzVoQMZ1LHQ/BLwA+mL/wAJNr0e7UrgFoYm/wCWCn1z 3PB+mfWvVx0wcDPUgcfQVNGgCDn6kf5/CkZOTg9B6dPf617lOCpx5UczbY3ZwTgc9gOnPH+NMxuU Z5IHPv71K5PTleeP9rnv/KmuCf4sgHn1U/54qtBkLj5u3A4OOD7f59KRlPTg5wenOf8A6/WpGX0D A+n9aYQc9z6NjrQSyMZOD3Ix9fpx3xTmwQQwDeg9c/y/+tQBzgHI+lOPXqR7/wB32o6C1K9tbxQR +VAiqhO4BRgHPYfWnEZbGBkjHTp/+upVBxnOPUDsMdR/nvTQDuIzwegH8QoWxXM73MzQdPaws3gc h/3rNgHru/lV4kjOSDnqcfe7fhUjADJOVA4z/d9qaVJXccHvg9qSQ5zc3zM8z8UShtVuEZd3zkcD 8D/hWW5b5d21VBxkjr/+scVe1nI1S6fccGRuCP8AOcdfrVJlwpJ79ePoSPy5+tcL3C4KHY/I8cRw NwZM5+npRTkD4BQlsgds0UuVge6+IL6fT/D8l3Bs8xY8jcMjpXzj4g1S+1e7lvr+4eWUk4BPyrz2 HaiiunFvQpGdMoEsi5JC889+e9MK/vkiBIDg855X6elFFeYadBsgC5xxl8H/AB+tKygeaf8Ankfl 9/r60UVaEMZf3irknKls9xSOAPKPd85oopIXQaP9ZjGRk8dqXALEf3Rn6/WiimJ7DY0BRuSOCRg9 KVm/dhsAZXGOwoooYkK42uuD2HX8KAi+bs7HHPfvRRStqAfwuMkKeMA8U+GIE43N0oopJJMolsbq eOaIrK3MoBG44IrubBzdWMssgAZDgbeKKK83GfEikOCjcy4GAB2pjqA6YPVvSiiuQpChQYoj3div 0HtTSB+8IAGw7Rx2JoopS6ARvbQyKUdFZfL3YwPSsjxzf3dr4Vg0+2lMVrMSrRoABgE8DH0ooq4b gmedxxB2EO91jcYZVbG4DpW2kMauY1G1VTIA7c4ooruw6VmKTIPAdjb+I/ijaaTqqmWzB3GMHG7b 0B9vWvqm2gijiSOONY0VdoVBgADIH6CiivbwK9xmMiQYClsdM0SDaMDsuRRRXYIbj/x4ZP54pGHQ 5ztO0fQUUUCIyMOEycdaRwNucclvyoooExjnDMOu1dwz6inKMOMdT+mOf60UUEobjbG5HVOnv0NN kAV5FHQDP5DP9aKKXQpCtxkj34+gB/rQqgnb25/QZooqUM898R6dBb3DyxtIWD/xHIPf+dc+VHQE gYPQ+27+dFFcc+oIfGOSQSMgHj3Gf5k0UUVmmwP/2Q== ------=_NextPart_000_0019_01C0638A.08800C20-- ------------- 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 compgeom-owner@research.bell-labs.com Tue Dec 12 11:45:21 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id LAA02144 for ; Tue, 12 Dec 2000 11:45:21 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id LAA14167; Tue, 12 Dec 2000 11:45:14 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Dec 12 12:38:48 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from scummy.research.bell-labs.com by netlib2; Mon Dec 11 00:01:06 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Dec 11 00:01:02 EST 2000 Received: from wren.cs.unc.edu ([152.2.128.86]) by dusty; Mon Dec 11 00:01:02 EST 2000 Received: from geom.cs.unc.edu (geom.cs.unc.edu [152.2.129.41]) by wren.cs.unc.edu (8.9.3/8.9.3) with ESMTP id AAA14702 for ; Mon, 11 Dec 2000 00:00:58 -0500 (EST) Received: (from lin@localhost) by geom.cs.unc.edu (8.9.3+Sun/8.8.8) id AAA16519 for compgeom-announce@research.bell-labs.com; Mon, 11 Dec 2000 00:00:58 -0500 (EST) Date: Mon, 11 Dec 2000 00:00:58 -0500 (EST) From: Ming Lin Message-Id: <200012110500.AAA16519@geom.cs.unc.edu> To: compgeom-announce@research.bell-labs.com Subject: a new proximity query library, SWIFT Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1144 Lines: 34 We announce the release of a new proximity query package called SWIFT. SWIFT is a C++ library for collision detection, exact and approximate distance computation, and contact determination of three-dimensional polyhedral objects undergoing rigid motion. SWIFT combines multi-resolution representations with Voronoi based walking (first proposed by Lin and Canny). Some preliminary results indicate that it is faster than I-COLLIDE and V-CLIP, and more robust than I-COLLIDE. It has been successfully applied to virtual prototyping, dynamic simulation, path planning and other applications. It is free for non-commercial use. More information about the package, new proximity query algorithms, MPEG demonstrations and related publications can be found at: http://www.cs.unc.edu/~geom/SWIFT Collide Research Group Computer Science Department University of North Carolina ------------- 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 compgeom-owner@research.bell-labs.com Tue Dec 12 11:46:16 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id LAA02148 for ; Tue, 12 Dec 2000 11:46:16 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id LAA14407; Tue, 12 Dec 2000 11:45:31 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Dec 12 12:39:21 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Mon Dec 11 12:25:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Dec 11 12:25:02 EST 2000 Received: from duke.cs.duke.edu ([152.3.140.1]) by dusty; Mon Dec 11 12:25:00 EST 2000 Received: from cs.duke.edu (aquarius.cs.duke.edu [152.3.140.233]) by duke.cs.duke.edu (8.9.3/8.9.3) with ESMTP id MAA29696; Mon, 11 Dec 2000 12:24:59 -0500 (EST) Message-ID: <3A350C78.B2862437@cs.duke.edu> Date: Mon, 11 Dec 2000 12:18:48 -0500 From: Celeste hodges X-Mailer: Mozilla 4.7 [en] (Win98; I) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com, THEORY-A@LISTSERV.NODAK.EDU, obmao@yahoo.com, drhuang100@hotmail.com, boczko@cauchy.math.gatech.edu Subject: Position Announcement - Duke University Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2171 Lines: 52 VISITING ASSISTANT PROFESSOR POSITION AVAILABLE Center for Geometric and Biological Computing Department of Computer Science Duke University A postdoctoral position at the level of Visiting Assistant Professor is available in the Center for Geometric and Biological Computing, Department of Computer Science at Duke University, for the NSF-ITR Bio-Geometry project funded by the National Science Foundation, under the supervision of Profs. Pankaj Agarwal, Herbert Edelsbrunner, and Homme Hellinga. Duke is an equal opportunity employer. The position, which is contingent upon grant funding, is for one year and can be extended to one or more additional years by mutual consent. The project, a collaborative effort with UNC, Stanford, and NC A&T, aims to develop new computational techniques and paradigms for representing, storing, searching, simulating, analyzing, and visualizing biological structures. Applicants must have clearly demonstrated experience and skills in at least one and familiarity with some of the following areas: algorithms, computational geometry, computational topology, computational biology, molecular modeling, structural biology. Teaching responsibilities include one research course per year on a related topic. Apart from pursuing his or her own research interests, the candidate is expected to play a vital role in the center and to interact closely with the PIs on the project from the three other sites. Additional responsibilities include helping prepare contracts and reports. Please send your CV and a letter of research interests, and ask three evaluators to send letters of reference, by US Mail or email to Ms. Celeste Hodges Department of Computer Science Duke University Box 90129 Durham, NC 27708-0129 Email: hodges@cs.duke.edu Tel: (919) 660-6511 To be assured of full consideration, all material including reference letters must arrive by March 16, 2001. ------------- 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 compgeom-owner@research.bell-labs.com Tue Dec 12 11:51:41 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id LAA02162 for ; Tue, 12 Dec 2000 11:51:40 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id LAA14736; Tue, 12 Dec 2000 11:51:38 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Dec 12 12:46:13 EST 2000 Received: from grubby.research.bell-labs.com by netlib2; Sat Dec 9 04:03:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Sat Dec 9 04:02:25 EST 2000 Received: from ada.cs.ucy.ac.cy ([194.42.7.2]) by dusty; Sat Dec 9 04:02:24 EST 2000 Received: from ada.cs.ucy.ac.cy (ada.cs.ucy.ac.cy [194.42.7.2]) by ada.cs.ucy.ac.cy (8.8.8/8.8.8) with ESMTP id LAA23084; Sat, 9 Dec 2000 11:03:24 +0200 Date: Sat, 9 Dec 2000 11:03:24 +0200 (WET) From: George Angelos Papadopoulos Reply-To: george@cs.ucy.ac.cy To: "CS Dept -- Univ. of Cyprus" Subject: Advanced MSc course in Computer Science Message-ID: Organization: Department of Computer Science - University of Cyprus Address: 75 Kallipoleos Str. -- POB 20537 -- CY-1678 -- Nicosia -- Cyprus Tel: +357-2-892242 -- Fax: +357-2-339062 URL: http://www.cs.ucy.ac.cy/~george MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1841 Lines: 59 DEPARTMENT OF COMPUTER SCIENCE, UNIVERSITY OF CYPRUS ADVANCED M.Sc. PROGRAMME IN COMPUTER SCIENCE Dear Student of Computing We would like to inform you of a new Masters Program in Advanced Information Technologies at the University of Cyprus. This program focuses on recent developments in Computer Science, such as Internet Computing, Distributed and Mobile Computing and Intelligent Systems. The course aims to prepare graduates for the industry as well to give a solid foundation for further studies at a doctoral level. More information can be found at http://www.cs.ucy.ac.cy/Education/masters.html . Please note that the language of instruction is Greek. Anyone interested to attend can apply sending an application to: Department of Computer Science (c/o Postgraduate Admissions Coordinator) University of Cyprus 75 Kallipoleos Street P.O. Box 20537 CY-1678 Nicosia CYPRUS This should include: 1. Curriculum Vitae. 2. Copies of degree certificate or certificate of expected graduation in the Summer of 2001. 3. Transcript of degree. 4. Brief (up to 2 pages) statement of purpose and research interests. 5. Names and addresses of two University professors, whom the applicants should request to send letters of reference directly to the Postgraduate Admissions Tutor of the Department. The deadline for application is the 15th February 2001. For further information, you can contact us as follows: E-Mail: cs@cs.ucy.ac.cy Fax: +357-2-339062 Phone: +357-2-892230 Thank you for your interest. Department of Computer Science, University of Cyprus. -- ------------- 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 compgeom-owner@research.bell-labs.com Tue Dec 12 11:51:52 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id LAA02166 for ; Tue, 12 Dec 2000 11:51:52 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id LAA14726; Tue, 12 Dec 2000 11:51:30 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Dec 12 12:50:52 EST 2000 MIME-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Content-Transfer-Encoding: 8bit Received: from grubby.research.bell-labs.com by netlib2; Tue Dec 12 10:55:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Tue Dec 12 10:53:32 EST 2000 Received: from core.inf.ethz.ch ([129.132.178.196]) by dusty; Tue Dec 12 10:53:30 EST 2000 Received: from shadow.inf.ethz.ch (emo@shadow-medoc.inf.ethz.ch [129.132.11.67]) by core.inf.ethz.ch (8.9.3/8.9.3) with ESMTP id QAA27274; Tue, 12 Dec 2000 16:53:28 +0100 (MET) From: Emo Welzl Received: (from emo@localhost) by shadow.inf.ethz.ch (8.8.8/8.8.8) id QAA15103; Tue, 12 Dec 2000 16:53:27 +0100 (MET) Date: Tue, 12 Dec 2000 16:53:27 +0100 (MET) Message-Id: <200012121553.QAA15103@shadow.inf.ethz.ch> To: compgeom-announce@research.bell-labs.com Subject: Pre-Doc Program - Combinatorics, Geometry, and Computation - ETH Zurich Cc: emo@inf.ethz.ch X-Sun-Charset: US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 6065 Lines: 149 First Call for Applications Pre-Doc Program Combinatorics, Geometry, and Computation (CGC) October 2001 -- March 2002 www.cgc.ethz.ch (At ETH Zurich -- part of Berlin/Zurich CGC Graduate Program) ETH Zurich offers a one-semester study program that focuses on the preparation of a Ph.D. in areas like: Discrete and Computational Geometry; Computer Graphics and Vision; Algorithms Design, Analysis and Implementation; Optimization and Mathematical Programming. Building blocks of the program are four 5-week research oriented courses, a project and the preparation of a proposal for a Ph.D. (see schedule 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 Masters 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 CGC Graduate Program (although it is not automatically implied by acceptance to the PreDoc program). Students who plan to continue their Ph.D. at some other university, or are in the course of doing a Ph.D., are also welcome. Advanced Diploma or Masters 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, (diploma/masters) thesis, areas of interest, a letter of recommendation of the last advisor, should be sent to: Emo Welzl Institut Theoretische Informatik ETH Zentrum CH-8092 Zurich Switzerland Application deadlines are Jan 19, 2001, Mar 23, 2001, and May 30, 2001; last deadline dependent on availability. Applicants will be 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 for those who fulfill the necessary prerequisites only at a later stage. For further information consult the web page of the Berlin/Zurich CGC Graduate Program or email . -------------------------------------------------------------------------- SCHEDULE 2001/2002 (Courses, lecturers, and abstracts below) --------------------------------------- Oct 1 Reading assignments --------------------------------------- Oct 22 Courses -Nov 23 Mo&Tu RandAlgs Th&Fr TopCoGe --------------------------------------- Nov 29 Projects, reading assignments -Dec 19 and presentations --------------------------------------- Jan 7 Courses -Feb 8 Mo&Tu GraphVis Th&Fr ApproxAlgs --------------------------------------- Feb 14 Preparation of Ph.D. proposal -Mar 28 and presentations --------------------------------------- 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 (Emo Welzl) Randomized algorithms have by now emerged in many fields, and have lead to several improvements compared to deterministic methods. We will discuss several basic methods in several areas, including graph algorithms and geometry, optimization, discrepancy, 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. TopCoGe Topological methods in combinatorics and geometry (Jiri Matousek) One of the important tools for proving results in discrete mathematics are theorems from algebraic topology, most notably various fixed-point theorems. The course covers the basic topological notions and results (simplicial complexes, Borsuk-Ulam theorem and its generalizations etc.) and proofs of several combinatorial and geometric results. The topological notions and results are kept on very elementary level. In particular, knowledge of elementary algebraic topology, like introductory homology theory, is (encouraged but) not required. GraphVis Advanced Topics in Vision and Graphics (Luc van Gool, Markus Gross, Bernt Schiele, Gabor Szekely) Although being two separate disciplines we observe that Graphics and Vision are increasingly converging. Independently developed methods and algorithms are being combined and merged into sophisticated frameworks covering a wide range of applications. In this course we will present a selection of advanced topics in Vision and Graphics illustrating the tight relationship between the two disciplines. We will discuss recent research results and developments in both areas with a special emphasis on modeling and geometry. Topics include the notion of invariance, methods for 3D reconstruction, learning and statistical modeling, mesh signal processing, image based rendering, deformable templates and FEM. The course will be organized into separate modules each of which consists of lectures and practical or theoretical exercises. ApproxAlgs Approximation: Theory and Algorithms (Johannes Bloemer, Maurice Cochand, Thomas Erlebach, Bernd Gaertner, Angelika Steger, Peter Widmayer) 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, derandomization, and semidefinite programming; inapproximability and the PCP concept. ------------- 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 compgeom-owner@research.bell-labs.com Mon Dec 18 07:57:45 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id HAA24727 for ; Mon, 18 Dec 2000 07:57:45 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id HAA20499; Mon, 18 Dec 2000 07:57:38 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Dec 18 08:54:31 EST 2000 Received: from scummy.research.bell-labs.com by netlib2; Wed Dec 13 10:39:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Dec 13 10:38:27 EST 2000 Received: from mail.mpi-sb.mpg.de ([139.19.1.1]) by dusty; Wed Dec 13 10:38:25 EST 2000 Received: from mpii01802.ag1.mpi-sb.mpg.de (mpii01802.ag1.mpi-sb.mpg.de [139.19.11.33]) by mail.mpi-sb.mpg.de (8.9.3/8.9.3) with ESMTP id PAA00958; Wed, 13 Dec 2000 15:38:22 GMT Received: (from sanders@localhost) by mpii01802.ag1.mpi-sb.mpg.de (8.9.3/8.9.3) id QAA25121; Wed, 13 Dec 2000 16:36:12 +0100 (MET) From: Peter Sanders MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <14903.38763.981071.418413@gargle.gargle.HOWL> Date: Wed, 13 Dec 2000 16:36:11 +0100 (MET) To: compgeom-announce@research.bell-labs.com Subject: Positions at MPI for Computer Science - Algorithms Group X-Mailer: VM 6.72 under 21.1 (patch 8) "Bryce Canyon" XEmacs Lucid Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2539 Lines: 72 P O S I T I O N S (Research Associates, Postdocs and PhD-Students) at the M A X - P L A N C K - I N S T I T U T E for C O M P U T E R S C I E N C E The Max-Planck-Institute for Computer Science is located on the campus of the Universit"at des Saarlandes in Saarbr"ucken, Germany. The institute was founded in 1990 and consists, at present, of three research units: Algorithms and Complexity, Logic of Programming, and Computer Graphics. The research group ALGORITHMS AND COMPLEXITY offers - Research Associate Positions - a number of postdoctoral fellowships for the year 2001/2002 - PhD-Positions We are looking for applicants from all areas of algorithmics, e.g., data structures, complexity theory, graph algorithms, approximation algorithms, parallel, distributed, external, online, probabilistic or geometric algorithms. For national and European projects we are particularly looking for applicants interested in - Design and implementation of algorithm libraries - Algorithms and software for handling parallel disks - Integer programming and constraint programming - Internet routing and load balancing algorithms - Geometric algorithms for curves and surfaces The group consists mainly of young researchers of several nationalities. Our working language is English. The group collaborates with several of the major research institutions in Europe and USA and has a high international visibility. There is generous travel support available for all group members. Applications (including curriculum vitae, list of publications, research plan, names of references with their e-mail addresses, and intended period of stay) should be sent by January 31, 2001 to Kurt Mehlhorn Max-Planck-Institut f"ur Informatik Im Stadtwald D-66123 Saarbr"ucken Germany Electronic applications (email to mayer@mpi-sb.mpg.de) are possible but should consist of files easy to process on Unix systems (e.g., Postscript produced by dvips, pdf, ASCII, HTML). Please avoid MS Word documents or unprintable Postscript. For further information refer to http://www.mpi-sb.mpg.de/units/ag1/offers.html or contact Peter Sanders (sanders@mpi-sb.mpg.de). ------------- 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 compgeom-owner@research.bell-labs.com Fri Dec 22 14:39:18 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id OAA14706 for ; Fri, 22 Dec 2000 14:39:18 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id OAA05972; Fri, 22 Dec 2000 14:39:16 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Dec 22 15:34:08 EST 2000 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Tue Dec 19 07:39:05 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Dec 19 07:37:59 EST 2000 Received: from math.fu-berlin.de ([160.45.40.10]) by dusty; Tue Dec 19 07:37:57 EST 2000 Received: (qmail 16636 invoked from network); 19 Dec 2000 13:37:55 +0100 Received: from sahib.inf.fu-berlin.de (160.45.111.13) by leibniz.math.fu-berlin.de with QMQP; 19 Dec 2000 13:37:55 +0100 From: Carola Wenk MIME-Version: 1.0 Content-Type: text/plain; charset=iso-8859-1 Message-ID: <14911.22178.909543.805886@gargle.gargle.HOWL> Date: Tue, 19 Dec 2000 13:37:54 +0100 (MET) To: theorynt@vm1.nodak.edu, compgeom-announce@research.bell-labs.com, fg011@inf.fu-berlin.de, adm-all@inf.fu-berlin.de, ti@inf.fu-berlin.de Subject: Final Call For Papers CG01 X-Mailer: VM 6.75 under Emacs 20.3.1 Reply-To: Carola Wenk X-Url: http://www.inf.fu-berlin.de/~wenk Organization: Freie Universitaet Berlin Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by valis.cs.uiuc.edu id OAA14706 Status: RO Content-Length: 2814 Lines: 83 FINAL CALL FOR PAPERS Euro-CG 2001 17th European Workshop on Computational Geometry March 26 - 28, 2001 Institute of Computer Science Freie Universitaet Berlin, Germany The 17th European Workshop on Computational Geometry (CG '01) will take place at the Institute of Computer Science of Freie Universität Berlin, Germany. The European Workshop on Computational Geometry is an important scientific event in which established researchers from academia, R&D people from industry, research students, and postdocs meet and present their current work, establishing scientific interaction and international collaboration. The goal of the workshop is to bring together researchers in Computational Geometry, facilitating - in an informal atmosphere - the spreading of their most recent work. Invited speakers: Heinrich Mueller, Universitaet Dortmund Jack Snoeyink, University of North Carolina at Chapel Hill Emo Welzl, ETH Zuerich Submissions: A title and a brief abstract (2-4 pages) should be submitted before January 7th, 2001 (preferrably as a postscript-file to cg01@inf.fu-berlin.de). The abstracts will be collected and distributed among the participants at the workshop. There will be no other proceedings so that preliminary work can be presented which may later appear in a more complete form at a larger conference. A special issue of ``Computational Geometry: Theory and Applications'' will be dedicated to outstanding results presented at the workshop. In order to provide a consistent layout of the collection of abstracts we encourage authors to write the abstracts in LATEX using our LATEX frame file at http://www.inf.fu-berlin.de/~cg01/frame.tex. Please submit the resulting postscript file via e-mail to cg01@inf.fu-berlin.de . If e-mail is not available, please send 2 copies to EURO CG 2001 c/o Carola Wenk Freie Universität Berlin Institute of Computer Science Takustr. 9 14195 Berlin Germany Important dates: Deadline for submissions: January 7th, 2001 Notification of acceptance: January 19th, 2001 Deadline for hotel registration: January 26th, 2001 Deadline for registration: February 25th, 2001 For more information see our webpage http://www.inf.fu-berlin.de/~cg01 or contact cg01@inf.fu-berlin.de . ------------- 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 compgeom-owner@research.bell-labs.com Fri Dec 22 14:39:26 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id OAA14710 for ; Fri, 22 Dec 2000 14:39:26 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id OAA05994; Fri, 22 Dec 2000 14:39:24 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Dec 22 15:34:18 EST 2000 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Mon Dec 18 20:59:03 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Dec 18 20:58:20 EST 2000 Received: from emgw1.cpsc.ucalgary.ca ([136.159.2.40]) by dusty; Mon Dec 18 20:58:18 EST 2000 Received: from imgw1.cpsc.ucalgary.ca (ons-imgw1 [192.168.1.66]) by emgw1.cpsc.ucalgary.ca (8.11.1/8.11.1) with ESMTP id eBJ1sOx26320; Mon, 18 Dec 2000 17:56:16 -0800 (PST) Received: from cpsc.ucalgary.ca (marina [136.159.6.17]) by imgw1.cpsc.ucalgary.ca (8.11.1/8.11.1) with ESMTP id eBJ1u3r31720; Mon, 18 Dec 2000 18:56:03 -0700 Message-ID: <3A3EC321.7ADCF6B5@cpsc.ucalgary.ca> Date: Mon, 18 Dec 2000 19:08:33 -0700 From: Marina Gavrilova Organization: Dept. of Computer Science, University of Calgary X-Mailer: Mozilla 4.75 [en] (WinNT; U) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com, compgeom-tribune@research.bell-labs.com Subject: CG Workshop, ICCS'2001 Content-Type: text/plain; charset=koi8-r Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 5094 Lines: 182 Dear Colleagues, Please allow me to bring to your attention the following initiative. Thank you very much for your time, Best regards, Marina Gavrilova --------------------------------------------------------------- --------------------------------------------------------------- CALL FOR PAPERS for INTERNATIONAL WORKSHOP on COMPUTATIONAL GEOMETRY AND APPLICATIONS in conjunction with THE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE 2001 San Francisco, California, USA May 28 - 30, 2001 http://www.ucalgary.ca/iccs Workshop Description -------------------------------- Papers presenting the results of original research in all areas of computational geometry and related areas, are invited for submission. The workshop web site is accessible by following a link from the ICCS web site http://www.ucalgary.ca/iccs or directly at http://www.cpsc.ucalgary.ca/~marina/Newweb/session.htm. Topics of interest include, but are not limited to: COMPUTATIONAL GEOMETRY ----------------------------------------------- Point Location Range Searching Visibility Graphs Space Partitioning Voronoi Diagrams and Delaunay triangulations Convex Hulls Arrangements of Hyperplanes Nearest-Neighbor Search Proximity Problems Parallel Computational Geometry GIS (Geographical Information Systems) --------------------------------------------------------- Mesh Generation Surface Simplification Interpolation and Surface Reconstruction Data Models and Representation Relational Databases Spacial and Terrain Analysis COMPUTER GRAPHICS AND VISION ------------------------------------------------------- Image Synthesis Image Representation and Rendering Model-Based Recognition Image Segmentation AREAS RELATED TO CG -------------------------------------- Exact Computation Robotics Solid Modeling CAD/CAM Molecular biology Astrophysics Physics Mechanics Other related areas The design and implementation of algorithms in parallel and distributed environments, and applications of such methods to mechanics and physics, are of special interest. Paper Submission ------------------------- We invite you to submit a: full paper of 6 to 10 pages (Letter or A4 paper) for oral presentation short paper of 2 to 4 pages (Letter or A4 paper) for poster presentation. Please include a cover page which lists the following: - name, affiliation, address and e-mail address of each author - name of the presenting author - name of the contact author - a maximum of 5 keywords - 3 nominated referees and contact information of all nominated referees The submitted paper must be camera-ready and formatted according to the rules of LNCS. See http://www.springer.de/comp/lncs/authors.html for formatting information. Please follow the guidelines posted at http://www.ucalgary.ca/iccs to format your submission. Electronic submissions in PS, PDF, LaTex or MS Word format are accepted. Hard copies should be mailed only if electronic submission is not possible. Submission implies the willingness of at least one of the authors to register and present the paper. Proceedings ------------------ The proceedings of the Conference will be published in the Springer-Verlag Lecture Notes in Computer Science (LNCS) series. Important Dates ---------------------- January 19, 2001: Draft papers due March 1, 2001: Notification of Acceptance March 29, 2001: Camera Ready Papers and Pre-registration due May 28 - 30, 2001: ICCS 2001 Conference Contact Information ----------------------------- All submissions to Computational Geometry and Applications Workshop can be forwarded to: Dr. Marina L. Gavrilova, Program Committee Member, Special Events Committee Member, ICCS'2001 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 Papers can be also submitted to: ICCS 2001 Department of Computer Science University of Reading Reading RG6 6AY United Kingdom Telephone: 44-118-931-6722 Fax: 44-118-975-1994 E-mail: iccs2001@csres.cs.rdg.ac.uk Electonic submissions are encouraged. ------------- 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 compgeom-owner@research.bell-labs.com Wed Dec 27 07:56:04 2000 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id HAA11336 for ; Wed, 27 Dec 2000 07:56:04 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id HAA16928; Wed, 27 Dec 2000 07:55:47 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Dec 27 08:49:48 EST 2000 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Fri Dec 22 16:11:04 EST 2000 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Fri Dec 22 16:09:18 EST 2000 Received: from cs.utexas.edu ([128.83.139.9]) by dusty; Fri Dec 22 16:09:17 EST 2000 Received: from corn.cs.utexas.edu (amenta@corn.cs.utexas.edu [128.83.144.109]) by cs.utexas.edu (8.9.3/8.9.3) with ESMTP id PAA13978 for ; Fri, 22 Dec 2000 15:09:16 -0600 (CST) Received: (from amenta@localhost) by corn.cs.utexas.edu (8.9.3/8.9.3) id PAA15910 for compgeom-announce@research.bell-labs.com; Fri, 22 Dec 2000 15:09:16 -0600 Message-Id: <200012222109.PAA15910@corn.cs.utexas.edu> From: "Nina Amenta" Date: Fri, 22 Dec 2000 15:09:16 -0600 X-Mailer: Mail User's Shell (7.2.6 beta(3) 11/17/96) To: compgeom-announce@research.bell-labs.com Subject: surface reconstruction software Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 777 Lines: 20 Source code and research papers about our recent Power Crust algorithm for three-dimensional surface reconstruction are now available. This algorithm always outputs the boundary of a three-dimensional solid, so it tends to be pretty robust in practice (as well at correct in a theoretical sense). It also outputs an estimate of the medial axis of the object, which can be simplified to include only features which are stable with respect to noise. Please enjoy! http://www.cs.utexas.edu/users/amenta/powercrust/ ------------- 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 compgeom-owner@research.bell-labs.com Sat Jan 6 16:01:30 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id QAA05484 for ; Sat, 6 Jan 2001 16:01:30 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id QAA06939; Sat, 6 Jan 2001 16:01:17 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Jan 6 17:00:44 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Wed Jan 3 21:13:06 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Jan 3 21:12:09 EST 2001 Received: from mm02snlnto.sandia.gov ([132.175.109.21]) by dusty; Wed Jan 3 21:12:08 EST 2001 Received: from 132.175.109.1 by mm02snlnto.sandia.gov with ESMTP ( WorldSecure Server SMTP Relay(WSS) v4.5); Wed, 03 Jan 2001 19:07:33 -0700 X-Server-Uuid: 7edb479a-fd89-11d2-9a77-0090273cd58c Received: from es01snlnt.sandia.gov (es01snlnt.sandia.gov [134.253.130.4]) by sass165.sandia.gov (8.10.2/8.10.2) with ESMTP id f0427XO01555 for ; Wed, 3 Jan 2001 19:07:33 -0700 (MST) Received: by es01snlnt.sandia.gov with Internet Mail Service ( 5.5.2653.19) id ; Wed, 3 Jan 2001 19:07:33 -0700 Message-ID: <77349FC5DC1CD211BAD900805FA7241A0C1E8138@es01snlnt.sandia.gov> From: "Owen, Steven James" To: "'compgeom-announce@research.bell-labs.com'" Subject: 3rd Symposium on Trends in Unstructured Mesh Generation Date: Wed, 3 Jan 2001 19:07:32 -0700 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) X-WSS-ID: 164D056F95669-01-01 Content-Type: text/plain; charset=iso-8859-1 Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2290 Lines: 57 Call for Abstracts ==================================================================== Sixth US National Congress on Computational Mechanics 3rd Symposium on Unstructured Mesh Generation Hyatt Regency Dearborn, Dearborn Michigan August 1-4, 2001 ==================================================================== Abstracts are invited dealing with all aspects of unstructured mesh generation, including, but not limited to the following: * 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 Abstracts are required for the conference and will be included in the conference proceedings. Abstracts should be plain text and should be less than 500 words. Submit a one page electronic version of your abstract by January 31, 2001 to Professor Mark S. Shephard, shephard@scorec.rpi.edu. Authors will be notified of acceptance by March 15, 2001. For inclusion in this symposium, full-length papers (in addition to the abstract) are requested, but not required. While the conference proceedings will only contain abstracts, a collection of the final papers are planned to be combined into a special edition of the journal, Engineering With Computers All papers must be submitted by July 15, 2001. For further information on the symposium and conference, visit the Symposium Web Page at http://www.andrew.cmu.edu/user/sowen/usnccm01 For questions, please contact one of the symposium organizers: Mark Shephard (shephard@scorec.rpi.com) Steven Owen (sjowen@sandia.gov) Sunil Saigal (saigal@cmu.edu) Kenji Shimada (shimada@cmu.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 compgeom-owner@research.bell-labs.com Sat Jan 6 16:10:47 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id QAA05492 for ; Sat, 6 Jan 2001 16:10:46 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id QAA15080; Sat, 6 Jan 2001 16:10:45 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Jan 6 17:08:17 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Thu Jan 4 07:51:07 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Jan 4 07:49:55 EST 2001 Received: from core.inf.ethz.ch ([129.132.178.196]) by dusty; Thu Jan 4 07:49:54 EST 2001 Received: from shadow.inf.ethz.ch (emo@shadow-byebye.inf.ethz.ch [129.132.11.131]) by core.inf.ethz.ch (8.9.3/8.9.3) with ESMTP id NAA07698; Thu, 4 Jan 2001 13:49:51 +0100 (MET) From: Emo Welzl Received: (from emo@localhost) by shadow.inf.ethz.ch (8.8.8/8.8.8) id NAA04042; Thu, 4 Jan 2001 13:49:50 +0100 (MET) Date: Thu, 4 Jan 2001 13:49:50 +0100 (MET) Message-Id: <200101041249.NAA04042@shadow.inf.ethz.ch> To: compgeom-announce@research.bell-labs.com Subject: Ph.D. and Post-Doc Scholarships, CGC Berlin-Zurich Cc: emo@inf.ethz.ch X-Sun-Charset: US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1826 Lines: 48 Ph.D. and Post-Doc Scholarships Call for Applications The Berlin-Zurich CGC Graduate Program Combinatorics, Geometry, and Computation http://www.cgc.ethz.ch offers scholarships for Ph.D. students and Post-Docs for 2 1/2 years and 2 years, resp., starting in 2001. The program is a joint initiative of ETH Zurich, the three universities of Berlin - Free University, Technical University, Humboldt-University - and the Konrad-Zuse-Research Center. Scholarships are up to DM 2870 (tax-free) per month in Berlin, and roughly CHF 36000 (pre-tax) per year in Zurich. The scientific program ranges from theoretical foundations to applications. The areas of research are combinatorics, geometry, optimization, algorithms and computation, computer graphics, and vision. Supervisors in Berlin are Aigner, Alt, Rote, Schulz (FU), Moehring, Ziegler (TU), Proemel (HU) and Groetschel (ZIB), and at ETH Zurich Erlebach, Fukuda, Van Gool, M. Gross, Luethi, Nievergelt, Richter-Gebert, Schiele, Welzl and Widmayer. Applications with curriculum vitae, copies of certificates, thesis, a letter of recommendation of the last advisor, and a brief description of the proposed research should be sent in until January 26, 2001 (Post-Doc applications to Zurich, only): Prof. Helmut Alt Prof. Emo Welzl Institut Informatik Institut Theoretische Informatik Freie Univ. Berlin ETH Zentrum Takustr. 9 CH-8092 Zurich D-14195 Berlin Switzerland Germany Contact: bfelsner@inf.fu-berlin.de cgc.graduate@inf.ethz.ch www.inf.fu-berlin.de/gk-cgc www.cgc.ethz.ch ------------- 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 compgeom-owner@research.bell-labs.com Sat Jan 6 16:10:48 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id QAA05496 for ; Sat, 6 Jan 2001 16:10:48 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id QAA15088; Sat, 6 Jan 2001 16:10:46 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Jan 6 17:04:18 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Wed Jan 3 15:45:07 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Jan 3 15:43:53 EST 2001 Received: from magnolia.math.uwaterloo.ca ([129.97.74.123]) by dusty; Wed Jan 3 15:43:52 EST 2001 Received: from localhost (biedl@localhost) by magnolia.math.uwaterloo.ca (8.9.3/8.9.3) with ESMTP id PAA26634 for ; Wed, 3 Jan 2001 15:43:27 -0500 (EST) X-Authentication-Warning: magnolia.math: biedl owned process doing -bs Date: Wed, 3 Jan 2001 15:43:27 -0500 (EST) From: Therese Biedl To: compgeom-announce@research.bell-labs.com Subject: CCCG '01: First Call for Papers Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2510 Lines: 82 -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- First Call for Papers 13th Canadian Conference on Computational Geometry August 13-15, 2001 University of Waterloo http://compgeo.math.uwaterloo.ca/~cccg01 -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- 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. A special issue of Computational Geometry: Theory and Applications will be devoted to invited papers from the conference. Program Committee Therese Biedl (Univ. of Waterloo) Timothy Chan (Univ. of Waterloo) Erik Demaine (Univ. of Waterloo) David Kirkpatrick (UBC) Anna Lubiw (Univ. of Waterloo) Joseph O'Rourke (Smith College) Godfried Toussaint (McGill University) Organizing Committee Therese Biedl (Univ. of Waterloo) Erik Demaine (Univ. of Waterloo) Martin Demaine (Univ. of Waterloo) Anna Lubiw (Univ. of Waterloo) Important dates Submission of papers: April 16, 2001 Notification of acceptance: May 15, 2001 Submission of final paper: June 15, 2001 Conference: August 13-15, 2001 Contact Information Therese Biedl Dept. of Computer Science University of Waterloo Waterloo, ON N2L 3G1 Phone: (519) 888-4567x4721 Fax: (519) 885-1208 Email: biedl@uwaterloo.ca Sponsors CCCG '01 is supported by CRM, The Fields Institute, PIMS and the University of Waterloo. ------------- 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 compgeom-owner@research.bell-labs.com Tue Jan 9 10:03:03 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id KAA22886 for ; Tue, 9 Jan 2001 10:03:03 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id KAA08947; Tue, 9 Jan 2001 10:03:00 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Jan 9 10:56:12 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Mon Jan 8 19:29:05 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Jan 8 19:27:57 EST 2001 Received: from cs.sfu.ca ([142.58.111.1]) by dusty; Mon Jan 8 19:27:55 EST 2001 Received: from naos.cs.sfu.ca (mitchell@naos [199.60.1.24]) by cs.sfu.ca (8.9.1/8.9.1) with ESMTP id QAA04277 for ; Mon, 8 Jan 2001 16:27:44 -0800 (PST) From: David G Mitchell Received: (from mitchell@localhost) by naos.cs.sfu.ca (8.9.1/8.9.1) id QAA13907 for compgeom-announce@research.bell-labs.com; Mon, 8 Jan 2001 16:27:38 -0800 (PST) Date: Mon, 8 Jan 2001 16:27:38 -0800 (PST) Message-Id: <200101090027.QAA13907@naos.cs.sfu.ca> To: compgeom-announce@research.bell-labs.com Subject: Posd-docs at Simon Fraser & PIMS Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3236 Lines: 65 Post-Doctoral Fellowships, Simon Fraser University Applications are solicited for several postdoctoral positions in the School of Computing Science, Simon Fraser University. These positions are being offered in conjunction with the Pacific Institute for the Mathematical Sciences (PIMS) and the MITACS Networks of Centres of Excellence. PIMS postdoc applicants are solicited in the areas of computational logic, graph theory, combinatorics and computational geometry. Successful candidates will be expected to participate in appropriate research activities of both the School and PIMS. The annual stipend is $50,000 (inclusive of benefits). MITACS postdocs/research associates are solicited in the areas of discrete optimization, computational geometry, graph theory, operations research, algorithms, and industrial mathematics. Successful candidates will be expected to work on a combination of theoretical and industrial research relevant to ongoing MITACS projects within the school. The school currently boasts two such projects in the areas of scheduling (Project Leaders: Pavol Hell and Lou Hafer) and facility location problems (Project Leader: Binay Bhattacharya). The annual stipend for MITACS postdocs is $50,000 (inclusive of benefits). Successful candidates for all postdoc positions must hold a PhD in the relevant area at the time they take up the position and have a strong research record. Positions are for one year with a strong possibility for renewal for a second year subject to funding. The School of Computing Science has 33 faculty members, and offers an expanding graduate program with over 130 M.Sc. and Ph.D. students. The School has state-of-the art computer equipment with excellent network support. There are well-equipped research laboratories in areas including algorithms, artificial intelligence, graphics and multimedia, and database systems. As well the School has strong links with the university's Centre for Systems Science, the B.C. Advanced Systems Institute, the Pacific Institute for the Mathematical Sciences and is the head office for MITACS. Further information can be obtained at the department web page: www.cs.sfu.ca. Simon Fraser University is situated on top of Burnaby Mountain just east of Vancouver and commands magnificent views of Burrard Inlet, the North Shore Mountains, the Fraser River, and Vancouver Harbour. The Lower Mainland area of British Columbia is unique in Canada for its mild climate and varied recreational opportunities. Please forward an application package consisting of a resume and 2 letters of reference to: Arvind Gupta MITACS Program Leader East Academic Annex, Room 120 Simon Fraser University 8888 University Avenue Burnaby, BC, V5A 1S6 Applicants can also send this information electronically via text or unix readable postscript files to: postdoc-applications@pims.math.ca Note: Application packages must be received by January 29, 2001 to be considered. ------------- 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 compgeom-owner@research.bell-labs.com Wed Jan 10 17:39:51 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA25423 for ; Wed, 10 Jan 2001 17:39:51 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA17417; Wed, 10 Jan 2001 17:39:49 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Jan 10 18:32:20 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Wed Jan 10 09:05:06 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Jan 10 09:04:16 EST 2001 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.37]) by dusty; Wed Jan 10 09:04:15 EST 2001 Received: by nrclonex1.imti.nrc.ca with Internet Mail Service (5.5.2650.21) id ; Wed, 10 Jan 2001 09:04:17 -0500 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFFA2A@nrclonex1.imti.nrc.ca> From: "Dickinson, John" To: compgeom-discuss@research.bell-labs.com Subject: triangle triangle intesection line segment Date: Wed, 10 Jan 2001 09:04:15 -0500 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2650.21) Content-Type: text/plain; charset="iso-8859-1" Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 888 Lines: 25 Given two triangles in 3D space known to intersect (or at least touch), I need to find the line segment (or the point) that they touch at in space. Anyone have an algorithm or reference for that? If not, how about for a triangle and a plane, the same deal, I know they touch and want to determine the line segment that represents where they touch in 3-D space. John -- -((Insert standard disclaimer here))-|--- Ray's Rule for Precision ---- John Kenneth Dickinson, Ph.D. | "Measure with micrometer; Research Council Officer IMTI-NRC | Mark with chalk; email: john.dickinson@nrc.ca | Cut with axe." ------------- 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 compgeom-owner@research.bell-labs.com Wed Jan 10 17:40:25 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA25431 for ; Wed, 10 Jan 2001 17:40:25 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA17519; Wed, 10 Jan 2001 17:40:24 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Jan 10 18:34:19 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Wed Jan 10 13:13:06 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Jan 10 13:12:11 EST 2001 Received: from photon.poly.edu ([128.238.32.22]) by dusty; Wed Jan 10 13:12:09 EST 2001 Received: from localhost (yjc@localhost) by photon.poly.edu (8.9.0/8.9.0) with ESMTP id NAA09559; Wed, 10 Jan 2001 13:11:31 -0500 (EST) Date: Wed, 10 Jan 2001 13:11:31 -0500 (EST) From: Yi-Jen Chiang Reply-To: yjc@poly.edu To: DMANET@zpr.uni-koeln.de, THEORYNT@listserv.nodak.edu, compgeom-announce@research.bell-labs.com, GRAPHNET@listserv.nodak.edu, opt-net@ZIB.DE, dm@INFORMATIK.HU-BERLIN.DE, DMA-LIST@nic.surfnet.nl cc: Yi-Jen Chiang Subject: WADS 2001 Call for Papers Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2442 Lines: 67 CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions are posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: submission of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) M. Yannakakis (Bell Laboratories) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) Program Committee: Co-Chairs: F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown) PC-Members: A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer ------------- 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 dmanet-admin@zpr.uni-koeln.de Thu Jan 11 03:08:31 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id DAA26057 for ; Thu, 11 Jan 2001 03:08:31 -0600 Received: from Octopussy.MI.Uni-Koeln.DE (Octopussy.MI.Uni-Koeln.DE [134.95.166.20]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id DAA17347 for ; Thu, 11 Jan 2001 03:08:21 -0600 (CST) Received: from Octopussy.MI.Uni-Koeln.DE (localhost [127.0.0.1]) by Octopussy.MI.Uni-Koeln.DE (8.9.1/8.9.1) with ESMTP id JAA19295; Thu, 11 Jan 2001 09:36:02 +0100 (MET) Received: from photon.poly.edu (yjc@photon.poly.edu [128.238.32.22]) by Octopussy.MI.Uni-Koeln.DE (8.9.1/8.9.1) with ESMTP id TAA07279 for ; Wed, 10 Jan 2001 19:11:54 +0100 (MET) Received: from localhost (yjc@localhost) by photon.poly.edu (8.9.0/8.9.0) with ESMTP id NAA09559; Wed, 10 Jan 2001 13:11:31 -0500 (EST) From: Yi-Jen Chiang Reply-To: yjc@poly.edu To: DMANET@zpr.uni-koeln.de, THEORYNT@listserv.nodak.edu, compgeom-announce@research.bell-labs.com, GRAPHNET@listserv.nodak.edu, opt-net@ZIB.DE, dm@INFORMATIK.HU-BERLIN.DE, DMA-LIST@nic.surfnet.nl cc: Yi-Jen Chiang Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Subject: [DMANET] WADS 2001 Call for Papers Sender: dmanet-admin@zpr.uni-koeln.de Errors-To: dmanet-admin@zpr.uni-koeln.de X-BeenThere: dmanet@zpr.uni-koeln.de X-Mailman-Version: 2.0 Precedence: bulk List-Help: List-Post: List-Subscribe: , List-Id: discrete mathematics and algorithms List-Unsubscribe: , List-Archive: Date: Wed, 10 Jan 2001 13:11:31 -0500 (EST) Status: RO Content-Length: 2784 Lines: 76 CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions are posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: submission of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) M. Yannakakis (Bell Laboratories) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) Program Committee: Co-Chairs: F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown) PC-Members: A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer ********************************************************** * * 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 compgeom-owner@research.bell-labs.com Thu Jan 11 12:26:55 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id MAA26890 for ; Thu, 11 Jan 2001 12:26:54 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id MAA07060; Thu, 11 Jan 2001 12:26:52 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Jan 11 13:20:35 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Thu Jan 11 09:29:05 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Jan 11 09:27:55 EST 2001 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.37]) by dusty; Thu Jan 11 09:27:54 EST 2001 Received: by nrclonex1.imti.nrc.ca with Internet Mail Service (5.5.2650.21) id ; Thu, 11 Jan 2001 09:27:29 -0500 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFFA33@nrclonex1.imti.nrc.ca> From: "Dickinson, John" To: compgeom-discuss@research.bell-labs.com Subject: Triangle intersection Date: Thu, 11 Jan 2001 09:27:27 -0500 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2650.21) Content-Type: text/plain; charset="iso-8859-1" Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by valis.cs.uiuc.edu id MAA26890 Status: RO Content-Length: 1789 Lines: 57 I have recieved a couple of answers directly and I thought other might want some of the references I got. Note that the trick is to do this efficiently, something I forgot to say as I have to do it for many such pairs of triangles. John -- -((Insert standard disclaimer here))-|--- Ray's Rule for Precision ---- John Kenneth Dickinson, Ph.D. | "Measure with micrometer; Research Council Officer IMTI-NRC | Mark with chalk; email: john.dickinson@nrc.ca | Cut with axe." Please have a look at M. Held (1997): ``ERIT: A Collection of Efficient and Reliable Intersection Tests''. Journal of Graphics Tools 2(4):25-44, 1997. Good luck with your project. Regards, --martin held if they are known to intersect, just walk around triangle A until it pierces the plane of B inside B, call that point pA. same for B wrt A, call that pB; then the segment you want is just pApB. seth. Tomas Möller. A fast triangle-triangle intersection test. Journal of Graphics Tools, 2(2):25-30, 1997 A Fast Triangle-Triangle Intersection Test Tomas Möller Prosolvia Clarus AB Sweden tompa@clarus.se Abstract: This paper presents a method, along with some optimizations, for computing whether or not two triangles intersect. The code, which is shown to be fast, can be used, for example, in collision detection algorithms. ------------- 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 compgeom-owner@research.bell-labs.com Wed Jan 24 08:20:56 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id IAA02770 for ; Wed, 24 Jan 2001 08:20:56 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA25441; Wed, 24 Jan 2001 08:20:50 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Jan 24 09:16:14 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Mon Jan 22 15:49:05 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Jan 22 15:48:20 EST 2001 Received: from cis.poly.edu ([128.238.32.126]) by dusty; Mon Jan 22 15:48:18 EST 2001 Received: from ziggy.poly.edu (ziggy.poly.edu [128.238.32.79]) by cis.poly.edu (8.9.0/8.9.0) with ESMTP id PAA10064; Mon, 22 Jan 2001 15:48:03 -0500 (EST) Received: (from aronov@localhost) by ziggy.poly.edu (8.9.1b+Sun/8.9.1) id PAA06902; Mon, 22 Jan 2001 15:47:58 -0500 (EST) Date: Mon, 22 Jan 2001 15:47:58 -0500 (EST) From: Boris Aronov Message-Id: <200101222047.PAA06902@ziggy.poly.edu> To: THEORYNT@listserv.nodak.edu, compgeom-announce@research.bell-labs.com CC: aronov@ziggy.poly.edu Subject: The Goodman--Pollack two-thirds-of-a-century fest Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1501 Lines: 53 New York University Courant Institute of Mathematical Sciences THE GOODMAN--POLLACK TWO-THIRDS-OF-A-CENTURY FEST A special Computational Geometry Day celebrating the 2/3 x 100 birthdays of Eli Goodman and Ricky Pollack Friday, February 16, 2001 Room 109, Warren Weaver Hall 251 Mercer St., New York, NY 10012 9:45--10:15 Coffee (Warren Weaver Hall Lobby) 10:15--10:30 Opening Addresses 10:30--11:15 Marie-Francoise Roy, University of Rennes Three Problems in Real Algebraic Geometry and Their Descendants 11:30--12:15 Rephael Wenger, Ohio State University Geometric Transversal Theory in the New Millennium 12:30--2:00 Lunch 2:00--2:45 Laszlo Lovasz, Microsoft, Inc. Steinitz Representations 3:00--3:45 Pankaj K. Agarwal, Duke University Arrangements: Combinatorial and Algorithmic Applications 4:00--5:00 Wine and Cheese Reception (13th floor lounge) For more information contact: Janos Pach (212) 998-3184 pach@cims.nyu.edu Micha Sharir sharir@math.tau.ac.il ------------- 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 compgeom-owner@research.bell-labs.com Sat Jan 27 17:43:30 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA17547 for ; Sat, 27 Jan 2001 17:43:30 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA03614; Sat, 27 Jan 2001 17:43:28 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Jan 27 18:42:55 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Wed Jan 24 12:23:05 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Jan 24 12:21:37 EST 2001 Received: from cis.ohio-state.edu ([164.107.115.5]) by dusty; Wed Jan 24 12:21:31 EST 2001 Received: from beta.cis.ohio-state.edu (tamaldey@beta.cis.ohio-state.edu [164.107.112.14]) by cis.ohio-state.edu (8.9.1/8.9.1) with SMTP id MAA22893 for ; Wed, 24 Jan 2001 12:21:29 -0500 (EST) Message-Id: <200101241721.MAA22893@cis.ohio-state.edu> Date: Wed, 24 Jan 2001 12:21:29 -0500 (EST) From: tamal dey Reply-To: tamal dey Subject: Special Issue on Triangulation To: compgeom-announce@research.bell-labs.com MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: FFSiaV1yIDdKnrf36XBp6w== X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4u sparc Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2566 Lines: 71 CALL FOR PAPERS Special Issue of INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE on Volume and Surface Triangulations Triangulation has been used as an important data structure and methodology for many problems in different applications such as finite element methods, computer graphics, geometric modeling, and geographical information systems. The classical Delaunay triangulation and its dual, the Voronoi diagram, has been extensively studied and many beautiful theorems are known. Recently, research in surface reconstruction, simplification, and mesh generation have spurred new combinatorial and algorithmic advances for triangulations. We can expect that the trend will continue, novel methodologies for triangulations will be developed, and further applications will be discovered. Accordingly, we are planning a special issue of IJFCS on new results on volume and surface triangulations in topics of interest that include, but are not limited to: [o] Data structures and algorithms for triangulations [o] Geometric modeling [o] Mesh generation [o] Surface reconstruction and simplification [o] Applications of triangulations A timely publication with a fast refereeing process is planned. Submit five copies of your manuscript by February 15, 2001, to one of the guest editors: Tamal K. Dey Department of Computer and Information Science The Ohio State University 2015 Neil Av., Columbus, OH 43210-1277 U.S.A Email: tamaldey@cis.ohio-state.edu Siu-Wing Cheng Department of Computer Science Hong Kong University of Science Technology Clear Water Bay Hong Kong Email: scheng@cs.ust.hk Instructions for submitting papers: Papers should not exceed 30 pages including figures, tables, etc. Papers should not have been previously published, nor currently submitted elsewhere for publication. Papers should include a title page containing title, authors' names and affiliations, as well as the contact author's name, email and postal addresses, and phone and fax numbers. All submissions should include an abstract of no more than 500 words. All submitted papers will be refereed under the usual criteria of IJFCS. ------------- 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 compgeom-owner@research.bell-labs.com Sat Jan 27 17:51:32 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA17559 for ; Sat, 27 Jan 2001 17:51:31 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA04717; Sat, 27 Jan 2001 17:51:24 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat Jan 27 18:47:32 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Fri Jan 26 17:37:06 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Jan 26 17:35:07 EST 2001 Received: from photon.poly.edu ([128.238.32.22]) by dusty; Fri Jan 26 17:35:06 EST 2001 Received: from localhost (yjc@localhost) by photon.poly.edu (8.9.0/8.9.0) with ESMTP id RAA13655; Fri, 26 Jan 2001 17:34:42 -0500 (EST) Date: Fri, 26 Jan 2001 17:34:42 -0500 (EST) From: Yi-Jen Chiang Reply-To: yjc@poly.edu To: DMANET@zpr.uni-koeln.de, THEORYNT@listserv.nodak.edu, compgeom-announce@research.bell-labs.com, GRAPHNET@listserv.nodak.edu, opt-net@ZIB.DE, dm@INFORMATIK.HU-BERLIN.DE, DMA-LIST@nic.surfnet.nl cc: Yi-Jen Chiang Subject: Reminder: WADS 2001 Call for Papers Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2545 Lines: 72 This is a reminder that the paper submission deadline for WADS 2001 is February 19. --------------- CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions are posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: submission of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) M. Yannakakis (Bell Laboratories) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) Program Committee: Co-Chairs: F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown) PC-Members: A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer ------------- 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 compgeom-owner@research.bell-labs.com Mon Jan 29 13:57:17 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id NAA05608 for ; Mon, 29 Jan 2001 13:57:17 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id NAA04283; Mon, 29 Jan 2001 13:57:17 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Jan 29 14:49:02 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Mon Jan 29 11:33:06 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Jan 29 11:31:33 EST 2001 To: compgeom-announce@research.bell-labs.com Received: from ada.cs.ucy.ac.cy ([194.42.7.2]) by dusty; Mon Jan 29 11:31:31 EST 2001 Received: from ada.cs.ucy.ac.cy (ada.cs.ucy.ac.cy [194.42.7.2]) by ada.cs.ucy.ac.cy (8.8.8/8.8.8) with ESMTP id SAA16138; Mon, 29 Jan 2001 18:26:41 +0200 Date: Mon, 29 Jan 2001 18:26:40 +0200 (WET) From: George Angelos Papadopoulos Reply-To: george@cs.ucy.ac.cy Subject: ACM SAC'02 -- Call for Track Proposals Message-ID: Organization: Department of Computer Science - University of Cyprus Address: 75 Kallipoleos Str. -- POB 20537 -- CY-1678 -- Nicosia -- Cyprus Tel: +357-2-892242 -- Fax: +357-2-339062 URL: http://www.cs.ucy.ac.cy/~george MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 4159 Lines: 88 2002 ACM SYMPOSIUM ON APPLIED COMPUTING (SAC'02) Madrid, Spain, 10-13 March 2002 *** Call for Track Proposals *** For the past sixteen years the Symposium on Applied Computing has been a primary forum for applied computer scientists, computer engineers and application developers to gather, interact and present their work. SAC is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP); its proceedings are published by ACM in both printed form and CD-ROM; they are also available on the web through ACM's Digital Library. More information on SAC can be found at http://www.acm.org/conferences/sac . SAC is based on a flexible structure of mostly self-contained and self-managed tracks. Over the past years it has hosted tracks on a variety of topics such as Artificial Intelligence, Distributed Systems, Internet Technologies, Software Engineering, etc. For SAC'02, to be held in Spain in March of 2002, the SAC organizers solicit proposals for hosting tracks. Perspective track chairs should submit a less than one page description for organizing a track, which should include at least the following items: 1) The proposed title for the track with a description of its aims, topics it will cover and rationale for having such a track in SAC. This rationale should refer to any related conference events that are held regularly and why the proposed track differs from them or complements them. The proposed track should not be over general but also not overly specialized, thus being able to attract a wide audience of people sharing similar interests. Proposals from industry are also welcomed. Despite its name, SAC also welcomes papers of mostly theoretical nature, provided there is clear practical potential in applying the results of such work. 2) A short description of the activities the track chair will undertake upon acceptance of the proposal, to disseminate the call-for-papers for his/her track, manage the review process and collect final materials from authors of accepted papers. (Specific guidelines to track chairs regarding these issues will also be provided.) 3) A short CV of the perspective track chair(s) with reference to research interests and publication record directly related to the themes of the proposed track, and any previous experience of involvement in the organization of similar events (in the interest of brevity, reference to a personal web page where such information can be found will be welcomed). All proposals will be reviewed by the Conference and Program Chairs with respect to the above criteria. The Chairs reserve the right to: (1) accept a proposal as is, (2) recommend merging of similar proposals with a considerable overlap in the topics addressed (in this case the track chairs of the different proposals will be asked to form a single chair), (3) reject a proposal. Upon acceptance of a proposal, the track chairs will be notified of their responsibilities in managing the affairs of their tracks, as these are defined by SAC itself but also ACM. The Chairs reserve the right to cancel at any time a track, if these responsibilities are not addressed adequately by its track chair(s). Please submit your proposal electronically and in any acceptable readable form to: George A. Papadopoulos Department of Computer Science University of Cyprus E-Mail: george@cs.ucy.ac.cy IMPORTANT DATES 20 March 2001: Submission of track proposals 15 April 2001: Notification of acceptance/rejection 15 May 2001: Call-For-Papers for accepted tracks 1 Sept 2001: Submission of papers and tutorial proposals 15 Oct 2001: Notification of Acceptance/Rejection 1 Nov 2001: Camera-Ready copies of accepted papers 11-13 March 2002: SAC'02 takes place ------------- 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 dmanet-admin@zpr.uni-koeln.de Tue Jan 30 03:34:05 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id DAA10223 for ; Tue, 30 Jan 2001 03:34:04 -0600 Received: from Octopussy.MI.Uni-Koeln.DE (Octopussy.MI.Uni-Koeln.DE [134.95.166.20]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id DAA09160 for ; Tue, 30 Jan 2001 03:34:04 -0600 (CST) Received: from Octopussy.MI.Uni-Koeln.DE (localhost [127.0.0.1]) by Octopussy.MI.Uni-Koeln.DE (8.9.1/8.9.1) with ESMTP id KAA23879; Tue, 30 Jan 2001 10:22:04 +0100 (MET) Received: from photon.poly.edu (yjc@[128.238.32.22]) by Octopussy.MI.Uni-Koeln.DE (8.9.1/8.9.1) with ESMTP id XAA10338 for ; Fri, 26 Jan 2001 23:34:53 +0100 (MET) Received: from localhost (yjc@localhost) by photon.poly.edu (8.9.0/8.9.0) with ESMTP id RAA13655; Fri, 26 Jan 2001 17:34:42 -0500 (EST) From: Yi-Jen Chiang Reply-To: yjc@poly.edu To: DMANET@zpr.uni-koeln.de, THEORYNT@listserv.nodak.edu, compgeom-announce@research.bell-labs.com, GRAPHNET@listserv.nodak.edu, opt-net@ZIB.DE, dm@INFORMATIK.HU-BERLIN.DE, DMA-LIST@nic.surfnet.nl cc: Yi-Jen Chiang Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Subject: [DMANET] Reminder: WADS 2001 Call for Papers Sender: dmanet-admin@zpr.uni-koeln.de Errors-To: dmanet-admin@zpr.uni-koeln.de X-BeenThere: dmanet@zpr.uni-koeln.de X-Mailman-Version: 2.0.1 Precedence: bulk List-Help: List-Post: List-Subscribe: , List-Id: discrete mathematics and algorithms List-Unsubscribe: , List-Archive: Date: Fri, 26 Jan 2001 17:34:42 -0500 (EST) Status: RO Content-Length: 2887 Lines: 81 This is a reminder that the paper submission deadline for WADS 2001 is February 19. --------------- CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions are posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: submission of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) M. Yannakakis (Bell Laboratories) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) Program Committee: Co-Chairs: F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown) PC-Members: A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer ********************************************************** * * 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 compgeom-owner@research.bell-labs.com Tue Jan 30 15:15:44 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id PAA14410 for ; Tue, 30 Jan 2001 15:15:43 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id PAA26378; Tue, 30 Jan 2001 15:15:40 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Jan 30 16:10:28 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Tue Jan 30 10:21:06 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Jan 30 10:19:21 EST 2001 Received: from junior.lgc.com ([134.132.72.99]) by dusty; Tue Jan 30 10:19:20 EST 2001 Received: from lgchvw02 by junior.lgc.com (8.8.8/lgc.1.26) id JAA19795; Tue, 30 Jan 2001 09:18:38 -0600 (CST) Received: from 134.132.92.92 by lgchvw02 (InterScan E-Mail VirusWall NT); Tue, 30 Jan 2001 09:20:28 -0600 (Central Standard Time) Received: by lgchexch001 with Internet Mail Service (5.5.2653.19) id ; Tue, 30 Jan 2001 09:19:17 -0600 Message-ID: <462F323275D6D311BA0200805F356C52AD85BB@lgcadev001.zycor.lgc.com> From: Steve Zoraster To: compgeom-discuss@research.bell-labs.com Subject: Line Simplification Literature Review? Date: Tue, 30 Jan 2001 09:21:10 -0600 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 567 Lines: 20 I have not been paying attention to the state-of-the-art in automated 2D line simplification for some time. Could someone recommend an up-to-date review article on this topic? Thanks for your time and attention. Steven Zoraster Research Manager/Mapping Landmark Graphics www.lgc.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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed Jan 31 07:45:03 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id HAA16011 for ; Wed, 31 Jan 2001 07:45:03 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id HAA26863; Wed, 31 Jan 2001 07:43:23 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Jan 31 08:37:50 EST 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Tue Jan 30 17:29:03 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Tue Jan 30 17:27:06 EST 2001 Received: from postoffice.srv.cs.cmu.edu ([128.2.181.62]) by dusty; Tue Jan 30 17:27:05 EST 2001 Received: from KRUNCH.GRAPHICS.CS.CMU.EDU by postoffice.srv.cs.cmu.edu id aa01120; 30 Jan 2001 17:26 EST Sender: ph@postoffice.srv.cs.cmu.edu Message-ID: <3A773F90.8038B99A@cs.cmu.edu> Date: Tue, 30 Jan 2001 17:26:24 -0500 From: Paul Heckbert Organization: Computer Science Dept., Carnegie Mellon University X-Mailer: Mozilla 4.08 [en] (X11; U; IRIX 6.2 IP22) MIME-Version: 1.0 To: compgeom-discuss@research.bell-labs.com CC: Steve Zoraster Subject: Re: Line Simplification Literature Review? References: <462F323275D6D311BA0200805F356C52AD85BB@lgcadev001.zycor.lgc.com> Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1541 Lines: 47 Steve Zoraster wrote: > > I have not been paying attention to the state-of-the-art in automated 2D > line simplification for some time. Could someone recommend an up-to-date > review article on this topic? If by "line simplification" you mean taking a polyline (piecewise-linear curve) and approximating it with a new polyline with fewer line segments, then my survey is relevant: Survey of Polygonal Surface Simplification Algorithms, Paul S. Heckbert and Michael Garland, tech. report, CS Dept., Carnegie Mellon U., 1997, that is available at ftp://ftp.cs.cmu.edu/afs/cs/project/anim/ph/paper/multi97/release/intro.html#contents Let me know if you have trouble with the above FTP site. The survey covers curve simplification briefly. My high-level conclusions: * many literatures have explored this topic, including cartography, computer graphics, pattern recognition, image processing, computer vision, computational geometry * cartography calls this topic "generalization" * there's been a lot of redundant work in this area * the Douglas-Peucker algorithm is the most widely-used Paul Heckbert Associate Professor 4205 Newell-Simon Hall Computer Science Dept. Carnegie Mellon University Pittsburgh PA 15213-3891, USA ph@cs.cmu.edu http://www.cs.cmu.edu/~ph ------------- 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 compgeom-owner@research.bell-labs.com Thu Feb 1 09:38:26 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id JAA19575 for ; Thu, 1 Feb 2001 09:38:26 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id JAA06618; Thu, 1 Feb 2001 09:38:21 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Feb 1 10:27:14 EST 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Thu Feb 1 05:21:04 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Feb 1 05:19:25 EST 2001 Received: from aragorn.ads.tuwien.ac.at ([128.131.166.130]) by dusty; Thu Feb 1 05:19:23 EST 2001 Received: from haul (haul.ads.tuwien.ac.at [128.131.166.201]) by aragorn.ads.tuwien.ac.at (8.9.3/8.9.3) with ESMTP id LAA17963; Thu, 1 Feb 2001 11:19:17 +0100 Date: Thu, 1 Feb 2001 11:19:17 +0100 (MET) From: =?iso-8859-1?Q?Ren=E9_Weiskircher?= X-Sender: rene@haul To: dimacs-massive@dimacs.rutgers.edu, compgeom-announce@research.bell-labs.com, diagrams@csli.stanford.edu Subject: Graph Drawing 2001 Vienna Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 6634 Lines: 148 *********************************************************************** ***** Call for Papers ***** ****** ****** ******** G R A P H D R A W I N G 2 0 0 1 ******** ******** ******** ******** September 23-26, 2001, Vienna, Austria ******** ****** ****** ***** http://www.ads.tuwien.ac.at/gd2001 ***** *********************************************************************** *** Scope: *** Theory - Algorithms - Software. The symposium is a forum for researchers, practitioners, developers, and users working on all aspects of graph visualization and representation. The range of issues considered in graph drawing includes graph algorithms, graph theory, computational geometry, topology, planarity issues, combinatorics, optimization, heuristics, local search, computational cartography, information visualization, visual languages, visual perception, computer-human interaction, applications, and practical systems. 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). Researchers and practitioners with an interest in these or other applications are especially welcome to participate. *** Software_Exhibition: *** During the conference there will be a graph drawing software exhibition for which we hope to attract all state-of-the-art software tools in graph drawing. The software will be accessible for all conference participants on computers in the hall of the conference building. *** Graph_Drawing_Contest: *** See the GD 2001 web site. *** Location: *** The conference will take place in the building of the Austrian Academy of Sciences (picture on the 100 schilling bank note) which is located in the center of Vienna at Dr. Ignaz Seipel Platz 2 (about 3 minutes walking distance from Stephansdom). *** Satellite Event: Bike Tour to Vienna *** Go to Vienna by bike! There is a scenic bike route from Passau - the site of GD 95 - to Vienna. The tour is about 300 km long and follows the Danube river on the historic Nibelungen trail. It's an easy ride, completely on bike paths and down hill. As an introduction to the bike tour, an informal workshop on "Drawing Large Graphs" shall be held at the University of Passau on Wednesday, September 19, 2001. The bike tour and the workshop are organized by Franz Brandenburg. *** Call_for_Papers_and_Software: *** * PAPERS: We invite papers describing original research of theoretical or practical significance to graph drawing. A submission consists of a standard PostScript or PDF file of an extended abstract or full draft paper of at most 15 pages in Springer LNCS-style format, including fax number and e-mail address. * SOFTWARE: A contribution to the software exhibition consists of the software in executable format for Windows, Linux, or Solaris, a poster, and a 2 page short description in Springer LNCS-style format, including fax number and e-mail address. Please e-mail submissions to gd2001@ads.tuwien.ac.at by May 28, 2001. See http://www.springer.de/comp/lncs/authors.html for Springer LNCS-style format requirements. *** Proceedings: *** Accepted papers (at most 15 pages) and software (2 pages) will be published in the conference proceedings, which will appear in the series Lecture Notes in Computer Science of Springer-Verlag. The camera-ready copy as well as electronic files of accepted papers and software are due at the conference. A selection of the exhibited software will be invited to contribute to a book on state-of-the-art graph drawing software. This book will be one of the first volumes in a new book series called "Mathematics and Visualization" that will be launched by Springer-Verlag. *** Program Committee: *** Petra Mutzel, Vienna University of Technology - chair Michael Juenger, University of Cologne - co-chair Franz Aurenhammer, Graz University of Technology Therese Biedl, University of Waterloo Giuseppe Di Battista, University of Rome III Franz Brandenburg, University of Passau Yefim Dinitz, Ben Gurion University Peter Eades, University of Sydney Herbert Fleischner, Austrian Academy of Sciences Hubert de Fraysseix, CNRS Paris Mike Goodrich, Johns Hopkins University Jan Kratochvil, Charles University Prague Giuseppe Liotta, University of Perugia Brendan Madden, Tom Sawyer Software Shin-ichi Nakano, Gunma University *** Organizing Committee: *** Petra Mutzel, Vienna University of Technology - chair Michael Juenger, University of Cologne - co-chair Leonid Dimitrov, Austrian Academy of Sciences Barbara Hufnagel, Vienna University Of Technology Gunnar Klau, Vienna University of Technology Sebastian Leipert, caesar Bonn Rene Weiskircher, Vienna University Of Technology Emanuel Wenger, Austrian Academy of Sciences *** Software Exhibition Organizers: *** Martin Gruber, Vienna University of Technology Thomas Lange, University of Cologne *** Graph Drawing Contest Organizer: *** Franz Brandenburg, University of Passau *** Important Dates:*** Submission of papers and software: May 28, 2001 Notification of acceptance: July 17, 2001 Registration: July 31, 2001 Final version due: Sept. 23, 2001 *** Contact Information: *** Petra Mutzel - GD 2001 Institute of Computer Graphics and Algorithms Vienna University of Technology Favoritenstr. 9-11 E186 A-1040 Vienna, Austria ----- fax: +43 1 58801 18699 phone: +43 1 58801 18611 e-mail: gd2001@ads.tuwien.ac.at **** Graph Drawing 2001 Web Site: **** http://www.ads.tuwien.ac.at/gd2001 *********************************************************************** **** GD 2001 is organized by Vienna University of Technology, ***** **** Austrian Academy of Sciences, and University of Cologne ***** *********************************************************************** ------------- 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 compgeom-owner@research.bell-labs.com Thu Feb 1 09:40:38 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id JAA19585 for ; Thu, 1 Feb 2001 09:40:38 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id JAA06824; Thu, 1 Feb 2001 09:40:37 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Feb 1 10:33:38 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Wed Jan 31 17:49:06 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Jan 31 17:47:34 EST 2001 Received: from mailth4.byworkwise.com ([213.166.15.20]) by dusty; Wed Jan 31 17:47:32 EST 2001 Received: from [195.89.145.33] by mailth4.freenet.co.uk (NTMail 6.02.0007/NT0619.00.193cd2dc) with ESMTP id sgkdieaa for compgeom-announce@research.bell-labs.com; Wed, 31 Jan 2001 22:50:26 +0000 Sender: steph@research.bell-labs.com Message-ID: <3A789A8F.19048B75@lmm.jussieu.fr> Date: Wed, 31 Jan 2001 23:06:55 +0000 From: Stephane Popinet Organization: LMM, Universite Paris VI, France X-Mailer: Mozilla 4.07 [en] (X11; I; Linux 2.0.36 i686) MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: The GNU Triangulated Surface library version 0.4.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1965 Lines: 52 I am pleased to announce release 0.4.0 of GTS. http://gts.sourceforge.net Much has happened since 0.3.0. A new object structure inspired by GTK allows to use classical inheritance mechanisms and virtual functions. As a consequence the object hierarchy has been restructured and now uses points, vertices, segments, edges, triangles, faces and surfaces. The Delaunay triangulation has been entirely re-written and is now fully-dynamic (insertion or deletion of vertices). The constrained Delaunay triangulation is semi-dynamic (insertion of vertices and constraints). Boolean operations between surfaces have also been re-written and are more robust (and also benefit from a much more robust implementation of the Delaunay triangulation). Surface coarsening routines have been improved both in term of a more generic interface and in order to avoid artefacts such as folds in the simplified surface. An interesting new extension is the implementation of progressive surfaces which allow dynamic real-time continuous level-of-detail representation of a surface. Progressive transmission of surfaces is also possible. The first building blocks for a hierarchical surface extension have been written. This will allow for dynamic view-dependent simplification of surfaces. The floating-point control interface necessary for robust geometric predicates has been cleaned and GTS should now build on any (touch wood) UNIX-based machine. Preliminary support has been added for win32 compilation using Microsoft C. Please note that the html reference manual is now distributed with the sources. You might want to check the updated manual at http://gts.sourceforge.net/reference/book1.html Stephane Popinet ------------- 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 compgeom-owner@research.bell-labs.com Wed Feb 7 17:15:15 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA21261 for ; Wed, 7 Feb 2001 17:15:15 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA07731; Wed, 7 Feb 2001 17:15:15 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Feb 7 18:08:47 EST 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Tue Feb 6 19:09:04 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Tue Feb 6 19:07:24 EST 2001 Received: from grimy.research.bell-labs.com ([204.178.16.57]) by dusty; Tue Feb 6 19:07:23 EST 2001 Received: from duke.cs.duke.edu ([152.3.140.1]) by grimy; Tue Feb 6 10:48:06 EST 2001 Received: from cs.duke.edu (hadrian.cs.duke.edu [152.3.140.205]) by duke.cs.duke.edu (8.9.3/8.9.3) with ESMTP id KAA14483; Tue, 6 Feb 2001 10:47:00 -0500 (EST) Message-ID: <3A801C8A.1CE65DAE@cs.duke.edu> Date: Tue, 06 Feb 2001 10:47:22 -0500 From: Celeste Hodges Organization: Duke University - Computer Science Dept. X-Mailer: Mozilla 4.76 [en] (Windows NT 5.0; U) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com, THEORY-A@LISTSERV.NODAK.EDU, drhuang100@hotmail.com, boczko@cauchy.math.gatech.edu Subject: Position Announcement - Duke University Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2177 Lines: 51 VISITING ASSISTANT PROFESSOR POSITION AVAILABLE Center for Geometric and Biological Computing Department of Computer Science Duke University A postdoctoral position at the level of Visiting Assistant Professor is available in the Center for Geometric and Biological Computing, Department of Computer Science at Duke University, for the NSF-ITR Bio-Geometry project funded by the National Science Foundation, under the supervision of Profs. Pankaj Agarwal, Herbert Edelsbrunner, and Homme Hellinga. Duke is an equal opportunity employer. The position, which is contingent upon grant funding, is for one year and can be extended to one or more additional years by mutual consent. The project, a collaborative effort with UNC, Stanford, and NC A&T, aims to develop new computational techniques and paradigms for representing, storing, searching, simulating, analyzing, and visualizing biological structures. Applicants must have clearly demonstrated experience and skills in at least one and familiarity with some of the following areas: algorithms, computational geometry, computational topology, computational biology, molecular modeling, structural biology. Teaching responsibilities include one research course per year on a related topic. Apart from pursuing his or her own research interests, the candidate is expected to play a vital role in the center and to interact closely with the PIs on the project from the three other sites. Additional responsibilities include helping prepare contracts and reports. Please send your CV and a letter of research interests, and ask three evaluators to send letters of reference, by US Mail or email to Ms. Celeste Hodges Department of Computer Science Duke University Box 90129 Durham, NC 27708-0129 Email: hodges@cs.duke.edu Tel: (919) 660-6511 To be assured of full consideration, all material including reference letters must arrive by March 16, 2001 ------------- 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 compgeom-owner@research.bell-labs.com Wed Feb 7 17:15:16 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA21265 for ; Wed, 7 Feb 2001 17:15:16 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA07736; Wed, 7 Feb 2001 17:15:15 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Feb 7 18:11:02 EST 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Wed Feb 7 16:47:05 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Feb 7 16:46:59 EST 2001 Received: from cs.utexas.edu ([128.83.139.9]) by dusty; Wed Feb 7 16:46:56 EST 2001 Received: from corn.cs.utexas.edu (amenta@corn.cs.utexas.edu [128.83.144.109]) by cs.utexas.edu (8.9.3/8.9.3) with ESMTP id PAA07186 for ; Wed, 7 Feb 2001 15:46:54 -0600 (CST) Received: (from amenta@localhost) by corn.cs.utexas.edu (8.9.3/8.9.3) id PAA23780 for compgeom-announce@research.bell-labs.com; Wed, 7 Feb 2001 15:46:54 -0600 Message-Id: <200102072146.PAA23780@corn.cs.utexas.edu> From: "Nina Amenta" Date: Wed, 7 Feb 2001 15:46:54 -0600 X-Mailer: Mail User's Shell (7.2.6 beta(3) 11/17/96) To: compgeom-announce@research.bell-labs.com Subject: Brazilian computer graphics conference Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 6844 Lines: 184 This would be a fun opportunity to meet international computer graphics people and our Brazilian computational geometry colleagues. Nina ********************************************************************* Call for Contributions SIBGRAPI 2001 14th Brazilian Symposium on Computer Graphics and Image Processing 15-18 October 2001 Florian=F3polis (http://www.hipernet.ufsc.br/floripa/ingles/indice.htm) Santa Catarina, Brazil SUBMISSION DEADLINES Full Papers: May 04, 2001 Tutorial Proposals: May 25, 2001 Panel Proposals: Jul 01, 2001 Technical Posters: Jul 04, 2001 Cover Image: Jul 15, 2001 Videos: Jul 20, 2001 http://www.dca.fee.unicamp.br/~sib2001/ SIBGRAPI is a traditional (annual) and main scientific event of Brazilian Computer Graphics and Image Processing community, sponsored by the Brazilian Computer Society (http://www.sbc.org.br). The symposium is intended to bring the Remote Sensing, Image Processing, Vision, Graphics, Computational Geometry, and Geometric Modeling communities together. SIBGRAPI 2001 will be held in conjunction with Brazilian Symposium on Multimidia and Hypermidia (SBMIDIA), Workshop on Human Factors in Computer Systems (IHC) and Symposium on Virtual Reality (SVR). Its technical program consists of invited talks, tutorials, video exhibition, and panel sessions with topics of general interest. All information on past SIBGRAPI events can be found at http://www.sbc.org.br/cegrapi/. You are cordially invited to participate by submitting your work in the areas of Computer Graphics and Image Processing, including but not limited to the following: + Image synthesis, + Geometric modeling, + Graphical interfaces, + Multimedia, + Image segmentation, + Computer vision, + Image compression, + Remote sensing, + Graphics hardware, + Animation and simulation, + Computational geometry, + Scientific visualization, + Image retrieval, + Pattern recognition, + Mathematical morphology, + Three-dimensional images, + Geographical databases, + Applications. Full instructions for submissions are available at http://www.dca.fee.unicamp.br/~sib2001/. Contributions should be in one of the following categories: + FULL PAPERS, presented as technical lectures and published in the Proceedings as two-column, 8-page papers. + TECHNICAL POSTERS, presented in a special session and published in the Proceedings as two-column, 1-page papers. + PANELS on topics related to the SIBGRAPI 2001 themes and their short descriptions published in the Proceedings as two-column, 2-page papers. + TUTORIALS about classical or timely topics, ranged from elementary to advanced, consisting of three to six hours of lectures with printed notes (20-50 pages). + FRONT COVER IMAGES generated by computer graphics or image processing techniques, to be printed on the front cover of the SIBGRAPI 2001 proceedings. + VIDEOS generated by computer graphics or digital video processing techniques to be presented in a special session. Papers, posters, and contributions to panels are to be submitted in English, while tutorial proposals may be either in English or in Portuguese. In case of questions please feel free to contact the Program Co-Chairs: Wu, Shin - Ting (Unicamp) ting@dca.fee.unicamp.br Dibio Leandro Borges (PUC-PR) dibio@ppgia.pucpr.br IMPORTANT DATES: *Full Papers Submission: May/04/2001 Notification of acceptance: Jul/02/2001 Camera-Ready: Jul/31/2001 *Technical Posters Submission: Jul/04/2001 Notification of acceptance: Jul/20/2001 Camera-Ready: Jul/31/2001 *Panel Contributions Submission: Jun/01/2001 Notification of acceptance: Jul/20/2001 Camera-Ready: Jul/31/2001 *Tutorial Proposals Submission: May/25/2001 Notification of acceptance: Jul/02/2001 Camera-Ready: Jul/31/2001 *Cover Images Submission: Jul/15/2001 Notification of acceptance: Jul/20/2001 *Videos Submission: Jul/20/2001 Notification of acceptance: Sep/21/2001 Exhibition and award cerimony: Oct/17/2001 SIBGRAPI 2001 COMMITTEE: Organization Committee Fernando Ostuni Gauthier (UFSC, Brazil) Raul S. Wazlawick (UFSC, Brazil) Roberto Willwrich (UFSC, Brazil) Walter de Abreu Cybis (UFSC, Brazil) Program Committee Co-Chairs: Dibio Leandro Borges (UFG, Brazil) dibio@lis.eee.ufg.br Wu, Shin - Ting (Unicamp, Brazil) ting@dca.fee.unicamp.br Tutorial Co-Chairs: Luiz Henrique de Figueiredo (IMPA, Brazil) lhf@visgraf.impa.br Luiz Marcos Garcia Gon=E7alves (UFRJ, Brazil) lmarcos@lcg.ufrj.br Video Festival Coordinator: Jos=E9 Mario De Martino (Unicamp, Brazil) martino@dca.fee.unicamp.br International Technical Committee Adnan Amin (UNSW, Australia) Alejandro C. Frery (UFPe, Brazil) Alexander A. Pasko(Hosei University, Japan) Antonio Elias Fabris (USP-IME, Brazil) Antonio Nuno de Castro Santa Rosa (UnB, Brazil) Arnaldo de Albuquerque Ara=FAjo (UFMG, Brazil) Aura Conci (UFF, Brazil) Creto Augusto Vidal (UFC, Brazil) Daniel Thalmann (LIG-EPFL, Switzerland) Edward M. Riseman (UMASS, USA) Flavio Bortolozzi (PUC-PR, Brazil) Hans-Peter Seidel (Max-Planck-Institute, Germany) Joaquim A. Jorge (IST-UTL, Portugal) Joao Marques de Carvalho (UFPb, Brazil) Jose Luis Encarna=E7=E3o (FhG-IGD, Germany) Gabriel Taubin (IBM T.J. Watson, USA) Marcelo K. Zuffo (USP-POLI, Brazil) Marcelo Dreux (PUC-RIO, Brazil) Maria Andreia Formico Rodrigues (UFC, Brazil) Michel Couprie (ESIEE, France) Myoung-hee Kim (Ewha Womans University, Korea) Nelson D. A. Mascarenhas (UFSCar, Brazil) Neucimar Jeronimo Leite (Unicamp, Brazil) Nina Amenta (U.T. Austin, USA) Oscar H. Bustos (UNCor, Argentina) Paulo Cezar Pinto Carvalho (IMPA, Brazil) Patricia Lobo Netto (Vetor Zero, Brazil) Pedro J. de Rezende (Unicamp, Brazil) Robert Sabourin (University of Quebec, Canada) Roseli de Deus Lopes (USP-POLI, Brazil) Sameer Singh (University of Exeter, United Kingdom) Silvia Delgado Olabarriaga (UFRGS, Brazil) Soraia Raupp Musse (UNISINOS, Brazil) Vaclav Skala (University of West Bohemia, Czech Republic) ------------- 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 compgeom-owner@research.bell-labs.com Wed Feb 7 17:21:31 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA21673 for ; Wed, 7 Feb 2001 17:21:31 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA07969; Wed, 7 Feb 2001 17:21:30 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Feb 7 18:13:54 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Wed Feb 7 11:47:06 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Feb 7 11:46:28 EST 2001 Received: from photon.poly.edu ([128.238.32.22]) by dusty; Wed Feb 7 11:46:27 EST 2001 Received: from localhost (yjc@localhost) by photon.poly.edu (8.9.0/8.9.0) with ESMTP id LAA25451; Wed, 7 Feb 2001 11:46:20 -0500 (EST) Date: Wed, 7 Feb 2001 11:46:19 -0500 (EST) From: Yi-Jen Chiang Reply-To: yjc@poly.edu To: DMANET@zpr.uni-koeln.de, THEORYNT@listserv.nodak.edu, compgeom-announce@research.bell-labs.com, GRAPHNET@listserv.nodak.edu, opt-net@ZIB.DE, dm@INFORMATIK.HU-BERLIN.DE, DMA-LIST@nic.surfnet.nl cc: Yi-Jen Chiang Subject: WADS 2001 Final Call for Papers Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2564 Lines: 73 WADS 2001 Final Call for Papers: This is a reminder that the paper submission deadline is February 19. --------------- CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions are posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: submission of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) M. Yannakakis (Bell Laboratories) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) Program Committee: Co-Chairs: F. Dehne (Carleton), J.-R. Sack (Carleton), R. Tamassia (Brown) PC-Members: A. Apostolico, T. Chan, B. Codenotti, G. Di Battista, S. Dolev, M. Farach-Colton, P. Fraigniaud, H. Gabow, S. Goldman, G. Gonnet, M. Goodrich, R. Grossi, M. Halldorsson, S. Khuller, R. Klein, J. Kleinberg, G. Liotta, E. Mayr, J. Mitchell, S. Naeher, T. Nishizeki, V. Prasanna, E. Puppo, J. Rolim, J. Snoeyink, I. Tollis, I. Vrt'o, D. Wagner, T. Warnow, S. Whitesides, P. Widmayer ------------- 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 compgeom-owner@research.bell-labs.com Thu Feb 8 15:44:56 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id PAA20994 for ; Thu, 8 Feb 2001 15:44:55 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id PAA25041 for ; Thu, 8 Feb 2001 15:44:55 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Feb 8 16:38:14 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Thu Feb 8 04:29:07 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Feb 8 04:27:13 EST 2001 Received: from eerie.site-eerie.ema.fr ([146.19.2.1]) by dusty; Thu Feb 8 04:27:12 EST 2001 Received: from maileerie.site-eerie.ema.fr (maileerie [146.19.1.3]) by eerie.site-eerie.ema.fr (8.9.3/8.9.1) with ESMTP id KAA23537 for ; Thu, 8 Feb 2001 10:27:09 +0100 (MET) Received: from site-eerie.ema.fr (lgpc27 [146.19.33.117]) by maileerie.site-eerie.ema.fr (8.9.3/8.9.1) with ESMTP id KAA07209; Thu, 8 Feb 2001 10:36:30 +0100 (MET) Message-ID: <3A8267B4.D8B862EE@site-eerie.ema.fr> Date: Thu, 08 Feb 2001 10:32:36 +0100 From: aupetit X-Mailer: Mozilla 4.61 [en] (WinNT; I) X-Accept-Language: en MIME-Version: 1.0 To: "compgeom-discuss@research.bell-labs.com" , aupetit@eerie.site-eerie.ema.fr Subject: convexity for discrete set of points... Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1128 Lines: 40 Hello, I'm a PhD student from France. I'd like to know if it exists a "correct" name for the following property: considering a set S of a finite number N of points in R^d and an indicator value 0 or 1 associated to them which indicates if the points are part or not of a particular set X. (X subset of S) If any point of X is inside the convex hull of X, then I would like to say that X is "convex". And if it exists at least one point in S which is not in X but which is in the convex hull of X, I would like to say that X is not "convex". I'm not sure I can use the term "convex" for that property. Does it already exist a well suited term for that? Thank you for your help Michael Aupetit 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 1 1 0 0 1 1 1 0 0 1 0 1 0 0 1 1 1 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 "convex" - "non convex" ? ------------- 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 compgeom-owner@research.bell-labs.com Thu Feb 8 15:45:43 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id PAA21001 for ; Thu, 8 Feb 2001 15:45:43 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id PAA25868; Thu, 8 Feb 2001 15:45:32 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Feb 8 16:39:52 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Thu Feb 8 06:13:06 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Feb 8 06:12:23 EST 2001 To: compgeom-announce@research.bell-labs.com Received: from ada.cs.ucy.ac.cy ([194.42.7.2]) by dusty; Thu Feb 8 06:12:20 EST 2001 Received: from ada.cs.ucy.ac.cy (ada.cs.ucy.ac.cy [194.42.7.2]) by ada.cs.ucy.ac.cy (8.8.8/8.8.8) with ESMTP id NAA30034; Thu, 8 Feb 2001 13:04:29 +0200 Date: Thu, 8 Feb 2001 13:04:28 +0200 (WET) From: George Angelos Papadopoulos Reply-To: cs@cs.ucy.ac.cy Subject: Academic Vacancies -- CS Dept., Univ. of Cyprus Message-ID: Organization: Department of Computer Science - University of Cyprus Address: 75 Kallipoleos Str. -- POB 20537 -- CY-1678 -- Nicosia -- Cyprus Tel: +357-2-892242 -- Fax: +357-2-339062 URL: http://www.cs.ucy.ac.cy/~george MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2499 Lines: 67 DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF CYPRUS VISITING PROFESSORSHIPS The Department of Computer Science at the University of Cyprus has a number of vacancies for visiting professors at the ranks of Assistant, Associate, and Full Professor. ALL fields of study will be considered, but preference will be given to applicants associated with one or more of the following ones: * Computer Architecture * Parallel and Distributed Processing * Programming Languages * Multimedia Information Systems * Data Communication Networks * Artificial Intelligence * Software Engineering * Database Systems A new M.Sc. course on "Advanced Information Technologies" is now offered by the Department and the successful applicants will therefore have the opportunity to teach at both the undergraduate and graduate levels. A visiting appointment is usually for one semester (Spring semester: Jan-June; Winter semester: Sept-Dec), but it can be renewed for up to four semesters. Applicants should hold a Ph.D. in a relevant subject, have post Ph.D. experience, and BE FLUENT IN GREEK (both these requirements are mandatory). The annual salaries for these positions (including the 13th salary) are: Professor (Scale A15-A16) CYP 27,875 - 36,235 Associate Professor (Scale A14-A15) CYP 24,587 - 33,518 Assistant Professor (Scale A13-A14) CYP 22,938 - 30,940 Lecturer (Scale A12-A13) CYP 17,706 - 28,372 (At present CYP 1 = 1.1 sterling and CYP 1 = 1.6 U.S. dollars). Presently, the Department is seeking applications for the winter and spring semesters of the academic year 2001-2002. The processing of applications will start on the 1st May 2001 and will continue until all the available positions have been filled. Anyone wishing to apply should send a full CV to the following address: The Chairperson Department of Computer Science University of Cyprus 75 Kallipoleos Street P.O. Box 20537, CY-1678 Nicosia, CYPRUS For more details and other information, interested individuals may contact the Chairperson of the Department of Computer Science: Associate Professor Antonis Kakas Tel: +357-2-892230/1, Fax: +357-2-339062, E-mail: antonis@ucy.ac.cy ------------- 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 dmanet-admin@zpr.uni-koeln.de Fri Feb 9 07:02:58 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id HAA22812 for ; Fri, 9 Feb 2001 07:02:58 -0600 Received: from Octopussy.MI.Uni-Koeln.DE (Octopussy.MI.Uni-Koeln.DE [134.95.166.20]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id HAA16660 for ; Fri, 9 Feb 2001 07:02:56 -0600 (CST) Received: from Octopussy.MI.Uni-Koeln.DE (localhost [127.0.0.1]) by Octopussy.MI.Uni-Koeln.DE (8.9.1/8.9.1) with ESMTP id NAA11025; Fri, 9 Feb 2001 13:15:09 +0100 (MET) Received: from photon.poly.edu (yjc@photon.poly.edu [128.238.32.22]) by Octopussy.MI.Uni-Koeln.DE (8.9.1/8.9.1) with ESMTP id RAA14478 for ; Wed, 7 Feb 2001 17:46:24 +0100 (MET) Received: from localhost (yjc@localhost) by photon.poly.edu (8.9.0/8.9.0) with ESMTP id LAA25451; Wed, 7 Feb 2001 11:46:20 -0500 (EST) From: Yi-Jen Chiang Reply-To: yjc@poly.edu To: DMANET@zpr.uni-koeln.de, THEORYNT@listserv.nodak.edu, compgeom-announce@research.bell-labs.com, GRAPHNET@listserv.nodak.edu, opt-net@ZIB.DE, dm@INFORMATIK.HU-BERLIN.DE, DMA-LIST@nic.surfnet.nl cc: Yi-Jen Chiang Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Subject: [DMANET] WADS 2001 Final Call for Papers Sender: dmanet-admin@zpr.uni-koeln.de Errors-To: dmanet-admin@zpr.uni-koeln.de X-BeenThere: dmanet@zpr.uni-koeln.de X-Mailman-Version: 2.0.1 Precedence: bulk List-Help: List-Post: List-Subscribe: , List-Id: discrete mathematics and algorithms List-Unsubscribe: , List-Archive: Date: Wed, 7 Feb 2001 11:46:19 -0500 (EST) Status: RO Content-Length: 2381 Lines: 69 WADS 2001 Final Call for Papers: This is a reminder that the paper submission deadline is February 19. --------------- CALL FOR PAPERS WADS 2001 7th Workshop on Algorithms and Data Structures August 8-10, 2001 Brown University Providence, Rhode Island, USA http://www.wads.org/ Sponsored by the Center for Geometric Computing and by the Department of Computer Science at Brown University The Workshop on Algorithms and Data Structures, which alternates with the Scandinavian Workshop on Algorithm Theory, is intended as a forum for researchers in the area of design, analysis, and implementation of algorithms and data structures. We invite submissions of papers presenting original research on the theory and applications of algorithms and data structures in all areas, including combinatorics, computational biology, computational geometry, databases, graph drawing, graphics, information retrieval, information security, parallel and distributed computing. Contributors are invited to submit an extended abstract not exceeding 12 pages by February 19, 2001. Detailed submission instructions are posted at http://www.wads.org/. The proceedings will be published in the Springer-Verlag series Lecture Notes in Computer Science. Deadlines: February 19: submission of papers April 18: notification of acceptance/rejection of papers May 9: submission of accepted papers in camera-ready form June 20: advance registration Invited Speakers: M. J. Atallah (Purdue) F. T. Leighton (Akamai Technologies and MIT) M. Yannakakis (Bell Laboratories) Conference Organization: Conference Chair: R. Tamassia (Brown) Publicity Chair: Y.-J. Chiang (Polytechnic) Local Arrangements Chair: G. Shubina (Brown) ********************************************************** * * 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 compgeom-owner@research.bell-labs.com Fri Feb 9 09:38:46 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id JAA23192 for ; Fri, 9 Feb 2001 09:38:46 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id JAA16610; Fri, 9 Feb 2001 09:38:45 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Feb 9 10:31:29 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Thu Feb 8 19:51:07 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Feb 8 19:49:51 EST 2001 Received: from upright.CS.Princeton.EDU ([128.112.136.7]) by dusty; Thu Feb 8 19:49:49 EST 2001 Received: from cs.princeton.edu (inspiron.dyn.CS.Princeton.EDU [128.112.105.245]) by upright.CS.Princeton.EDU (8.10.2/8.10.2) with ESMTP id f190mI905819; Thu, 8 Feb 2001 19:48:18 -0500 (EST) Message-ID: <3A833C09.672AC04C@cs.princeton.edu> Date: Thu, 08 Feb 2001 19:38:33 -0500 From: Bernard Chazelle X-Mailer: Mozilla 4.72 [en] (Windows NT 5.0; U) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: New Book Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO X-Status: A Content-Length: 707 Lines: 27 New Book: Spice up the long winter months with this thriller by your bedside! THE DISCREPANCY METHOD: RANDOMNESS AND COMPLEXITY Bernard Chazelle, Cambridge University Press, ISBN: 0521770939 Check out: http://www.cs.princeton.edu/~chazelle/book for the table of contents and how to order. Go to: http://www.cs.princeton.edu/~chazelle/ to see what the book will look like on your bedside table. ------------- 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 compgeom-owner@research.bell-labs.com Mon Feb 12 15:20:19 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id PAA24530 for ; Mon, 12 Feb 2001 15:20:19 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id PAA27025; Mon, 12 Feb 2001 15:20:18 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Feb 12 16:19:58 EST 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Sat Feb 10 08:39:06 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Sat Feb 10 08:37:50 EST 2001 Received: from cis.poly.edu ([128.238.32.126]) by dusty; Sat Feb 10 08:37:50 EST 2001 Received: from ziggy.poly.edu (ziggy.poly.edu [128.238.32.79]) by cis.poly.edu (8.9.0/8.9.0) with ESMTP id IAA04255; Sat, 10 Feb 2001 08:37:39 -0500 (EST) Received: (from aronov@localhost) by ziggy.poly.edu (8.9.1b+Sun/8.9.1) id IAA15405; Sat, 10 Feb 2001 08:37:37 -0500 (EST) Date: Sat, 10 Feb 2001 08:37:37 -0500 (EST) From: Boris Aronov Message-Id: <200102101337.IAA15405@ziggy.poly.edu> To: compgeom-announce@research.bell-labs.com, theorynt@listserv.nodak.edu Subject: Goodman-Pollack Fest postponed User-Agent: REMI/1.14.2 (=?ISO-8859-4?Q?Hokuhoku-=D2shima?=) Chao/1.14.1 (=?ISO-8859-4?Q?Rokujiz=F2?=) APEL/10.2 Emacs/20.7 (sparc-sun-solaris2.7) MULE/4.0 (HANANOEN) MIME-Version: 1.0 (generated by REMI 1.14.2 - =?ISO-8859-4?Q?=22Hokuhoku-=D2?= =?ISO-8859-4?Q?shima=22?=) Content-Type: text/plain; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 865 Lines: 30 New York University Courant Institute of Mathematical Sciences THE GOODMAN--POLLACK TWO-THIRDS-OF-A-CENTURY FEST We regret to announce the postponement of the Goodman-Pollack Two-thirds-of-a-century Fest that was scheduled for next Friday, February 16. The postponement is due to an illness of Ricky Pollack. In spite of his good recovery, we feel that it is safer to postpone the event. We will notify you once the event is re-scheduled. We hope to schedule it soon for some time during this semester. With best regards, Janos Pach and Micha Sharir ------------- 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 compgeom-owner@research.bell-labs.com Thu Feb 15 15:03:36 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id PAA09820 for ; Thu, 15 Feb 2001 15:03:36 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id PAA13840; Thu, 15 Feb 2001 15:03:35 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Feb 15 16:00:42 EST 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Thu Feb 15 14:41:08 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Feb 15 14:39:33 EST 2001 Received: from gremlin.ics.uci.edu ([128.195.1.70]) by dusty; Thu Feb 15 14:39:28 EST 2001 Received: from hyperbolic.ics.uci.edu ( hyperbolic.ics.uci.edu [128.195.4.237] ) by gremlin-relay.ics.uci.edu id aa21169 for ; 15 Feb 2001 11:39 PST Date: Thu, 15 Feb 2001 11:39:09 -0800 From: David Eppstein To: compgeom-announce@research.bell-labs.com Subject: SoCG 2001 accepted papers Message-ID: <40951261.3191225949@hyperbolic.ics.uci.edu> X-Mailer: Mulberry/2.0.0 (MacOS) X-Face: %L;%tM$D+%zkQ$zp8f/vAx*mr6T79jgxh,SC!$,8.r%HBe}KZ)iMb$tB.Z,30 3QLpj-NoP*NzsIC,boYU]bQ]H'y<#4ga3$21: MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii; format=flowed Content-Transfer-Encoding: 7bit Content-Disposition: inline Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 4845 Lines: 149 The following papers have been accepted to the 17th ACM Symposium on Computational Geometry, to be held June 3-5, 2001, at Tufts University, Medford, MA. For more information about the conference, see its web page, . This list includes papers from both the theory and applied tracks, but does not include the video program, which is not scheduled to be announced until March 1. Box-Trees and R-Trees with Near-Optimal Query Time, Pankaj K. Agarwal and Mark de Berg and Joachim Gudmundsson and Mikael Hammar and Herman J. Havekort On the Number of Congruent Simplices in a Point Set, Pankaj K. Agarwal and Micha Sharir Enumerating Order Types for Small Point Sets with Applications, O. Aichholzer and F. Aurenhammer and H. Krasser Exact $L_\infty$ Nearest Neighbor Search in High Dimensions, Helmut Alt and Laura Heinrich-Litan A Sum of Squares Theorem for Visibility Complexes, Pierre Angelier and Michel Pocchiola New Bounds on the Betti Numbers of Semi-Algebraic Sets and Arrangements of Real Algebraic Hypersurfaces, Saugata Basu Farthest Neighbors and Center Points in the Presence of Rectangular Obstacles, Boaz Ben-Moshe and Matthew J. Katz and Joseph S. B. Mitchell A Segment-Tree Based Kinetic BSP, Mark de Berg and Joao Comba and Leonidas J. Guibas Schematization of Road Networks, Sergio Cabello and Mark de Berg and Steven van Dijk and Marc van Kreveld and Tycho Strijk A Fully Dynamic Algorithm for Planar Width, Timothy M. Chan Algorithms for Congruent Sphere Packing and Applications, Danny Z. Chen and Xiaobo (Sharon) Hu and Yingping Huang and Yifan Li and Jinhui Xu Walking in a Triangulation, Olivier Devillers and Sylvain Pion and Monique Teillaud Detecting Undersampling in Surface Reconstruction, Tamal K. Dey and Joachim Giesen Efficient and Small Representation of Line Arrangements with Applications, David P. Dobkin and Ayellet Tal Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles, Adrian Dumitrescu and Joseph S. B. Mitchell and Micha Sharir Sink-insertion for Mesh Improvement, Herbert Edelsbrunner and Damrong Guoy Hierarchical Morse Complexes for Piecewise Linear 2-Manifolds, Herbert Edelsbrunner and John Harer and Afra Zomorodian Nice Point Sets Can Have Nasty Delaunay Triangulations, Jeff Erickson Simplifying a Polygonal Subdivision While Keeping it Simple, Regina Estkowski and Joseph S. B. Mitchell Discrete Mobile Centers, Jie Gao and Leonidas J. Guibas and John Hershberger and Li Zhang and An Zhu polymake: an Approach to Modular Software Design in Computational Geometry, Ewgenij Gawrilow and Michael Joswig Computing the Intersection of Quadrics: Exactly and Actually!, Nicola Geismann and Michael Hemmer and Elmar Schoemer A Randomized Art-Gallery Algorithm for Sensor Placement, Hector Gonzalez-Banos and Jean-Claude Latombe A Practical Approach for Computing the Diameter of a Point-Set, Sariel Har-Peled Notes on Computing Peaks in k-Levels and Parametric Spanning Trees, Naoki Katoh and Takeshi Tokuyama Geometric Permutations of Fat Objects, Matthew Katz and Kasturi Varadarajan Intersection Searching Problems in General Settings, Vladlen Koltun PRECISE: Efficient Multiprecision Evaluation of Algebraic Roots and Predicates for Reliable Geometric Computation, S. Krishnan and M. Foskey and T. Culver and J. Keyser and D. Manocha On the Complexity of Halfspace Area Queries, Stefan Langerman Computing a Canonical Polygonal Schema of an Orientable Triangulated Surface, Francis Lazarus and Michel Pocchiola and Gert Vegter and Anne Verroust Hardware-Assisted View-Dependent Map Simplification, Nabil Mustafa and Eleftheris Koutsofios and Shankar Krishnan and Suresh Venkatasubraminian The Union of Congruent Cubes in Three Dimensions, Janos Pach and Ido Safruti and Micha Sharir Efficient Perspective-Accurate Silhouette Computation and Applications, Mihai Pop and Gill Barequet and Christian A. Duncan and Michael T. Goodrich and Wenjing Huang and Subodh Kumar Monotone Paths in Line Arrangements, Rados Radoicic and Geza Toth Area-Preserving Piecewise-Affine Transformations, Alan Saalfeld The Clarkson-Shor Technique Revisited and Extended, Micha Sharir Balanced Lines, Halving Triangles, and the Generalized Lower Bound Theorem, Micha Sharir and Emo Welzl Different Distances of Planar Point Sets, Jozsef Solymosi and Csaba David Toth A Note on Binary Plane Partitions, Csaba David Toth -- David Eppstein UC Irvine Dept. of Information & Computer Science eppstein@ics.uci.edu http://www.ics.uci.edu/~eppstein/ ------------- 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 compgeom-owner@research.bell-labs.com Fri Feb 23 17:09:18 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA28737 for ; Fri, 23 Feb 2001 17:09:16 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA11391 for ; Fri, 23 Feb 2001 17:09:16 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Feb 23 18:03:57 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Mon Feb 19 08:51:12 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Feb 19 08:49:41 EST 2001 Received: from geomat.math.uni-hamburg.de ([134.100.220.2]) by dusty; Mon Feb 19 08:49:40 EST 2001 Received: from sun14.math.uni-hamburg.de (sun14.math.uni-hamburg.de [134.100.222.34]) by geomat.math.uni-hamburg.de (8.9.3/8.9.3) with ESMTP id OAA03235; Mon, 19 Feb 2001 14:49:31 +0100 (MET) Received: from localhost (am7a021@localhost) by sun14.math.uni-hamburg.de (8.9.3/8.9.3) with SMTP id OAA14225; Mon, 19 Feb 2001 14:49:33 +0100 (MET) X-Authentication-Warning: sun14.math.uni-hamburg.de: am7a021 owned process doing -bs Date: Mon, 19 Feb 2001 14:49:33 +0100 (MET) From: Longin Jan Latecki To: compgeom-discuss@research.bell-labs.com cc: Michael.Aupetit@site-eerie.ema.fr Subject: Re: convexity for discrete set of points... Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2165 Lines: 79 Hi, The term Michael Aupetit defines is called digital convexity. There are a few definitions of digital convexity, which are not necessarily equivalent. I can recommend two older references: Rosenfeld, A., Kim, C.E., How a Digital Computer Can Tell Whether a Line is Straight, AMM(89), 1982, pp. 230-235. Kim, C.E., and Rosenfeld, A., Digital Straight Lines and Convexity of Digital Regions, PAMI(4), No. 2, March 1982, pp. 149-153. With best regards, Longin Jan *** Dr. Longin Jan Latecki Department of Applied Mathematics University of Hamburg Bundesstr. 55, 20146 Hamburg, Germany Email: latecki@math.uni-hamburg.de http://www.math.uni-hamburg.de/home/latecki/ Phone: ++49 40 428385156 or ++49 40 822273241 Fax: ++49 40 42838 5117 Michael Aupetit wrote: To: "compgeom-discuss@research.bell-labs.com" , aupetit@eerie.site-eerie.ema.fr Subject: convexity for discrete set of points... From: aupetit Date: Thu, 08 Feb 2001 10:32:36 +0100 Hello, I'm a PhD student from France. I'd like to know if it exists a "correct" name for the following property: considering a set S of a finite number N of points in R^d and an indicator value 0 or 1 associated to them which indicates if the points are part or not of a particular set X. (X subset of S) If any point of X is inside the convex hull of X, then I would like to say that X is "convex". And if it exists at least one point in S which is not in X but which is in the convex hull of X, I would like to say that X is not "convex". I'm not sure I can use the term "convex" for that property. Does it already exist a well suited term for that? Thank you for your help Michael Aupetit 0 0 0 0 0 0 0 0 0 0 0 1 1 1 0 0 1 1 1 0 0 1 1 1 0 0 1 0 1 0 0 1 1 1 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 "convex" - "non convex" ? ------------- 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 compgeom-owner@research.bell-labs.com Fri Feb 23 17:11:20 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA28772 for ; Fri, 23 Feb 2001 17:11:20 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA11711 for ; Fri, 23 Feb 2001 17:11:20 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Fri Feb 23 18:06:45 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Tue Feb 20 11:33:12 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Feb 20 11:32:01 EST 2001 Received: from cse.unl.edu ([129.93.33.1]) by dusty; Tue Feb 20 11:32:00 EST 2001 Received: from localhost (cterlapu@localhost) by cse.unl.edu (8.11.2/8.9.1) with ESMTP id f1KGVvL6368618 for ; Tue, 20 Feb 2001 10:31:57 -0600 (CST) Date: Tue, 20 Feb 2001 10:31:56 -0600 From: Chakravarthy Terlapu To: compgeom-discuss@research.bell-labs.com Subject: need help Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2153 Lines: 96 Hi, I have a image called street.tif and 2 boxes whose coordinates are for example as follows; //Box1 frc[i].lx = x1; //left x-coordinate frc[i].ly = y1; //left y-coordinate frc[i].tx = x2; //top x-coordinate frc[i].ty = y2; //top y-coordinate frc[i].rx = x3; //right x-coordinate frc[i].ry = y3; //right y-coordinate frc[i].bx = x4; //bottom x-coordinate frc[i].by = y4; //bottom y-coordinate //Box2 frc[i].lx = x11; frc[i].ly = y11; frc[i].tx = x22; frc[i].ty = y22; frc[i].rx = x33; frc[i].ry = y33; frc[i].bx = x44; frc[i].by = y44; I need to create a new image say street1.tif which contains street.tif minus boxes (street.tif-boxes) i.e I have to erase all pixels within the box1 and box2. It would be great if anyone could help me. THanks Chakravarthy Terlapu #include "tiffio.h" #include main() { int i,j,k; unsigned short t; int linebytes, outbytes; uint32 w,h; uint32 row; unsigned char *inbuf,*outbuf; TIFF* in; TIFF* out; in=TIFFOpen("street.tif","r"); out=TIFFOpen("street1.tif","w"); TIFFGetField(in, TIFFTAG_IMAGELENGTH, &h); TIFFGetField(in, TIFFTAG_IMAGEWIDTH, &w); TIFFSetField(out, TIFFTAG_IMAGELENGTH, h); TIFFSetField(out, TIFFTAG_IMAGEWIDTH, w); TIFFSetField(out, TIFFTAG_SAMPLESPERPIXEL, 1); TIFFSetField(out, TIFFTAG_BITSPERSAMPLE, 1); TIFFSetField(out, TIFFTAG_PHOTOMETRIC, PHOTOMETRIC_MINISBLACK); TIFFSetField(out, TIFFTAG_ORIENTATION, 1); linebytes=TIFFScanlineSize(in); outbytes=TIFFScanlineSize(out); inbuf=_TIFFmalloc(linebytes); outbuf=_TIFFmalloc(outbytes); for(row=0; row Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA23824 for ; Thu, 1 Mar 2001 17:21:07 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA19815; Thu, 1 Mar 2001 17:21:06 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Mar 1 18:18:29 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Wed Feb 28 10:41:16 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Feb 28 10:39:42 EST 2001 Received: from jardine.math.uwo.ca ([129.100.75.21]) by dusty; Wed Feb 28 10:39:40 EST 2001 Received: from uwo.ca (jardine@localhost [127.0.0.1]) by jardine.math.uwo.ca (8.10.2/8.10.0) with ESMTP id f1SFdWq27066 for ; Wed, 28 Feb 2001 10:39:33 -0500 Sender: jardine@jardine.math.uwo.ca Message-ID: <3A9D1BB4.D7B1662F@uwo.ca> Date: Wed, 28 Feb 2001 10:39:32 -0500 From: Rick Jardine Organization: Math. Dept., Univ. of Western Ontario X-Mailer: Mozilla 4.75 [en] (X11; U; Linux 2.2.17 i686) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: 2nd announcement: Algebraic Topological Methods in Computer Science Content-Type: multipart/mixed; boundary="------------C489BFC3F2FEA53C8430AEA4" Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3452 Lines: 99 This is a multi-part message in MIME format. --------------C489BFC3F2FEA53C8430AEA4 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit --------------C489BFC3F2FEA53C8430AEA4 Content-Type: text/plain; charset=us-ascii; name="at-cs2.txt" Content-Transfer-Encoding: 7bit Content-Disposition: inline; filename="at-cs2.txt" Second Announcement: Conference on Algebraic Topological Methods in Computer Science Department of Mathematics Stanford University July 30 - August 3, 2001 The application of algebraic topological methods in areas related to Computer Science is an emerging field that is of interest to both pure and applied mathematical scientists. The aim of this conference is to describe recent advances, and define the fundamental open problems in the field through a mixture of expository and technical lectures. There will be twenty-one main lectures, on a variety of topics in the area. This meeting has been funded by grants from Hewlett-Packard and the National Science Foundation. The following mathematical scientists have agreed to speak: John Baez (Math, UC Riverside) Marshall Bern (Xerox PARC) Anders Bjorner (Royal Institute of Technology, Stockholm) Tamal Dey (CS, Ohio State) Herbert Edelsbrunner (CS, Duke) David Eppstein (CS, UC Irvine) Michael Freedman (Microsoft) Philippe Gaucher (CNRS, Strasbourg) Eric Goubault (Commissariat a l'Energie Atomique, France) Jean Goubault-Larrecq (ENS Cachan) Marco Grandis (Dip. di Mat., Genova) Jeremy Gunawardena (HP BRIMS) John Harer (Math, Duke) Joel Hass (Math, UC Davis) Maurice Herlihy (CS, Brown) Reinhard Laubenbacher (Math, NMSU) Laszlo Lovasz (Microsoft) Vaughan Pratt (CS, Stanford) Christian Reidys (Los Alamos National Lab) Bernd Sturmfels (Math, UC Berkeley) Noson Yanofsky (CS, Brooklyn College) The organizers for this meeting are: Gunnar Carlsson, gunnar@math.stanford.edu Rick Jardine, jardine@uwo.ca We ask that all participants register for the meeting. The latest information and all registration forms are available at the Stanford Conference Web Site (http://math.stanford.edu/atmcs/index.htm). A limited amount of time at the meeting will be devoted to short talks by conference participants. If you would like to give a short presentation, please send an abstract to gunnar@math.stanford.edu. There will be a volume of proceedings for the conference, to appear in the journal "Homology, Homotopy and Applications", with Gunnar Carlsson as senior editor. Submissions for this volume should be set in LATEX and should be sent to gunnar@math.stanford.edu, to arrive by Friday, August 17. We are interested in expository papers on particular areas of application of topology, as well as research papers. There will be housing for conference participants on the Stanford campus, at the rate of about 50.00 US per night for single accomodation: a reservation form is available at the Stanford Conference Web Site. There are also several hotels in the area - see the Stanford site for a list. Limited financial support may be available for travel and housing: please make your request when registering. --------------C489BFC3F2FEA53C8430AEA4-- ------------- 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 compgeom-owner@research.bell-labs.com Thu Mar 1 17:27:58 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA23830 for ; Thu, 1 Mar 2001 17:27:58 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA20501; Thu, 1 Mar 2001 17:27:57 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Mar 1 18:20:58 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Mon Feb 26 19:57:16 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Feb 26 19:56:01 EST 2001 Received: from cis.ohio-state.edu ([164.107.115.5]) by dusty; Mon Feb 26 19:56:00 EST 2001 Received: from beta.cis.ohio-state.edu (tamaldey@beta.cis.ohio-state.edu [164.107.112.14]) by cis.ohio-state.edu (8.9.1/8.9.1) with SMTP id TAA26718 for ; Mon, 26 Feb 2001 19:55:59 -0500 (EST) Message-Id: <200102270055.TAA26718@cis.ohio-state.edu> Date: Mon, 26 Feb 2001 19:55:59 -0500 (EST) From: tamal dey Reply-To: tamal dey Subject: Software release for surface reconstruction To: compgeom-announce@research.bell-labs.com MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: rlDhXPTCzvUbYVkFDWOOrg== X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4u sparc Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 717 Lines: 22 Dear Geometers, It is our pleasure to announce the release of the first version of the Cocone software that we developed at the Ohio State University for reconstructing surfaces from their samples. The implementation is based on CGAL and LEDA libraries and our recent work on surface reconstruction. The details can be found 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 compgeom-owner@research.bell-labs.com Tue Mar 6 16:46:08 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id QAA06878 for ; Tue, 6 Mar 2001 16:46:08 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id QAA00557; Tue, 6 Mar 2001 16:46:01 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Mar 6 17:41:03 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Tue Mar 6 08:23:18 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Mar 6 08:22:33 EST 2001 Received: from cedar.dcs.shef.ac.uk ([143.167.8.6]) by dusty; Tue Mar 6 08:22:27 EST 2001 Received: from padley.dcs.shef.ac.uk (padley.dcs.shef.ac.uk [143.167.9.77]) by cedar.dcs.shef.ac.uk (8.9.3+Sun/8.9.3) with ESMTP id NAA26448; Tue, 6 Mar 2001 13:22:10 GMT From: Joab Winkler Received: (from joab@localhost) by padley.dcs.shef.ac.uk (8.9.3+Sun/8.9.3) id NAA15398; Tue, 6 Mar 2001 13:22:17 GMT Date: Tue, 6 Mar 2001 13:22:17 GMT Message-Id: <200103061322.NAA15398@padley.dcs.shef.ac.uk> To: compgeom-announce@research.bell-labs.com Subject: Workshop on Geometric Uncertainty Cc: j.winkler@cedar.dcs.shef.ac.uk X-Sun-Charset: US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2725 Lines: 77 Dear Geometers We have pleasure in inviting you to participate in the workshop 'Uncertainty in Geometric Computations', to be held in Sheffield, England, 5-6 July 2001. Full details, including the web page, are below. Joab Winkler Mahesan Niranjan Department of Computer Science, The University of Sheffield, England +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ UNCERTAINTY IN GEOMETRIC COMPUTATIONS, 5-6 July 2001, Sheffield, England Invited Speakers (will be expanded) : Shun-ichi Amari (RIKEN, Japan), Andrew Blake (Microsoft, UK), Adrian Bowyer (Bath, UK), Alan Edelman (MIT, USA), Robin Forrest (East Anglia, UK), Nicholas Higham (Manchester, UK), Dinesh Manocha (North Carolina, USA), Tomaso Poggio (MIT, USA), Si Wu (Sheffield, UK) Organisers: Joab Winkler and Mahesan Niranjan Department of Computer Science The University of Sheffield, UK. The representation and management of uncertainty is an important issue in several different disciplines, such as numerical problems in computer graphics that occur when calculating the intersection curve of two surfaces, high performance pattern classification in a feature space, and the study of families of probability distributions in information geometry. The aim of this two-day workshop is to explore the underlying geometric theme that is common to these diverse disciplines. The workshop will consist of a number of invited contributions of a tutorial nature covering the different topics, contributed papers from participants and discussion sessions that explore the connections. Contributions will be published by Kluwer in an edited volume. The workshop is sponsored by the Engineering and Physical Sciences Research Council (EPSRC) and London Mathematical Society (LMS). Financial support is available to cover costs of UK based graduate students. The total number of participants is limited to 70. One page abstracts are invited from potential participants. Please submit electronically (postscript, PDF or plain text) to Dr Joab Winkler Deadline for Abstracts: 15 April 2001 For further information see: http://www.shef.ac.uk/~geom2001/ +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ ------------- 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 compgeom-owner@research.bell-labs.com Wed Mar 7 12:27:31 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id MAA29888 for ; Wed, 7 Mar 2001 12:27:31 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id MAA29315; Wed, 7 Mar 2001 12:27:30 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Mar 7 13:21:00 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Wed Mar 7 10:33:21 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Mar 7 10:31:33 EST 2001 Received: from e1.ny.us.ibm.com ([32.97.182.101]) by dusty; Wed Mar 7 10:31:32 EST 2001 Received: from northrelay02.pok.ibm.com (northrelay02.pok.ibm.com [9.117.200.22]) by e1.ny.us.ibm.com (8.9.3/8.9.3) with ESMTP id KAA83514 for ; Wed, 7 Mar 2001 10:30:19 -0500 Received: from d01ml233.pok.ibm.com (d01ml233.pok.ibm.com [9.117.200.63]) by northrelay02.pok.ibm.com (8.8.8m3/NCO v4.95) with ESMTP id KAA47982 for ; Wed, 7 Mar 2001 10:27:25 -0500 Importance: Normal Subject: Optimal 4-8 Mesh simplification To: compgeom-announce@research.bell-labs.com X-Mailer: Lotus Notes Release 5.0.4a July 24, 2000 Message-ID: From: "Laurent L Balmelli" Date: Wed, 7 Mar 2001 10:31:21 -0500 X-MIMETrack: Serialize by Router on D01ML233/01/M/IBM(Release 5.0.6a |January 17, 2001) at 03/07/2001 10:31:28 AM MIME-Version: 1.0 Content-type: text/plain; charset=us-ascii Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1435 Lines: 47 Dear Computational Geometry Lovers, My PhD thesis, RATE-DISTORTION OPTIMAL MESH SIMPLIFICATION FOR COMMUNICATIONS Laboratory for Audio-Visual Communications Ecole Polytechnique Federale (EPFL), Switzerland is available in pdf format at http://www.research.ibm.com/people/b/balmelli/ See the topics covered below. all the best Laurent Balmelli, Research Staff Member IBM Research Division -------------------------- TOPICS COVERED (1) Conceptual system for the transmission of textured meshes, (2) Analysis of a set of approximation algorithms for the polyline in the computation-rate-distortion sense, (3) Analysis in computational geometry of binary subdivided meshes, also known as 4-8 meshes, (4) Efficient quadtree data structure for subdivision surfaces providing O(1) neighbor-finding access methods, (5) Optimal mesh simplification in the Rate-Distortion Sense, (6) Joint Mesh-Texture optimization using Marginal Analysis. ------------- 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 compgeom-owner@research.bell-labs.com Thu Mar 8 17:25:30 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA02662 for ; Thu, 8 Mar 2001 17:25:30 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA15639; Thu, 8 Mar 2001 17:25:29 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Mar 8 18:23:57 EST 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Wed Mar 7 16:09:18 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Mar 7 16:08:16 EST 2001 Received: from cis.ohio-state.edu ([164.107.115.5]) by dusty; Wed Mar 7 16:08:14 EST 2001 Received: from beta.cis.ohio-state.edu (tamaldey@beta.cis.ohio-state.edu [164.107.112.14]) by cis.ohio-state.edu (8.9.1/8.9.1) with SMTP id QAA19190 for ; Wed, 7 Mar 2001 16:08:10 -0500 (EST) Message-Id: <200103072108.QAA19190@cis.ohio-state.edu> Date: Wed, 7 Mar 2001 16:08:10 -0500 (EST) From: tamal dey Reply-To: tamal dey Subject: Cocone Software for surface reconstruction To: compgeom-announce@research.bell-labs.com MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: n7t9vAKDKwRau0kUBPcL4Q== X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4u sparc Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 529 Lines: 20 For those who asked for the static binary for the Cocone software (for reconstructing surfaces from point clouds): it is now available from 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 compgeom-owner@research.bell-labs.com Fri Mar 9 08:39:32 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id IAA04255 for ; Fri, 9 Mar 2001 08:39:32 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA02113; Fri, 9 Mar 2001 08:39:31 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Mar 9 09:35:47 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Thu Mar 8 19:11:21 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Mar 8 19:10:42 EST 2001 Received: from mserve1.acs.ucalgary.ca ([136.159.34.51]) by dusty; Thu Mar 8 19:10:38 EST 2001 Received: from ucalgary.ca (mserve2.acs.ucalgary.ca [136.159.34.55]) by mserve1.acs.ucalgary.ca (Postfix) with ESMTP id 2032A11AB; Thu, 8 Mar 2001 17:10:35 -0700 (MST) Received: from 124-96.dialup.ucalgary.ca(136.159.124.96) by mserve2.acs.ucalgary.ca via smap (V2.0) id ZZ591407; Thu, 8 Mar 2001 17:09:26 -0700 From: "Marina Gavrilova" To: Cc: Subject: PDPTA'01, Session on Applied Parallel Algorithms, CFP Date: Thu, 8 Mar 2001 17:12:04 -0700 Message-ID: MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="----=_NextPart_000_0041_01C0A7F2.E5C8F310" X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2910.0) Importance: Normal In-Reply-To: <0165B8BD4314D31192B500E0292DF78F423E60@sssnt122.rdg.ac.uk> X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2919.6700 Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 86676 Lines: 1232 This is a multi-part message in MIME format. ------=_NextPart_000_0041_01C0A7F2.E5C8F310 Content-Type: text/plain; charset="koi8-r" Content-Transfer-Encoding: 7bit Dear Colleagues, Please, allow me to bring to your attention the Final Call for Papers for Technical Session on Applied Parallel Algorithms, to be held in conjunction with the International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA'2001, Las Vegas, USA http://www.ashland.edu/~iajwa/conferences). The Conference is a long running well established international event, attracting outstanding researchers in the areas of parallel and distributed processing. It is estimated that around 1500 participants will attend the PDPTA in 2001. The Technical Section on Applied Parallel Algorithms (http://www.cpsc.ucalgary.ca/~marina/Newweb/pdpta01.htm) is focused on recent advances in high performance computing and applications of the parallel algorithms to such natural sciences and engineering, including parallel computational geometry, biology, chemistry and physics. Applied computational methods in parallel and distributed environments, including but not limited to computer graphics, visualization, GIS, databases, matrix computations, equation solvers, Monte Carlo methods are also of interest. The details on paper submission can be found from the attached Final Call for Papers. Please note that the deadline for DRAFT paper submission is March 13th, 2001. CALL FOR PAPERS ================ TECHNICAL SESSION ON APPLIED PARALLEL ALGORITHMS in conjunction with the 2001 International Conference on Parallel and Distributed Processing Techniques and Applications PDPTA'2001 June 25 - 28, 2001, Las Vegas, USA http://www.ashland.edu/~iajwa/conferences http://www.cpsc.ucalgary.ca/~marina/Newweb/pdpta01.htm PLEASE NOTE EXTENDED DEADLINE FOR PAPER SUBMISSION: MARCH 13, 2001 SESSION CHAIRS C.J. Kenneth Tan, The Queen's University of Belfast, UK Marina Gavrilova, University of Calgary, Canada Vassil N. Alexandrov, High Performance Computing Centre, University of Reading, UK OVERVIEW The concentration of this Technical Session is in the realms of applied computational methods in parallel and distributed environments, including but not limited to computer graphics, visualization, GIS, databases, matrix computations, equation solvers, Monte Carlo methods, and others. (See the list below.) The sequential counterpart of these topics have long been the interest of researchers. However, many of the parallel aspects of various algorithms, their implementations and applications, still remain open. Implementation of these algorithms may be on systems ranging from loosely-coupled pile of DSP's to workstation clusters to MPP's. The large scale computations are of the special interest for session organizers. This topic offers the opportunity to discuss problems and solutions in the area, to identify new issues, and to shape future directions for research, as well as to help industrial users apply techniques of large scale parallel and distributed computations. TOPICS OF INTEREST Topics of interest of this Technical Session include, but not limited to: matrix computations equation solvers Monte Carlo methods random number generators sorting algorithms computer vision and computer graphics visualization robotics computer simulation parallel numerical computations/methods parallel computational geometry, biology, chemistry and physics The design and implementation of algorithms in parallel and distributed environments, and applications of such methods to mechanics and physics, are of special interest. PDPTA Conference Series The 2001 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'2001) will be held at the Monte Carlo Resort, Las Vegas, Nevada, USA, from June 25 till June 28, 2000. It is anticipated that this international event will attract about 1500 participants. This MultiConference is composed of eight International conferences that will be held simultaneously. Attendees will have full access to all eight conferences. The conference will be co-sponsored by Computer Science Research, Education, & Applications Press together with research centers, international associations, international research groups, and developers of high-performance machines and systems. PAPER SUBMISSION Prospective authors are invited to submit their draft paper of about 4 pages, to Kenneth Tan or Marina Gavrilova (contact information is given below) by the due date, March 13, 2001. Papers must not have been previously published or currently submitted for publication elsewhere. Electronic submissions via e-mail is preferred, although fax submissions or hard copy submissions are also acceptable. When submitting via e-mail, the preferred formats are: Adobe PostScript Adobe PDF DVI (please include all graphics files) LaTex ((please include any non-standard style files or class files, and all graphics) Papers in Microsoft Word format are also acceptable. Should the submission for a paper contain more than one file, please submit them as a GZIP'ed or 'compress'ed Tar archive (i.e.: either as a .tar.gz or .tar.Z file). If submitting via fax or in hard copy, please make sure 3 copies of the paper arrive before the due date, March 1, 2001. The length of the camera-ready papers (if accepted) will be limited to 7 pages. Please include a cover page which lists the following: Title of the paper Name, affiliation, postal address, E-mail address, telephone number, and fax number for each author Name of the author who will be presenting the paper (if accepted) A maximum of 5 keywords 2 nominated referees and contact information of all nominated referees PROCEEDINGS The conference proceedings will be published by CSREA Press (ISBN) in hardcopy. The proceedings will be available at the conferences site. Some accepted papers will also be considered for journal publication. In addition to the hardcopy, it is also planned to publish the papers on a CD. IMPORTANT DATES March 13, 2001 (Thursday): Draft papers (about 4 to 5 pages) due April 2, 2001 (Monday) : Notification of acceptance May 1, 2001 (Tuesday) : Camera-Ready papers and Preregistration due June 25 - 28, 2001 : PDPTA'2001 CONTACT INFORNATION For all questions related to Technical Session on Applied Parallel Algorithms please contact C. J. Kenneth Tan Address: School of Computer Science The Queen's University of Belfast Belfast BT7 1NN United Kingdom Telephone: 44-289-027-4636 Facsimile: 44-289-068-3890 or M. L. Gavrilova Address: Department of Computer Science University of Calgary 2500 University Drive N.W. Calgary, AB Canada T2N 1N4 Telephone: 1-403-220-5105 Facsimile: 1-403-284-4707 or Vassil Alexandrov Address: High Performance Computing Center University of Reading Reading RG6 6AY United Kingdom Telephone: 44-118-931-6722 Facsimile: 44-118-975-1994 With best wishes, Marina Gavrilova ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Dr. Marina Gavrilova Dept. Of Computer Science University of Calgary Office: MS 269 Phone: (403) 220-5105 Fax: (403) 284-4707 E-mail: marina@cpsc.ucalgary.ca WWW: www.cpsc.ucalgary.ca/~marina ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ------=_NextPart_000_0041_01C0A7F2.E5C8F310 Content-Type: application/msword; name="Parallel Algm Session PDPTA.doc" Content-Transfer-Encoding: base64 Content-Disposition: attachment; filename="Parallel Algm Session PDPTA.doc" 0M8R4KGxGuEAAAAAAAAAAAAAAAAAAAAAPgADAP7/CQAGAAAAAAAAAAAAAAABAAAAbQAAAAAAAAAA EAAAbwAAAAEAAAD+////AAAAAGwAAAD///////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// ///////////////////////////////////////////////////////////////////////////s pcEANyAJBAAA+BK/AAAAAAAAEAAAAAAABAAA5iUAAA4AYmpialUWVRYAAAAAAAAAAAAAAAAAAAAA AAAJBBYAIkIAADd8AAA3fAAA5iEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAD//w8AAAAA AAAAAAD//w8AAAAAAAAAAAD//w8AAAAAAAAAAAAAAAAAAAAAAGwAAAAAAEYCAAAAAAAARgIAAEYC AAAAAAAARgIAAAAAAABGAgAAAAAAAEYCAAAAAAAARgIAABQAAAAAAAAAAAAAAFoCAAAAAAAAxAwA AAAAAADEDAAAAAAAAMQMAAAAAAAAxAwAACwAAADwDAAAPAAAAFoCAAAAAAAAeRUAAEIBAAA4DQAA MgIAAGoPAAAAAAAAag8AAAAAAABqDwAAAAAAAGoPAAAAAAAAag8AAAAAAABqDwAAAAAAAGoPAAAA AAAA+BQAAAIAAAD6FAAAAAAAAPoUAAAAAAAA+hQAAAAAAAD6FAAAAAAAAPoUAAAAAAAA+hQAACQA AAC7FgAAIAIAANsYAACUAAAAHhUAABUAAAAAAAAAAAAAAAAAAAAAAAAARgIAAAAAAABqDwAAAAAA AAAAAAAAAAAAAAAAAAAAAABqDwAAAAAAAGoPAAAAAAAAag8AAAAAAABqDwAAAAAAAB4VAAAAAAAA 7BEAAAAAAABGAgAAAAAAAEYCAAAAAAAAag8AAAAAAAAAAAAAAAAAAGoPAAAAAAAAMxUAABYAAADs EQAAAAAAAOwRAAAAAAAA7BEAAAAAAABqDwAAsgAAAEYCAAAAAAAAag8AAAAAAABGAgAAAAAAAGoP AAAAAAAA+BQAAAAAAAAAAAAAAAAAAOwRAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAag8AAAAAAAD4FAAAAAAAAOwRAACIAAAA7BEAAAAAAAAAAAAA AAAAAHQSAAAAAAAARgIAAAAAAABGAgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAdBIAAAAAAABqDwAAAAAAACwNAAAMAAAA0NIX+B6o wAFaAgAAagoAAMQMAAAAAAAAHBAAAEIBAAB0EgAAAAAAAAAAAAAAAAAAdBIAAIQCAABJFQAAMAAA AHkVAAAAAAAAdBIAAAAAAABvGQAAAAAAAF4RAACOAAAAbxkAAAAAAAB0EgAAAAAAAOwRAAAAAAAA WgIAAAAAAABaAgAAAAAAAEYCAAAAAAAARgIAAAAAAABGAgAAAAAAAEYCAAAAAAAAAgDZAAAAVGVj aG5pY2FsIFNlc3Npb24gb24gDUFwcGxpZWQgUGFyYWxsZWwgQWxnb3JpdGhtcyANaW4gY29uanVu Y3Rpb24gd2l0aCANdGhlIDIwMDEgSW50ZXJuYXRpb25hbCBDb25mZXJlbmNlIG9uIFBhcmFsbGVs IGFuZCBEaXN0cmlidXRlZCBQcm9jZXNzaW5nIFRlY2huaXF1ZXMgYW5kIEFwcGxpY2F0aW9ucyAN EyBIWVBFUkxJTksgImh0dHA6Ly93d3cuYXNobGFuZC5lZHUvfmlhandhL2NvbmZlcmVuY2VzIiAU UERQVEEnMDEVLCBKdW5lIDI1IC0gMjgsIDIwMDEsIExhcyBWZWdhcywgVVNBIA1odHRwOi8vd3d3 LmFzaGxhbmQuZWR1L35pYWp3YS9jb25mZXJlbmNlcw1odHRwOi8vd3d3LmNwc2MudWNhbGdhcnku Y2Evfm1hcmluYS9OZXd3ZWIvcGRwdGEwMS5odG0NCSANUGxlYXNlIG5vdGUgRVhURU5ERUQgZGVh ZGxpbmUgZm9yIHN1Ym1pc3Npb246IE1BUkNIIDEzLCAyMDAxDVNlc3Npb24gQ2hhaXJzOiANEyBI WVBFUkxJTksgImh0dHA6Ly9uZXh0LmVuc3UudWNhbGdhcnkuY2EvfmNqdGFuIiAUQy4gSi4gS2Vu bmV0aCBUYW4VLCBUaGUgUXVlZW4ncyBVbml2ZXJzaXR5IG9mIEJlbGZhc3QsIFVLDRMgSFlQRVJM SU5LICJodHRwOi8vd3d3LmNwc2MudWNhbGdhcnkuY2Evfm1hcmluYS9OZXd3ZWIvaW5kZXguaHRt IiAURHIuIE1hcmluYSBMLiBHYXZyaWxvdmEVLCBVbml2ZXJzaXR5IG9mIENhbGdhcnksIENhbmFk YQ0TIEhZUEVSTElOSyAiaHR0cDovL3d3dy5jcy5yZGcuYWMudWsvfm5zYS9IaTRORVRncm91cC9p bmRleC5odG1sIiAURHIuIFZhc3NpbCBOLiBBbGV4YW5kcm92IBUsIEhpZ2ggUGVyZm9ybWFuY2Ug Q29tcHV0aW5nIENlbnRyZSwgVW5pdmVyc2l0eSBvZiBSZWFkaW5nLCBVSw2gDU92ZXJ2aWV3IA1U aGUgY29uY2VudHJhdGlvbiBvZiB0aGlzIFRlY2huaWNhbCBTZXNzaW9uIGlzIGluIHRoZSByZWFs bXMgb2YgYXBwbGllZCBjb21wdXRhdGlvbmFsIG1ldGhvZHMgaW4gcGFyYWxsZWwgYW5kIGRpc3Ry aWJ1dGVkIGVudmlyb25tZW50cywgaW5jbHVkaW5nIGJ1dCBub3QgbGltaXRlZCB0byBjb21wdXRl ciBncmFwaGljcywgdmlzdWFsaXphdGlvbiwgR0lTLCBkYXRhYmFzZXMsIG1hdHJpeCBjb21wdXRh dGlvbnMsIGVxdWF0aW9uIHNvbHZlcnMsIE1vbnRlIENhcmxvIG1ldGhvZHMsIGFuZCBvdGhlcnMu IChTZWUgdGhlIGxpc3QgYmVsb3cuKSBUaGUgc2VxdWVudGlhbCBjb3VudGVycGFydCBvZiB0aGVz ZSB0b3BpY3MgaGF2ZSBsb25nIGJlZW4gdGhlIGludGVyZXN0IG9mIHJlc2VhcmNoZXJzLiBIb3dl dmVyLCBtYW55IG9mIHRoZSBwYXJhbGxlbCBhc3BlY3RzIG9mIHZhcmlvdXMgYWxnb3JpdGhtcywg dGhlaXIgaW1wbGVtZW50YXRpb25zIGFuZCBhcHBsaWNhdGlvbnMsIHN0aWxsIHJlbWFpbiBvcGVu LiBJbXBsZW1lbnRhdGlvbiBvZiB0aGVzZSBhbGdvcml0aG1zIG1heSBiZSBvbiBzeXN0ZW1zIHJh bmdpbmcgZnJvbSBsb29zZWx5LWNvdXBsZWQgcGlsZSBvZiBEU1AncyB0byB3b3Jrc3RhdGlvbiBj bHVzdGVycyB0byBNUFAncy4gVGhlIGxhcmdlIHNjYWxlIGNvbXB1dGF0aW9ucyBhcmUgb2YgdGhl IHNwZWNpYWwgaW50ZXJlc3QgZm9yIHNlc3Npb24gb3JnYW5pemVycy4gVGhpcyB0b3BpYyBvZmZl cnMgdGhlIG9wcG9ydHVuaXR5IHRvIGRpc2N1c3MgcHJvYmxlbXMgYW5kIHNvbHV0aW9ucyBpbiB0 aGUgYXJlYSwgdG8gaWRlbnRpZnkgbmV3IGlzc3VlcywgYW5kIHRvIHNoYXBlIGZ1dHVyZSBkaXJl Y3Rpb25zIGZvciByZXNlYXJjaCwgYXMgd2VsbCBhcyB0byBoZWxwIGluZHVzdHJpYWwgdXNlcnMg YXBwbHkgdGVjaG5pcXVlcyBvZiBsYXJnZSBzY2FsZSBwYXJhbGxlbCBhbmQgZGlzdHJpYnV0ZWQg Y29tcHV0YXRpb25zLiANVG9waWNzIG9mIEludGVyZXN0DVRvcGljcyBvZiBpbnRlcmVzdCBvZiB0 aGlzIFRlY2huaWNhbCBTZXNzaW9uIGluY2x1ZGUsIGJ1dCBub3QgbGltaXRlZCB0bzogDRMgSU5D TFVERVBJQ1RVUkUgImh0dHA6Ly93d3cuY3BzYy51Y2FsZ2FyeS5jYS9+bWFyaW5hL05ld3dlYi9f dGhlbWVzL2JsZW5kcy9ibGVidWwxYS5naWYiIFwqIE1FUkdFRk9STUFUSU5FVCAUARUHbWF0cml4 IGNvbXB1dGF0aW9ucyAHBxMgSU5DTFVERVBJQ1RVUkUgImh0dHA6Ly93d3cuY3BzYy51Y2FsZ2Fy eS5jYS9+bWFyaW5hL05ld3dlYi9fdGhlbWVzL2JsZW5kcy9ibGVidWwxYS5naWYiIFwqIE1FUkdF Rk9STUFUSU5FVCAUARUHZXF1YXRpb24gc29sdmVycwcHEyBJTkNMVURFUElDVFVSRSAiaHR0cDov L3d3dy5jcHNjLnVjYWxnYXJ5LmNhL35tYXJpbmEvTmV3d2ViL190aGVtZXMvYmxlbmRzL2JsZWJ1 bDFhLmdpZiIgXCogTUVSR0VGT1JNQVRJTkVUIBQBFQdNb250ZSBDYXJsbyBtZXRob2RzBwcTIElO Q0xVREVQSUNUVVJFICJodHRwOi8vd3d3LmNwc2MudWNhbGdhcnkuY2Evfm1hcmluYS9OZXd3ZWIv X3RoZW1lcy9ibGVuZHMvYmxlYnVsMWEuZ2lmIiBcKiBNRVJHRUZPUk1BVElORVQgFAEVB3JhbmRv bSBudW1iZXIgZ2VuZXJhdG9ycwcHEyBJTkNMVURFUElDVFVSRSAiaHR0cDovL3d3dy5jcHNjLnVj YWxnYXJ5LmNhL35tYXJpbmEvTmV3d2ViL190aGVtZXMvYmxlbmRzL2JsZWJ1bDFhLmdpZiIgXCog TUVSR0VGT1JNQVRJTkVUIBQBFQdzb3J0aW5nIGFsZ29yaXRobXMHBxMgSU5DTFVERVBJQ1RVUkUg Imh0dHA6Ly93d3cuY3BzYy51Y2FsZ2FyeS5jYS9+bWFyaW5hL05ld3dlYi9fdGhlbWVzL2JsZW5k cy9ibGVidWwxYS5naWYiIFwqIE1FUkdFRk9STUFUSU5FVCAUARUHY29tcHV0ZXIgdmlzaW9uIGFu ZCBjb21wdXRlciBncmFwaGljcwcHEyBJTkNMVURFUElDVFVSRSAiaHR0cDovL3d3dy5jcHNjLnVj YWxnYXJ5LmNhL35tYXJpbmEvTmV3d2ViL190aGVtZXMvYmxlbmRzL2JsZWJ1bDFhLmdpZiIgXCog TUVSR0VGT1JNQVRJTkVUIBQBFQd2aXN1YWxpemF0aW9uBwcTIElOQ0xVREVQSUNUVVJFICJodHRw Oi8vd3d3LmNwc2MudWNhbGdhcnkuY2Evfm1hcmluYS9OZXd3ZWIvX3RoZW1lcy9ibGVuZHMvYmxl YnVsMWEuZ2lmIiBcKiBNRVJHRUZPUk1BVElORVQgFAEVB3JvYm90aWNzBwcTIElOQ0xVREVQSUNU VVJFICJodHRwOi8vd3d3LmNwc2MudWNhbGdhcnkuY2Evfm1hcmluYS9OZXd3ZWIvX3RoZW1lcy9i bGVuZHMvYmxlYnVsMWEuZ2lmIiBcKiBNRVJHRUZPUk1BVElORVQgFAEVB2NvbXB1dGVyIHNpbXVs YXRpb24HBxMgSU5DTFVERVBJQ1RVUkUgImh0dHA6Ly93d3cuY3BzYy51Y2FsZ2FyeS5jYS9+bWFy aW5hL05ld3dlYi9fdGhlbWVzL2JsZW5kcy9ibGVidWwxYS5naWYiIFwqIE1FUkdFRk9STUFUSU5F VCAUARUHcGFyYWxsZWwgbnVtZXJpY2FsIGNvbXB1dGF0aW9ucy9tZXRob2RzBwcTIElOQ0xVREVQ SUNUVVJFICJodHRwOi8vd3d3LmNwc2MudWNhbGdhcnkuY2Evfm1hcmluYS9OZXd3ZWIvX3RoZW1l cy9ibGVuZHMvYmxlYnVsMWEuZ2lmIiBcKiBNRVJHRUZPUk1BVElORVQgFAEVB3BhcmFsbGVsIGNv bXB1dGF0aW9uYWwgZ2VvbWV0cnksIGJpb2xvZ3ksIGNoZW1pc3RyeSwgcGh5c2ljcywgYW5kIG90 aGVyIG5hdHVyYWwgc2NpZW5jZXMgBwcTIElOQ0xVREVQSUNUVVJFICJodHRwOi8vd3d3LmNwc2Mu dWNhbGdhcnkuY2Evfm1hcmluYS9OZXd3ZWIvX3RoZW1lcy9ibGVuZHMvYmxlYnVsMWEuZ2lmIiBc KiBNRVJHRUZPUk1BVElORVQgFAEVB090aGVyIHJlbGF0ZWQgYXJlYXMHB1RoZSBkZXNpZ24gYW5k IGltcGxlbWVudGF0aW9uIG9mIGFsZ29yaXRobXMgaW4gcGFyYWxsZWwgYW5kIGRpc3RyaWJ1dGVk IGVudmlyb25tZW50cywgYW5kIGFwcGxpY2F0aW9ucyBvZiBzdWNoIG1ldGhvZHMgdG8gbWVjaGFu aWNzIGFuZCBwaHlzaWNzLCBhcmUgb2Ygc3BlY2lhbCBpbnRlcmVzdC4gDVBEUFRBIENvbmZlcmVu Y2UgU2VyaWVzIA1UaGUgMjAwMSBJbnRlcm5hdGlvbmFsIENvbmZlcmVuY2Ugb24gUGFyYWxsZWwg YW5kIERpc3RyaWJ1dGVkIFByb2Nlc3NpbmcgVGVjaG5pcXVlcyBhbmQgQXBwbGljYXRpb25zIChQ RFBUQScyMDAxKSB3aWxsIGJlIGhlbGQgYXQgdGhlIE1vbnRlIENhcmxvIFJlc29ydCwgTGFzIFZl Z2FzLCBOZXZhZGEsIFVTQSwgZnJvbSBKdW5lIDI1IHRpbGwgSnVuZSAyOCwgMjAwMC4NSXQgaXMg YW50aWNpcGF0ZWQgdGhhdCB0aGlzIGludGVybmF0aW9uYWwgZXZlbnQgd2lsbCBhdHRyYWN0IGFi b3V0IDE1MDAgcGFydGljaXBhbnRzLiBUaGlzIE11bHRpQ29uZmVyZW5jZSBpcyBjb21wb3NlZCBv ZiBlaWdodCBJbnRlcm5hdGlvbmFsIGNvbmZlcmVuY2VzIHRoYXQgd2lsbCBiZSBoZWxkIHNpbXVs dGFuZW91c2x5LiBBdHRlbmRlZXMgd2lsbCBoYXZlIGZ1bGwgYWNjZXNzIHRvIGFsbCBlaWdodCBj b25mZXJlbmNlcy4NVGhlIGNvbmZlcmVuY2Ugd2lsbCBiZSBjby1zcG9uc29yZWQgYnkgQ29tcHV0 ZXIgU2NpZW5jZSBSZXNlYXJjaCwgRWR1Y2F0aW9uLCAmIEFwcGxpY2F0aW9ucyBQcmVzcyB0b2dl dGhlciB3aXRoIHJlc2VhcmNoIGNlbnRlcnMsIGludGVybmF0aW9uYWwgYXNzb2NpYXRpb25zLCBp bnRlcm5hdGlvbmFsIHJlc2VhcmNoIGdyb3VwcywgYW5kIGRldmVsb3BlcnMgb2YgaGlnaC1wZXJm b3JtYW5jZSBtYWNoaW5lcyBhbmQgc3lzdGVtcy4NUGFwZXIgU3VibWlzc2lvbiANUHJvc3BlY3Rp dmUgYXV0aG9ycyBhcmUgaW52aXRlZCB0byBzdWJtaXQgdGhlaXIgZHJhZnQgcGFwZXIgb2YgYWJv dXQgNCBwYWdlcywgdG8gS2VubmV0aCBUYW4gb3IgTWFyaW5hIEdhdnJpbG92YSAoY29udGFjdCBp bmZvcm1hdGlvbiBpcyBnaXZlbiBiZWxvdykgYnkgdGhlIGR1ZSBkYXRlLCBNYXJjaCAxLCAyMDAx LiBQYXBlcnMgbXVzdCBub3QgaGF2ZSBiZWVuIHByZXZpb3VzbHkgcHVibGlzaGVkIG9yIGN1cnJl bnRseSBzdWJtaXR0ZWQgZm9yIHB1YmxpY2F0aW9uIGVsc2V3aGVyZS4NRWxlY3Ryb25pYyBzdWJt aXNzaW9ucyB2aWEgZS1tYWlsIGlzIHByZWZlcnJlZCwgYWx0aG91Z2ggZmF4IHN1Ym1pc3Npb25z IG9yIGhhcmQgY29weSBzdWJtaXNzaW9ucyBhcmUgYWxzbyBhY2NlcHRhYmxlLiBXaGVuIHN1Ym1p dHRpbmcgdmlhIGUtbWFpbCwgdGhlIHByZWZlcnJlZCBmb3JtYXRzIGFyZToNEyBJTkNMVURFUElD VFVSRSAiaHR0cDovL3d3dy5jcHNjLnVjYWxnYXJ5LmNhL35tYXJpbmEvTmV3d2ViL190aGVtZXMv YmxlbmRzL2JsZWJ1bDFhLmdpZiIgXCogTUVSR0VGT1JNQVRJTkVUIBQBFQdBZG9iZSBQb3N0U2Ny aXB0BwcTIElOQ0xVREVQSUNUVVJFICJodHRwOi8vd3d3LmNwc2MudWNhbGdhcnkuY2Evfm1hcmlu YS9OZXd3ZWIvX3RoZW1lcy9ibGVuZHMvYmxlYnVsMWEuZ2lmIiBcKiBNRVJHRUZPUk1BVElORVQg FAEVB0Fkb2JlIFBERgcHEyBJTkNMVURFUElDVFVSRSAiaHR0cDovL3d3dy5jcHNjLnVjYWxnYXJ5 LmNhL35tYXJpbmEvTmV3d2ViL190aGVtZXMvYmxlbmRzL2JsZWJ1bDFhLmdpZiIgXCogTUVSR0VG T1JNQVRJTkVUIBQBFQdEVkkgKHBsZWFzZSBpbmNsdWRlIGFsbCBncmFwaGljcyBmaWxlcykHBxMg SU5DTFVERVBJQ1RVUkUgImh0dHA6Ly93d3cuY3BzYy51Y2FsZ2FyeS5jYS9+bWFyaW5hL05ld3dl Yi9fdGhlbWVzL2JsZW5kcy9ibGVidWwxYS5naWYiIFwqIE1FUkdFRk9STUFUSU5FVCAUARUHTGFU ZVggKHBsZWFzZSBpbmNsdWRlIGFueSBub24tc3RhbmRhcmQgc3R5bGUgZmlsZXMgb3IgY2xhc3Mg ZmlsZXMsIGFuZCBhbGwgZ3JhcGhpY3MpIAcHUGFwZXJzIGluIE1pY3Jvc29mdCBXb3JkIGZvcm1h dCBhcmUgYWxzbyBhY2NlcHRhYmxlLiBTaG91bGQgdGhlIHN1Ym1pc3Npb24gZm9yIGEgcGFwZXIg Y29udGFpbiBtb3JlIHRoYW4gb25lIGZpbGUsIHBsZWFzZSBzdWJtaXQgdGhlbSBhcyBhIEdaSVAn ZWQgb3IgJ2NvbXByZXNzJ2VkIFRhciBhcmNoaXZlIChpLmUuOiBlaXRoZXIgYXMgYSAudGFyLmd6 IG9yIC50YXIuWiBmaWxlKS4gSWYgc3VibWl0dGluZyB2aWEgZmF4IG9yIGluIGhhcmQgY29weSwg cGxlYXNlIG1ha2Ugc3VyZSAzIGNvcGllcyBvZiB0aGUgcGFwZXIgYXJyaXZlIGJlZm9yZSB0aGUg ZHVlIGRhdGUsIE1hcmNoIDEsIDIwMDEuIFRoZSBsZW5ndGggb2YgdGhlIGNhbWVyYS1yZWFkeSBw YXBlcnMgKGlmIGFjY2VwdGVkKSB3aWxsIGJlIGxpbWl0ZWQgdG8gNyBwYWdlcy4gDVBsZWFzZSBp bmNsdWRlIGEgY292ZXIgcGFnZSB3aGljaCBsaXN0cyB0aGUgZm9sbG93aW5nOiANEyBJTkNMVURF UElDVFVSRSAiaHR0cDovL3d3dy5jcHNjLnVjYWxnYXJ5LmNhL35tYXJpbmEvTmV3d2ViL190aGVt ZXMvYmxlbmRzL2JsZWJ1bDFhLmdpZiIgXCogTUVSR0VGT1JNQVRJTkVUIBQBFQd0aXRsZSBvZiB0 aGUgcGFwZXIgBwcTIElOQ0xVREVQSUNUVVJFICJodHRwOi8vd3d3LmNwc2MudWNhbGdhcnkuY2Ev fm1hcmluYS9OZXd3ZWIvX3RoZW1lcy9ibGVuZHMvYmxlYnVsMWEuZ2lmIiBcKiBNRVJHRUZPUk1B VElORVQgFAEVB05hbWUsIGFmZmlsaWF0aW9uLCBwb3N0YWwgYWRkcmVzcywgRS1tYWlsIGFkZHJl c3MsIHRlbGVwaG9uZSBudW1iZXIsIGFuZCBmYXggbnVtYmVyIGZvciBlYWNoIGF1dGhvciAHBxMg SU5DTFVERVBJQ1RVUkUgImh0dHA6Ly93d3cuY3BzYy51Y2FsZ2FyeS5jYS9+bWFyaW5hL05ld3dl Yi9fdGhlbWVzL2JsZW5kcy9ibGVidWwxYS5naWYiIFwqIE1FUkdFRk9STUFUSU5FVCAUARUHTmFt ZSBvZiB0aGUgYXV0aG9yIHdobyB3aWxsIGJlIHByZXNlbnRpbmcgdGhlIHBhcGVyIChpZiBhY2Nl cHRlZCkHBxMgSU5DTFVERVBJQ1RVUkUgImh0dHA6Ly93d3cuY3BzYy51Y2FsZ2FyeS5jYS9+bWFy aW5hL05ld3dlYi9fdGhlbWVzL2JsZW5kcy9ibGVidWwxYS5naWYiIFwqIE1FUkdFRk9STUFUSU5F VCAUARUHQSBtYXhpbXVtIG9mIDUga2V5d29yZHMHBxMgSU5DTFVERVBJQ1RVUkUgImh0dHA6Ly93 d3cuY3BzYy51Y2FsZ2FyeS5jYS9+bWFyaW5hL05ld3dlYi9fdGhlbWVzL2JsZW5kcy9ibGVidWwx YS5naWYiIFwqIE1FUkdFRk9STUFUSU5FVCAUARUHMiBub21pbmF0ZWQgcmVmZXJlZXMgYW5kIGNv bnRhY3QgaW5mb3JtYXRpb24gb2YgYWxsIG5vbWluYXRlZCByZWZlcmVlcyAHB1Byb2NlZWRpbmdz IA1UaGUgY29uZmVyZW5jZSBwcm9jZWVkaW5ncyB3aWxsIGJlIHB1Ymxpc2hlZCBieSBDU1JFQSBQ cmVzcyAoSVNCTikgaW4gaGFyZGNvcHkuIFRoZSBwcm9jZWVkaW5ncyB3aWxsIGJlIGF2YWlsYWJs ZSBhdCB0aGUgY29uZmVyZW5jZXMgc2l0ZS4gU29tZSBhY2NlcHRlZCBwYXBlcnMgd2lsbCBhbHNv IGJlIGNvbnNpZGVyZWQgZm9yIGpvdXJuYWwgcHVibGljYXRpb24uIEluIGFkZGl0aW9uIHRvIHRo ZSBoYXJkY29weSwgaXQgaXMgYWxzbyBwbGFubmVkIHRvIHB1Ymxpc2ggdGhlIHBhcGVycyBvbiBh IENELiANDQ0NSW1wb3J0YW50IERhdGVzDRMgSU5DTFVERVBJQ1RVUkUgImh0dHA6Ly93d3cuY3Bz Yy51Y2FsZ2FyeS5jYS9+bWFyaW5hL05ld3dlYi9fdGhlbWVzL2JsZW5kcy9ibGVidWwxYS5naWYi IFwqIE1FUkdFRk9STUFUSU5FVCAUARUHTWFyY2ggMTMsIDIwMDEgKFRodXJzZGF5KTogRHJhZnQg cGFwZXJzIChhYm91dCA0IHRvIDUgcGFnZXMpIGR1ZQcHEyBJTkNMVURFUElDVFVSRSAiaHR0cDov L3d3dy5jcHNjLnVjYWxnYXJ5LmNhL35tYXJpbmEvTmV3d2ViL190aGVtZXMvYmxlbmRzL2JsZWJ1 bDFhLmdpZiIgXCogTUVSR0VGT1JNQVRJTkVUIBQBFQdBcHJpbCAyLCAyMDAxIChNb25kYXkpIDog Tm90aWZpY2F0aW9uIG9mIGFjY2VwdGFuY2UHBxMgSU5DTFVERVBJQ1RVUkUgImh0dHA6Ly93d3cu Y3BzYy51Y2FsZ2FyeS5jYS9+bWFyaW5hL05ld3dlYi9fdGhlbWVzL2JsZW5kcy9ibGVidWwxYS5n aWYiIFwqIE1FUkdFRk9STUFUSU5FVCAUARUHTWF5IDEsIDIwMDEgKFR1ZXNkYXkpIDogQ2FtZXJh LVJlYWR5IHBhcGVycyBhbmQgUHJlcmVnaXN0cmF0aW9uIGR1ZQcHEyBJTkNMVURFUElDVFVSRSAi aHR0cDovL3d3dy5jcHNjLnVjYWxnYXJ5LmNhL35tYXJpbmEvTmV3d2ViL190aGVtZXMvYmxlbmRz L2JsZWJ1bDFhLmdpZiIgXCogTUVSR0VGT1JNQVRJTkVUIBQBFQdKdW5lIDI1IC0gMjgsIDIwMDEg OiBQRFBUQScyMDAxBwdDb250YWN0IEluZm9ybWF0aW9uDUZvciBhbGwgcXVlc3Rpb25zIHJlbGF0 ZWQgdG8gVGVjaG5pY2FsIFNlc3Npb24gb24gQXBwbGllZCBQYXJhbGxlbCBBbGdvcml0aG1zIHBs ZWFzZSBjb250YWN0IBMgSFlQRVJMSU5LICJtYWlsdG86Y2p0YW5AYWNtLm9yZyIgFEMuIEouIEtl bm5ldGggVGFuFSANQWRkcmVzczogU2Nob29sIG9mIENvbXB1dGVyIFNjaWVuY2UgC1RoZSBRdWVl bidzIFVuaXZlcnNpdHkgb2YgQmVsZmFzdCALQmVsZmFzdCBCVDcgMU5OIAtVbml0ZWQgS2luZ2Rv bQtUZWxlcGhvbmU6IDQ0LTI4OS0wMjctNDYzNiALRmFjc2ltaWxlOiA0NC0yODktMDY4LTM4OTAN DW9yIBMgSFlQRVJMSU5LICJtYWlsdG86bWFyaW5hQGNwc2MudWNhbGdhcnkuY2EiIBRNLiBMLiBH YXZyaWxvdmEVIA0NQWRkcmVzczogRGVwYXJ0bWVudCBvZiBDb21wdXRlciBTY2llbmNlC1VuaXZl cnNpdHkgb2YgQ2FsZ2FyeQsyNTAwIFVuaXZlcnNpdHkgRHJpdmUgTi5XLgtDYWxnYXJ5LCBBQiAL Q2FuYWRhIFQyTiAxTjQLVGVsZXBob25lOiAxLTQwMy0yMjAtNTEwNQtGYWNzaW1pbGU6IDEtNDAz LTI4NC00NzA3DQ1PciBWLk4uIEFsZXhhbmRyb3YNDUFkZHJlc3M6IEhpZ2ggUGVyZm9ybWFuY2Ug Q29tcHV0aW5nIENlbnRlcgtVbml2ZXJzaXR5IG9mIFJlYWRpbmcLUmVhZGluZyBSRzYgNkFZC1Vu aXRlZCBLaW5nZG9tC1RlbGVwaG9uZTogNDQtMTE4LTkzMS02NzIyC0ZhY3NpbWlsZTogNDQtMTE4 LTk3NS0xOTk0DQ0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAQAABUEAAAWBAAAMgQAADMEAABH BAAASAQAAK0EAACuBAAArwQAAOYEAADnBAAA7wQAAPAEAAAVBQAAFgUAAHcFAAB6BQAAxwUAAMgF AADJBQAA+gUAAPsFAAAMBgAADQYAADQGAAA1BgAANgYAAHgGAAB5BgAAkAYAAJEGAACwBgAAsQYA ALIGAADzBgAA9AYAAA0HAAAOBwAATAcAAE8HAABYBwAAMgsAAEQLAACQCwAAkQsAAP0LAAAADAAA AQwAABUMAAAWDAAAFwwAABgMAACEDAAAhQwAAPbx6PH28d/x0fbRytH28cG26ACsp6ykrKcArKes pKynAKynrKSspwCnAKcAnwCfkvEAjZ8AnwAAAAAAAAAACENKFABhShQAABlCKgFPSgQAUEoEAFFK BABeSgQAcGgAAAAACQNqAAAAAFUIAQQwSg8AAAlCKgJwaAAA/wASA2oAAAAAQioCVQgBcGgAAP8A ABRDShwAT0oCAFFKAgBeSgIAYUoUAAARQioCQ0ocAGFKFABwaAAA/wAMMEoPAE9KAwBRSgMAABoD agAAAABCKgJPSgMAUUoDAFUIAXBoAAD/AAARQioPT0oDAFFKAwBwaGYzmQARQioGT0oDAFFKAwBw aJkzMwAIT0oDAFFKAwAAEUIqAk9KAwBRSgMAcGgAAP8AADYABAAAFgQAADMEAABIBAAArgQAABYF AABABQAAdwUAAHoFAAC3BQAAyAUAADUGAACxBgAATQcAAE8HAABZBwAAMgsAAEULAACQCwAAAQwA ABYMAAD6AAAAAAAAAAAAAAAA+gAAAAAAAAAAAAAAAPUAAAAAAAAAAAAAAAD6AAAAAAAAAAAAAAAA 9QAAAAAAAAAAAAAAAOwAAAAAAAAAAAAAAADsAAAAAAAAAAAAAAAA5gAAAAAAAAAAAAAAAPUAAAAA AAAAAAAAAAD1AAAAAAAAAAAAAAAA4QAAAAAAAAAAAAAAAOEAAAAAAAAAAAAAAADhAAAAAAAAAAAA AAAA2AAAAAAAAAAAAAAAANYAAAAAAAAAAAAAAADYAAAAAAAAAAAAAAAA1gAAAAAAAAAAAAAAANgA AAAAAAAAAAAAAADQAAAAAAAAAAAAAAAAxgAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACRAAFKRaABYkAUlmAQAAAFwkAAYAABYk AUlmAQAAAAABAwAACBAAE6QAABSkAABbJABcJAAABAQAAyQBYSQBBgAANyQAOCQASCQACQAAAyQB NyQAOCQASCQAYSQBAAQDAAMkAWEkAQAEAgADJAFhJAEAFAAEAADmJQAA/QAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABAQAAQEBFgwAABcMAACIDAAAmQwAAJoMAAALDQAA Hw0AACANAACRDQAAqg0AAKsNAAAcDgAALw4AADAOAAChDgAAxw4AAMgOAAA5DwAARw8AAEgPAAC4 DAIAAAAAAAAAAAAAsgAAAAAAAAAAAAAAAKgAAAAAAAAAAAAAAAC4GAIAAAAAAAAAAAAAsgAAAAAA AAAAAAAAAKgAAAAAAAAAAAAAAAC4LAIAAAAAAAAAAAAAsgAAAAAAAAAAAAAAAKgAAAAAAAAAAAAA AAC4FAIAAAAAAAAAAAAAsgAAAAAAAAAAAAAAAKgAAAAAAAAAAAAAAAC4YAIAAAAAAAAAAAAAsgAA AAAAAAAAAAAAAKgAAAAAAAAAAAAAAAC4AAIAAAAAAAAAAAAAsgAAAAAAAAAAAAAAAKgAAAAAAAAA AAAAAAC47AEAAAAAAAAAAAAAAAAAAAAAAAAAAAkQABSkWgAWJAFJZgEAAABcJAAGAAAWJAFJZgEA AAAARgAAFiQBFyQBSWYBAAAACNYwAALx//AAzyEABnYCAAAAAAAAAAAAAAAAAAAAAAAEiBMAAAAA AAAAAAAAAAAAAAAAFPYCiBMVNgEa1ggAAAD/AAAA/xvWCAAAAP8AAAD/HNYIAAAA/wAAAP8d1ggA AAD/AAAA/zPWBgABDwMAADTWBgABDwMAAGH2AwAAABOFDAAAhgwAAIcMAACIDAAAmAwAAJkMAACa DAAAmwwAAAcNAAAIDQAACQ0AAAoNAAALDQAAHg0AAB8NAAAgDQAAIQ0AAI0NAACODQAAjw0AAJAN AACRDQAAqQ0AAKoNAACrDQAArA0AABgOAAAZDgAAGg4AABsOAAAcDgAALg4AAC8OAAAwDgAAMQ4A AJ0OAACeDgAAnw4AAKAOAAChDgAAxg4AAMcOAADIDgAAyQ4AADUPAAA2DwAANw8AADgPAAA5DwAA Rg8AAEcPAABIDwAASQ8AALUPAAC2DwAAtw8AALgPAAC5DwAAwQ8AAMIPAADDDwAAxA8AADAQAAAx EAAAMhAAADMQAAA0EAAARxAAAEgQAABJEAAAShAAALYQAAC3EAAA+vXo4wDe9QD12fXo4wDe9QD1 1PXo4wDe9QD1z/Xo4wDe9QD1yvXo4wDe9QD1xfXo4wDe9QD1wPXo4wDe9QD1u/Xo4wDe9QD1AAAA AAAAAAAAAAkDaqgZAABVCAEJA2pzFgAAVQgBCQNqPhMAAFUIAQkDagkQAABVCAEJA2rUDAAAVQgB CQNqnwkAAFUIAQkDamoGAABVCAEIQ0oUAGFKFAAACE9KAwBRSgMAABlCKgFPSgQAUEoEAFFKBABe SgQAcGgAAAAACQNqAAAAAFUIAQkDajUDAABVCAEASEgPAAC5DwAAwg8AAMMPAAA0EAAASBAAAEkQ AAC6EAAA4hAAAOMQAABUEQAArhEAAK8RAAAgEgAANBIAADUSAADgEgAA+RIAAMwTAAD5AAAAAAAA AAAAAAAA7wAAAAAAAAAAAAAAAKgYAgAAAAAAAAAAAAD5AAAAAAAAAAAAAAAA7wAAAAAAAAAAAAAA AKhoAgAAAAAAAAAAAAD5AAAAAAAAAAAAAAAA7wAAAAAAAAAAAAAAAKgwAwAAAAAAAAAAAAD5AAAA AAAAAAAAAAAA7wAAAAAAAAAAAAAAAKgYAgAAAAAAAAAAAAD5AAAAAAAAAAAAAAAA7wAAAAAAAAAA AAAAAKgAAAAAAAAAAAAAAACmAAAAAAAAAAAAAAAApAAAAAAAAAAAAAAAAJsAAAAAAAAAAAAAAAAA CBAAE6QAABSkAABbJABcJAAAAQMAAAEAAABGAAAWJAEXJAFJZgEAAAAI1jAAAvH/8ADPIQAGdgIA AAAAAAAAAAAAAAAAAAAAAASIEwAAAAAAAAAAAAAAAAAAAAAU9gKIExU2ARrWCAAAAP8AAAD/G9YI AAAA/wAAAP8c1ggAAAD/AAAA/x3WCAAAAP8AAAD/M9YGAAEPAwAANNYGAAEPAwAAYfYDAAAACRAA FKRaABYkAUlmAQAAAFwkAAYAABYkAUlmAQAAAAAStxAAALgQAAC5EAAAuhAAAOEQAADiEAAA4xAA AOQQAABQEQAAUREAAFIRAABTEQAAVBEAAK0RAACuEQAArxEAALARAAAcEgAAHRIAAB4SAAAfEgAA IBIAADMSAAA0EgAANRIAAOASAAD4EgAAuBUAAMkVAACPFwAAkBcAAPwXAAD9FwAA/hcAAP8XAAAA GAAAEBgAABEYAAASGAAAExgAAH8YAACAGAAAgRgAAIIYAACDGAAAjBgAAI0YAACOGAAAjxgAAPsY AAD8GAAA/RgAAP4YAAD/GAAAJhkAACcZAAAoGQAAKRkAAJUZAACWGQAAlxkAAJgZAACZGQAA7hkA AO8ZAADwGQAAzBsAAM0bAADOGwAAOhwAADscAAD69ejjAN71APXZ9ejjAN71APXU9ejjAN7jy+PL 4/UA9cb16OMA3vUA9cH16OMA3vUA9bz16OMA3vUA9bf16OMA3uMA9QD1AAAAAAAAAAAAAAAACQNq GzAAAFUIAQkDauYsAABVCAEJA2qxKQAAVQgBCQNqfCYAAFUIARFCKgJPSgMAUUoDAHBoAAD/AAkD akcjAABVCAEJA2oSIAAAVQgBCENKFABhShQAAAhPSgMAUUoDAAAZQioBT0oEAFBKBABRSgQAXkoE AHBoAAAAAAkDagAAAABVCAEJA2rdHAAAVQgBAEbMEwAAwhQAALgVAADKFQAA4RYAAI8XAAAAGAAA ERgAABIYAACDGAAAjRgAAI4YAAD/GAAAJxkAACgZAACZGQAA7xkAAPAZAACVGwAA9gAAAAAAAAAA AAAAAPYAAAAAAAAAAAAAAAD0AAAAAAAAAAAAAAAA9gAAAAAAAAAAAAAAAPYAAAAAAAAAAAAAAADu AAAAAAAAAAAAAAAA5AAAAAAAAAAAAAAAAJ3wAQAAAAAAAAAAAADuAAAAAAAAAAAAAAAA5AAAAAAA AAAAAAAAAJ1oAgAAAAAAAAAAAADuAAAAAAAAAAAAAAAA5AAAAAAAAAAAAAAAAJ0gAwAAAAAAAAAA AADuAAAAAAAAAAAAAAAA5AAAAAAAAAAAAAAAAJ0AAAAAAAAAAAAAAAD2AAAAAAAAAAAAAAAAAAAA AABGAAAWJAEXJAFJZgEAAAAI1jAAAvH/8ADPIQAGdgIAAAAAAAAAAAAAAAAAAAAAAASIEwAAAAAA AAAAAAAAAAAAAAAU9gKIExU2ARrWCAAAAP8AAAD/G9YIAAAA/wAAAP8c1ggAAAD/AAAA/x3WCAAA AP8AAAD/M9YGAAEPAwAANNYGAAEPAwAAYfYDAAAACRAAFKRaABYkAUlmAQAAAFwkAAYAABYkAUlm AQAAAAABAwAACBAAE6QAABSkAABbJABcJAAAEpUbAADNGwAAPhwAAFIcAABTHAAAxBwAACkdAAAq HQAAmx0AAN0dAADeHQAATx4AAGceAABoHgAA2R4AACEfAAAiHwAALx8AAFAgAAD2AAAAAAAAAAAA AAAA8AAAAAAAAAAAAAAAAOYAAAAAAAAAAAAAAACfXAMAAAAAAAAAAAAA8AAAAAAAAAAAAAAAAOYA AAAAAAAAAAAAAACf0AIAAAAAAAAAAAAA8AAAAAAAAAAAAAAAAOYAAAAAAAAAAAAAAACfKAIAAAAA AAAAAAAA8AAAAAAAAAAAAAAAAOYAAAAAAAAAAAAAAACf6AIAAAAAAAAAAAAA8AAAAAAAAAAAAAAA AOYAAAAAAAAAAAAAAACfAAAAAAAAAAAAAAAAnQAAAAAAAAAAAAAAAPYAAAAAAAAAAAAAAAAAAAAA AAEDAABGAAAWJAEXJAFJZgEAAAAI1jAAAvH/8ADPIQAGdgIAAAAAAAAAAAAAAAAAAAAAAASIEwAA AAAAAAAAAAAAAAAAAAAU9gKIExU2ARrWCAAAAP8AAAD/G9YIAAAA/wAAAP8c1ggAAAD/AAAA/x3W CAAAAP8AAAD/M9YGAAEPAwAANNYGAAEPAwAAYfYDAAAACRAAFKRaABYkAUlmAQAAAFwkAAYAABYk AUlmAQAAAAAIEAATpAAAFKQAAFskAFwkAAASOxwAADwcAAA9HAAAPhwAAFEcAABSHAAAUxwAAFQc AADAHAAAwRwAAMIcAADDHAAAxBwAACgdAAApHQAAKh0AACsdAACXHQAAmB0AAJkdAACaHQAAmx0A ANwdAADdHQAA3h0AAN8dAABLHgAATB4AAE0eAABOHgAATx4AAGYeAABnHgAAaB4AAGkeAADVHgAA 1h4AANceAADYHgAA2R4AACAfAAAhHwAAIh8AAC4fAABTIAAAYiAAAGMgAABkIAAA0CAAANEgAADS IAAA0yAAANQgAAAUIQAAFSEAABYhAAAXIQAAgyEAAIQhAACFIQAAhiEAAIchAAC6IQAAuyEAALwh AAC9IQAAKSIAACoiAAArIgAALCIAAC0iAAD69ejjAN71APXZ9ejjAN71APXU9ejjAN71APXP9ejj AN71APXK9ejjAN7B48Hj9QD1vPXo4wDe9QD1t/Xo4wDe9QD1svXoAAAJA2rDSQAAVQgBCQNqjkYA AFUIAQkDallDAABVCAERQioCT0oDAFFKAwBwaAAA/wAJA2okQAAAVQgBCQNq7zwAAFUIAQkDaro5 AABVCAEJA2qFNgAAVQgBCENKFABhShQAAAhPSgMAUUoDAAAZQioBT0oEAFBKBABRSgQAXkoEAHBo AAAAAAkDagAAAABVCAEJA2pQMwAAVQgBAEZQIAAAUSAAAFIgAABTIAAAYyAAANQgAAAVIQAAFiEA AIchAAC7IQAAvCEAAC0iAABxIgAAciIAAOMiAAADIwAABCMAABgjAACtIwAA9gAAAAAAAAAAAAAA APYAAAAAAAAAAAAAAAD2AAAAAAAAAAAAAAAA9AAAAAAAAAAAAAAAAO4AAAAAAAAAAAAAAADkAAAA AAAAAAAAAAAAnZgCAAAAAAAAAAAAAO4AAAAAAAAAAAAAAADkAAAAAAAAAAAAAAAAndgCAAAAAAAA AAAAAO4AAAAAAAAAAAAAAADkAAAAAAAAAAAAAAAAnUgCAAAAAAAAAAAAAO4AAAAAAAAAAAAAAADk AAAAAAAAAAAAAAAAnQAAAAAAAAAAAAAAAPQAAAAAAAAAAAAAAACbAAAAAAAAAAAAAAAAAAEAAABG AAAWJAEXJAFJZgEAAAAI1jAAAvH/8ADPIQAGdgIAAAAAAAAAAAAAAAAAAAAAAASIEwAAAAAAAAAA AAAAAAAAAAAU9gKIExU2ARrWCAAAAP8AAAD/G9YIAAAA/wAAAP8c1ggAAAD/AAAA/x3WCAAAAP8A AAD/M9YGAAEPAwAANNYGAAEPAwAAYfYDAAAACRAAFKRaABYkAUlmAQAAAFwkAAYAABYkAUlmAQAA AAABAwAACBAAE6QAABSkAABbJABcJAAAEi0iAABwIgAAcSIAAHIiAABzIgAA3yIAAOAiAADhIgAA 4iIAAOMiAAACIwAAAyMAAAQjAAAXIwAAdSMAAHYjAACYIwAAmSMAAKojAACrIwAAUCQAAFEkAAB9 JAAAfiQAAI0kAACOJAAA5SUAAOYlAAD7APbxAPHs8d/7APbW+837zcbN+837zcbN+wAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAwwSg8AT0oDAFFKAwAAEQNqAAAAAE9KAwBRSgMAVQgBEUIq Ak9KAwBRSgMAcGgAAP8AGUIqAU9KBABQSgQAUUoEAF5KBABwaAAAAAAJA2r4TAAAVQgBCQNqAAAA AFUIAQhDShQAYUoUAAAIT0oDAFFKAwAbrSMAAEwkAABNJAAAkCQAAJEkAAA6JQAAOyUAAE4lAABP JQAA5SUAAOYlAAD2AAAAAAAAAAAAAAAA9AAAAAAAAAAAAAAAAPQAAAAAAAAAAAAAAAD2AAAAAAAA AAAAAAAA9gAAAAAAAAAAAAAAAPYAAAAAAAAAAAAAAAD2AAAAAAAAAAAAAAAA9gAAAAAAAAAAAAAA APYAAAAAAAAAAAAAAAD0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AQAAAAgQABOkAAAUpAAAWyQAXCQAAAogADGQaAEfsNAvILDgPSGwCAcisAgHI5CgBSSQoAUlsAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAADUDAABEAGQAAAAAAAAAAAAAAAAAAAAAAAAAAADhAOEA6APo AwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADwAE8N4AAACyBArwCAAAAA4EAAAACgAA cwAL8LoAAAAEQQIAAAAFwY4AAAAGAQIAAAD/AQAACACBwwIAAACEA7HjAQCGA7HjAQBoAHQAdABw ADoALwAvAHcAdwB3AC4AYwBwAHMAYwAuAHUAYwBhAGwAZwBhAHIAeQAuAGMAYQAvAH4AbQBhAHIA aQBuAGEALwBOAGUAdwB3AGUAYgAvAF8AdABoAGUAbQBlAHMALwBiAGwAZQBuAGQAcwAvAGIAbABl AGIAdQBsADEAYQAuAGcAaQBmAAAAAAAAABDwBAAAAAAAAIBiAAfwAwIAAAYGpVD+CYJAXXC4OFXX dwf8EP8A3wEAAAEAAABEAAAAAABSAQBuHvDXAQAApVD+CYJAXXC4OFXXdwf8EP+JUE5HDQoaCgAA AA1JSERSAAAADwAAAA8IAwAAAAwIZXgAAAABc1JHQgCuzhzpAAAAzFBMVEX/99jAwMD/0BP/1Cf/ 2Dv/32IAAABSUf94eP+Mi/+fnv/Fxf//8LD/88QFBP8sK///9MT/+Nj/77D/88X/6In/8LH/2tr/ v7//sbH/o6P/h4f/eXn/1zv/4GL/z8//s7P/pqb/mJf/xMT/qKf/mpr/jIz/cXD/YmL/ra3/kZL/ hIP/dXb/Wlr/TEz/oqL/hob/eHf/amr/Tk7/QUD/lpb/enr/bW3/Xl//0BSfn//Gxf95d/+Li/// 6Ir/54l5eP94d/9SUv8sKv8rK/9YtRY2AAAADGNtUFBKQ21wMDcxMgIBAQaKuhTOAAAAAnRSTlP/ AOW3MEoAAACCSURBVBiVXc89C4IAAARQH9SYY+DS0NQUDUZGPz8hKnBramqIcAsElSRpKPu67cEN dwQ/0bnffEyUC9WFpxd7UZ5kOoMk67l+OWy113efsFYIxLCP5ItDUwhMwVFFfLcxAac4tdxSGoNL nILSCOevvUNQzNeSndnmtX+gWt1kyv8/D9u1KiRgpQUWAAAAAElFTkSuQmCCNQMAAEQAZAAAAAAA AAAAAAAAAAAAAAAAAAAAAOEA4QDoA+gDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP AATw3gAAALIECvAIAAAADwQAAAAKAABzAAvwugAAAARBAwAAAAXBjgAAAAYBAgAAAP8BAAAIAIHD AgAAAIQDseMBAIYDseMBAGgAdAB0AHAAOgAvAC8AdwB3AHcALgBjAHAAcwBjAC4AdQBjAGEAbABn AGEAcgB5AC4AYwBhAC8AfgBtAGEAcgBpAG4AYQAvAE4AZQB3AHcAZQBiAC8AXwB0AGgAZQBtAGUA cwAvAGIAbABlAG4AZABzAC8AYgBsAGUAYgB1AGwAMQBhAC4AZwBpAGYAAAAAAAAAEPAEAAAAAQAA gGIAB/ADAgAABgalUP4JgkBdcLg4Vdd3B/wQ/wDfAQAAAQAAAHkDAAAAAFIBAG4e8NcBAAClUP4J gkBdcLg4Vdd3B/wQ/4lQTkcNChoKAAAADUlIRFIAAAAPAAAADwgDAAAADAhleAAAAAFzUkdCAK7O HOkAAADMUExURf/32MDAwP/QE//UJ//YO//fYgAAAFJR/3h4/4yL/5+e/8XF///wsP/zxAUE/ywr ///0xP/42P/vsP/zxf/oif/wsf/a2v+/v/+xsf+jo/+Hh/95ef/XO//gYv/Pz/+zs/+mpv+Yl//E xP+op/+amv+MjP9xcP9iYv+trf+Rkv+Eg/91dv9aWv9MTP+iov+Ghv94d/9qav9OTv9BQP+Wlv96 ev9tbf9eX//QFJ+f/8bF/3l3/4uL///oiv/niXl4/3h3/1JS/ywq/ysr/1i1FjYAAAAMY21QUEpD bXAwNzEyAgEBBoq6FM4AAAACdFJOU/8A5bcwSgAAAIJJREFUGJVdzz0LggAABFAf1Jhj4NLQ1BQN RkY/PyEqcGtqaohwCwSVJGko+7rtwQ13BD/Rud98TJQL1YWnF3tRnmQ6gyTruX45bLXXd5+wVgjE sI/ki0NTCEzBUUV8tzEBpzi13FIag0ucgtII56+9Q1DM15Kd2ea1f6Ba3WTK/z8P27UqJGClBRYA AAAASUVORK5CYII1AwAARABkAAAAAAAAAAAAAAAAAAAAAAAAAAAA4QDhAOgD6AMAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8ABPDeAAAAsgQK8AgAAAAQBAAAAAoAAHMAC/C6AAAABEEE AAAABcGOAAAABgECAAAA/wEAAAgAgcMCAAAAhAOx4wEAhgOx4wEAaAB0AHQAcAA6AC8ALwB3AHcA dwAuAGMAcABzAGMALgB1AGMAYQBsAGcAYQByAHkALgBjAGEALwB+AG0AYQByAGkAbgBhAC8ATgBl AHcAdwBlAGIALwBfAHQAaABlAG0AZQBzAC8AYgBsAGUAbgBkAHMALwBiAGwAZQBiAHUAbAAxAGEA LgBnAGkAZgAAAAAAAAAQ8AQAAAACAACAYgAH8AMCAAAGBqVQ/gmCQF1wuDhV13cH/BD/AN8BAAAB AAAArgYAAAAAUgEAbh7w1wEAAKVQ/gmCQF1wuDhV13cH/BD/iVBORw0KGgoAAAANSUhEUgAAAA8A AAAPCAMAAAAMCGV4AAAAAXNSR0IArs4c6QAAAMxQTFRF//fYwMDA/9AT/9Qn/9g7/99iAAAAUlH/ eHj/jIv/n57/xcX///Cw//PEBQT/LCv///TE//jY/++w//PF/+iJ//Cx/9ra/7+//7Gx/6Oj/4eH /3l5/9c7/+Bi/8/P/7Oz/6am/5iX/8TE/6in/5qa/4yM/3Fw/2Ji/62t/5GS/4SD/3V2/1pa/0xM /6Ki/4aG/3h3/2pq/05O/0FA/5aW/3p6/21t/15f/9AUn5//xsX/eXf/i4v//+iK/+eJeXj/eHf/ UlL/LCr/Kyv/WLUWNgAAAAxjbVBQSkNtcDA3MTICAQEGiroUzgAAAAJ0Uk5T/wDltzBKAAAAgklE QVQYlV3PPQuCAAAEUB/UmGPg0tDUFA1GRj8/ISpwa2pqiHALBJUkaSj7uu3BDXcEP9G533xMlAvV hacXe1GeZDqDJOu5fjlstdd3n7BWCMSwj+SLQ1MITMFRRXy3MQGnOLXcUhqDS5yC0gjnr71DUMzX kp3Z5rV/oFrdZMr/Pw/btSokYKUFFgAAAABJRU5ErkJggjUDAABEAGQAAAAAAAAAAAAAAAAAAAAA AAAAAADhAOEA6APoAwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADwAE8N4AAACyBArw CAAAABEEAAAACgAAcwAL8LoAAAAEQQUAAAAFwY4AAAAGAQIAAAD/AQAACACBwwIAAACEA7HjAQCG A7HjAQBoAHQAdABwADoALwAvAHcAdwB3AC4AYwBwAHMAYwAuAHUAYwBhAGwAZwBhAHIAeQAuAGMA YQAvAH4AbQBhAHIAaQBuAGEALwBOAGUAdwB3AGUAYgAvAF8AdABoAGUAbQBlAHMALwBiAGwAZQBu AGQAcwAvAGIAbABlAGIAdQBsADEAYQAuAGcAaQBmAAAAAAAAABDwBAAAAAMAAIBiAAfwAwIAAAYG pVD+CYJAXXC4OFXXdwf8EP8A3wEAAAEAAADjCQAAAABSAQBuHvDXAQAApVD+CYJAXXC4OFXXdwf8 EP+JUE5HDQoaCgAAAA1JSERSAAAADwAAAA8IAwAAAAwIZXgAAAABc1JHQgCuzhzpAAAAzFBMVEX/ 99jAwMD/0BP/1Cf/2Dv/32IAAABSUf94eP+Mi/+fnv/Fxf//8LD/88QFBP8sK///9MT/+Nj/77D/ 88X/6In/8LH/2tr/v7//sbH/o6P/h4f/eXn/1zv/4GL/z8//s7P/pqb/mJf/xMT/qKf/mpr/jIz/ cXD/YmL/ra3/kZL/hIP/dXb/Wlr/TEz/oqL/hob/eHf/amr/Tk7/QUD/lpb/enr/bW3/Xl//0BSf n//Gxf95d/+Li///6Ir/54l5eP94d/9SUv8sKv8rK/9YtRY2AAAADGNtUFBKQ21wMDcxMgIBAQaK uhTOAAAAAnRSTlP/AOW3MEoAAACCSURBVBiVXc89C4IAAARQH9SYY+DS0NQUDUZGPz8hKnBramqI cAsElSRpKPu67cENdwQ/0bnffEyUC9WFpxd7UZ5kOoMk67l+OWy113efsFYIxLCP5ItDUwhMwVFF fLcxAac4tdxSGoNLnILSCOevvUNQzNeSndnmtX+gWt1kyv8/D9u1KiRgpQUWAAAAAElFTkSuQmCC NQMAAEQAZAAAAAAAAAAAAAAAAAAAAAAAAAAAAOEA4QDoA+gDAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAPAATw3gAAALIECvAIAAAAEgQAAAAKAABzAAvwugAAAARBBgAAAAXBjgAAAAYB AgAAAP8BAAAIAIHDAgAAAIQDseMBAIYDseMBAGgAdAB0AHAAOgAvAC8AdwB3AHcALgBjAHAAcwBj AC4AdQBjAGEAbABnAGEAcgB5AC4AYwBhAC8AfgBtAGEAcgBpAG4AYQAvAE4AZQB3AHcAZQBiAC8A XwB0AGgAZQBtAGUAcwAvAGIAbABlAG4AZABzAC8AYgBsAGUAYgB1AGwAMQBhAC4AZwBpAGYAAAAA AAAAEPAEAAAABAAAgGIAB/ADAgAABgalUP4JgkBdcLg4Vdd3B/wQ/wDfAQAAAQAAABgNAAAAAFIB AG4e8NcBAAClUP4JgkBdcLg4Vdd3B/wQ/4lQTkcNChoKAAAADUlIRFIAAAAPAAAADwgDAAAADAhl eAAAAAFzUkdCAK7OHOkAAADMUExURf/32MDAwP/QE//UJ//YO//fYgAAAFJR/3h4/4yL/5+e/8XF ///wsP/zxAUE/ywr///0xP/42P/vsP/zxf/oif/wsf/a2v+/v/+xsf+jo/+Hh/95ef/XO//gYv/P z/+zs/+mpv+Yl//ExP+op/+amv+MjP9xcP9iYv+trf+Rkv+Eg/91dv9aWv9MTP+iov+Ghv94d/9q av9OTv9BQP+Wlv96ev9tbf9eX//QFJ+f/8bF/3l3/4uL///oiv/niXl4/3h3/1JS/ywq/ysr/1i1 FjYAAAAMY21QUEpDbXAwNzEyAgEBBoq6FM4AAAACdFJOU/8A5bcwSgAAAIJJREFUGJVdzz0LggAA BFAf1Jhj4NLQ1BQNRkY/PyEqcGtqaohwCwSVJGko+7rtwQ13BD/Rud98TJQL1YWnF3tRnmQ6gyTr uX45bLXXd5+wVgjEsI/ki0NTCEzBUUV8tzEBpzi13FIag0ucgtII56+9Q1DM15Kd2ea1f6Ba3WTK /z8P27UqJGClBRYAAAAASUVORK5CYII1AwAARABkAAAAAAAAAAAAAAAAAAAAAAAAAAAA4QDhAOgD 6AMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8ABPDeAAAAsgQK8AgAAAATBAAAAAoA AHMAC/C6AAAABEEHAAAABcGOAAAABgECAAAA/wEAAAgAgcMCAAAAhAOx4wEAhgOx4wEAaAB0AHQA cAA6AC8ALwB3AHcAdwAuAGMAcABzAGMALgB1AGMAYQBsAGcAYQByAHkALgBjAGEALwB+AG0AYQBy AGkAbgBhAC8ATgBlAHcAdwBlAGIALwBfAHQAaABlAG0AZQBzAC8AYgBsAGUAbgBkAHMALwBiAGwA ZQBiAHUAbAAxAGEALgBnAGkAZgAAAAAAAAAQ8AQAAAAFAACAYgAH8AMCAAAGBqVQ/gmCQF1wuDhV 13cH/BD/AN8BAAABAAAATRAAAAAAUgEAbh7w1wEAAKVQ/gmCQF1wuDhV13cH/BD/iVBORw0KGgoA AAANSUhEUgAAAA8AAAAPCAMAAAAMCGV4AAAAAXNSR0IArs4c6QAAAMxQTFRF//fYwMDA/9AT/9Qn /9g7/99iAAAAUlH/eHj/jIv/n57/xcX///Cw//PEBQT/LCv///TE//jY/++w//PF/+iJ//Cx/9ra /7+//7Gx/6Oj/4eH/3l5/9c7/+Bi/8/P/7Oz/6am/5iX/8TE/6in/5qa/4yM/3Fw/2Ji/62t/5GS /4SD/3V2/1pa/0xM/6Ki/4aG/3h3/2pq/05O/0FA/5aW/3p6/21t/15f/9AUn5//xsX/eXf/i4v/ /+iK/+eJeXj/eHf/UlL/LCr/Kyv/WLUWNgAAAAxjbVBQSkNtcDA3MTICAQEGiroUzgAAAAJ0Uk5T /wDltzBKAAAAgklEQVQYlV3PPQuCAAAEUB/UmGPg0tDUFA1GRj8/ISpwa2pqiHALBJUkaSj7uu3B DXcEP9G533xMlAvVhacXe1GeZDqDJOu5fjlstdd3n7BWCMSwj+SLQ1MITMFRRXy3MQGnOLXcUhqD S5yC0gjnr71DUMzXkp3Z5rV/oFrdZMr/Pw/btSokYKUFFgAAAABJRU5ErkJggjUDAABEAGQAAAAA AAAAAAAAAAAAAAAAAAAAAADhAOEA6APoAwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA DwAE8N4AAACyBArwCAAAABQEAAAACgAAcwAL8LoAAAAEQQgAAAAFwY4AAAAGAQIAAAD/AQAACACB wwIAAACEA7HjAQCGA7HjAQBoAHQAdABwADoALwAvAHcAdwB3AC4AYwBwAHMAYwAuAHUAYwBhAGwA ZwBhAHIAeQAuAGMAYQAvAH4AbQBhAHIAaQBuAGEALwBOAGUAdwB3AGUAYgAvAF8AdABoAGUAbQBl AHMALwBiAGwAZQBuAGQAcwAvAGIAbABlAGIAdQBsADEAYQAuAGcAaQBmAAAAAAAAABDwBAAAAAYA AIBiAAfwAwIAAAYGpVD+CYJAXXC4OFXXdwf8EP8A3wEAAAEAAACCEwAAAABSAQBuHvDXAQAApVD+ CYJAXXC4OFXXdwf8EP+JUE5HDQoaCgAAAA1JSERSAAAADwAAAA8IAwAAAAwIZXgAAAABc1JHQgCu zhzpAAAAzFBMVEX/99jAwMD/0BP/1Cf/2Dv/32IAAABSUf94eP+Mi/+fnv/Fxf//8LD/88QFBP8s K///9MT/+Nj/77D/88X/6In/8LH/2tr/v7//sbH/o6P/h4f/eXn/1zv/4GL/z8//s7P/pqb/mJf/ xMT/qKf/mpr/jIz/cXD/YmL/ra3/kZL/hIP/dXb/Wlr/TEz/oqL/hob/eHf/amr/Tk7/QUD/lpb/ enr/bW3/Xl//0BSfn//Gxf95d/+Li///6Ir/54l5eP94d/9SUv8sKv8rK/9YtRY2AAAADGNtUFBK Q21wMDcxMgIBAQaKuhTOAAAAAnRSTlP/AOW3MEoAAACCSURBVBiVXc89C4IAAARQH9SYY+DS0NQU DUZGPz8hKnBramqIcAsElSRpKPu67cENdwQ/0bnffEyUC9WFpxd7UZ5kOoMk67l+OWy113efsFYI xLCP5ItDUwhMwVFFfLcxAac4tdxSGoNLnILSCOevvUNQzNeSndnmtX+gWt1kyv8/D9u1KiRgpQUW AAAAAElFTkSuQmCCNQMAAEQAZAAAAAAAAAAAAAAAAAAAAAAAAAAAAOEA4QDoA+gDAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPAATw3gAAALIECvAIAAAAFQQAAAAKAABzAAvwugAAAARB CQAAAAXBjgAAAAYBAgAAAP8BAAAIAIHDAgAAAIQDseMBAIYDseMBAGgAdAB0AHAAOgAvAC8AdwB3 AHcALgBjAHAAcwBjAC4AdQBjAGEAbABnAGEAcgB5AC4AYwBhAC8AfgBtAGEAcgBpAG4AYQAvAE4A ZQB3AHcAZQBiAC8AXwB0AGgAZQBtAGUAcwAvAGIAbABlAG4AZABzAC8AYgBsAGUAYgB1AGwAMQBh AC4AZwBpAGYAAAAAAAAAEPAEAAAABwAAgGIAB/ADAgAABgalUP4JgkBdcLg4Vdd3B/wQ/wDfAQAA AQAAALcWAAAAAFIBAG4e8NcBAAClUP4JgkBdcLg4Vdd3B/wQ/4lQTkcNChoKAAAADUlIRFIAAAAP AAAADwgDAAAADAhleAAAAAFzUkdCAK7OHOkAAADMUExURf/32MDAwP/QE//UJ//YO//fYgAAAFJR /3h4/4yL/5+e/8XF///wsP/zxAUE/ywr///0xP/42P/vsP/zxf/oif/wsf/a2v+/v/+xsf+jo/+H h/95ef/XO//gYv/Pz/+zs/+mpv+Yl//ExP+op/+amv+MjP9xcP9iYv+trf+Rkv+Eg/91dv9aWv9M TP+iov+Ghv94d/9qav9OTv9BQP+Wlv96ev9tbf9eX//QFJ+f/8bF/3l3/4uL///oiv/niXl4/3h3 /1JS/ywq/ysr/1i1FjYAAAAMY21QUEpDbXAwNzEyAgEBBoq6FM4AAAACdFJOU/8A5bcwSgAAAIJJ REFUGJVdzz0LggAABFAf1Jhj4NLQ1BQNRkY/PyEqcGtqaohwCwSVJGko+7rtwQ13BD/Rud98TJQL 1YWnF3tRnmQ6gyTruX45bLXXd5+wVgjEsI/ki0NTCEzBUUV8tzEBpzi13FIag0ucgtII56+9Q1DM 15Kd2ea1f6Ba3WTK/z8P27UqJGClBRYAAAAASUVORK5CYII1AwAARABkAAAAAAAAAAAAAAAAAAAA AAAAAAAA4QDhAOgD6AMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8ABPDeAAAAsgQK 8AgAAAAWBAAAAAoAAHMAC/C6AAAABEEKAAAABcGOAAAABgECAAAA/wEAAAgAgcMCAAAAhAOx4wEA hgOx4wEAaAB0AHQAcAA6AC8ALwB3AHcAdwAuAGMAcABzAGMALgB1AGMAYQBsAGcAYQByAHkALgBj AGEALwB+AG0AYQByAGkAbgBhAC8ATgBlAHcAdwBlAGIALwBfAHQAaABlAG0AZQBzAC8AYgBsAGUA bgBkAHMALwBiAGwAZQBiAHUAbAAxAGEALgBnAGkAZgAAAAAAAAAQ8AQAAAAIAACAYgAH8AMCAAAG BqVQ/gmCQF1wuDhV13cH/BD/AN8BAAABAAAA7BkAAAAAUgEAbh7w1wEAAKVQ/gmCQF1wuDhV13cH /BD/iVBORw0KGgoAAAANSUhEUgAAAA8AAAAPCAMAAAAMCGV4AAAAAXNSR0IArs4c6QAAAMxQTFRF //fYwMDA/9AT/9Qn/9g7/99iAAAAUlH/eHj/jIv/n57/xcX///Cw//PEBQT/LCv///TE//jY/++w //PF/+iJ//Cx/9ra/7+//7Gx/6Oj/4eH/3l5/9c7/+Bi/8/P/7Oz/6am/5iX/8TE/6in/5qa/4yM /3Fw/2Ji/62t/5GS/4SD/3V2/1pa/0xM/6Ki/4aG/3h3/2pq/05O/0FA/5aW/3p6/21t/15f/9AU n5//xsX/eXf/i4v//+iK/+eJeXj/eHf/UlL/LCr/Kyv/WLUWNgAAAAxjbVBQSkNtcDA3MTICAQEG iroUzgAAAAJ0Uk5T/wDltzBKAAAAgklEQVQYlV3PPQuCAAAEUB/UmGPg0tDUFA1GRj8/ISpwa2pq iHALBJUkaSj7uu3BDXcEP9G533xMlAvVhacXe1GeZDqDJOu5fjlstdd3n7BWCMSwj+SLQ1MITMFR RXy3MQGnOLXcUhqDS5yC0gjnr71DUMzXkp3Z5rV/oFrdZMr/Pw/btSokYKUFFgAAAABJRU5ErkJg gjUDAABEAGQAAAAAAAAAAAAAAAAAAAAAAAAAAADhAOEA6APoAwAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAADwAE8N4AAACyBArwCAAAABcEAAAACgAAcwAL8LoAAAAEQQsAAAAFwY4AAAAG AQIAAAD/AQAACACBwwIAAACEA7HjAQCGA7HjAQBoAHQAdABwADoALwAvAHcAdwB3AC4AYwBwAHMA YwAuAHUAYwBhAGwAZwBhAHIAeQAuAGMAYQAvAH4AbQBhAHIAaQBuAGEALwBOAGUAdwB3AGUAYgAv AF8AdABoAGUAbQBlAHMALwBiAGwAZQBuAGQAcwAvAGIAbABlAGIAdQBsADEAYQAuAGcAaQBmAAAA AAAAABDwBAAAAAkAAIBiAAfwAwIAAAYGpVD+CYJAXXC4OFXXdwf8EP8A3wEAAAEAAAAhHQAAAABS AQBuHvDXAQAApVD+CYJAXXC4OFXXdwf8EP+JUE5HDQoaCgAAAA1JSERSAAAADwAAAA8IAwAAAAwI ZXgAAAABc1JHQgCuzhzpAAAAzFBMVEX/99jAwMD/0BP/1Cf/2Dv/32IAAABSUf94eP+Mi/+fnv/F xf//8LD/88QFBP8sK///9MT/+Nj/77D/88X/6In/8LH/2tr/v7//sbH/o6P/h4f/eXn/1zv/4GL/ z8//s7P/pqb/mJf/xMT/qKf/mpr/jIz/cXD/YmL/ra3/kZL/hIP/dXb/Wlr/TEz/oqL/hob/eHf/ amr/Tk7/QUD/lpb/enr/bW3/Xl//0BSfn//Gxf95d/+Li///6Ir/54l5eP94d/9SUv8sKv8rK/9Y tRY2AAAADGNtUFBKQ21wMDcxMgIBAQaKuhTOAAAAAnRSTlP/AOW3MEoAAACCSURBVBiVXc89C4IA AARQH9SYY+DS0NQUDUZGPz8hKnBramqIcAsElSRpKPu67cENdwQ/0bnffEyUC9WFpxd7UZ5kOoMk 67l+OWy113efsFYIxLCP5ItDUwhMwVFFfLcxAac4tdxSGoNLnILSCOevvUNQzNeSndnmtX+gWt1k yv8/D9u1KiRgpQUWAAAAAElFTkSuQmCCNQMAAEQAZAAAAAAAAAAAAAAAAAAAAAAAAAAAAOEA4QDo A+gDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPAATw3gAAALIECvAIAAAAGAQAAAAK AABzAAvwugAAAARBDAAAAAXBjgAAAAYBAgAAAP8BAAAIAIHDAgAAAIQDseMBAIYDseMBAGgAdAB0 AHAAOgAvAC8AdwB3AHcALgBjAHAAcwBjAC4AdQBjAGEAbABnAGEAcgB5AC4AYwBhAC8AfgBtAGEA cgBpAG4AYQAvAE4AZQB3AHcAZQBiAC8AXwB0AGgAZQBtAGUAcwAvAGIAbABlAG4AZABzAC8AYgBs AGUAYgB1AGwAMQBhAC4AZwBpAGYAAAAAAAAAEPAEAAAACgAAgGIAB/ADAgAABgalUP4JgkBdcLg4 Vdd3B/wQ/wDfAQAAAQAAAFYgAAAAAFIBAG4e8NcBAAClUP4JgkBdcLg4Vdd3B/wQ/4lQTkcNChoK AAAADUlIRFIAAAAPAAAADwgDAAAADAhleAAAAAFzUkdCAK7OHOkAAADMUExURf/32MDAwP/QE//U J//YO//fYgAAAFJR/3h4/4yL/5+e/8XF///wsP/zxAUE/ywr///0xP/42P/vsP/zxf/oif/wsf/a 2v+/v/+xsf+jo/+Hh/95ef/XO//gYv/Pz/+zs/+mpv+Yl//ExP+op/+amv+MjP9xcP9iYv+trf+R kv+Eg/91dv9aWv9MTP+iov+Ghv94d/9qav9OTv9BQP+Wlv96ev9tbf9eX//QFJ+f/8bF/3l3/4uL ///oiv/niXl4/3h3/1JS/ywq/ysr/1i1FjYAAAAMY21QUEpDbXAwNzEyAgEBBoq6FM4AAAACdFJO U/8A5bcwSgAAAIJJREFUGJVdzz0LggAABFAf1Jhj4NLQ1BQNRkY/PyEqcGtqaohwCwSVJGko+7rt wQ13BD/Rud98TJQL1YWnF3tRnmQ6gyTruX45bLXXd5+wVgjEsI/ki0NTCEzBUUV8tzEBpzi13FIa g0ucgtII56+9Q1DM15Kd2ea1f6Ba3WTK/z8P27UqJGClBRYAAAAASUVORK5CYII1AwAARABkAAAA AAAAAAAAAAAAAAAAAAAAAAAA4QDhAOgD6AMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AA8ABPDeAAAAsgQK8AgAAAAZBAAAAAoAAHMAC/C6AAAABEENAAAABcGOAAAABgECAAAA/wEAAAgA gcMCAAAAhAOx4wEAhgOx4wEAaAB0AHQAcAA6AC8ALwB3AHcAdwAuAGMAcABzAGMALgB1AGMAYQBs AGcAYQByAHkALgBjAGEALwB+AG0AYQByAGkAbgBhAC8ATgBlAHcAdwBlAGIALwBfAHQAaABlAG0A ZQBzAC8AYgBsAGUAbgBkAHMALwBiAGwAZQBiAHUAbAAxAGEALgBnAGkAZgAAAAAAAAAQ8AQAAAAL AACAYgAH8AMCAAAGBqVQ/gmCQF1wuDhV13cH/BD/AN8BAAABAAAAiyMAAAAAUgEAbh7w1wEAAKVQ /gmCQF1wuDhV13cH/BD/iVBORw0KGgoAAAANSUhEUgAAAA8AAAAPCAMAAAAMCGV4AAAAAXNSR0IA rs4c6QAAAMxQTFRF//fYwMDA/9AT/9Qn/9g7/99iAAAAUlH/eHj/jIv/n57/xcX///Cw//PEBQT/ LCv///TE//jY/++w//PF/+iJ//Cx/9ra/7+//7Gx/6Oj/4eH/3l5/9c7/+Bi/8/P/7Oz/6am/5iX /8TE/6in/5qa/4yM/3Fw/2Ji/62t/5GS/4SD/3V2/1pa/0xM/6Ki/4aG/3h3/2pq/05O/0FA/5aW /3p6/21t/15f/9AUn5//xsX/eXf/i4v//+iK/+eJeXj/eHf/UlL/LCr/Kyv/WLUWNgAAAAxjbVBQ SkNtcDA3MTICAQEGiroUzgAAAAJ0Uk5T/wDltzBKAAAAgklEQVQYlV3PPQuCAAAEUB/UmGPg0tDU FA1GRj8/ISpwa2pqiHALBJUkaSj7uu3BDXcEP9G533xMlAvVhacXe1GeZDqDJOu5fjlstdd3n7BW CMSwj+SLQ1MITMFRRXy3MQGnOLXcUhqDS5yC0gjnr71DUMzXkp3Z5rV/oFrdZMr/Pw/btSokYKUF FgAAAABJRU5ErkJggjUDAABEAGQAAAAAAAAAAAAAAAAAAAAAAAAAAADhAOEA6APoAwAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADwAE8N4AAACyBArwCAAAAAEEAAAACgAAcwAL8LoAAAAE QQEAAAAFwY4AAAAGAQIAAAD/AQAACACBwwIAAACEA7HjAQCGA7HjAQBoAHQAdABwADoALwAvAHcA dwB3AC4AYwBwAHMAYwAuAHUAYwBhAGwAZwBhAHIAeQAuAGMAYQAvAH4AbQBhAHIAaQBuAGEALwBO AGUAdwB3AGUAYgAvAF8AdABoAGUAbQBlAHMALwBiAGwAZQBuAGQAcwAvAGIAbABlAGIAdQBsADEA YQAuAGcAaQBmAAAAAAAAABDwBAAAAAAAAIBiAAfwAwIAAAYGpVD+CYJAXXC4OFXXdwf8EP8A3wEA AA0AAADAJgAAAABSAQBuHvDXAQAApVD+CYJAXXC4OFXXdwf8EP+JUE5HDQoaCgAAAA1JSERSAAAA DwAAAA8IAwAAAAwIZXgAAAABc1JHQgCuzhzpAAAAzFBMVEX/99jAwMD/0BP/1Cf/2Dv/32IAAABS Uf94eP+Mi/+fnv/Fxf//8LD/88QFBP8sK///9MT/+Nj/77D/88X/6In/8LH/2tr/v7//sbH/o6P/ h4f/eXn/1zv/4GL/z8//s7P/pqb/mJf/xMT/qKf/mpr/jIz/cXD/YmL/ra3/kZL/hIP/dXb/Wlr/ TEz/oqL/hob/eHf/amr/Tk7/QUD/lpb/enr/bW3/Xl//0BSfn//Gxf95d/+Li///6Ir/54l5eP94 d/9SUv8sKv8rK/9YtRY2AAAADGNtUFBKQ21wMDcxMgIBAQaKuhTOAAAAAnRSTlP/AOW3MEoAAACC SURBVBiVXc89C4IAAARQH9SYY+DS0NQUDUZGPz8hKnBramqIcAsElSRpKPu67cENdwQ/0bnffEyU C9WFpxd7UZ5kOoMk67l+OWy113efsFYIxLCP5ItDUwhMwVFFfLcxAac4tdxSGoNLnILSCOevvUNQ zNeSndnmtX+gWt1kyv8/D9u1KiRgpQUWAAAAAElFTkSuQmCCNQMAAEQAZAAAAAAAAAAAAAAAAAAA AAAAAAAAAOEA4QDoA+gDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPAATw3gAAALIE CvAIAAAAAgQAAAAKAABzAAvwugAAAARBAQAAAAXBjgAAAAYBAgAAAP8BAAAIAIHDAgAAAIQDseMB AIYDseMBAGgAdAB0AHAAOgAvAC8AdwB3AHcALgBjAHAAcwBjAC4AdQBjAGEAbABnAGEAcgB5AC4A YwBhAC8AfgBtAGEAcgBpAG4AYQAvAE4AZQB3AHcAZQBiAC8AXwB0AGgAZQBtAGUAcwAvAGIAbABl AG4AZABzAC8AYgBsAGUAYgB1AGwAMQBhAC4AZwBpAGYAAAAAAAAAEPAEAAAAAQAAgGIAB/ADAgAA BgalUP4JgkBdcLg4Vdd3B/wQ/wDfAQAADQAAAPUpAAAAAFIBAG4e8NcBAAClUP4JgkBdcLg4Vdd3 B/wQ/4lQTkcNChoKAAAADUlIRFIAAAAPAAAADwgDAAAADAhleAAAAAFzUkdCAK7OHOkAAADMUExU Rf/32MDAwP/QE//UJ//YO//fYgAAAFJR/3h4/4yL/5+e/8XF///wsP/zxAUE/ywr///0xP/42P/v sP/zxf/oif/wsf/a2v+/v/+xsf+jo/+Hh/95ef/XO//gYv/Pz/+zs/+mpv+Yl//ExP+op/+amv+M jP9xcP9iYv+trf+Rkv+Eg/91dv9aWv9MTP+iov+Ghv94d/9qav9OTv9BQP+Wlv96ev9tbf9eX//Q FJ+f/8bF/3l3/4uL///oiv/niXl4/3h3/1JS/ywq/ysr/1i1FjYAAAAMY21QUEpDbXAwNzEyAgEB Boq6FM4AAAACdFJOU/8A5bcwSgAAAIJJREFUGJVdzz0LggAABFAf1Jhj4NLQ1BQNRkY/PyEqcGtq aohwCwSVJGko+7rtwQ13BD/Rud98TJQL1YWnF3tRnmQ6gyTruX45bLXXd5+wVgjEsI/ki0NTCEzB UUV8tzEBpzi13FIag0ucgtII56+9Q1DM15Kd2ea1f6Ba3WTK/z8P27UqJGClBRYAAAAASUVORK5C YII1AwAARABkAAAAAAAAAAAAAAAAAAAAAAAAAAAA4QDhAOgD6AMAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAA8ABPDeAAAAsgQK8AgAAAADBAAAAAoAAHMAC/C6AAAABEEBAAAABcGOAAAA BgECAAAA/wEAAAgAgcMCAAAAhAOx4wEAhgOx4wEAaAB0AHQAcAA6AC8ALwB3AHcAdwAuAGMAcABz AGMALgB1AGMAYQBsAGcAYQByAHkALgBjAGEALwB+AG0AYQByAGkAbgBhAC8ATgBlAHcAdwBlAGIA LwBfAHQAaABlAG0AZQBzAC8AYgBsAGUAbgBkAHMALwBiAGwAZQBiAHUAbAAxAGEALgBnAGkAZgAA AAAAAAAQ8AQAAAACAACAYgAH8AMCAAAGBqVQ/gmCQF1wuDhV13cH/BD/AN8BAAANAAAAKi0AAAAA UgEAbh7w1wEAAKVQ/gmCQF1wuDhV13cH/BD/iVBORw0KGgoAAAANSUhEUgAAAA8AAAAPCAMAAAAM CGV4AAAAAXNSR0IArs4c6QAAAMxQTFRF//fYwMDA/9AT/9Qn/9g7/99iAAAAUlH/eHj/jIv/n57/ xcX///Cw//PEBQT/LCv///TE//jY/++w//PF/+iJ//Cx/9ra/7+//7Gx/6Oj/4eH/3l5/9c7/+Bi /8/P/7Oz/6am/5iX/8TE/6in/5qa/4yM/3Fw/2Ji/62t/5GS/4SD/3V2/1pa/0xM/6Ki/4aG/3h3 /2pq/05O/0FA/5aW/3p6/21t/15f/9AUn5//xsX/eXf/i4v//+iK/+eJeXj/eHf/UlL/LCr/Kyv/ WLUWNgAAAAxjbVBQSkNtcDA3MTICAQEGiroUzgAAAAJ0Uk5T/wDltzBKAAAAgklEQVQYlV3PPQuC AAAEUB/UmGPg0tDUFA1GRj8/ISpwa2pqiHALBJUkaSj7uu3BDXcEP9G533xMlAvVhacXe1GeZDqD JOu5fjlstdd3n7BWCMSwj+SLQ1MITMFRRXy3MQGnOLXcUhqDS5yC0gjnr71DUMzXkp3Z5rV/oFrd ZMr/Pw/btSokYKUFFgAAAABJRU5ErkJggjUDAABEAGQAAAAAAAAAAAAAAAAAAAAAAAAAAADhAOEA 6APoAwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADwAE8N4AAACyBArwCAAAAAQEAAAA CgAAcwAL8LoAAAAEQQEAAAAFwY4AAAAGAQIAAAD/AQAACACBwwIAAACEA7HjAQCGA7HjAQBoAHQA dABwADoALwAvAHcAdwB3AC4AYwBwAHMAYwAuAHUAYwBhAGwAZwBhAHIAeQAuAGMAYQAvAH4AbQBh AHIAaQBuAGEALwBOAGUAdwB3AGUAYgAvAF8AdABoAGUAbQBlAHMALwBiAGwAZQBuAGQAcwAvAGIA bABlAGIAdQBsADEAYQAuAGcAaQBmAAAAAAAAABDwBAAAAAMAAIBiAAfwAwIAAAYGpVD+CYJAXXC4 OFXXdwf8EP8A3wEAAA0AAABfMAAAAABSAQBuHvDXAQAApVD+CYJAXXC4OFXXdwf8EP+JUE5HDQoa CgAAAA1JSERSAAAADwAAAA8IAwAAAAwIZXgAAAABc1JHQgCuzhzpAAAAzFBMVEX/99jAwMD/0BP/ 1Cf/2Dv/32IAAABSUf94eP+Mi/+fnv/Fxf//8LD/88QFBP8sK///9MT/+Nj/77D/88X/6In/8LH/ 2tr/v7//sbH/o6P/h4f/eXn/1zv/4GL/z8//s7P/pqb/mJf/xMT/qKf/mpr/jIz/cXD/YmL/ra3/ kZL/hIP/dXb/Wlr/TEz/oqL/hob/eHf/amr/Tk7/QUD/lpb/enr/bW3/Xl//0BSfn//Gxf95d/+L i///6Ir/54l5eP94d/9SUv8sKv8rK/9YtRY2AAAADGNtUFBKQ21wMDcxMgIBAQaKuhTOAAAAAnRS TlP/AOW3MEoAAACCSURBVBiVXc89C4IAAARQH9SYY+DS0NQUDUZGPz8hKnBramqIcAsElSRpKPu6 7cENdwQ/0bnffEyUC9WFpxd7UZ5kOoMk67l+OWy113efsFYIxLCP5ItDUwhMwVFFfLcxAac4tdxS GoNLnILSCOevvUNQzNeSndnmtX+gWt1kyv8/D9u1KiRgpQUWAAAAAElFTkSuQmCCNQMAAEQAZAAA AAAAAAAAAAAAAAAAAAAAAAAAAOEA4QDoA+gDAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAPAATw3gAAALIECvAIAAAABQQAAAAKAABzAAvwugAAAARBAQAAAAXBjgAAAAYBAgAAAP8BAAAI AIHDAgAAAIQDseMBAIYDseMBAGgAdAB0AHAAOgAvAC8AdwB3AHcALgBjAHAAcwBjAC4AdQBjAGEA bABnAGEAcgB5AC4AYwBhAC8AfgBtAGEAcgBpAG4AYQAvAE4AZQB3AHcAZQBiAC8AXwB0AGgAZQBt AGUAcwAvAGIAbABlAG4AZABzAC8AYgBsAGUAYgB1AGwAMQBhAC4AZwBpAGYAAAAAAAAAEPAEAAAA BAAAgGIAB/ADAgAABgalUP4JgkBdcLg4Vdd3B/wQ/wDfAQAADQAAAJQzAAAAAFIBAG4e8NcBAACl UP4JgkBdcLg4Vdd3B/wQ/4lQTkcNChoKAAAADUlIRFIAAAAPAAAADwgDAAAADAhleAAAAAFzUkdC AK7OHOkAAADMUExURf/32MDAwP/QE//UJ//YO//fYgAAAFJR/3h4/4yL/5+e/8XF///wsP/zxAUE /ywr///0xP/42P/vsP/zxf/oif/wsf/a2v+/v/+xsf+jo/+Hh/95ef/XO//gYv/Pz/+zs/+mpv+Y l//ExP+op/+amv+MjP9xcP9iYv+trf+Rkv+Eg/91dv9aWv9MTP+iov+Ghv94d/9qav9OTv9BQP+W lv96ev9tbf9eX//QFJ+f/8bF/3l3/4uL///oiv/niXl4/3h3/1JS/ywq/ysr/1i1FjYAAAAMY21Q UEpDbXAwNzEyAgEBBoq6FM4AAAACdFJOU/8A5bcwSgAAAIJJREFUGJVdzz0LggAABFAf1Jhj4NLQ 1BQNRkY/PyEqcGtqaohwCwSVJGko+7rtwQ13BD/Rud98TJQL1YWnF3tRnmQ6gyTruX45bLXXd5+w VgjEsI/ki0NTCEzBUUV8tzEBpzi13FIag0ucgtII56+9Q1DM15Kd2ea1f6Ba3WTK/z8P27UqJGCl BRYAAAAASUVORK5CYII1AwAARABkAAAAAAAAAAAAAAAAAAAAAAAAAAAA4QDhAOgD6AMAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8ABPDeAAAAsgQK8AgAAAAGBAAAAAoAAHMAC/C6AAAA BEEBAAAABcGOAAAABgECAAAA/wEAAAgAgcMCAAAAhAOx4wEAhgOx4wEAaAB0AHQAcAA6AC8ALwB3 AHcAdwAuAGMAcABzAGMALgB1AGMAYQBsAGcAYQByAHkALgBjAGEALwB+AG0AYQByAGkAbgBhAC8A TgBlAHcAdwBlAGIALwBfAHQAaABlAG0AZQBzAC8AYgBsAGUAbgBkAHMALwBiAGwAZQBiAHUAbAAx AGEALgBnAGkAZgAAAAAAAAAQ8AQAAAAFAACAYgAH8AMCAAAGBqVQ/gmCQF1wuDhV13cH/BD/AN8B AAANAAAAyTYAAAAAUgEAbh7w1wEAAKVQ/gmCQF1wuDhV13cH/BD/iVBORw0KGgoAAAANSUhEUgAA AA8AAAAPCAMAAAAMCGV4AAAAAXNSR0IArs4c6QAAAMxQTFRF//fYwMDA/9AT/9Qn/9g7/99iAAAA UlH/eHj/jIv/n57/xcX///Cw//PEBQT/LCv///TE//jY/++w//PF/+iJ//Cx/9ra/7+//7Gx/6Oj /4eH/3l5/9c7/+Bi/8/P/7Oz/6am/5iX/8TE/6in/5qa/4yM/3Fw/2Ji/62t/5GS/4SD/3V2/1pa /0xM/6Ki/4aG/3h3/2pq/05O/0FA/5aW/3p6/21t/15f/9AUn5//xsX/eXf/i4v//+iK/+eJeXj/ eHf/UlL/LCr/Kyv/WLUWNgAAAAxjbVBQSkNtcDA3MTICAQEGiroUzgAAAAJ0Uk5T/wDltzBKAAAA gklEQVQYlV3PPQuCAAAEUB/UmGPg0tDUFA1GRj8/ISpwa2pqiHALBJUkaSj7uu3BDXcEP9G533xM lAvVhacXe1GeZDqDJOu5fjlstdd3n7BWCMSwj+SLQ1MITMFRRXy3MQGnOLXcUhqDS5yC0gjnr71D UMzXkp3Z5rV/oFrdZMr/Pw/btSokYKUFFgAAAABJRU5ErkJggjUDAABEAGQAAAAAAAAAAAAAAAAA AAAAAAAAAADhAOEA6APoAwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADwAE8N4AAACy BArwCAAAAAcEAAAACgAAcwAL8LoAAAAEQQEAAAAFwY4AAAAGAQIAAAD/AQAACACBwwIAAACEA7Hj AQCGA7HjAQBoAHQAdABwADoALwAvAHcAdwB3AC4AYwBwAHMAYwAuAHUAYwBhAGwAZwBhAHIAeQAu AGMAYQAvAH4AbQBhAHIAaQBuAGEALwBOAGUAdwB3AGUAYgAvAF8AdABoAGUAbQBlAHMALwBiAGwA ZQBuAGQAcwAvAGIAbABlAGIAdQBsADEAYQAuAGcAaQBmAAAAAAAAABDwBAAAAAYAAIBiAAfwAwIA AAYGpVD+CYJAXXC4OFXXdwf8EP8A3wEAAA0AAAD+OQAAAABSAQBuHvDXAQAApVD+CYJAXXC4OFXX dwf8EP+JUE5HDQoaCgAAAA1JSERSAAAADwAAAA8IAwAAAAwIZXgAAAABc1JHQgCuzhzpAAAAzFBM VEX/99jAwMD/0BP/1Cf/2Dv/32IAAABSUf94eP+Mi/+fnv/Fxf//8LD/88QFBP8sK///9MT/+Nj/ 77D/88X/6In/8LH/2tr/v7//sbH/o6P/h4f/eXn/1zv/4GL/z8//s7P/pqb/mJf/xMT/qKf/mpr/ jIz/cXD/YmL/ra3/kZL/hIP/dXb/Wlr/TEz/oqL/hob/eHf/amr/Tk7/QUD/lpb/enr/bW3/Xl// 0BSfn//Gxf95d/+Li///6Ir/54l5eP94d/9SUv8sKv8rK/9YtRY2AAAADGNtUFBKQ21wMDcxMgIB AQaKuhTOAAAAAnRSTlP/AOW3MEoAAACCSURBVBiVXc89C4IAAARQH9SYY+DS0NQUDUZGPz8hKnBr amqIcAsElSRpKPu67cENdwQ/0bnffEyUC9WFpxd7UZ5kOoMk67l+OWy113efsFYIxLCP5ItDUwhM wVFFfLcxAac4tdxSGoNLnILSCOevvUNQzNeSndnmtX+gWt1kyv8/D9u1KiRgpQUWAAAAAElFTkSu QmCCNQMAAEQAZAAAAAAAAAAAAAAAAAAAAAAAAAAAAOEA4QDoA+gDAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAPAATw3gAAALIECvAIAAAACAQAAAAKAABzAAvwugAAAARBAQAAAAXBjgAA AAYBAgAAAP8BAAAIAIHDAgAAAIQDseMBAIYDseMBAGgAdAB0AHAAOgAvAC8AdwB3AHcALgBjAHAA cwBjAC4AdQBjAGEAbABnAGEAcgB5AC4AYwBhAC8AfgBtAGEAcgBpAG4AYQAvAE4AZQB3AHcAZQBi AC8AXwB0AGgAZQBtAGUAcwAvAGIAbABlAG4AZABzAC8AYgBsAGUAYgB1AGwAMQBhAC4AZwBpAGYA AAAAAAAAEPAEAAAABwAAgGIAB/ADAgAABgalUP4JgkBdcLg4Vdd3B/wQ/wDfAQAADQAAADM9AAAA AFIBAG4e8NcBAAClUP4JgkBdcLg4Vdd3B/wQ/4lQTkcNChoKAAAADUlIRFIAAAAPAAAADwgDAAAA DAhleAAAAAFzUkdCAK7OHOkAAADMUExURf/32MDAwP/QE//UJ//YO//fYgAAAFJR/3h4/4yL/5+e /8XF///wsP/zxAUE/ywr///0xP/42P/vsP/zxf/oif/wsf/a2v+/v/+xsf+jo/+Hh/95ef/XO//g Yv/Pz/+zs/+mpv+Yl//ExP+op/+amv+MjP9xcP9iYv+trf+Rkv+Eg/91dv9aWv9MTP+iov+Ghv94 d/9qav9OTv9BQP+Wlv96ev9tbf9eX//QFJ+f/8bF/3l3/4uL///oiv/niXl4/3h3/1JS/ywq/ysr /1i1FjYAAAAMY21QUEpDbXAwNzEyAgEBBoq6FM4AAAACdFJOU/8A5bcwSgAAAIJJREFUGJVdzz0L ggAABFAf1Jhj4NLQ1BQNRkY/PyEqcGtqaohwCwSVJGko+7rtwQ13BD/Rud98TJQL1YWnF3tRnmQ6 gyTruX45bLXXd5+wVgjEsI/ki0NTCEzBUUV8tzEBpzi13FIag0ucgtII56+9Q1DM15Kd2ea1f6Ba 3WTK/z8P27UqJGClBRYAAAAASUVORK5CYII1AwAARABkAAAAAAAAAAAAAAAAAAAAAAAAAAAA4QDh AOgD6AMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8ABPDeAAAAsgQK8AgAAAAJBAAA AAoAAHMAC/C6AAAABEEBAAAABcGOAAAABgECAAAA/wEAAAgAgcMCAAAAhAOx4wEAhgOx4wEAaAB0 AHQAcAA6AC8ALwB3AHcAdwAuAGMAcABzAGMALgB1AGMAYQBsAGcAYQByAHkALgBjAGEALwB+AG0A YQByAGkAbgBhAC8ATgBlAHcAdwBlAGIALwBfAHQAaABlAG0AZQBzAC8AYgBsAGUAbgBkAHMALwBi AGwAZQBiAHUAbAAxAGEALgBnAGkAZgAAAAAAAAAQ8AQAAAAIAACAYgAH8AMCAAAGBqVQ/gmCQF1w uDhV13cH/BD/AN8BAAANAAAAaEAAAAAAUgEAbh7w1wEAAKVQ/gmCQF1wuDhV13cH/BD/iVBORw0K GgoAAAANSUhEUgAAAA8AAAAPCAMAAAAMCGV4AAAAAXNSR0IArs4c6QAAAMxQTFRF//fYwMDA/9AT /9Qn/9g7/99iAAAAUlH/eHj/jIv/n57/xcX///Cw//PEBQT/LCv///TE//jY/++w//PF/+iJ//Cx /9ra/7+//7Gx/6Oj/4eH/3l5/9c7/+Bi/8/P/7Oz/6am/5iX/8TE/6in/5qa/4yM/3Fw/2Ji/62t /5GS/4SD/3V2/1pa/0xM/6Ki/4aG/3h3/2pq/05O/0FA/5aW/3p6/21t/15f/9AUn5//xsX/eXf/ i4v//+iK/+eJeXj/eHf/UlL/LCr/Kyv/WLUWNgAAAAxjbVBQSkNtcDA3MTICAQEGiroUzgAAAAJ0 Uk5T/wDltzBKAAAAgklEQVQYlV3PPQuCAAAEUB/UmGPg0tDUFA1GRj8/ISpwa2pqiHALBJUkaSj7 uu3BDXcEP9G533xMlAvVhacXe1GeZDqDJOu5fjlstdd3n7BWCMSwj+SLQ1MITMFRRXy3MQGnOLXc UhqDS5yC0gjnr71DUMzXkp3Z5rV/oFrdZMr/Pw/btSokYKUFFgAAAABJRU5ErkJggjUDAABEAGQA AAAAAAAAAAAAAAAAAAAAAAAAAADhAOEA6APoAwAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAADwAE8N4AAACyBArwCAAAAAoEAAAACgAAcwAL8LoAAAAEQQEAAAAFwY4AAAAGAQIAAAD/AQAA CACBwwIAAACEA7HjAQCGA7HjAQBoAHQAdABwADoALwAvAHcAdwB3AC4AYwBwAHMAYwAuAHUAYwBh AGwAZwBhAHIAeQAuAGMAYQAvAH4AbQBhAHIAaQBuAGEALwBOAGUAdwB3AGUAYgAvAF8AdABoAGUA bQBlAHMALwBiAGwAZQBuAGQAcwAvAGIAbABlAGIAdQBsADEAYQAuAGcAaQBmAAAAAAAAABDwBAAA AAkAAIBiAAfwAwIAAAYGpVD+CYJAXXC4OFXXdwf8EP8A3wEAAA0AAACdQwAAAABSAQBuHvDXAQAA pVD+CYJAXXC4OFXXdwf8EP+JUE5HDQoaCgAAAA1JSERSAAAADwAAAA8IAwAAAAwIZXgAAAABc1JH QgCuzhzpAAAAzFBMVEX/99jAwMD/0BP/1Cf/2Dv/32IAAABSUf94eP+Mi/+fnv/Fxf//8LD/88QF BP8sK///9MT/+Nj/77D/88X/6In/8LH/2tr/v7//sbH/o6P/h4f/eXn/1zv/4GL/z8//s7P/pqb/ mJf/xMT/qKf/mpr/jIz/cXD/YmL/ra3/kZL/hIP/dXb/Wlr/TEz/oqL/hob/eHf/amr/Tk7/QUD/ lpb/enr/bW3/Xl//0BSfn//Gxf95d/+Li///6Ir/54l5eP94d/9SUv8sKv8rK/9YtRY2AAAADGNt UFBKQ21wMDcxMgIBAQaKuhTOAAAAAnRSTlP/AOW3MEoAAACCSURBVBiVXc89C4IAAARQH9SYY+DS 0NQUDUZGPz8hKnBramqIcAsElSRpKPu67cENdwQ/0bnffEyUC9WFpxd7UZ5kOoMk67l+OWy113ef sFYIxLCP5ItDUwhMwVFFfLcxAac4tdxSGoNLnILSCOevvUNQzNeSndnmtX+gWt1kyv8/D9u1KiRg pQUWAAAAAElFTkSuQmCCNQMAAEQAZAAAAAAAAAAAAAAAAAAAAAAAAAAAAOEA4QDoA+gDAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAPAATw3gAAALIECvAIAAAACwQAAAAKAABzAAvwugAA AARBAQAAAAXBjgAAAAYBAgAAAP8BAAAIAIHDAgAAAIQDseMBAIYDseMBAGgAdAB0AHAAOgAvAC8A dwB3AHcALgBjAHAAcwBjAC4AdQBjAGEAbABnAGEAcgB5AC4AYwBhAC8AfgBtAGEAcgBpAG4AYQAv AE4AZQB3AHcAZQBiAC8AXwB0AGgAZQBtAGUAcwAvAGIAbABlAG4AZABzAC8AYgBsAGUAYgB1AGwA MQBhAC4AZwBpAGYAAAAAAAAAEPAEAAAACgAAgGIAB/ADAgAABgalUP4JgkBdcLg4Vdd3B/wQ/wDf AQAADQAAANJGAAAAAFIBAG4e8NcBAAClUP4JgkBdcLg4Vdd3B/wQ/4lQTkcNChoKAAAADUlIRFIA AAAPAAAADwgDAAAADAhleAAAAAFzUkdCAK7OHOkAAADMUExURf/32MDAwP/QE//UJ//YO//fYgAA AFJR/3h4/4yL/5+e/8XF///wsP/zxAUE/ywr///0xP/42P/vsP/zxf/oif/wsf/a2v+/v/+xsf+j o/+Hh/95ef/XO//gYv/Pz/+zs/+mpv+Yl//ExP+op/+amv+MjP9xcP9iYv+trf+Rkv+Eg/91dv9a Wv9MTP+iov+Ghv94d/9qav9OTv9BQP+Wlv96ev9tbf9eX//QFJ+f/8bF/3l3/4uL///oiv/niXl4 /3h3/1JS/ywq/ysr/1i1FjYAAAAMY21QUEpDbXAwNzEyAgEBBoq6FM4AAAACdFJOU/8A5bcwSgAA AIJJREFUGJVdzz0LggAABFAf1Jhj4NLQ1BQNRkY/PyEqcGtqaohwCwSVJGko+7rtwQ13BD/Rud98 TJQL1YWnF3tRnmQ6gyTruX45bLXXd5+wVgjEsI/ki0NTCEzBUUV8tzEBpzi13FIag0ucgtII56+9 Q1DM15Kd2ea1f6Ba3WTK/z8P27UqJGClBRYAAAAASUVORK5CYII1AwAARABkAAAAAAAAAAAAAAAA AAAAAAAAAAAA4QDhAOgD6AMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA8ABPDeAAAA sgQK8AgAAAAMBAAAAAoAAHMAC/C6AAAABEEBAAAABcGOAAAABgECAAAA/wEAAAgAgcMCAAAAhAOx 4wEAhgOx4wEAaAB0AHQAcAA6AC8ALwB3AHcAdwAuAGMAcABzAGMALgB1AGMAYQBsAGcAYQByAHkA LgBjAGEALwB+AG0AYQByAGkAbgBhAC8ATgBlAHcAdwBlAGIALwBfAHQAaABlAG0AZQBzAC8AYgBs AGUAbgBkAHMALwBiAGwAZQBiAHUAbAAxAGEALgBnAGkAZgAAAAAAAAAQ8AQAAAALAACAYgAH8AMC AAAGBqVQ/gmCQF1wuDhV13cH/BD/AN8BAAANAAAAB0oAAAAAUgEAbh7w1wEAAKVQ/gmCQF1wuDhV 13cH/BD/iVBORw0KGgoAAAANSUhEUgAAAA8AAAAPCAMAAAAMCGV4AAAAAXNSR0IArs4c6QAAAMxQ TFRF//fYwMDA/9AT/9Qn/9g7/99iAAAAUlH/eHj/jIv/n57/xcX///Cw//PEBQT/LCv///TE//jY /++w//PF/+iJ//Cx/9ra/7+//7Gx/6Oj/4eH/3l5/9c7/+Bi/8/P/7Oz/6am/5iX/8TE/6in/5qa /4yM/3Fw/2Ji/62t/5GS/4SD/3V2/1pa/0xM/6Ki/4aG/3h3/2pq/05O/0FA/5aW/3p6/21t/15f /9AUn5//xsX/eXf/i4v//+iK/+eJeXj/eHf/UlL/LCr/Kyv/WLUWNgAAAAxjbVBQSkNtcDA3MTIC AQEGiroUzgAAAAJ0Uk5T/wDltzBKAAAAgklEQVQYlV3PPQuCAAAEUB/UmGPg0tDUFA1GRj8/ISpw a2pqiHALBJUkaSj7uu3BDXcEP9G533xMlAvVhacXe1GeZDqDJOu5fjlstdd3n7BWCMSwj+SLQ1MI TMFRRXy3MQGnOLXcUhqDS5yC0gjnr71DUMzXkp3Z5rV/oFrdZMr/Pw/btSokYKUFFgAAAABJRU5E rkJggjUDAABEAGQAAAAAAAAAAAAAAAAAAAAAAAAAAADhAOEA6APoAwAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAADwAE8N4AAACyBArwCAAAAA0EAAAACgAAcwAL8LoAAAAEQQEAAAAFwY4A AAAGAQIAAAD/AQAACACBwwIAAACEA7HjAQCGA7HjAQBoAHQAdABwADoALwAvAHcAdwB3AC4AYwBw AHMAYwAuAHUAYwBhAGwAZwBhAHIAeQAuAGMAYQAvAH4AbQBhAHIAaQBuAGEALwBOAGUAdwB3AGUA YgAvAF8AdABoAGUAbQBlAHMALwBiAGwAZQBuAGQAcwAvAGIAbABlAGIAdQBsADEAYQAuAGcAaQBm AAAAAAAAABDwBAAAAAwAAIBiAAfwAwIAAAYGpVD+CYJAXXC4OFXXdwf8EP8A3wEAAA0AAAA8TQAA AABSAQBuHvDXAQAApVD+CYJAXXC4OFXXdwf8EP+JUE5HDQoaCgAAAA1JSERSAAAADwAAAA8IAwAA AAwIZXgAAAABc1JHQgCuzhzpAAAAzFBMVEX/99jAwMD/0BP/1Cf/2Dv/32IAAABSUf94eP+Mi/+f nv/Fxf//8LD/88QFBP8sK///9MT/+Nj/77D/88X/6In/8LH/2tr/v7//sbH/o6P/h4f/eXn/1zv/ 4GL/z8//s7P/pqb/mJf/xMT/qKf/mpr/jIz/cXD/YmL/ra3/kZL/hIP/dXb/Wlr/TEz/oqL/hob/ eHf/amr/Tk7/QUD/lpb/enr/bW3/Xl//0BSfn//Gxf95d/+Li///6Ir/54l5eP94d/9SUv8sKv8r K/9YtRY2AAAADGNtUFBKQ21wMDcxMgIBAQaKuhTOAAAAAnRSTlP/AOW3MEoAAACCSURBVBiVXc89 C4IAAARQH9SYY+DS0NQUDUZGPz8hKnBramqIcAsElSRpKPu67cENdwQ/0bnffEyUC9WFpxd7UZ5k OoMk67l+OWy113efsFYIxLCP5ItDUwhMwVFFfLcxAac4tdxSGoNLnILSCOevvUNQzNeSndnmtX+g Wt1kyv8/D9u1KiRgpQUWAAAAAElFTkSuQmCCAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAUABEACgABAGkADwADAAAAAAAA AAAAOAAAQPH/AgA4AAwABgBOAG8AcgBtAGEAbAAAAAIAAAAYAENKGABfSAEEYUoYAG1ICQRzSAkE dEgJBAAAYAACQAEAIgBgAAwACQBIAGUAYQBkAGkAbgBnACAAMgAAABMAAgATpGQAFKRkAEAmAVsk AVwkAQAnADUIgUIqAUNKJABPSgQAUEoEAFFKBABcCIFeSgQAYUokAHBoAAAAAABgAANAAQAyAGAA DAAJAEgAZQBhAGQAaQBuAGcAIAAzAAAAEwADABOkZAAUpGQAQCYCWyQBXCQBACcANQiBQioBQ0ob AE9KBABQSgQAUUoEAFwIgV5KBABhShsAcGgAAAAAAFgABEABAEIAWAAMAAkASABlAGEAZABpAG4A ZwAgADQAAAATAAQAE6RkABSkZABAJgNbJAFcJAEAHwA1CIFCKgFPSgQAUEoEAFFKBABcCIFeSgQA cGgAAAAAAAAAAAAAAAAAAAA8AEFA8v+hADwADAAWAEQAZQBmAGEAdQBsAHQAIABQAGEAcgBhAGcA cgBhAHAAaAAgAEYAbwBuAHQAAAAAAAAAAAAAAAAALgBVQKIA8QAuAAwACQBIAHkAcABlAHIAbABp AG4AawAAAAwAPioBQioCcGiZMwAAVABeQAEAAgFUAAwADABOAG8AcgBtAGEAbAAgACgAVwBlAGIA KQAAABAAEAATpGQAFKRkAFskAVwkARkAQioBT0oEAFBKBABRSgQAXkoEAHBoAAAAAAAAAAAA5iEA AAQAAEIAAAAA/////wAAAAAWAAAAMwAAAEgAAACuAAAAFgEAAEABAAB3AQAAegEAALcBAADIAQAA NQIAALECAABNAwAATwMAAFkDAAAyBwAARQcAAJAHAAABCAAAFggAABcIAACICAAAmQgAAJoIAAAL CQAAHwkAACAJAACRCQAAqgkAAKsJAAAcCgAALwoAADAKAAChCgAAxwoAAMgKAAA5CwAARwsAAEgL AAC5CwAAwgsAAMMLAAA0DAAASAwAAEkMAAC6DAAA4gwAAOMMAABUDQAArg0AAK8NAAAgDgAANA4A ADUOAADgDgAA+Q4AAMwPAADCEAAAuBEAAMoRAADhEgAAjxMAAAAUAAARFAAAEhQAAIMUAACNFAAA jhQAAP8UAAAnFQAAKBUAAJkVAADvFQAA8BUAAJUXAADNFwAAPhgAAFIYAABTGAAAxBgAACkZAAAq GQAAmxkAAN0ZAADeGQAATxoAAGcaAABoGgAA2RoAACEbAAAiGwAALxsAAFAcAABRHAAAUhwAAFMc AABjHAAA1BwAABUdAAAWHQAAhx0AALsdAAC8HQAALR4AAHEeAAByHgAA4x4AAAMfAAAEHwAAGB8A AK0fAABMIAAATSAAAJAgAACRIAAAOiEAADshAABOIQAATyEAAOUhAADoIQAAGAAAAAIwAAAAAAAA AIAAAACAGAAAAAIwAAAAAAAAAIAAAACAKAAAAAMwAAAAAAAAAIAAAACAGAAAAAIwAAAAAAAAAIAA AACAKAAAAAMwAAAAAAAAAIAAAACAmAAAAAAwAAAAAAAAAIAAAACAmAAAAAAwAAAAAAAAAIAAAACA mAAAAAAwAAAAAAAAAIAAAACAKAAAAAMwAAAAAAAAAIAAAACAKAAAAAMwAAAAAAAAAIAAAACAOAAA AAQwAAAAAAAAAIAAAACAOAAAAAQwAAAAAAAAAIAAAACAOAAAAAQwAAAAAAAAAIAAAACAmAAAABAw AAAAAAAAAIAAAACAKAAAAAMwAAAAAAAAAIAAAACAmAAAABAwAAAAAAAAAIAAAACAKAAAAAMwAAAA AAAAAIAAAACAmAAAABAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAA AIAAAACAmQAAAAAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAA AACAmQAAAAAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACA mQAAAAAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAA AAAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAAAAAw AAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAAAAAwAAAA AAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAAAAAwAAAAAAAA AIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAAAAAwAAAAAAAAAIAA AACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAAAAAwAAAAAAAAAIAAAACA qQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAAAAAwAAAAAAAAAIAAAACAqQAA AAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAAAAAwAAAAAAAAAIAAAACAqQAAAAAw AAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAAAAAwAAAAAAAAAIAAAACAmAAAAAAwAAAA AAAAAIAAAACAKAAAAAMwAAAAAAAAAIAAAACAmAAAABAwAAAAAAAAAIAAAACAmAAAABAwAAAAAAAA AIAAAACAmAAAABAwAAAAAAAAAIAAAACAKAAAAAMwAAAAAAAAAIAAAACAmAAAABAwAAAAAAAAAIAA AACAmAAAABAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACA mQAAAAAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAA AAAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAAAAAw AAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAAAAAwAAAA AAAAAIAAAACAmAAAABAwAAAAAAAAAIAAAACAmAAAABAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAA AIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAAAAAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAA AACAqQAAABAwAAAAAAAAAIAAAACAmQAAAAAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACA qQAAABAwAAAAAAAAAIAAAACAmQAAAAAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAA ABAwAAAAAAAAAIAAAACAmQAAAAAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAw AAAAAAAAAIAAAACAmQAAAAAwAAAAAAAAAIAAAACAKAAAAAMwAAAAAAAAAIAAAACAmAAAABAwAAAA AAAAAIAAAACAmAAAABAwAAAAAAAAAIAAAACAmAAAABAwAAAAAAAAAIAAAACAmAAAABAwAAAAAAAA AIAAAACAKAAAAAMwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqwAAABEwAAAAAAAAAIAA AACAmQAAAAAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACA mQAAAAAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAA AAAwAAAAAAAAAIAAAACAqQAAAAAwAAAAAAAAAIAAAACAqQAAABAwAAAAAAAAAIAAAACAmQAAAAAw AAAAAAAAAIAAAACAKAAAAAMwAAAAAAAAAIAAAACAmAAAAAAwAAAAAAAAAIAAAACAmAAAABAwAAAA AAAAAIAAAACAmAAAAAAwAAAAAAAAAIAAAACAmAAAAAAwAAAAAAAAAIAAAACAmAAAABAwAAAAAAAA AIAAAACAmAAAABAwAAAAAAAAAIAAAACAmAAAABAwAAAAAAAAAIAAAACAmAAAABAwAAAAAAAAAIAA AACAmAAAABAwAAAAAAAAAIAAAACAmAAAABAwAAAAAAAAAIAAAACAmAAAAAAwAAAAAAAAAIAAAACA AAQAAIUMAAC3EAAAOxwAAC0iAADmJQAAFAAAABgAAAAaAAAAHQAAAB8AAAAABAAAFgwAAEgPAADM EwAAlRsAAFAgAACtIwAA5iUAABUAAAAXAAAAGQAAABsAAAAcAAAAHgAAACAAAAAABAAA5iUAABYA AACuAAAA5gAAAO8AAADIAQAA+gEAAAwCAAA1AgAAeAIAAJACAACxAgAA8wIAAA0DAACQBwAA/QcA AP8HAAAXCAAAhAgAAIYIAACaCAAABwkAAAkJAAAgCQAAjQkAAI8JAACrCQAAGAoAABoKAAAwCgAA nQoAAJ8KAADICgAANQsAADcLAABICwAAtQsAALcLAADDCwAAMAwAADIMAABJDAAAtgwAALgMAADj DAAAUA0AAFINAACvDQAAHA4AAB4OAACPEwAA/BMAAP4TAAASFAAAfxQAAIEUAACOFAAA+xQAAP0U AAAoFQAAlRUAAJcVAADNFwAAOhgAADwYAABTGAAAwBgAAMIYAAAqGQAAlxkAAJkZAADeGQAASxoA AE0aAABoGgAA1RoAANcaAABjHAAA0BwAANIcAAAWHQAAgx0AAIUdAAC8HQAAKR4AACseAAByHgAA 3x4AAOEeAAB1HwAAmB8AAKofAABQIAAAfSAAAI0gAADmIQAAE1h0/xWME1h0/xWME1h0/xWME1h0 /xWME0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWs E0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0 /xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE0N0/xWsE1h0/xWME1h0/xWMAAAAAPgC AAD+AgAAAgMAAAwDAAArAwAAMQMAALcFAAC8BQAA2AUAAN0FAAAnEAAANhAAAJkVAACeFQAAexYA AIIWAACHFgAAkhYAALMWAAC5FgAAvhYAAMMWAABdHgAAbB4AAEMhAABNIQAATyEAAFYhAADoIQAA BwAcAAcAHAAHABwABwAcAAcAHAAHABwABwAcAAcAHAAHABwABwAcAAcAHAAHABwABwAcAAcABAAH AAAAAAAzAAAANQAAAEgAAABLAAAAnQQAAL0EAACfBQAArgUAAOMFAADuBQAA/gYAAAkHAAABCAAA BwgAAIgIAACQCAAAkQkAAJcJAAAcCgAAIwoAAKEKAACpCgAAOQsAAEYLAAC5CwAAwQsAADQMAAA8 DAAAugwAAMIMAABUDQAAXA0AAOESAAAFEwAAsBYAALkWAACsFwAAthcAAD4YAABDGAAALxsAAHEb AADPGwAA0xsAAJwdAACfHQAAQR4AAEQeAADxHgAA9x4AAE0gAABPIAAA6CEAAAcAMwAHADMABwAz AAcAMwAHADMABwAzAAcAMwAHADMABwAzAAcAMwAHADMABwAzAAcAMwAHADMABwAzAAcAMwAHADMA BwAzAAcAMwAHADMABwAzAAcAMwAHADMABwAzAAcAMwAHADMABwAAAAAAtwEAAMgBAAABCAAAFwgA AIgIAACaCAAAHAoAADAKAAA5CwAASAsAALkLAADDCwAANAwAAEkMAAAAFAAAEhQAAIMUAACOFAAA UxwAAGMcAABPIQAAeSEAAOghAAAHAAUABwAFAAcABQAHAAUABwAFAAcABQAHAAUABwAFAAcABQAH AAUABwAEAAcA//8CAAAAEABNAGEAcgBpAG4AYQAgAEcAYQB2AHIAaQBsAG8AdgBhAC8ARAA6AFwA TQBBAFIASQBOAEEAXABQAEQAUABUAEEAXABQAGEAcgBhAGwAbABlAGwAIABBAGwAZwBtACAAUwBl AHMAcwBpAG8AbgAgAFAARABQAFQAQQAuAGQAbwBjAAAAAACQBwAAAQgAABYIAAAXCAAAiAgAAJkI AACaCAAACwkAAB8JAAAgCQAAkQkAAKoJAACrCQAAHAoAAC8KAAAwCgAAoQoAAMcKAADICgAAOQsA AEcLAABICwAAuQsAAMILAADDCwAANAwAAEgMAABJDAAAugwAAOIMAADjDAAAVA0AAK4NAACvDQAA IA4AADQOAAA1DgAAjxMAAAAUAAARFAAAEhQAAIMUAACNFAAAjhQAAP8UAAAnFQAAKBUAAJkVAADv FQAA8BUAAM0XAAA+GAAAUhgAAFMYAADEGAAAKRkAACoZAACbGQAA3RkAAN4ZAABPGgAAZxoAAGga AADZGgAAIRsAACIbAABjHAAA1BwAABUdAAAWHQAAhx0AALsdAAC8HQAALR4AAHEeAAByHgAA4x4A AAMfAAAEHwAA6CEAAAAAAAAIAAAAAgEAAAIBAACeAQAAAgEAAAIBAACeAQAAAgEAAAIBAACeAQAA AgEAAAIBAACeAQAAAgEAAAIBAACeAQAAAgEAAAIBAACeAQAAAgEAAAIBAACeAQAAAgEAAAIBAACe AQAAAgEAAAIBAACeAQAAAgEAAAIBAACeAQAAAgEAAAIBAACeAQAAAgEAAAIBAACWAQAACAAAAAIB AAACAQAAngEAAAIBAAACAQAAngEAAAIBAAACAQAAngEAAAIBAAACAQAAlgEAAAgAAAACAQAAAgEA AJ4BAAACAQAAAgEAAJ4BAAACAQAAAgEAAJ4BAAACAQAAAgEAAJ4BAAACAQAAAgEAAJYBAAAIAAAA AgEAAAIBAACeAQAAAgEAAAIBAACeAQAAAgEAAAIBAACeAQAAAgEAAAIBAACWAQAA/0ADgAEATyEA AE8hAADwRZMEAQABAE8hAAAAAAAATiEAAAAAAAACEAAAAAAAAADmIQAAQAAACABAAAD//wEAAAAH AFUAbgBrAG4AbwB3AG4A//8BAAgAAAAAAAAAAAAAAP//AQAAAAAA//8AAAIA//8AAAAA//8AAAIA //8AAAAABQAAAEcWkAEAAAICBgMFBAUCAwSHegAgAAAAgAgAAAAAAAAA/wEAAAAAAABUAGkAbQBl AHMAIABOAGUAdwAgAFIAbwBtAGEAbgAAADUWkAECAAUFAQIBBwYCBQcAAAAAAAAAEAAAAAAAAAAA AAAAgAAAAABTAHkAbQBiAG8AbAAAADMmkAEAAAILBgQCAgICAgSHegAgAAAAgAgAAAAAAAAA/wEA AAAAAABBAHIAaQBhAGwAAABBJpABAAACCwYDAgICAgIEBwAAAAAAAAAAAAAAAAAAABMAAAAAAAAA VAByAGUAYgB1AGMAaABlAHQAIABNAFMAAABJJpABgAACCwYEAgICAgIE/////////+k/AAAAAAAA AP8APwAAAAAAQQByAGkAYQBsACAAVQBuAGkAYwBvAGQAZQAgAE0AUwAAACIABABxCIgYAPDQAgAA aAEAAAAAqUNThttDU4YAAAAABAAFAAAA5wQAAPMbAAABAA4AAAAEAAMQOwAAAAAAAAAAAAAAAQAB AAAAAQAAAAAAAAAhAwDwEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAIB6AFtAC0AIGBMjAA AAAAAAAAAAAAAAAAAFIiAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAgAAAAAAAAAAAAEygxEA8BAACAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAD//xIAAAAAAAAAFQBUAGUAYwBoAG4AaQBjAGEAbAAgAFMAZQBzAHMA aQBvAG4AIABvAG4AIAAAAAAAAAAQAE0AYQByAGkAbgBhACAARwBhAHYAcgBpAGwAbwB2AGEAEABN AGEAcgBpAG4AYQAgAEcAYQB2AHIAaQBsAG8AdgBhAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAP7/AAAFAAIAAAAAAAAAAAAAAAAAAAAAAAEAAADghZ/y +U9oEKuRCAArJ7PZMAAAAJQBAAARAAAAAQAAAJAAAAACAAAAmAAAAAMAAAC4AAAABAAAAMQAAAAF AAAA4AAAAAYAAADsAAAABwAAAPgAAAAIAAAADAEAAAkAAAAoAQAAEgAAADQBAAAKAAAAUAEAAAwA AABcAQAADQAAAGgBAAAOAAAAdAEAAA8AAAB8AQAAEAAAAIQBAAATAAAAjAEAAAIAAADkBAAAHgAA ABYAAABUZWNobmljYWwgU2Vzc2lvbiBvbiAAOQAeAAAAAQAAAABlY2geAAAAEQAAAE1hcmluYSBH YXZyaWxvdmEAIG9uHgAAAAEAAAAAYXJpHgAAAAEAAAAAYXJpHgAAAAsAAABOb3JtYWwuZG90AGke AAAAEQAAAE1hcmluYSBHYXZyaWxvdmEAIG9uHgAAAAIAAAA0AHJpHgAAABMAAABNaWNyb3NvZnQg V29yZCA5LjAAbkAAAAAAXtCyAAAAAEAAAAAA/kN3GKjAAUAAAAAAklrkHqjAAQMAAAABAAAAAwAA AOcEAAADAAAA8xsAAAMAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAD+/wAABQACAAAAAAAAAAAAAAAAAAAAAAACAAAAAtXN1ZwuGxCTlwgA Kyz5rkQAAAAF1c3VnC4bEJOXCAArLPmuUAEAAAwBAAAMAAAAAQAAAGgAAAAPAAAAcAAAAAUAAACM AAAABgAAAJQAAAARAAAAnAAAABcAAACkAAAACwAAAKwAAAAQAAAAtAAAABMAAAC8AAAAFgAAAMQA AAANAAAAzAAAAAwAAADuAAAAAgAAAOQEAAAeAAAAFAAAAEF4aWEgTmV0TWVkaWEgQ29ycC4AAwAA ADsAAAADAAAADgAAAAMAAABSIgAAAwAAAKAKCQALAAAAAAAAAAsAAAAAAAAACwAAAAAAAAALAAAA AAAAAB4QAAABAAAAFgAAAFRlY2huaWNhbCBTZXNzaW9uIG9uIAAMEAAAAgAAAB4AAAAGAAAAVGl0 bGUAAwAAAAEAAACEFgAAAwAAAAAAAAAgAAAAAQAAADgAAAACAAAAQAAAAAEAAAACAAAADAAAAF9Q SURfSExJTktTAAIAAADkBAAAQQAAADwWAAC6AAAAAwAAAGkADgADAAAAWgAAAAMAAAAAAAAAAwAA AAUAAAAfAAAAHwAAAG0AYQBpAGwAdABvADoAbQBhAHIAaQBuAGEAQABjAHAAcwBjAC4AdQBjAGEA bABnAGEAcgB5AC4AYwBhAAAAAAAfAAAAAQAAAAAAAAADAAAAPgAfAAMAAABXAAAAAwAAAAAAAAAD AAAABQAAAB8AAAAVAAAAbQBhAGkAbAB0AG8AOgBjAGoAdABhAG4AQABhAGMAbQAuAG8AcgBnAAAA AAAfAAAAAQAAAAAAAAADAAAAOgArAAMAAAAJAAAAAwAAAAAAAAADAAAABQAAAB8AAAA0AAAAaAB0 AHQAcAA6AC8ALwB3AHcAdwAuAGMAcwAuAHIAZABnAC4AYQBjAC4AdQBrAC8AfgBuAHMAYQAvAEgA aQA0AE4ARQBUAGcAcgBvAHUAcAAvAGkAbgBkAGUAeAAuAGgAdABtAGwAAAAfAAAAAQAAAAAAAAAD AAAAGAAQAAMAAAAGAAAAAwAAAAAAAAADAAAABQAAAB8AAAA1AAAAaAB0AHQAcAA6AC8ALwB3AHcA dwAuAGMAcABzAGMALgB1AGMAYQBsAGcAYQByAHkALgBjAGEALwB+AG0AYQByAGkAbgBhAC8ATgBl AHcAdwBlAGIALwBpAG4AZABlAHgALgBoAHQAbQAAAAAAHwAAAAEAAAAAAAAAAwAAAGwAMwADAAAA AwAAAAMAAAAAAAAAAwAAAAUAAAAfAAAAJAAAAGgAdAB0AHAAOgAvAC8AbgBlAHgAdAAuAGUAbgBz AHUALgB1AGMAYQBsAGcAYQByAHkALgBjAGEALwB+AGMAagB0AGEAbgAAAB8AAAABAAAAAAAAAAMA AABIAAAAAwAAAAAAAAADAAAAAAAAAAMAAAAFAAAAHwAAACoAAABoAHQAdABwADoALwAvAHcAdwB3 AC4AYQBzAGgAbABhAG4AZAAuAGUAZAB1AC8AfgBpAGEAagB3AGEALwBjAG8AbgBmAGUAcgBlAG4A YwBlAHMAAAAfAAAAAQAAAAAAAAADAAAAZwAHAAMAAAD+CwAAAwAAAA4EAAADAAAAAQAAAB8AAABH AAAAaAB0AHQAcAA6AC8ALwB3AHcAdwAuAGMAcABzAGMALgB1AGMAYQBsAGcAYQByAHkALgBjAGEA LwB+AG0AYQByAGkAbgBhAC8ATgBlAHcAdwBlAGIALwBfAHQAaABlAG0AZQBzAC8AYgBsAGUAbgBk AHMALwBiAGwAZQBiAHUAbAAxAGEALgBnAGkAZgAAAAAAHwAAAAEAAAAAAAAAAwAAAGcABwADAAAA hQwAAAMAAAAPBAAAAwAAAAEAAAAfAAAARwAAAGgAdAB0AHAAOgAvAC8AdwB3AHcALgBjAHAAcwBj AC4AdQBjAGEAbABnAGEAcgB5AC4AYwBhAC8AfgBtAGEAcgBpAG4AYQAvAE4AZQB3AHcAZQBiAC8A XwB0AGgAZQBtAGUAcwAvAGIAbABlAG4AZABzAC8AYgBsAGUAYgB1AGwAMQBhAC4AZwBpAGYAAAAA AB8AAAABAAAAAAAAAAMAAABnAAcAAwAAAAgNAAADAAAAEAQAAAMAAAABAAAAHwAAAEcAAABoAHQA dABwADoALwAvAHcAdwB3AC4AYwBwAHMAYwAuAHUAYwBhAGwAZwBhAHIAeQAuAGMAYQAvAH4AbQBh AHIAaQBuAGEALwBOAGUAdwB3AGUAYgAvAF8AdABoAGUAbQBlAHMALwBiAGwAZQBuAGQAcwAvAGIA bABlAGIAdQBsADEAYQAuAGcAaQBmAAAAAAAfAAAAAQAAAAAAAAADAAAAZwAHAAMAAACODQAAAwAA ABEEAAADAAAAAQAAAB8AAABHAAAAaAB0AHQAcAA6AC8ALwB3AHcAdwAuAGMAcABzAGMALgB1AGMA YQBsAGcAYQByAHkALgBjAGEALwB+AG0AYQByAGkAbgBhAC8ATgBlAHcAdwBlAGIALwBfAHQAaABl AG0AZQBzAC8AYgBsAGUAbgBkAHMALwBiAGwAZQBiAHUAbAAxAGEALgBnAGkAZgAAAAAAHwAAAAEA AAAAAAAAAwAAAGcABwADAAAAGQ4AAAMAAAASBAAAAwAAAAEAAAAfAAAARwAAAGgAdAB0AHAAOgAv AC8AdwB3AHcALgBjAHAAcwBjAC4AdQBjAGEAbABnAGEAcgB5AC4AYwBhAC8AfgBtAGEAcgBpAG4A YQAvAE4AZQB3AHcAZQBiAC8AXwB0AGgAZQBtAGUAcwAvAGIAbABlAG4AZABzAC8AYgBsAGUAYgB1 AGwAMQBhAC4AZwBpAGYAAAAAAB8AAAABAAAAAAAAAAMAAABnAAcAAwAAAJ4OAAADAAAAEwQAAAMA AAABAAAAHwAAAEcAAABoAHQAdABwADoALwAvAHcAdwB3AC4AYwBwAHMAYwAuAHUAYwBhAGwAZwBh AHIAeQAuAGMAYQAvAH4AbQBhAHIAaQBuAGEALwBOAGUAdwB3AGUAYgAvAF8AdABoAGUAbQBlAHMA LwBiAGwAZQBuAGQAcwAvAGIAbABlAGIAdQBsADEAYQAuAGcAaQBmAAAAAAAfAAAAAQAAAAAAAAAD AAAAZwAHAAMAAAA2DwAAAwAAABQEAAADAAAAAQAAAB8AAABHAAAAaAB0AHQAcAA6AC8ALwB3AHcA dwAuAGMAcABzAGMALgB1AGMAYQBsAGcAYQByAHkALgBjAGEALwB+AG0AYQByAGkAbgBhAC8ATgBl AHcAdwBlAGIALwBfAHQAaABlAG0AZQBzAC8AYgBsAGUAbgBkAHMALwBiAGwAZQBiAHUAbAAxAGEA LgBnAGkAZgAAAAAAHwAAAAEAAAAAAAAAAwAAAGcABwADAAAAtg8AAAMAAAAVBAAAAwAAAAEAAAAf AAAARwAAAGgAdAB0AHAAOgAvAC8AdwB3AHcALgBjAHAAcwBjAC4AdQBjAGEAbABnAGEAcgB5AC4A YwBhAC8AfgBtAGEAcgBpAG4AYQAvAE4AZQB3AHcAZQBiAC8AXwB0AGgAZQBtAGUAcwAvAGIAbABl AG4AZABzAC8AYgBsAGUAYgB1AGwAMQBhAC4AZwBpAGYAAAAAAB8AAAABAAAAAAAAAAMAAABnAAcA AwAAADEQAAADAAAAFgQAAAMAAAABAAAAHwAAAEcAAABoAHQAdABwADoALwAvAHcAdwB3AC4AYwBw AHMAYwAuAHUAYwBhAGwAZwBhAHIAeQAuAGMAYQAvAH4AbQBhAHIAaQBuAGEALwBOAGUAdwB3AGUA YgAvAF8AdABoAGUAbQBlAHMALwBiAGwAZQBuAGQAcwAvAGIAbABlAGIAdQBsADEAYQAuAGcAaQBm AAAAAAAfAAAAAQAAAAAAAAADAAAAZwAHAAMAAAC3EAAAAwAAABcEAAADAAAAAQAAAB8AAABHAAAA aAB0AHQAcAA6AC8ALwB3AHcAdwAuAGMAcABzAGMALgB1AGMAYQBsAGcAYQByAHkALgBjAGEALwB+ AG0AYQByAGkAbgBhAC8ATgBlAHcAdwBlAGIALwBfAHQAaABlAG0AZQBzAC8AYgBsAGUAbgBkAHMA LwBiAGwAZQBiAHUAbAAxAGEALgBnAGkAZgAAAAAAHwAAAAEAAAAAAAAAAwAAAGcABwADAAAAUREA AAMAAAAYBAAAAwAAAAEAAAAfAAAARwAAAGgAdAB0AHAAOgAvAC8AdwB3AHcALgBjAHAAcwBjAC4A dQBjAGEAbABnAGEAcgB5AC4AYwBhAC8AfgBtAGEAcgBpAG4AYQAvAE4AZQB3AHcAZQBiAC8AXwB0 AGgAZQBtAGUAcwAvAGIAbABlAG4AZABzAC8AYgBsAGUAYgB1AGwAMQBhAC4AZwBpAGYAAAAAAB8A AAABAAAAAAAAAAMAAABnAAcAAwAAAB0SAAADAAAAGQQAAAMAAAABAAAAHwAAAEcAAABoAHQAdABw ADoALwAvAHcAdwB3AC4AYwBwAHMAYwAuAHUAYwBhAGwAZwBhAHIAeQAuAGMAYQAvAH4AbQBhAHIA aQBuAGEALwBOAGUAdwB3AGUAYgAvAF8AdABoAGUAbQBlAHMALwBiAGwAZQBuAGQAcwAvAGIAbABl AGIAdQBsADEAYQAuAGcAaQBmAAAAAAAfAAAAAQAAAAAAAAADAAAAZwAHAAMAAAD9FwAAAwAAAAEE AAADAAAAAQAAAB8AAABHAAAAaAB0AHQAcAA6AC8ALwB3AHcAdwAuAGMAcABzAGMALgB1AGMAYQBs AGcAYQByAHkALgBjAGEALwB+AG0AYQByAGkAbgBhAC8ATgBlAHcAdwBlAGIALwBfAHQAaABlAG0A ZQBzAC8AYgBsAGUAbgBkAHMALwBiAGwAZQBiAHUAbAAxAGEALgBnAGkAZgAAAAAAHwAAAAEAAAAA AAAAAwAAAGcABwADAAAAgBgAAAMAAAACBAAAAwAAAAEAAAAfAAAARwAAAGgAdAB0AHAAOgAvAC8A dwB3AHcALgBjAHAAcwBjAC4AdQBjAGEAbABnAGEAcgB5AC4AYwBhAC8AfgBtAGEAcgBpAG4AYQAv AE4AZQB3AHcAZQBiAC8AXwB0AGgAZQBtAGUAcwAvAGIAbABlAG4AZABzAC8AYgBsAGUAYgB1AGwA MQBhAC4AZwBpAGYAAAAAAB8AAAABAAAAAAAAAAMAAABnAAcAAwAAAPwYAAADAAAAAwQAAAMAAAAB AAAAHwAAAEcAAABoAHQAdABwADoALwAvAHcAdwB3AC4AYwBwAHMAYwAuAHUAYwBhAGwAZwBhAHIA eQAuAGMAYQAvAH4AbQBhAHIAaQBuAGEALwBOAGUAdwB3AGUAYgAvAF8AdABoAGUAbQBlAHMALwBi AGwAZQBuAGQAcwAvAGIAbABlAGIAdQBsADEAYQAuAGcAaQBmAAAAAAAfAAAAAQAAAAAAAAADAAAA ZwAHAAMAAACWGQAAAwAAAAQEAAADAAAAAQAAAB8AAABHAAAAaAB0AHQAcAA6AC8ALwB3AHcAdwAu AGMAcABzAGMALgB1AGMAYQBsAGcAYQByAHkALgBjAGEALwB+AG0AYQByAGkAbgBhAC8ATgBlAHcA dwBlAGIALwBfAHQAaABlAG0AZQBzAC8AYgBsAGUAbgBkAHMALwBiAGwAZQBiAHUAbAAxAGEALgBn AGkAZgAAAAAAHwAAAAEAAAAAAAAAAwAAAGcABwADAAAAOxwAAAMAAAAFBAAAAwAAAAEAAAAfAAAA RwAAAGgAdAB0AHAAOgAvAC8AdwB3AHcALgBjAHAAcwBjAC4AdQBjAGEAbABnAGEAcgB5AC4AYwBh AC8AfgBtAGEAcgBpAG4AYQAvAE4AZQB3AHcAZQBiAC8AXwB0AGgAZQBtAGUAcwAvAGIAbABlAG4A ZABzAC8AYgBsAGUAYgB1AGwAMQBhAC4AZwBpAGYAAAAAAB8AAAABAAAAAAAAAAMAAABnAAcAAwAA AMEcAAADAAAABgQAAAMAAAABAAAAHwAAAEcAAABoAHQAdABwADoALwAvAHcAdwB3AC4AYwBwAHMA YwAuAHUAYwBhAGwAZwBhAHIAeQAuAGMAYQAvAH4AbQBhAHIAaQBuAGEALwBOAGUAdwB3AGUAYgAv AF8AdABoAGUAbQBlAHMALwBiAGwAZQBuAGQAcwAvAGIAbABlAGIAdQBsADEAYQAuAGcAaQBmAAAA AAAfAAAAAQAAAAAAAAADAAAAZwAHAAMAAACYHQAAAwAAAAcEAAADAAAAAQAAAB8AAABHAAAAaAB0 AHQAcAA6AC8ALwB3AHcAdwAuAGMAcABzAGMALgB1AGMAYQBsAGcAYQByAHkALgBjAGEALwB+AG0A YQByAGkAbgBhAC8ATgBlAHcAdwBlAGIALwBfAHQAaABlAG0AZQBzAC8AYgBsAGUAbgBkAHMALwBi AGwAZQBiAHUAbAAxAGEALgBnAGkAZgAAAAAAHwAAAAEAAAAAAAAAAwAAAGcABwADAAAATB4AAAMA AAAIBAAAAwAAAAEAAAAfAAAARwAAAGgAdAB0AHAAOgAvAC8AdwB3AHcALgBjAHAAcwBjAC4AdQBj AGEAbABnAGEAcgB5AC4AYwBhAC8AfgBtAGEAcgBpAG4AYQAvAE4AZQB3AHcAZQBiAC8AXwB0AGgA ZQBtAGUAcwAvAGIAbABlAG4AZABzAC8AYgBsAGUAYgB1AGwAMQBhAC4AZwBpAGYAAAAAAB8AAAAB AAAAAAAAAAMAAABnAAcAAwAAANYeAAADAAAACQQAAAMAAAABAAAAHwAAAEcAAABoAHQAdABwADoA LwAvAHcAdwB3AC4AYwBwAHMAYwAuAHUAYwBhAGwAZwBhAHIAeQAuAGMAYQAvAH4AbQBhAHIAaQBu AGEALwBOAGUAdwB3AGUAYgAvAF8AdABoAGUAbQBlAHMALwBiAGwAZQBuAGQAcwAvAGIAbABlAGIA dQBsADEAYQAuAGcAaQBmAAAAAAAfAAAAAQAAAAAAAAADAAAAZwAHAAMAAADRIAAAAwAAAAoEAAAD AAAAAQAAAB8AAABHAAAAaAB0AHQAcAA6AC8ALwB3AHcAdwAuAGMAcABzAGMALgB1AGMAYQBsAGcA YQByAHkALgBjAGEALwB+AG0AYQByAGkAbgBhAC8ATgBlAHcAdwBlAGIALwBfAHQAaABlAG0AZQBz AC8AYgBsAGUAbgBkAHMALwBiAGwAZQBiAHUAbAAxAGEALgBnAGkAZgAAAAAAHwAAAAEAAAAAAAAA AwAAAGcABwADAAAAhCEAAAMAAAALBAAAAwAAAAEAAAAfAAAARwAAAGgAdAB0AHAAOgAvAC8AdwB3 AHcALgBjAHAAcwBjAC4AdQBjAGEAbABnAGEAcgB5AC4AYwBhAC8AfgBtAGEAcgBpAG4AYQAvAE4A ZQB3AHcAZQBiAC8AXwB0AGgAZQBtAGUAcwAvAGIAbABlAG4AZABzAC8AYgBsAGUAYgB1AGwAMQBh AC4AZwBpAGYAAAAAAB8AAAABAAAAAAAAAAMAAABnAAcAAwAAACoiAAADAAAADAQAAAMAAAABAAAA HwAAAEcAAABoAHQAdABwADoALwAvAHcAdwB3AC4AYwBwAHMAYwAuAHUAYwBhAGwAZwBhAHIAeQAu AGMAYQAvAH4AbQBhAHIAaQBuAGEALwBOAGUAdwB3AGUAYgAvAF8AdABoAGUAbQBlAHMALwBiAGwA ZQBuAGQAcwAvAGIAbABlAGIAdQBsADEAYQAuAGcAaQBmAAAAAAAfAAAAAQAAAAAAAAADAAAAZwAH AAMAAADgIgAAAwAAAA0EAAADAAAAAQAAAB8AAABHAAAAaAB0AHQAcAA6AC8ALwB3AHcAdwAuAGMA cABzAGMALgB1AGMAYQBsAGcAYQByAHkALgBjAGEALwB+AG0AYQByAGkAbgBhAC8ATgBlAHcAdwBl AGIALwBfAHQAaABlAG0AZQBzAC8AYgBsAGUAbgBkAHMALwBiAGwAZQBiAHUAbAAxAGEALgBnAGkA ZgAAAAAAHwAAAAEAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAABAAAAAgAAAAMAAAAEAAAABQAAAAYAAAAHAAAACAAAAAkAAAAKAAAACwAAAAwAAAANAAAA DgAAAA8AAAAQAAAAEQAAABIAAAATAAAAFAAAABUAAAAWAAAAFwAAABgAAAAZAAAAGgAAABsAAAAc AAAAHQAAAB4AAAAfAAAAIAAAACEAAAD+////IwAAACQAAAAlAAAAJgAAACcAAAAoAAAAKQAAACoA AAArAAAALAAAAC0AAAAuAAAALwAAADAAAAAxAAAAMgAAADMAAAA0AAAANQAAADYAAAA3AAAAOAAA ADkAAAA6AAAAOwAAADwAAAA9AAAAPgAAAD8AAABAAAAAQQAAAEIAAABDAAAARAAAAEUAAABGAAAA RwAAAEgAAABJAAAASgAAAP7///9MAAAATQAAAE4AAABPAAAAUAAAAFEAAABSAAAAUwAAAFQAAABV AAAAVgAAAFcAAAD+////WQAAAFoAAABbAAAAXAAAAF0AAABeAAAAXwAAAP7///9hAAAAYgAAAGMA AABkAAAAZQAAAGYAAABnAAAAaAAAAGkAAABqAAAAawAAAP7////9////bgAAAP7////+/////v// //////////////////////////////////////////////////////////////////////////// /////1IAbwBvAHQAIABFAG4AdAByAHkAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAWAAUB//////////8DAAAABgkCAAAAAADAAAAAAAAARgAAAAAAAAAAAAAAAJAv LfgeqMABcAAAAIAAAAAAAAAARABhAHQAYQAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAoAAgH///////////////8AAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAiAAAALVAAAAAAAAAxAFQAYQBiAGwAZQAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAADgACAAEAAAD//////////wAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAEsAAABvGQAAAAAAAFcAbwByAGQARABv AGMAdQBtAGUAbgB0AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAaAAIB BgAAAAUAAAD/////AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAACJCAAAA AAAABQBTAHUAbQBtAGEAcgB5AEkAbgBmAG8AcgBtAGEAdABpAG8AbgAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAACgAAgH///////////////8AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAABYAAAAABAAAAAAAAAFAEQAbwBjAHUAbQBlAG4AdABTAHUAbQBtAGEAcgB5AEkAbgBmAG8A cgBtAGEAdABpAG8AbgAAAAAAAAAAAAAAOAACAQQAAAD//////////wAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAGAAAADUFwAAAAAAAAEAQwBvAG0AcABPAGIAagAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAASAAIBAgAAAAcAAAD/////AAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAGoAAAAAAAAATwBiAGoAZQBjAHQA UABvAG8AbAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABYAAQD/ //////////////8AAAAAAAAAAAAAAAAAAAAAAAAAAJAvLfgeqMABkC8t+B6owAEAAAAAAAAAAAAA AAABAAAA/v////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// //////////////////////////////////////////////////////////////////////////// /wEA/v8DCgAA/////wYJAgAAAAAAwAAAAAAAAEYYAAAATWljcm9zb2Z0IFdvcmQgRG9jdW1lbnQA CgAAAE1TV29yZERvYwAQAAAAV29yZC5Eb2N1bWVudC44APQ5snEAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA ------=_NextPart_000_0041_01C0A7F2.E5C8F310-- ------------- 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 compgeom-owner@research.bell-labs.com Mon Mar 12 18:13:39 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id SAA00590 for ; Mon, 12 Mar 2001 18:13:39 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id SAA23126; Mon, 12 Mar 2001 18:13:39 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Mar 12 19:12:07 EST 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Sun Mar 11 18:57:20 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Sun Mar 11 18:56:01 EST 2001 Received: from dirichlet.csar.uiuc.edu ([128.174.251.37]) by dusty; Sun Mar 11 18:55:58 EST 2001 Received: from dirichlet.csar.uiuc.edu (dirichlet.csar.uiuc.edu [128.174.251.37]) by dirichlet.csar.uiuc.edu (8.10.1/8.10.1) with SMTP id f2BNtud16845 for ; Sun, 11 Mar 2001 17:55:57 -0600 (CST) Message-Id: <200103112355.f2BNtud16845@dirichlet.csar.uiuc.edu> Date: Sun, 11 Mar 2001 17:55:56 -0600 (CST) From: Alla Sheffer Reply-To: Alla Sheffer Subject: 10th IMR-CALL FOR PAPERS/ANNOUNCEMENT To: compgeom-announce@research.bell-labs.com MIME-Version: 1.0 Content-Type: MULTIPART/mixed; BOUNDARY=Descent_of_Woodpeckers_240_000 X-Mailer: dtmail 1.3.0 @(#)CDE Version 1.3.5 SunOS 5.7 sun4u sparc Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 29116 Lines: 683 --Descent_of_Woodpeckers_240_000 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: npjKjMlod1/mHU3ShTAb2w== *************************************************************** ** Announcement and Call for Papers ** ** ** ** 10TH INTERNATIONAL MESHING ROUNDTABLE ** ** ** ** October 7-10, 2001 ** ** Newport Beach, California USA ** ** ** ** http://www.imr.sandia.gov ** ** ** *************************************************************** Join us at the 10th International Meshing Roundtable to be held in warm and sunny Newport Beach, California, on October 7-10, 2001. In 1992, Sandia National Laboratories started the Meshing Roundtable as a small meeting of like-minded companies and organizations striving to establish a common focus for research and development in the field of mesh and grid generation. Now after 10 consecutive years, the International Meshing Roundtable has become recognized as an international focal point annually attended by researchers and developers from dozens of countries around the world. The relaxed atmosphere at each Roundtable provides an open and technically rich environment in which to share new ideas and technical advances. The International Meshing Roundtable continues to focus on bringing together researchers and developers from academia, national labs and industry in a stimulating, open environment to share technical information related to mesh generation and general pre-processing techniques. In 2001, Roundtable attendees will enjoy the balmy weather and breathtaking beaches of Newport Beach, California, located between Los Angeles and San Diego on the Pacific coast. This year's conference will be hosted by UGS, Inc. which maintains its principle development site in Southern California. EVENTS ------ Events at Roundtable 2001 include: * Pre-conference short course on Sunday, October 7 * Technical presentations of contributed papers * Keynote and invited speakers * Poster session with "Best Technical Poster", "Best Student Poster" and "Meshing Maestro" awards. We encourage submission of posters presenting novel research results as well as posters showcasing state-of-the-art technology by industry developers and meshing software vendors. * Birds-of-a-Feather session providing a discussion forum for small groups of researchers working in similar fields. * Panel discussion. * Dinner Banquet More information on the Roundtable, as it becomes available, will be published at the International Meshing Roundtable website: http://www.imr.sandia.gov FINANCIAL SUPPORT FOR STUDENTS ---------------------------- Limited financial support from the National Science Foundation (www.nsf.gov) will be made available to student attendees from US academic institutions to defray travel and conference registration expenses. Awards of funding to students will be based on active research in mesh generation or interest in meshing as a future research topic. Funding awards will be prioritized as follows: * Presentation of a research paper at the conference (accepted through the regular review process) * Presentation of a poster at the poster session accompanied by a brief, written research description * Submission of a one-page, written statement of interest from beginning graduate students, signed by their advisor and/or chairman of their department. All students must provide a copy of their student ID. Please send all proposals to Nikos Chrisochoides. More information regarding travel support for students will be posted on the International Meshing Roundtable website: http://www.imr.sandia.gov IMPORTANT DATES --------------- June 1, 2001 Full paper due August 6, 2001 Acceptance/Rejection notices sent to authors August 27, 2001 Final camera-ready papers due September 7, 2001 Early conference registration due September 14, 2001 Hotel reservation due for special discount rates October 7, 2001 Short Course, Marriott Hotel, Newport Beach October 7-10, 2001 10th International Meshing Roundtable, Marriott Hotel, Newport Beach, California, USA CALL FOR PAPERS --------------- Papers are being sought that present original results on meshing and related topics. We encourage theoretical and novel ideas with practical potential as well as technical applications from industrial researchers. In addition to our core topics in meshing related algorithms, we are also interested in obtaining technical papers that relate analysis and application solutions to the mesh generation process. Potential topics include but are not limited to: * Volume and surface mesh generation * Structured and unstructured grid generation * Hybrid meshing * Anisotropic mesh generation * Mesh quality, smoothing, and optimization * Adaptive meshing * Geometry simplification, decomposition, and cleanup * Industrial applications for complex geometries * Large mesh manipulation * CAD Interface for meshing * Parallel meshing algorithms and software * Meshing of parametric models * Theoretical basis of mesh generation 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 Engineering with Computers. 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 8-12 pages in length (9 point, two columns) and received by June 1, 2001. Paper submissions will be accepted in Word and PostScript, electronic submission only. Formatting details including templates for Word and LaTeX will be available on the conference web site. Final camera-ready papers not meeting formatting guidelines will not be accepted for publication in the proceedings.. Papers can be transferred by anonymous ftp to endo.sandia.gov (place in directory pub/incoming/pknupp/10imr) or can be mailed to pknupp@sandia.gov. Files transferred via anonymous ftp should be named as follows, to avoid collisions on the ftp site: names should start with the first author's last name, followed by a hyphen, followed by the last four digits of the author's phone number. Authors should send email to Patrick Knupp, (pknupp@sandia.gov) with the paper title and file name immediately after placing it on the site. Questions regarding paper submission should be addressed to Patrick Knupp or Nikos Chrisochoides, Technical Papers Co-Chairs. CONFERENCE REGISTRATION ----------------------- A detailed registration packet and registration form will be mailed and will be made available on the International Meshing Roundtable WWW page at: http://www.imr.sandia.gov CONFERENCE LOCATION AND HOTEL RESERVATIONS ------------------------------------------ The site of this year's Roundtable is the city of Newport Beach, California (http://www.newportbeach.com). The Roundtable will be held at the Marriott Hotel & Tennis Club in Newport Beach which is centrally located between Los Angeles and San Diego. The Marriott is adjacent to Fashion Island, an extraordinary shopping destination featuring over 200 stores and restaurants overlooking the beautiful Pacific Ocean and Newport Harbor. There are four airports with convenient service to Newport Beach: * Orange County Airport (SNA) also known as John Wayne International, 5 miles from the hotel * Long Beach (LGB, 25 miles away from the hotel.) * Los Angeles International (LAX), 43 miles, will accommodate international flights and boasts cheaper fares. * Ontario International Airport (ONT), 45 miles away from Newport Beach. Super Shuttle service (1-800-258-3826) or (714-517-6600) is available from all of these airports to the Marriott, or reservations can be made online at http://www.supershuttle.com. Newport Beach Marriott Hotel 900 Newport Center Drive Newport Beach, CA 92660 949-640-4000 (Direct) 949-640-4918 (Fax Number) http://marriotthotels.com/LAXNB/ A block of rooms has been reserved at the Newport Beach Marriott Hotel at a special conference rate of $159/day Saturday-Thursday plus state and local taxes. To ensure obtaining this rate, participants should make their own reservations before September 14th, 2001. Please note that October is an extremely busy time of the year in Newport Beach and hotel rooms are at a premium and may be hard to obtain after September 14, 2001. You must mention that you will be attending the "10TH INTERNATIONAL MESHING ROUNDTABLE" sponsored by Sandia National Laboratories to receive our special rate for the nights of October 6-10, 2001 Note: All trademarks are property STEERING COMMITTEE ------------------ The International Meshing Roundtable Steering Committee consists of representatives from national research labs, academia, and industry who serve on a rotating basis. This year's committee is: Alla Sheffer, Chair University of Illinois at Urbana-Champaign Phone: 217-244-0360 Fax: 217-333-1910 E-mail: sheffa@cse.uiuc.edu John Chawner Pointwise, Inc. Phone: 817-377-2807 Fax: 817-377-2799 E-mail: jrc@pointwise.com Nikos Chrisochoides, Technical Papers Co-Chair College of William and Mary, Computer Science Parallel Experimental Systems Lab Williamsburg, VA 23187-8795 Phone: 757-221-3466 Fax: 757-221-1717 E-mail: nikos@cs.wm.edu Tammy Eldred, Conference Coordinator Sandia National Laboratories Phone: 505-844-0180 Fax: 505-844-8251 E-mail: tjeldre@sandia.gov Patrick Knupp, Technical Papers Co-Chair Sandia National Laboratories Phone: 505-284-4565 Fax: 505-844-9297 E-mail: pknupp@sandia.gov FTP: endo.sandia.gov (pub/incoming/pknupp/10imr) Matthew Staten, Conference Host UGS, Inc. Phone: 714-952-5478 Fax: 714-952-6095 E-mail: staten@ugsolutions.com Frank Witzeman Air Force Research Laboratory Phone: 937-255-3876 Fax: 937-656-7867 E-mail: frank.witzeman@wpafb.af.mil Questions regarding registration or other conference details should be sent to: Tammy Eldred, Conference Coordinator. ***************************************************** Alla Sheffer Department of Computer Science University of Illinois (UIUC) tel: (217)-244-0360 e-mail: sheffa@uiuc.edu http://www.csar.uiuc.edu/~sheffa ****************************************************** --Descent_of_Woodpeckers_240_000 Content-Type: TEXT/html; name=NoName; charset=us-ascii Content-Description: NoName Content-MD5: ztw0r2nlu993tsRiL8PkLg== 10th IMR-CALL FOR PAPERS/ANNOUNCEMENT
  ***************************************************************
  **             Announcement and Call for Papers              **
  **                                                           **
  **           10TH INTERNATIONAL MESHING ROUNDTABLE           **
  **                                                           **
  **                   October 7-10, 2001                      **
  **               Newport Beach, California  USA              **
  **                                                           **
  **                   http://www.imr.sandia.gov               **
  **                                                           **
  ***************************************************************

Join us at the 10th International Meshing Roundtable to be held in warm and sunny Newport Beach, California, on October 7-10, 2001.

In 1992, Sandia National Laboratories started the Meshing Roundtable as a small meeting of like-minded companies and organizations striving to establish a common focus for research and development in the field of mesh and grid generation.  Now after 10 consecutive years, the International Meshing Roundtable has become recognized as an international focal point annually attended by researchers and developers from dozens of countries around the world.  The relaxed atmosphere at each Roundtable provides an open and technically rich environment in which to share new ideas and technical advances.

The International Meshing Roundtable continues to focus on bringing together researchers and developers from academia, national labs and industry in a stimulating, open environment to share technical information related to mesh generation and general pre-processing techniques.  In 2001, Roundtable attendees will enjoy the balmy weather and breathtaking beaches of Newport Beach, California, located between Los Angeles and San Diego on the Pacific coast. This year's conference will be hosted by UGS, Inc. which maintains its principle development site in Southern California.

EVENTS
------
Events at Roundtable 2001 include:
  * Pre-conference short course on Sunday, October 7
  * Technical presentations of contributed papers
  * Keynote and invited speakers
  * Poster session with "Best Technical Poster", "Best Student Poster" and
    "Meshing Maestro" awards. We encourage submission of posters presenting
      novel research results as well as posters showcasing state-of-the-art technology
      by industry developers and meshing software vendors.
  * Birds-of-a-Feather session providing a discussion forum for small groups
     of researchers working in similar fields.
  * Panel discussion.
  * Dinner Banquet

More information on the Roundtable, as it becomes available, will be published at the International Meshing Roundtable website: http://www.imr.sandia.gov


FINANCIAL SUPPORT FOR STUDENTS
----------------------------
Limited financial support from the National Science Foundation (www.nsf.gov) will be made available to student attendees from US academic institutions to defray travel and conference registration expenses. Awards of funding to students will be based on active research in mesh generation or interest in meshing as a future research topic. Funding awards will be prioritized as follows:  

* Presentation of a research paper at the conference (accepted through the regular review process)
* Presentation of a poster at the poster session accompanied by a brief, written research description
* Submission of a one-page, written statement of interest from beginning graduate students, signed
   by their advisor and/or chairman of their department.

All students must provide a copy of their student ID. Please send all proposals to Nikos Chrisochoides. More information regarding travel support for students will be posted on the International Meshing Roundtable website: http://www.imr.sandia.gov


IMPORTANT DATES
---------------
  June 1, 2001               Full paper due
  August 6, 2001           Acceptance/Rejection notices sent to authors
  August 27, 2001         Final camera-ready papers due
  September 7, 2001      Early conference registration due
  September 14, 2001    Hotel reservation due for special discount rates
  October 7, 2001         Short Course, Marriott Hotel, Newport Beach
  October 7-10, 2001    10th International Meshing Roundtable, Marriott Hotel,
                                     Newport Beach, California, USA

CALL FOR PAPERS
---------------
Papers are being sought that present original results on meshing and related topics. We encourage theoretical and novel ideas with practical potential as well as technical applications from industrial researchers. In addition to our core topics in meshing related algorithms, we are also interested in obtaining technical papers that relate analysis and application solutions to the mesh generation process. Potential topics include but are not limited to:

* Volume and surface mesh generation
* Structured and unstructured grid generation
* Hybrid meshing
* Anisotropic mesh generation
* Mesh quality, smoothing, and optimization
* Adaptive meshing
* Geometry simplification, decomposition, and cleanup
* Industrial applications for complex geometries
* Large mesh manipulation
* CAD Interface for meshing
* Parallel meshing algorithms and software
* Meshing of parametric models
* Theoretical basis of mesh generation

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 Engineering with Computers.


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 8-12 pages in length (9 point, two columns) and received by June 1, 2001. Paper submissions will be accepted in Word and PostScript, electronic submission only.  Formatting details including templates for Word and LaTeX will be available on the conference web site. Final camera-ready papers not meeting formatting guidelines will not be accepted for publication in the proceedings.. Papers can be transferred by anonymous ftp to endo.sandia.gov (place in directory pub/incoming/pknupp/10imr) or can be mailed to pknupp@sandia.gov.

Files transferred via anonymous ftp should be named as follows, to avoid collisions on the ftp site: names should start with the first author's last name, followed by a hyphen, followed by the last four digits of the author's phone number.  Authors should send email to Patrick Knupp, (pknupp@sandia.gov) with the paper title and file name immediately after placing it on the site.

Questions regarding paper submission should be addressed to Patrick Knupp or Nikos Chrisochoides, Technical Papers Co-Chairs.

CONFERENCE REGISTRATION
-----------------------
A detailed registration packet and registration form will be mailed and will be made available on the International Meshing Roundtable WWW page at: http://www.imr.sandia.gov
CONFERENCE LOCATION AND HOTEL RESERVATIONS
------------------------------------------
The site of this year's Roundtable is the city of Newport Beach, California (http://www.newportbeach.com). The Roundtable will be held at the Marriott Hotel & Tennis Club in Newport Beach  which is centrally located between Los Angeles and San Diego. The Marriott is adjacent to Fashion Island, an extraordinary shopping destination featuring over 200 stores and restaurants overlooking the beautiful Pacific Ocean and Newport Harbor.

There are four airports with convenient service to Newport Beach:
* Orange County Airport (SNA) also known as John Wayne International,  5 miles from the hotel
* Long Beach (LGB, 25 miles away from the hotel.)
* Los Angeles International (LAX), 43 miles, will accommodate international flights and
   boasts cheaper fares.
* Ontario International Airport (ONT), 45 miles away from Newport Beach.

Super Shuttle service (1-800-258-3826) or (714-517-6600) is available from all of these airports to the Marriott, or reservations can be made online at http://www.supershuttle.com.

        Newport Beach Marriott Hotel
        900 Newport Center Drive
        Newport Beach, CA 92660
        949-640-4000 (Direct)
        949-640-4918 (Fax Number)
        http://marriotthotels.com/LAXNB/

A block of rooms has been reserved at the Newport Beach Marriott Hotel at a special conference rate of $159/day Saturday-Thursday plus state and local taxes. To ensure obtaining this rate, participants should make their own reservations before September 14th, 2001. Please note that October is an extremely busy time of the year in Newport Beach and hotel rooms are at a premium and may be hard to obtain after September 14, 2001.

You must mention that you will be attending the "10TH INTERNATIONAL MESHING ROUNDTABLE" sponsored by Sandia National Laboratories to receive our special rate for the nights of October 6-10, 2001

Note: All trademarks are property


STEERING COMMITTEE
------------------
The International Meshing Roundtable Steering Committee consists of representatives from national research labs, academia, and industry who serve on a rotating basis.  This year's committee is:

Alla Sheffer, Chair
University of Illinois at Urbana-Champaign
Phone: 217-244-0360
Fax: 217-333-1910
E-mail: sheffa@cse.uiuc.edu

John Chawner
Pointwise, Inc.
Phone: 817-377-2807
Fax: 817-377-2799
E-mail: jrc@pointwise.com

Nikos Chrisochoides, Technical Papers Co-Chair
College of William and Mary, Computer Science
Parallel Experimental Systems Lab
Williamsburg, VA 23187-8795
Phone: 757-221-3466
Fax: 757-221-1717
E-mail: nikos@cs.wm.edu

Tammy Eldred, Conference Coordinator
Sandia National Laboratories
Phone: 505-844-0180
Fax: 505-844-8251
E-mail: tjeldre@sandia.gov

Patrick Knupp, Technical Papers Co-Chair
Sandia National Laboratories
Phone: 505-284-4565
Fax: 505-844-9297
E-mail: pknupp@sandia.gov
FTP: endo.sandia.gov (pub/incoming/pknupp/10imr)

Matthew Staten, Conference Host
UGS, Inc.
Phone: 714-952-5478
Fax:  714-952-6095
E-mail: staten@ugsolutions.com

Frank Witzeman
Air Force Research Laboratory
Phone: 937-255-3876
Fax: 937-656-7867
E-mail: frank.witzeman@wpafb.af.mil
Questions regarding registration or other conference details should be sent to:
--
---x--x---x---x---x--x---x---x----x----x---x---x---x---x---x---x--
 Tammy J. Eldred         ,--,   Sandia National Laboratories
               ,;` _ ___/ /\|   PO Box 5800 - MS0833
              //  ( )__, )  ~  (1515 Eubank SE, MS0833 -zip 87123)
             //   //   '--;     Albuquerque, NM 87185
            '     \     | ^     Phone: (505) 844-0180
                   ^    ^       Fax:   (505) 844-8251
~^~^~^~~^~^~~^~^~~^^~^^^^^^^^^^ Email: tjeldre@sandia.gov
                                URL:   http://www.esc.sandia.gov
---x--x---x---x---x--x---x---x----x----x---x---x---x---x---x---x--
Half the failures in life arise from pulling in one's horse
as he is leaping.    (J.C. and A.W. Hare)
---x--x---x---x---x--x---x---x----x----x---x---x---x---x---x---x--
--Descent_of_Woodpeckers_240_000-- ------------- 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 compgeom-owner@research.bell-labs.com Mon Mar 12 18:21:39 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id SAA00615 for ; Mon, 12 Mar 2001 18:21:39 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id SAA23486; Mon, 12 Mar 2001 18:21:38 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Mar 12 19:16:12 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Mon Mar 12 16:07:21 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Mar 12 16:06:14 EST 2001 Received: from cdwork.cvt.stuba.sk ([147.175.1.11]) by dusty; Mon Mar 12 16:06:13 EST 2001 Received: from gamca.sk ([193.87.160.131]) by cdwork.cvt.stuba.sk (8.10.1/8.10.1) with ESMTP id f2CL6AH21064 for ; Mon, 12 Mar 2001 22:06:10 +0100 (CET) Received: from DELFINIK/SpoolDir by gamca.sk (Mercury 1.46); 12 Mar 01 22:05:11 +0200 (MET) Received: from SpoolDir by DELFINIK (Mercury 1.46); 12 Mar 01 22:05:10 +0200 (MET) Received: from darken (193.87.242.146) by gamca.sk (Mercury 1.46); 12 Mar 01 22:05:08 +0200 (MET) From: "Darken" To: Subject: Search for algorithm... Date: Mon, 12 Mar 2001 22:05:26 +0100 Message-ID: MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2910.0) Importance: Normal X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2919.6700 Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 754 Lines: 26 Hi everybody ! I'm just a newbie in this mailing list so I am sorry for my English and sorry if'll be asking questions witch has obvious solutions... I just wanted to ask you for algoritms solving this prob : Given two convex polygons P,Q which have N,M vertexes, find their "intersection" - (give vertexes of the polygon which is their intersection). I am searching for an algorithm which solves this problem in linear time depending on N,M -> O(N+M) Thankx ! Darken (darken@gamca.sk) ------------- 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 compgeom-owner@research.bell-labs.com Tue Mar 13 09:20:57 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id JAA01747 for ; Tue, 13 Mar 2001 09:20:57 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id JAA14499; Tue, 13 Mar 2001 09:20:57 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue Mar 13 10:16:34 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Tue Mar 13 04:49:21 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue Mar 13 04:48:50 EST 2001 To: compgeom-announce@research.bell-labs.com Received: from ada.cs.ucy.ac.cy ([194.42.7.2]) by dusty; Tue Mar 13 04:48:47 EST 2001 Received: from ada.cs.ucy.ac.cy (ada.cs.ucy.ac.cy [194.42.7.2]) by ada.cs.ucy.ac.cy (8.8.8/8.8.8) with ESMTP id LAA43320; Tue, 13 Mar 2001 11:41:06 +0200 Date: Tue, 13 Mar 2001 11:41:04 +0200 (WET) From: George Angelos Papadopoulos Reply-To: george@cs.ucy.ac.cy Subject: ACM SAC'02 -- Last Call for Track Proposals Message-ID: Organization: Department of Computer Science - University of Cyprus Address: 75 Kallipoleos Str. -- POB 20537 -- CY-1678 -- Nicosia -- Cyprus Tel: +357-2-892242 -- Fax: +357-2-339062 URL: http://www.cs.ucy.ac.cy/~george MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 4326 Lines: 90 (Sincere apologies if you receive this call multiple times) 2002 ACM SYMPOSIUM ON APPLIED COMPUTING (SAC'02) Madrid, Spain, 10-13 March 2002 *** Last Call for Track Proposals *** For the past sixteen years the ACM Symposium on Applied Computing (SAC) has been a primary forum for applied computer scientists, computer engineers and application developers to gather, interact and present their work. SAC is sponsored by the ACM Special Interest Group on Applied Computing (SIGAPP); its proceedings are published by ACM in both printed form and CD-ROM; they are also available on the web through ACM's Digital Library. More information on SAC can be found at http://www.acm.org/conferences/sac . SAC is based on a flexible structure of mostly self-contained and self-managed tracks. Over the past years it has hosted tracks on a variety of topics such as Artificial Intelligence, BioInformatics, Computers in Education, Distributed Systems, Internet Technologies, Software Engineering, etc. For SAC'02, to be held in Spain between 11-13 of March 2002 (the 10th is dedicated for tutorials), the SAC organizers solicit proposals for hosting tracks. Perspective track chairs should submit an up to one page description for organizing a track, which should include at least the following items: 1) The proposed title for the track with a description of its aims, topics it will cover and rationale for having such a track in SAC. This rationale should refer to any related conference events that are held regularly and why the proposed track differs from them or complements them. The proposed track should not be over general but also not overly specialized, thus being able to attract a wide audience of people sharing similar interests. Proposals from industry are also welcomed. Despite its name, SAC also welcomes topics of mostly theoretical nature, provided there is clear practical potential in applying the results of such work. 2) A short description of the activities the track chair will undertake upon acceptance of the proposal, to disseminate the call-for-papers for his/her track, manage the review process and collect final materials from authors of accepted papers. (Specific guidelines to track chairs regarding these issues will also be provided.) 3) A short CV of the perspective track chair(s) with reference to research interests and publication record directly related to the themes of the proposed track, and any previous experience of involvement in the organization of similar events (in the interest of brevity, reference to a personal web page where such information can be found will be welcomed). All proposals will be reviewed by the Conference and Program Chairs with respect to the above criteria. The Chairs reserve the right to: (1) accept a proposal as is, (2) recommend merging of similar proposals with a considerable overlap in the topics addressed (in this case the track chairs of the different proposals will be asked to form a single chair), (3) reject a proposal. Upon acceptance of a proposal, the track chairs will be notified of their responsibilities in managing the affairs of their tracks, as these are defined by SAC itself but also ACM. The Chairs reserve the right to cancel at any time a track, if these responsibilities are not addressed adequately by its track chair(s). Please submit your proposal electronically and in any acceptable readable form to: George A. Papadopoulos Department of Computer Science University of Cyprus E-Mail: george@cs.ucy.ac.cy IMPORTANT DATES 20 March 2001: Submission of track proposals 15 April 2001: Notification of acceptance/rejection 15 May 2001: Call-For-Papers for accepted tracks 1 Sept 2001: Submission of papers and tutorial proposals 15 Oct 2001: Notification of Acceptance/Rejection 1 Nov 2001: Camera-Ready copies of accepted papers 10-13 March 2002: SAC'02 takes place ------------- 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 compgeom-owner@research.bell-labs.com Thu Mar 15 09:16:29 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id JAA08318 for ; Thu, 15 Mar 2001 09:16:28 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id JAA24964; Thu, 15 Mar 2001 09:16:27 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Mar 15 10:09:52 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Thu Mar 15 08:53:23 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Mar 15 08:51:30 EST 2001 Received: from procyon.inria.fr ([138.96.83.3]) by dusty; Thu Mar 15 08:51:28 EST 2001 Received: from procyon.inria.fr by procyon.inria.fr (8.11.1/8.10.0) with ESMTP id f2FDpGe01394; Thu, 15 Mar 2001 14:51:16 +0100 Message-Id: <200103151351.f2FDpGe01394@procyon.inria.fr> X-Mailer: exmh version 2.3.1 01/18/2001 To: compgeom-announce@research.bell-labs.com Subject: A position at INRIA cc: amenta@cs.utexas.edu, amato@cs.tamu.edu, chazelle@cs.princeton.edu, franco@cs.brown.edu, golin@cs.ust.hk, hbr@poly.edu, jeffe@cs.uiuc.edu, jsv@cs.duke.edu, nielsen@csl.sony.co.jp, otfried@cs.ruu.nl, sue@cs.mcgill.ca, Pierre.Angelier@ens.fr, Dominique.Attali@inpg.fr, Bernard.Lacolle@imag.fr, lazard@loria.fr, azarus@sic.sp2mi.univ-poitiers.fr, andre_lieutier@ds-fr.com, manuela.neagu@unilim.fr, Michel.Pocchiola@ens.fr, jc.spehner@univ-mulhouse.fr, Anne.Verroust@inria.fr, antoine@cs.ust.hk Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Thu, 15 Mar 2001 14:51:16 +0100 From: Mariette Yvinec Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2344 Lines: 54 A twelve month position at INRIA Sophia Antipolis to improve the packaging and porting of CGAL on Windows operating systems The Computational Geometry Algorithms Library (http://www.cgal.org) is a C++ library which aims to make the most important of the solutions and methods developed in computational geometry available to users in industry and academia. CGAL results from a collaborative effort of seven research institute (INRIA Sophia Antipolis, Max Planck Institute, ETH Zurich, Utrecht University, Tel Aviv University, FU Berlin and Halle University). In order to help the diffusion of CGAL, INRIA offers a twelve month position to improve the packaging of CGAL for windows platforms. The work to be done mainly consists in : - setting up an easy installation procedure under Windows, - create demos with a convivial GUI. (This assumes to find out and set up the right combination of viewer/window tool kit) - set up IDE projects for CGAL demos and examples, - check the debugging possibilities under IDE - configure CGAL for the next release of VC++ (cleaning no longer usefull workarounds) - evaluate the Intel plugin compiler - evaluate how CGAL functionalities could be offered through MS component technology. Thus, we are looking with candidate with more or less the following profile : - a good knowledge of VC++ application developpement - a good knowledge of unix for porting and platform question - fluency in english - some knowledge on viewing and windows toolkit If this offer interests you or anybody in your neighboorhood, please react quickly. We have to find a good candidate for this position before the BEGINNING OF MAY otherwise the funding for that position will vanish. --------------------------------------------------------------------- Mariette Yvinec INRIA Sophia-Antipolis email: yvinec@sophia.inria.fr 2004, Route des Lucioles BP 93 phone: 33 (0)4 92.38.77.49 06902 Sophia-Antipolis Cedex (France) fax : 33 (0)4 92.38.76.43 http://www.inria.fr/prisme/personnel/yvinec/yvinec.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 compgeom-owner@research.bell-labs.com Tue Mar 20 11:40:09 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id LAA29351 for ; Tue, 20 Mar 2001 11:40:09 -0600 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id LAA27343; Tue, 20 Mar 2001 11:40:08 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Mar 20 12:36:36 EST 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Mon Mar 19 10:24:46 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Mar 19 10:14:10 EST 2001 Received: from ziggy.poly.edu ([128.238.32.79]) by dusty; Mon Mar 19 10:14:03 EST 2001 Received: (from aronov@localhost) by ziggy.poly.edu (8.9.0/8.9.0) id KAA00581; Mon, 19 Mar 2001 10:13:30 -0500 (EST) Date: Mon, 19 Mar 2001 10:13:30 -0500 (EST) From: Boris Aronov Message-Id: <200103191513.KAA00581@ziggy.poly.edu> To: THEORYNT@listserv.nodak.edu, compgeom-announce@research.bell-labs.com Subject: The Goodman--Pollack two-thirds-of-a-century fest NEW DATE User-Agent: REMI/1.14.2 (=?ISO-8859-4?Q?Hokuhoku-=D2shima?=) Chao/1.14.1 (=?ISO-8859-4?Q?Rokujiz=F2?=) APEL/10.2 Emacs/20.7 (sparc-sun-solaris2.7) MULE/4.0 (HANANOEN) MIME-Version: 1.0 (generated by REMI 1.14.2 - =?ISO-8859-4?Q?=22Hokuhoku-=D2?= =?ISO-8859-4?Q?shima=22?=) Content-Type: text/plain; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1388 Lines: 50 New York University Courant Institute of Mathematical Sciences THE GOODMAN--POLLACK TWO-THIRDS-OF-A-CENTURY FEST A special Computational Geometry Day celebrating the 2/3 x 100 birthdays of Eli Goodman and Ricky Pollack Friday, May 4, 2001 Room 109, Warren Weaver Hall 251 Mercer St., New York, NY 10012 9:45--10:15 Coffee (Warren Weaver Hall Lobby) 10:15--10:30 Opening Addresses 10:30--11:15 Gil Kalai, Hebrew University, Jerusalem Learnability and Rationality of Choice 11:30--12:15 Rephael Wenger, Ohio State University Geometric Transversal Theory in the New Millennium 12:30--2:00 Lunch 2:00--2:45 Laszlo Lovasz, Microsoft, Inc. Steinitz Representations 3:00--3:45 Pankaj K. Agarwal, Duke University Arrangements: Combinatorial and Algorithmic Applications 4:00--5:00 Wine and Cheese Reception (13th floor lounge) For more information contact: Janos Pach (212) 998-3184 pach@cims.nyu.edu Micha Sharir sharir@math.tau.ac.il ------------- 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 compgeom-owner@research.bell-labs.com Mon Mar 26 12:27:47 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id MAA09300 for ; Mon, 26 Mar 2001 12:27:47 -0600 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id MAA20140; Mon, 26 Mar 2001 12:27:47 -0600 (CST) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Mar 26 13:22:52 EST 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Sun Mar 25 23:09:05 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sun Mar 25 23:07:18 EST 2001 Received: from yogi.eecs.tufts.edu ([130.64.23.171]) by dusty; Sun Mar 25 23:07:17 EST 2001 Received: from piano.eecs.tufts.edu (Piano.EECS.Tufts.EDU [130.64.23.40]) by yogi.eecs.tufts.edu (Postfix) with ESMTP id 1E8381A6E8 for ; Sun, 25 Mar 2001 23:08:43 -0500 (EST) Received: (from dls@localhost) by piano.eecs.tufts.edu (8.9.1a/8.9.1) id XAA04535 for compgeom-announce@research.bell-labs.com; Sun, 25 Mar 2001 23:07:16 -0500 (EST) Date: Sun, 25 Mar 2001 23:07:16 -0500 (EST) From: Message-Id: <200103260407.XAA04535@piano.eecs.tufts.edu> To: compgeom-announce@research.bell-labs.com Subject: ACM Symposium on Computional Geometry 2001: Conference Program Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 9931 Lines: 240 ************************************************************* The 15th Annual ACM Symposium on Computational Geometry Tufts University Medford/Somerville, Massachusetts June 3-5, 2001 http://www.eecs.tufts.edu/EECS/scg01 http://www.eecs.tufts.edu/EECS/scg01/prog.ps Sponsored by ACM SIGACT and SIGGRAPH With support from Tufts University and MERL ************************************************************* Saturday, June 2 Optional Cruises of Boston Harbour: 1:00 p.m. & 3:00 p.m. Cocktail Hour and Registration: 6:00 - 8:00 pm Sunday, June 3 Session 1 9:00 On the Number of Congruent Simplices in a Point Set: Pankaj K. Agarwal (Duke); Micha Sharir (Tel Aviv & NYU) 9:20 Enumerating Order Types for Small Point Sets with Applications O. Aichholzer, F. Aurenhammer, H. Krasser (Graz U. of Technology) 9:40 The Union of Congruent Cubes in Three Dimensions: Janos Pach (CUNY, NYU, Hungarian Acad. of Sciences) Ido Safruti (Tel Aviv) Micha Sharir (Tel Aviv & NYU) 10:00 Different Distances of Planar Point Sets: Jozsef Solymosi, Csaba David Toth (ETH Z) Refreshment break Session 2 10:40 Schematization of Road Networks: Sergio Cabello, Mark de Berg, Steven van Dijk, Marc van Kreveld, Tycho Strijk (Utrecht) 11:00 Simplifying a Polygonal Subdivision While Keeping it Simple: Regina Estkowski (HRL Labs) Joseph S. B. Mitchell (SUNY Stony Brook) 11:20 Hardware-Assisted View-Dependent Map Simplification Nabil Mustafa (Duke) Eleftheris Koutsofios, Shankar Krishnan, Suresh Venkatasubraminian (AT&T Research) 11:40 Efficient Perspective-Accurate Silhouette Computation and Applications: Mihai Pop (TIGR) Gill Barequet (Technion) Christian A. Duncan (U. Miami) Michael T. Goodrich, Wenjing Huang, Subodh Kumar (Johns Hopkins) Lunch: 12:00 pm Invited Talk 1:30 Sphere Packings and Generative Programming: Thomas Hales (U. Michigan) Session 3 2:45 Hierarchical Morse Complexes for Piecewise Linear 2-Manifolds: Herbert Edelsbrunner (Duke & Raindrop Geomagic) John Harer (Duke) Afra Zomorodian (UI Urbana-Champaign) 3:05 Computing a Canonical Polygonal Schema of an Orientable Triang- ulated Surface: Francis Lazarus (CNRS & U. Poitiers) Michel Pocchiola (Ecole Normale Superieure) Gert Vegter (Groningen) Anne Verroust (INRIA, Rocquencourt) 3:25 Area-Preserving Piecewise-Affine Transformations: Alan Saalfeld (Ohio-State) Refreshment Break Session 4 4:15 Nice Point Sets Can Have Nasty Delaunay Triangulations: Jeff Erickson (UI Urbana-Champaign) 4:35 Walking in a Triangulation: Olivier Devillers, Sylvain Pion, Monique Teillaud (INRIA, Sophia Antipolis) 4:55 Sink-insertion for Mesh Improvement: Herbert Edelsbrunner (Duke) Damrong Guoy (UI Urbana-Champaign) Business Meeting: 5:30 pm, Cabot Auditorium Monday, June 4 Session 5 9:00 Box-Trees and R-Trees with Near-Optimal Query Time: Pankaj K. Agarwal (Duke) Mark de Berg (Utrecht) Joachim Gudmundsson, Mikael Hammar (Lund U.) Herman J. Havekort (Utrecht) 9:20 A Segment-Tree Based Kinetic BSP: Mark de Berg (Utrecht) Joao Comba, Leonidas J. Guibas (Stanford) 9:40 Binary Space Partitions for Axis-Parallel Segments, Rectangles, and Hyperrectangles: Adrian Dumitrescu, Joseph S. B. Mitchell (SUNY Stony Brook) Micha Sharir (Tel Aviv & NYU ) 10:00 A Note on Binary Plane Partitions: Csaba David Toth (ETH Z) Refreshment Break Session 6 10:40 Exact Nearest Neighbor Search in High Dimensions: Helmut Alt, Laura Heinrich-Litan (Freie U. Berlin) 11:00 Farthest Neighbors and Center Points in the Presence of Rectangular Obstacles: Boaz Ben-Moshe, Matthew J. Katz (Ben-Gurion) Joseph S. B. Mitchell (SUNY Stony Brook) 11:20 A Fully Dynamic Algorithm for Planar Width: Timothy M. Chan (U. Waterloo) 11:40 A Practical Approach for Computing the Diameter of a Point-Set Sariel Har-Peled (UI Urbana-Champaign) Lunch: 12:00 pm Invited Talk 1:30 Protein Geometry as a Function of Time: Fred Richards (Yale) Session 7 2:45 Discrete Mobile Centers: Jie Gao, Leonidas J. Guibas (Stanford) John Hershberger (Mentor Graphics) Li Zhang (Compaq Systems Research) An Zhu (Stanford) 3:05 Segment Intersection Searching Problems in General Settings: Vladlen Koltun (Tel Aviv) 3:25 On the Complexity of Halfspace Area Queries: Stefan Langerman (Rutgers) Refreshment Break Session 8 4:15 Algorithms for Congruent Sphere Packing and Applications Danny Z. Chen, Xiaobo {Sharon} Hu, Yingping Huang, Yifan Li (Notre Dame) Jinhui Xu (SUNY Buffalo) 4:35 polymake: an Approach to Modular Software Design in Computational Geometry: Ewgenij Gawrilow, Michael Joswig (TU-Berlin) 4:55 A Randomized Art-Gallery Algorithm for Sensor Placement Hector Gonzalez-Banos, Jean-Claude Latombe (Stanford Barbecue 6:00 pm: Gather on the lawn between Lewis and Tilton Halls for an outdoor cookout with blankets, frisbees, and volleyball (weather permitting) followed by music by blues band DEEP FREYED , featuring Bill Frey, Matt Dickerson, Daniel Scharstein, and special guest. Tuesday, June 5 Session 9 9:00 Notes on Computing Peaks in k-Levels and Parametric Spanning Trees: Naoki Katoh ( Kyoto U.) Takeshi Tokuyama (Tohoku U.) 9:20 Geometric Permutations of Fat Objects: Matthew Katz (Ben-Gurion) Kasturi Varadarajan (U. Iowa) 9:40 The Clarkson-Shor Technique Revisited and Extended: Micha Sharir (Tel Aviv & NYU) 10:00 Detecting Undersampling in Surface Reconstruction: Tamal K. Dey, Joachim Giesen (Ohio State) Refreshment Break Session 10 10:40 Computing the Intersection of Quadrics: Exactly and Actually! Nicola Geismann (Saarlandes) Michael Hemmer, Elmar Schoemer (Max Planck Saarbruecken) 11:00 PRECISE: Efficient Multiprecision Evaluation of Algebraic Roots and Predicates for Reliable Geometric Computation: S. Krishnan (AT&T Research) M. Foskey (UNC) T. Culver (Think3) J. Keyser (Texas A ) D. Manocha (UNC) Invited Talk 11:30 Computational Geometry for Sculpture: George W. Hart http://www.georgehart.com/ Lunch: 12:30 pm Session 11 2:00 New Bounds on the Betti Numbers of Semi-Algebraic Sets and Arrangements of Real Algebraic Hypersurfaces: Saugata Basu (Georgia Tech) 2:20 Efficient and Small Representation of Line Arrangements with Applications: David P. Dobkin (Princeton) Ayellet Tal (Technion) 2:40 A Sum of Squares Theorem for Visibility Complexes Pierre Angelier, Michel Pocchiola (Ecole Normale Sup Short Break 3:15 Monotone Paths in Line Arrangements: Rados Radoicic (MIT) Geza Toth (MIT & Hungarian Acad. of Sciences) 3:35 Balanced Lines, Halving Triangles, and the Generalized Lower Bound Theorem: Micha Sharir (Tel Aviv & NYU) Emo Welzl (ETH Z) Refreshment Break: 4:00 - 4:30 pm Optional: Boston Red Sox vs Detroit Tigers, 7:30 p.m. at Fenway Park ****************************************************************** 10th Annual Video Review of Computational Geometry The video review showcases advances in the use of algorithm animation, visualization, and interactive computing in the study of computational geometry. The video review tape is distributed to all registrants at the conference and will subsequently be available from ACM. * Small Representation of Line Arrangements: Ayellet Tal (Technion), David Dobkin (Princeton) * The convex hull of ellipsoids: Nicola Geismann (Saarlandes) Michael Hemmer, Elmar Schomer (Max Planck Saarbruecken) * 2-point site Voronoi Diagram: Gill Barequet (Technion), Matthew Dickerson (Middlebury) Robert Drysdale (Dartmouth) * The Connectivity Shapes Video: Martin Isenburg (UNC), Stefan Gumhold (Tubingen), Craig Gotsman (Technion) * A prototype system for Visualizing Time-Dependent Data: Lutz Kettner, Jack Snoeyink (UNC) ************************************************************************ Theoretical Track Program Committee: Applied Track Program Committee: Boris Aronov (Polytechnic U, Brooklyn) Nancy Amato (Texas A&M) Otfried Cheong (Utrecht U) Karl Bo"hringer (U Washington, Seattle) Jesu's De Loera (UC Davis) Franca Gianini (IMA, Genova) David Eppstein, Chair (UC Irvine) Lutz Kettner (UNC Chapel Hill) Sariel Har-Peled (UI Urbana Champaign) Dan Halperin, Chair (Tel Aviv U) Piotr Indyk (MIT) Kurt Mehlhorn (MPII, Saarbru"cken) Edgar A. Ramos (MPII Saarbru"cken) Mark Overmars (Utrecht U) Ileana Streinu (Smith College) Seth Teller (MIT) Peter Widmayer (ETH Zurich) Video Review Committee Mariette Yvinec (INRIA Sophia-Antipolis) Jonathan Cohen (Johns Hopkins) Herbert Edelsbrunner (Duke) Subodh Kumar (Johns Hopkins) Conference Chair Ming C. Lin (UNC Chapel Hill) Dinesh Manocha, Chair (UNC Chapel Hill) Diane L. Souvaine (Tufts U) Amitabh Varshney (U of Maryland) ******************************************************************************* ------------- The compgeom mailing lists: see http://netlib.bell-labs.com/netlib/compgeom/readme.html or send mail to compgeom-request@research.bell-labs.com with the line: send readme Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Mon Apr 2 12:16:09 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id MAA15630 for ; Mon, 2 Apr 2001 12:16:08 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id MAA07633; Mon, 2 Apr 2001 12:16:08 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Apr 2 13:12:38 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Sat Mar 24 10:59:04 EST 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Sat Mar 24 10:57:32 EST 2001 Received: from relay2.primushost.com ([207.244.125.21]) by dusty; Sat Mar 24 10:57:31 EST 2001 Received: from cmbr1-tnt-01-228.port.shore.net (1z4an.shore.net) [209.58.174.228] by relay2.primushost.com with esmtp (Exim) for compgeom-announce@research.bell-labs.com id 14gqSI-0005TS-00; Sat, 24 Mar 2001 10:59:55 -0500 Message-Id: <4.3.2.7.2.20010324103316.00b1c750@shell.shore.net> X-Sender: bradb@shell.shore.net X-Mailer: QUALCOMM Windows Eudora Version 4.3.2 Date: Sat, 24 Mar 2001 10:48:29 -0500 To: "compgeom-announce@research.bell-labs.com" From: Brad Barber Subject: Announce: Qhull 3.0 for convex hull, Delaunay, Voronoi, Halfspace Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii"; format=flowed Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2384 Lines: 63 I am pleased to announce Qhull 3.0 for computing convex hulls, Delaunay triangulations, Voronoi diagrams, and halfspace intersection about a point. It includes programs for each of these structures. Qhull uses floating point arithmetic to compute an approximation to the convex hull. Each facet is defined by an outer plane that is clearly above all points and an inner plane that is clearly below the vertices. It provides two methods to handle precision errors: facet merging -- If a ridge is not clearly convex, Qhull merges a facet into a neighboring facet. joggled input -- Qhull randomly perturbs the input. If a precision error occurs, Qhull restarts with a larger joggle. For example, rbox 1000 W0 | qconvex QR0 R1e-3 computes the convex hull of 1000 points on the surface of a rotated unit cube. To test Qhull, each computation is randomly perturbed by up to 0.001. Qhull merged 92 facets to handle precision errors. Convex hull of 1000 points in 3-d: Number of vertices: 52 Number of facets: 39 Number of non-simplicial facets: 12 Statistics for: RBOX 1000 W0 | QCONVEX QR0 R1e-3 QR985448492 Number of points processed: 62 Number of hyperplanes created: 178 Number of distance tests for qhull: 18629 Number of merged facets: 92 Number of distance tests for merging: 2801 CPU seconds to compute hull (after input): 0.11 Maximum distance of point above facet: 0.0038 (0.6x) Maximum distance of vertex below facet: -0.0074 (1.2x) Home page: http://www.geom.umn.edu/locate/qhull Convex hull: http://www.geom.umn.edu/software/qhull/html/qconvex.htm Delaunay triangulation: http://www.geom.umn.edu/software/qhull/html/qdelaun.htm Voronoi diagram: http://www.geom.umn.edu/software/qhull/html/qvoronoi.htm Halfspace intersection about a point: http://www.geom.umn.edu/software/qhull/html/qhalf.htm N-dimensional point distributions: http://www.geom.umn.edu/software/qhull/html/rbox.htm --Brad ------------- 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 compgeom-owner@research.bell-labs.com Mon Apr 2 12:17:26 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id MAA15634 for ; Mon, 2 Apr 2001 12:17:26 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id MAA07688; Mon, 2 Apr 2001 12:17:25 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Apr 2 13:07:27 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Mon Apr 2 11:11:06 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Apr 2 11:09:21 EDT 2001 Received: from magnolia.math.uwaterloo.ca ([129.97.74.123]) by dusty; Mon Apr 2 11:09:19 EDT 2001 Received: from localhost (biedl@localhost) by magnolia.math.uwaterloo.ca (8.9.3/8.9.3) with ESMTP id LAA13510; Mon, 2 Apr 2001 11:08:59 -0400 (EDT) X-Authentication-Warning: magnolia.math: biedl owned process doing -bs Date: Mon, 2 Apr 2001 11:08:58 -0400 (EDT) From: Therese Biedl To: THEORYNT@LISTSERV.NODAK.EDU, DMANET@zpr.uni-koeln.de, compgeom-announce@research.bell-labs.com Subject: CCCG'01: Second Call for Papers Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2863 Lines: 87 -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- Second Call for Papers 13th Canadian Conference on Computational Geometry August 13-15, 2001 University of Waterloo http://compgeo.math.uwaterloo.ca/~cccg01 -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- [Due to unanticipated shorter printing schedule, we are able to shift the deadline by two weeks. The new deadline for paper submission is April 30, 2001.] 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 using the SIGACT Electronic Submissions Server. Details can be found on the conference web page. A special issue of Computational Geometry: Theory and Applications will be devoted to invited papers from the conference. Program Committee ================= Therese Biedl (Univ. of Waterloo) Timothy Chan (Univ. of Waterloo) Erik Demaine (Univ. of Waterloo) David Kirkpatrick (Univ. of British Columbia) Anna Lubiw (Univ. of Waterloo) Joseph O'Rourke (Smith College) Godfried Toussaint (McGill University) Organizing Committee ==================== Therese Biedl (Univ. of Waterloo) Erik Demaine (Univ. of Waterloo) Martin Demaine (Univ. of Waterloo) Anna Lubiw (Univ. of Waterloo) Important dates =============== Submission of papers: April 30, 2001 Notification of acceptance: May 29, 2001 Submission of final paper: June 29, 2001 Conference: August 13-15, 2001 Contact Information =================== Therese Biedl Dept. of Computer Science University of Waterloo Waterloo, ON N2L 3G1 Phone: (519) 888-4567x4721 Fax: (519) 885-1208 Email: biedl@uwaterloo.ca Sponsors ======== CCCG '01 is supported by CRM, The Fields Institute, PIMS and the University of Waterloo. ------------- 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 compgeom-owner@research.bell-labs.com Tue Apr 10 16:28:05 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id QAA11078 for ; Tue, 10 Apr 2001 16:28:05 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id QAA22353; Tue, 10 Apr 2001 16:27:58 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Apr 10 17:22:44 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Mon Apr 9 09:27:03 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Mon Apr 9 09:26:56 EDT 2001 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.38]) by dusty; Mon Apr 9 09:26:51 EDT 2001 Received: by nrclonex1.imti.nrc.ca with Internet Mail Service (5.5.2653.19) id ; Mon, 9 Apr 2001 09:26:52 -0400 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFFBF8@nrclonex1.imti.nrc.ca> From: "Dickinson, John" To: "'compgeom-discuss@research.bell-labs.com'" Subject: Silhouette of a facetted polyhedra Date: Mon, 9 Apr 2001 09:26:50 -0400 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain; charset="iso-8859-1" Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1231 Lines: 30 I want to get the shadow or projection of a 3D facetted polyhedra on a plane. In other words I want to project all the triangles that describe the surface of the polyhedra onto a plane and union them so that I have a polygon possibly with inclusions or holes (e.g. project a donut onto a plane perpendicular to the axis of its hole). Can anyone point me to some code or papers that would give decent algorithms for doing this (specifically the union of all the facets into a polygon)? The goal of this is to determine the centroid and area of the resultant projection. Is there a way to do this without building the projected polygon first? John -- -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859) ---- John Kenneth Dickinson | "A sharp tongue is the only Research Council Officer IMTI-NRC | edge tool that grows keener email: john.dickinson@nrc.ca | with constant use." http://publish.uwo.ca/~jkdickin/ | ------------- 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 compgeom-owner@research.bell-labs.com Tue Apr 10 16:33:51 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id QAA11094 for ; Tue, 10 Apr 2001 16:33:51 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id QAA28529; Tue, 10 Apr 2001 16:33:50 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Apr 10 17:28:39 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Mon Apr 9 09:45:08 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Apr 9 09:43:19 EDT 2001 Received: from cedar.dcs.shef.ac.uk ([143.167.8.6]) by dusty; Mon Apr 9 09:43:15 EDT 2001 Received: from padley.dcs.shef.ac.uk (padley.dcs.shef.ac.uk [143.167.9.77]) by cedar.dcs.shef.ac.uk (8.9.3+Sun/8.9.3) with ESMTP id OAA14814; Mon, 9 Apr 2001 14:42:59 +0100 (BST) From: Joab Winkler Received: (from joab@localhost) by padley.dcs.shef.ac.uk (8.9.3+Sun/8.9.3) id OAA12774; Mon, 9 Apr 2001 14:43:08 +0100 (BST) Date: Mon, 9 Apr 2001 14:43:08 +0100 (BST) Message-Id: <200104091343.OAA12774@padley.dcs.shef.ac.uk> To: compgeom-announce@research.bell-labs.com Subject: Workshop, Sheffield July 2001 Cc: j.winkler@cedar.dcs.shef.ac.uk X-Sun-Charset: US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1947 Lines: 62 ***** Apologies for multiple receipts of this e-mail ***** Dear Colleague, Registration is now open for the workshop ** Uncertainty in Geometric Computations, 5-6 July 2001, Sheffield ** The representation and management of uncertainty is an important issue in several different disciplines, such as numerical problems in computer graphics that occur when calculating the intersection curve of two surfaces, high performance pattern classification in a feature space, and the study of families of probability distributions in information geometry. The aim of this two-day workshop is to explore the underlying geometric theme that is common to these diverse disciplines. The workshop will consist of a number of invited contributions of a tutorial nature covering the different topics, contributed papers from participants and discussion sessions that explore the connections. Contributions will be published by Kluwer in an edited volume. The workshop is sponsored by the Engineering and Physical Sciences Research Council (EPSRC) and London Mathematical Society (LMS). The total number of participants is limited to 70. The workshop is sponsored by the London Mathematical Society and Engineering and Physical Sciences Research Council. For further information see: http://www.shef.ac.uk/~geom2001/ In order to register, please use the registration form on this web page. Best regards Joab Winkler ------------------------------------------ Dr Joab R Winkler The University of Sheffield Department of Computer Science Regent Court 211 Portobello Street Sheffield S1 4DP United Kingdom Tel : +44 114 222 1834 Fax : +44 114 222 1810 E-mail : j.winkler@dcs.shef.ac.uk ------------- 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 compgeom-owner@research.bell-labs.com Wed Apr 11 09:21:06 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id JAA12572 for ; Wed, 11 Apr 2001 09:21:05 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id JAA02576; Wed, 11 Apr 2001 09:20:52 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed Apr 11 10:14:44 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Wed Apr 11 09:19:07 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Apr 11 09:17:37 EDT 2001 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.38]) by dusty; Wed Apr 11 09:17:26 EDT 2001 Received: by nrclonex1.imti.nrc.ca with Internet Mail Service (5.5.2653.19) id ; Wed, 11 Apr 2001 09:17:31 -0400 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFFC0A@nrclonex1.imti.nrc.ca> From: "Dickinson, John" To: "'Hans Pedersen'" Cc: "'compgeom-discuss@research.bell-labs.com'" Subject: RE: Silhouette of a facetted polyhedra Date: Wed, 11 Apr 2001 09:17:21 -0400 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: multipart/alternative; boundary="----_=_NextPart_001_01C0C289.BDB75270" Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 7739 Lines: 173 This message is in MIME format. Since your mail reader does not understand this format, some or all of this message may not be legible. ------_=_NextPart_001_01C0C289.BDB75270 Content-Type: text/plain; charset="iso-8859-1" Unfortunately, hardware solutions aren't practical in this case. I do, however, have the luxury of doing the projection calculations off-line. John -----Original Message----- From: Hans Pedersen [mailto:Hans@paraform.com] Sent: Tuesday, April 10, 2001 5:47 PM To: 'Dickinson, John' Subject: RE: Silhouette of a facetted polyhedra Hi John, You can use graphics hardware to reduce this to a 2d image processing operation that will give you an approximation to centroid/area: Render all the polygons on the plane that you want and compute centroid/ area from the resulting binary image. You can get any accuracy you want by increasing the resolution of the image. Just an idea - good luck! Hans --- Hans K. Pedersen Sr. Software Engineer Paraform Inc Santa Clara, California, USA -----Original Message----- From: Dickinson, John [ mailto:John.Dickinson@nrc.ca ] Sent: Monday, April 09, 2001 6:27 AM To: 'compgeom-discuss@research.bell-labs.com' Subject: Silhouette of a facetted polyhedra I want to get the shadow or projection of a 3D facetted polyhedra on a plane. In other words I want to project all the triangles that describe the surface of the polyhedra onto a plane and union them so that I have a polygon possibly with inclusions or holes (e.g. project a donut onto a plane perpendicular to the axis of its hole). Can anyone point me to some code or papers that would give decent algorithms for doing this (specifically the union of all the facets into a polygon)? The goal of this is to determine the centroid and area of the resultant projection. Is there a way to do this without building the projected polygon first? John -- -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859) ---- John Kenneth Dickinson | "A sharp tongue is the only Research Council Officer IMTI-NRC | edge tool that grows keener email: john.dickinson@nrc.ca | with constant use." http://publish.uwo.ca/~jkdickin/ | ------------- 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 . ------_=_NextPart_001_01C0C289.BDB75270 Content-Type: text/html; charset="iso-8859-1" RE: Silhouette of a facetted polyhedra
Unfortunately, hardware solutions aren't practical in this case.  I do, however, have the luxury of doing the projection calculations off-line.
 
John
-----Original Message-----
From: Hans Pedersen [mailto:Hans@paraform.com]
Sent: Tuesday, April 10, 2001 5:47 PM
To: 'Dickinson, John'
Subject: RE: Silhouette of a facetted polyhedra

Hi John,

You can use graphics hardware to reduce this to a 2d image processing
operation that will give you an approximation to centroid/area:

Render all the polygons on the plane that you want and compute centroid/
area from the resulting binary image. You can get any accuracy you want
by increasing the resolution of the image.

Just an idea - good luck!

Hans

---
Hans K. Pedersen
Sr. Software Engineer
Paraform Inc
Santa Clara, California, USA

-----Original Message-----
From: Dickinson, John [mailto:John.Dickinson@nrc.ca]
Sent: Monday, April 09, 2001 6:27 AM
To: 'compgeom-discuss@research.bell-labs.com'
Subject: Silhouette of a facetted polyhedra


I want to get the shadow or projection of a 3D facetted polyhedra on a
plane.  In other words I want to project all the triangles that describe the
surface of the polyhedra onto a plane and union them so that I have a
polygon possibly with inclusions or holes (e.g. project a donut onto a plane
perpendicular to the axis of its hole).

Can anyone point me to some code or papers that would give decent algorithms
for doing this (specifically the union of all the facets into a polygon)?

The goal of this is to determine the centroid and area of the resultant
projection.  Is there a way to do this without building the projected
polygon first?

John

--
-((Insert standard disclaimer here))-|--- Washington Irving (1783-1859) ----
John Kenneth Dickinson               |   "A sharp tongue is the only
Research Council Officer  IMTI-NRC   |    edge tool that grows keener
email: john.dickinson@nrc.ca         |    with constant use."
http://publish.uwo.ca/~jkdickin/     |



-------------
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.

------_=_NextPart_001_01C0C289.BDB75270-- ------------- 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 compgeom-owner@research.bell-labs.com Wed Apr 11 09:22:41 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id JAA12577 for ; Wed, 11 Apr 2001 09:22:41 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id JAA02639; Wed, 11 Apr 2001 09:22:36 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Apr 11 10:18:28 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Wed Apr 11 09:29:02 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Apr 11 09:28:37 EDT 2001 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.38]) by dusty; Wed Apr 11 09:28:26 EDT 2001 Received: by nrclonex1.imti.nrc.ca with Internet Mail Service (5.5.2653.19) id ; Wed, 11 Apr 2001 09:28:31 -0400 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFFC0B@nrclonex1.imti.nrc.ca> From: "Dickinson, John" To: "'Steven Spitz'" Cc: "'compgeom-discuss@research.bell-labs.com'" Subject: RE: Silhouette of a facetted polyhedra Date: Wed, 11 Apr 2001 09:28:30 -0400 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain; charset="iso-8859-1" Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2736 Lines: 80 Thanks for the pointer. I checked out your online abstracts an they look impressive but not really along the line or simplicity of what I am looking for. I can reduce my task to the more simple problem of unioning many triangulare planar facets together and then working with the resulting polygon. Of course, calculating the union of an unordered list of triangle facets on a plane can be very expensive if not done correctly. John -----Original Message----- From: Steven Spitz [mailto:StevenS@proficiency.com] Sent: Wednesday, April 11, 2001 4:07 AM To: 'Dickinson, John' Subject: RE: Silhouette of a facetted polyhedra John, It sounds like you are interested in related problems from computer graphics: shading, visibility, and accessibility. I personally did some work in accessibility, but used discrete techniques. You can find papers at: http://www-pal.usc.edu/html/publications.html or http://www-pal.usc.edu/~spitz Steven > -----Original Message----- > From: Dickinson, John [mailto:John.Dickinson@nrc.ca] > Sent: Monday, April 09, 2001 3:27 PM > To: 'compgeom-discuss@research.bell-labs.com' > Subject: Silhouette of a facetted polyhedra > > > I want to get the shadow or projection of a 3D facetted polyhedra on a > plane. In other words I want to project all the triangles > that describe the > surface of the polyhedra onto a plane and union them so that I have a > polygon possibly with inclusions or holes (e.g. project a > donut onto a plane > perpendicular to the axis of its hole). > > Can anyone point me to some code or papers that would give > decent algorithms > for doing this (specifically the union of all the facets into > a polygon)? > > The goal of this is to determine the centroid and area of the > resultant > projection. Is there a way to do this without building the projected > polygon first? > > John > > -- > -((Insert standard disclaimer here))-|--- Washington Irving > (1783-1859) ---- > John Kenneth Dickinson | "A sharp tongue is the only > Research Council Officer IMTI-NRC | edge tool that grows keener > email: john.dickinson@nrc.ca | with constant use." > http://publish.uwo.ca/~jkdickin/ | > > > > ------------- > 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 compgeom-owner@research.bell-labs.com Thu Apr 12 14:22:33 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id OAA01780 for ; Thu, 12 Apr 2001 14:22:33 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id OAA13507; Thu, 12 Apr 2001 14:22:29 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Apr 12 15:15:50 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Wed Apr 11 14:09:06 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Apr 11 14:07:46 EDT 2001 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.38]) by dusty; Wed Apr 11 14:07:40 EDT 2001 Received: by nrclonex1.imti.nrc.ca with Internet Mail Service (5.5.2653.19) id ; Wed, 11 Apr 2001 14:07:45 -0400 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFFC0F@nrclonex1.imti.nrc.ca> From: "Dickinson, John" To: "'Guenter Rote'" Cc: "'compgeom-discuss@research.bell-labs.com'" Subject: RE: Silhouette of a facetted polyhedra Date: Wed, 11 Apr 2001 14:07:37 -0400 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain; charset="iso-8859-1" Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2533 Lines: 65 Good suggestion, applicable to my situation with no edge, no vertex sharing information (which I should have mentioned at the outset). Thanks, I'll look into it further. John -----Original Message----- From: Guenter Rote [mailto:rote@inf.fu-berlin.de] Sent: Wednesday, April 11, 2001 11:40 AM To: Dickinson, John Subject: Re: Silhouette of a facetted polyhedra "Dickinson, John" wrote: > > I want to get the shadow or projection of a 3D facetted polyhedra on a > plane. In other words I want to project all the triangles that describe the > surface of the polyhedra onto a plane and union them so that I have a > polygon possibly with inclusions or holes (e.g. project a donut onto a plane > perpendicular to the axis of its hole). > > Can anyone point me to some code or papers that would give decent algorithms > for doing this (specifically the union of all the facets into a polygon)? > > The goal of this is to determine the centroid and area of the resultant > projection. Is there a way to do this without building the projected > polygon first? The simplest thing to suggest is a planesweep of the projection by a vertical plane with increasing x-coordinate, maintaining the intersection intervals with each triangle. This works for an unrelated collection of triangles. You can accumulate the area and momentum that are needed for the centroid as you go. There are more advanced methods for computing unions of triangles, but they are probably not good for practice. Possible improvements may depend on the data that you have. Is it a topologically complicated polyhedron with relatively few faces, such as a tree or a gutter? Or even with topological inconsistencies/ self intersections due to data errors? Or is it a relatively smooth surface with thousands of triangles, like a donut? In that case it might pay off to concentrate on those edges that have a supporting light ray which does not (locally) penetrate the surface, the "contour" edges. -- G"unter Rote (Germany=49)30-838-75150 (office) Freie Universit"at Berlin -75103 (secretary) Institut f"ur Informatik FAX (49)30-838-75109 Takustrase 9 (49)30-84108844 (home) D-14195 Berlin, GERMANY electronic mail: rote@inf.fu-berlin.de ------------- 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 compgeom-owner@research.bell-labs.com Thu Apr 12 14:22:35 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id OAA01784 for ; Thu, 12 Apr 2001 14:22:35 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id OAA13515; Thu, 12 Apr 2001 14:22:31 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Apr 12 15:19:09 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Wed Apr 11 14:11:02 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Apr 11 14:09:12 EDT 2001 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.38]) by dusty; Wed Apr 11 14:08:59 EDT 2001 Received: by nrclonex1.imti.nrc.ca with Internet Mail Service (5.5.2653.19) id ; Wed, 11 Apr 2001 14:09:05 -0400 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFFC10@nrclonex1.imti.nrc.ca> From: "Dickinson, John" To: "'Tom Shermer'" Cc: "'compgeom-discuss@research.bell-labs.com'" Subject: RE: Silhouette of a facetted polyhedra Date: Wed, 11 Apr 2001 14:09:03 -0400 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain; charset="iso-8859-1" Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 4679 Lines: 120 I hadn't thought of this but unfortunately I don't have shared edge/vertex information available. Good point about nonconvex polyhedra having holes in shadows even if they don't have them in 3D. John -----Original Message----- From: Tom Shermer [mailto:shermer@cs.sfu.ca] Sent: Tuesday, April 10, 2001 6:22 PM To: John.Dickinson@nrc.ca Cc: shermer@cs.sfu.ca Subject: Re: Silhouette of a facetted polyhedra Hi John, the edges that are on the silhouette have a normal whose dot product with the normal of the projection plane is zero. (Depending on your definition of silhouette, the silhouettes are either exactly those with a normal with zero dot product, or a subset of them.) The easiest way I know of to test this is to take all face normals and compute their dot product with the plane normal. Then, any edge having faces with differently-signed dot products is a "silhouette" edge. If one keeps this information directly in the edge data structure, we can consider this as a coloring of the edges of the polyhedron where, say, red represents "silhouette" and blue represents "non-silhouette". Then by examining a separate list of silhouette edges, one can find connected components in the red graph and use these to form polygons. Decisions to throw out some chains can be made locally at high-degree vertices. If the polyhedron is convex, rather than testing all pairs, find an extreme vertex in some direction contained in the projection plane. This vertex will be in the silhouette, so check the edges around it to find one that is silhouette. Cross this edge and repeat at the next vertex, until you return to the start. If the polyhedron is nonconvex, then life is trickier. First, one must decide if holes are allowed in the silhouette. A silhouette can have holes even if the polyhedron doesn't. If holes are not allowed, then one can just take the union of all of the polygons that corresponding to "positive" (non-hole) silhouettes. ["Negative" (hole) silhouettes locally do not contain the object, as in the silhouette in the center of a torus.] If holes are allowed in the silhouette, I'm not quite sure how to proceed. For centroid, one only needs to identify the silhouette vertices. To compute area, take any point p on the projection plane. For each silhouette edge (again, what these are differ depending on your definition of silhouette) and orient it so that the polyhedron appears on the left as one walks from tail to the head (as viewed from above the polyhedron, where the projection plane is below). Then, compute the signed area (positive if the edge is oriented counterclockwise around p, negative otherwise) of the triangle formed by p and the projection of this edge. The sum of these, over all such triangles, is the area of the silhouette. (no construction of polygon required.) Tom shermer@cs.sfu.ca > From: "Dickinson, John" > To: "'compgeom-discuss@research.bell-labs.com'" > Subject: Silhouette of a facetted polyhedra > Date: Mon, 9 Apr 2001 09:26:50 -0400 > MIME-Version: 1.0 > > I want to get the shadow or projection of a 3D facetted polyhedra on a > plane. In other words I want to project all the triangles that describe the > surface of the polyhedra onto a plane and union them so that I have a > polygon possibly with inclusions or holes (e.g. project a donut onto a plane > perpendicular to the axis of its hole). > > Can anyone point me to some code or papers that would give decent algorithms > for doing this (specifically the union of all the facets into a polygon)? > > The goal of this is to determine the centroid and area of the resultant > projection. Is there a way to do this without building the projected > polygon first? > > John > > -- > -((Insert standard disclaimer here))-|--- Washington Irving (1783-1859) ---- > John Kenneth Dickinson | "A sharp tongue is the only > Research Council Officer IMTI-NRC | edge tool that grows keener > email: john.dickinson@nrc.ca | with constant use." > http://publish.uwo.ca/~jkdickin/ | > > > > ------------- > 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 compgeom-owner@research.bell-labs.com Thu Apr 12 14:22:38 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id OAA01788 for ; Thu, 12 Apr 2001 14:22:38 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id OAA13511; Thu, 12 Apr 2001 14:22:30 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu Apr 12 15:14:54 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Wed Apr 11 14:07:01 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed Apr 11 14:06:09 EDT 2001 Received: from NRCLONEX1.imti.nrc.ca ([206.248.115.38]) by dusty; Wed Apr 11 14:06:01 EDT 2001 Received: by nrclonex1.imti.nrc.ca with Internet Mail Service (5.5.2653.19) id ; Wed, 11 Apr 2001 14:06:05 -0400 Message-ID: <35C5DD9F60FED21192B00004ACA6E6C7FFFC0E@nrclonex1.imti.nrc.ca> From: "Dickinson, John" To: "'Lutz Kettner'" Cc: "'compgeom-discuss@research.bell-labs.com'" Subject: RE: Silhouette of a facetted polyhedra Date: Wed, 11 Apr 2001 14:05:55 -0400 MIME-Version: 1.0 X-Mailer: Internet Mail Service (5.5.2653.19) Content-Type: text/plain; charset="iso-8859-1" Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Content-Transfer-Encoding: 8bit X-MIME-Autoconverted: from quoted-printable to 8bit by valis.cs.uiuc.edu id OAA01788 Status: RO Content-Length: 2187 Lines: 62 More unfortunately for me is that I don't have neighbourhood information for the model and in fact never did. I am working with a non-convex polyhedra, described by a list of triangles described by their vertices. No shared edge or vertex information exists, the polyhedra could potentially have holes/missing facets, as well as assume shapes like donuts with holes through them. Initial attempts to address this problem can be off-line (non-real time) though. Kind of a sticky problem. So far the best suggestion for my particular set of circumstances came from Guenter Rote with "The simplest thing to suggest is a planesweep of the projection by a vertical plane with increasing x-coordinate, maintaining the intersection intervals with each triangle. This works for an unrelated collection of triangles. You can accumulate the area and momentum that are needed for the centroid as you go. There are more advanced methods for computing unions of triangles, but they are probably not good for practice." Still non-trivial to implement but not too costly for pre-processing. John -----Original Message----- From: Lutz Kettner [mailto:kettner@inf.ethz.ch] Sent: Wednesday, April 11, 2001 1:44 PM To: John.Dickinson@nrc.ca Subject: Re: Silhouette of a facetted polyhedra Hi John, Do you still have neighborhood information for the facets? An approach using contour edges might speed up things. I implemented a still simple sweep line algorithm for my thesis to compute the silhouette of polyhedral surfaces (my name for your problem ;-). If you are interested, you can check out my thesis Lutz Kettner. Software Design in Computational Geometry and Contour-Edge Based Polyhedron Visualization. PhD Thesis, ETH Zürich, Institute of Theoretical Computer Science, 148 pages, September 1999. from my web page http://www.cs.unc.edu/~kettner/pub/ Unfortunately for you, no sources released. Best regards, Lutz ------------- 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 compgeom-owner@research.bell-labs.com Fri Apr 13 13:43:58 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id NAA05980 for ; Fri, 13 Apr 2001 13:43:58 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id NAA27505; Fri, 13 Apr 2001 13:43:56 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Fri Apr 13 14:40:18 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Fri Apr 13 05:33:03 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Apr 13 05:32:13 EDT 2001 Received: from hotmail.com ([64.4.9.50]) by dusty; Fri Apr 13 05:32:06 EDT 2001 Received: from mail pickup service by hotmail.com with Microsoft SMTPSVC; Fri, 13 Apr 2001 02:32:05 -0700 Received: from 212.8.162.181 by lw9fd.law9.hotmail.msn.com with HTTP; Fri, 13 Apr 2001 09:32:05 GMT X-Originating-IP: [212.8.162.181] From: "Michel Tavernier" To: compgeom-announce@research.bell-labs.com Subject: kordervoronoi Date: Fri, 13 Apr 2001 11:32:05 +0200 Mime-Version: 1.0 Content-Type: text/plain; format=flowed Message-ID: X-OriginalArrivalTime: 13 Apr 2001 09:32:05.0311 (UTC) FILETIME=[9A3B0CF0:01C0C3FC] Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1865 Lines: 44 Hi sir, My name is Michel 22years old and i am in my last year engineer in Belgium. I 'am making a thesis about computational geometry. More precisely programming computaional geometry figures in a java applet. I've already computed Delaunay triangulations, convex hulls,Voronoi diagrams,(largest and smallest) empty circles, constrained Delaunay triangulations and a few applications based on computational geometry such as topographic charts... The last thing I need is the higher order voronoi diagram. The last few months I tried to compute an own creation of an algorithm for the k-order voronoi (i made about 3500 java program lines).It only works for a second order voronoi in a very small amount of cases and it is very slow (it takes 4 minutes to do it for only 5 points). So I'm not a good inventor of algorithms but I needed to do it this way because nowhere in Belgium(highschool and university included) or on the internet I could find a book or a text describing a method for higher order Voronoi. It's also difficult to order a book such as international comp. geom. journal because i have no much time left and I can't afford it (I already spent about 250 dollars on books) My teacher suggested me to mail you. So you are my last hope,please can you help me. If you can mail me an article with an easy algorithm or in the best case java-code of the higher order Voronoi I would be very very grateful to you. Thank you! Greetings Michel. _________________________________________________________________________ Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Mon Apr 16 12:28:29 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id MAA06738 for ; Mon, 16 Apr 2001 12:28:29 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id MAA29826; Mon, 16 Apr 2001 12:28:27 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Apr 16 13:24:27 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Sat Apr 14 17:47:02 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sat Apr 14 17:47:03 EDT 2001 Received: from yogi.eecs.tufts.edu ([130.64.23.171]) by dusty; Sat Apr 14 17:46:54 EDT 2001 Received: from andante.eecs.tufts.edu (Andante.EECS.Tufts.EDU [130.64.23.37]) by yogi.eecs.tufts.edu (Postfix) with ESMTP id D03191A6E8 for ; Sat, 14 Apr 2001 17:46:59 -0400 (EDT) Received: (from dls@localhost) by andante.eecs.tufts.edu (8.9.3+Sun/8.9.1) id RAA11278 for compgeom-announce@research.bell-labs.com; Sat, 14 Apr 2001 17:46:57 -0400 (EDT) Date: Sat, 14 Apr 2001 17:46:57 -0400 (EDT) From: Message-Id: <200104142146.RAA11278@andante.eecs.tufts.edu> To: compgeom-announce@research.bell-labs.com Subject: ACM Symposium on Computational Geometry: On-line Registration is Enabled Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 867 Lines: 21 ON-LINE REGISTRATION IS AVAILABLE: http://www.eecs.tufts.edu/EECS/scg01/regform.html Early Discount through May 5, 2001 (Some resources are first-come-first-served) 17th Annual ACM Symposium on COMPUTATIONAL GEOMETRY June 3--5, 2001 Tufts University, Medford/Somerville, MA, USA INVITED SPEAKERS: Thomas Hales (University of Michigan): "Sphere Packings and Generative Programming" Fred Richards (Yale University): "Protein Geometry as a Function of Time" George W. Hart (http://www.georgehart.com): "Computational Geometry for Sculpture" ------------- 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 compgeom-owner@research.bell-labs.com Mon Apr 16 12:28:39 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id MAA06742 for ; Mon, 16 Apr 2001 12:28:39 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id MAA29854; Mon, 16 Apr 2001 12:28:39 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Apr 16 13:24:16 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Fri Apr 13 14:57:06 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Apr 13 14:55:54 EDT 2001 Received: from mail-blue.research.att.com ([135.207.30.102]) by dusty; Fri Apr 13 14:55:48 EDT 2001 Received: from bigmail.research.att.com (bigmail.research.att.com [135.207.30.101]) by mail-blue.research.att.com (Postfix) with ESMTP id D58A74CF12; Fri, 13 Apr 2001 14:51:48 -0400 (EDT) Received: from divya.research.att.com (divya.research.att.com [135.207.22.25]) by bigmail.research.att.com (8.8.8/8.8.8) with ESMTP id OAA00698; Fri, 13 Apr 2001 14:51:48 -0400 (EDT) Date: Fri, 13 Apr 2001 14:48:35 -0400 From: Shankar Krishnan To: Michel Tavernier Cc: Subject: Re: kordervoronoi In-Reply-To: Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2432 Lines: 64 Here is a Java applet for higher order voronoi diagrams. http://www.msi.umn.edu/~schaudt/voronoi/voronoi.html Shankar Krishnan Member of Technical Staff AT&T Shannon Laboratory On Fri, 13 Apr 2001, Michel Tavernier wrote: > Hi sir, > > My name is Michel 22years old and i am in my last > year engineer in Belgium. > I 'am making a thesis about computational geometry. > More precisely programming computaional geometry figures > in a java applet. I've already computed Delaunay triangulations, > convex hulls,Voronoi diagrams,(largest and smallest) empty circles, > constrained Delaunay triangulations and a few applications based > on computational geometry such as topographic charts... > The last thing I need is the higher order voronoi diagram. The > last few months I tried to compute an own creation of > an algorithm for the k-order voronoi (i made about 3500 java program > lines).It only works for a second order voronoi in a very small amount > of cases and it is very slow (it takes 4 minutes to do it for only 5 > points). > So I'm not a good inventor of algorithms but I needed to do it > this way because nowhere in Belgium(highschool and university included) > or on the internet I could find a book or a text describing a method > for higher order Voronoi. > It's also difficult to order a book such as international comp. geom. > journal because i have no much time left and I can't afford it > (I already spent about 250 dollars on books) > My teacher suggested me to mail you. > So you are my last hope,please can you help me. > If you can mail me an article with an easy algorithm or in > the best case java-code of the higher order Voronoi I would > be very very grateful to you. > Thank you! > > Greetings Michel. > > > > _________________________________________________________________________ > Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.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://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 compgeom-owner@research.bell-labs.com Tue Apr 17 13:16:48 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id NAA10071 for ; Tue, 17 Apr 2001 13:16:47 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id NAA18676; Tue, 17 Apr 2001 13:16:46 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Apr 17 14:11:15 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Mon Apr 16 16:17:03 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Apr 16 16:15:39 EDT 2001 Received: from laime.cs.uchicago.edu ([128.135.11.244]) by dusty; Mon Apr 16 16:15:27 EDT 2001 Received: from sloth.cs.uchicago.edu (postfix@sloth.cs.uchicago.edu [128.135.11.131]) by laime.cs.uchicago.edu (8.10.2/8.9.3) with ESMTP id f3GKFVe28886; Mon, 16 Apr 2001 15:15:31 -0500 (CDT) Received: by sloth.cs.uchicago.edu (Postfix, from userid 278) id 9949B5394B; Mon, 16 Apr 2001 15:15:30 -0500 (CDT) To: krishnas@research.att.com, michel_tavernier@hotmail.com Subject: Re: kordervoronoi Cc: compgeom-announce@research.bell-labs.com Message-Id: <20010416201530.9949B5394B@sloth.cs.uchicago.edu> Date: Mon, 16 Apr 2001 15:15:30 -0500 (CDT) From: mulmuley@cs.uchicago.edu (Ketan Mulmuley) Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 416 Lines: 15 I have one paper on a randomized algorithm for it: Discrete and Combinatorial Geometry, 6: 307-338 1991. See if that helps. all the best, ketan mulmuley. ------------- 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 compgeom-owner@research.bell-labs.com Tue Apr 17 13:16:48 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id NAA10075 for ; Tue, 17 Apr 2001 13:16:48 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id NAA18680; Tue, 17 Apr 2001 13:16:47 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue Apr 17 14:12:51 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Mon Apr 16 18:19:02 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Apr 16 18:18:10 EDT 2001 Received: from duke.cs.duke.edu ([152.3.140.1]) by dusty; Mon Apr 16 18:18:00 EDT 2001 Received: from redbeans.cs.duke.edu (redbeans.cs.duke.edu [152.3.140.143]) by duke.cs.duke.edu (8.9.3/8.9.3) with ESMTP id SAA11274 for ; Mon, 16 Apr 2001 18:18:06 -0400 (EDT) Received: (jsv@localhost) by redbeans.cs.duke.edu (8.8.5/8.6.9) id SAA25871; Mon, 16 Apr 2001 18:18:04 -0400 (EDT) From: Jeff Vitter MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-ID: <15067.28572.255036.20183@redbeans.cs.duke.edu> Date: Mon, 16 Apr 2001 18:18:04 -0400 (EDT) To: compgeom-announce@research.bell-labs.com Subject: Postdoctoral position at Duke X-Mailer: VM 6.72 under 21.1 (patch 9) "Canyonlands" XEmacs Lucid Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2185 Lines: 49 A postdoctoral position at the level of Visiting Assistant Professor of Computer Science is available starting August 2001 in the Department of Computer Science at Duke University, under the supervision of Prof. Jeff Vitter. The position, which is contingent upon grant funding, is for one year and can be extended for one or more additional years by mutual consent. Applicants must have clearly demonstrated experience and skills in algorithms design and implementation. Familiarity with external memory algorithms and indexing is a definite plus. Teaching responsibilities may include one research course per year. The position will include membership in the Center for Geometric and Biological Computing, a collaborative effort funded by the Army Research Office and the National Science Foundation. The problems of interest center around high-performance geometric and biological applications. They include development of efficient methods for spatial databases, geographic information systems, and indexing, especially those dealing with massive amounts of data. The candidate is expected to play a vital role in the development and/or use of the TPIE programming environment (http://www.cs.duke.edu/TPIE/) for external memory computation. Additional responsibilities will be to interact with agency scientists and to help prepare contract, technical, and other reports. Please send a letter of interest and your CV, and ask three evaluators to send letters of reference, by US Mail or email, to: Ms. Susan Clear ATTENTION: POSTDOC SEARCH Department of Computer Science Duke University Durham, NC 27708-0129 sclear@cs.duke.edu (919) 660-6548 To be assured of full consideration, all material including reference letters must arrive by April 30, 2001. Applications will be considered until the position is filled. Duke University is an affirmative action, equal opportunity employer. ------------- 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 compgeom-owner@research.bell-labs.com Thu Apr 19 14:57:49 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id OAA22098 for ; Thu, 19 Apr 2001 14:57:45 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id MAA07981; Thu, 19 Apr 2001 12:38:03 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu Apr 19 13:35:10 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Thu Apr 19 08:57:02 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Apr 19 08:55:37 EDT 2001 Received: from cs.Technion.AC.IL ([132.68.32.1]) by dusty; Thu Apr 19 08:55:23 EDT 2001 Received: (from barequet@localhost) by cs.Technion.AC.IL (8.9.3+Sun/8.9.0) id PAA25498 for compgeom-discuss@research.bell-labs.com; Thu, 19 Apr 2001 15:56:42 +0300 (IDT) Date: Thu, 19 Apr 2001 15:56:42 +0300 (IDT) From: Gill Barequet Message-Id: <200104191256.PAA25498@cs.Technion.AC.IL> To: compgeom-discuss@research.bell-labs.com Subject: sweep in high dimensions Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1016 Lines: 26 Dear geometers, I am looking for a working code for sweeping an arrangement of hyperplanes in a high-dimensional space. My specific application is to look for highly covered areas in a collection of (say, 30) halfspaces in 4-D or in 8-D. Thanks in advance, Gill. --------------------------------------------------------------------------- Gill Barequet Phone: +972-4-829-3219 Faculty of Computer Science Fax: +972-4-822-1128 (Rm.: [New] Taub 516) E-mail: barequet@cs.technion.ac.il The Technion---IIT WWW: http://www.cs.technion.ac.il/~barequet Haifa 32000 http://myprofile.cos.com/barequet Israel "Life is NP-Hard." (-) ------------- 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 compgeom-owner@research.bell-labs.com Wed Apr 25 18:04:06 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id SAA31264 for ; Wed, 25 Apr 2001 18:04:06 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id SAA06273; Wed, 25 Apr 2001 18:04:05 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed Apr 25 18:58:38 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Wed Apr 25 13:56:58 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Wed Apr 25 13:55:06 EDT 2001 Received: from gaia.cs.uoi.gr ([195.130.121.201]) by dusty; Wed Apr 25 13:54:41 EDT 2001 Received: from zeus.cs.uoi.gr (zeus.cs.uoi.gr [195.130.121.11]) by gaia.cs.uoi.gr (8.9.3/8.9.3) with ESMTP id UAA15828 for ; Wed, 25 Apr 2001 20:54:53 +0300 (EEST) (envelope-from palios@zeus.cs.uoi.gr) Received: (from palios@localhost) by zeus.cs.uoi.gr (8.8.8+Sun/8.8.8) id UAA21842 for compgeom-discuss@research.bell-labs.com; Wed, 25 Apr 2001 20:54:52 +0300 (EET DST) Date: Wed, 25 Apr 2001 20:54:52 +0300 (EET DST) From: Leonidas Palios Message-Id: <200104251754.UAA21842@zeus.cs.uoi.gr> To: compgeom-discuss@research.bell-labs.com Subject: triangulation verification Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 797 Lines: 23 Hello all. Some time ago, I came across a paper which dealt with the problem of verifying whether a given collection of triangles is a triangulation of a given polygon. The paper also addressed other verification problems (eg, delaunay triangulations, etc). Unfortunately, I do not recall the names of the authors, nor the exact title of the paper, and a (not very thorough) search on the Web did not produce anything. Does the above description ring a bell to any of you, so that I can locate that paper? Many thanks, Leonidas Palios ------------- 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 compgeom-owner@research.bell-labs.com Mon Apr 30 13:33:43 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id NAA23877 for ; Mon, 30 Apr 2001 13:33:43 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id NAA11898; Mon, 30 Apr 2001 13:33:39 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Apr 30 14:30:36 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Thu Apr 26 02:32:58 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu Apr 26 02:32:55 EDT 2001 Received: from polaire.inria.fr ([138.96.83.13]) by dusty; Thu Apr 26 02:32:32 EDT 2001 Received: from polaire.inria.fr by polaire.inria.fr (8.11.1/8.10.0) with ESMTP id f3Q6WhK08245; Thu, 26 Apr 2001 08:32:43 +0200 Message-Id: <200104260632.f3Q6WhK08245@polaire.inria.fr> X-Mailer: exmh version 2.3.1 01/18/2001 To: Leonidas Palios cc: compgeom-discuss@research.bell-labs.com Subject: Re: triangulation verification In-reply-to: Your message of Wed, 25 Apr 2001 20:54:52 +0300. <200104251754.UAA21842@zeus.cs.uoi.gr> Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Thu, 26 Apr 2001 08:32:43 +0200 From: Olivier Devillers Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2350 Lines: 63 > Some time ago, I came across a paper which dealt with the problem > of verifying whether a given collection of triangles is a triangulation > of a given polygon. The computational geometry bibliography can be download at ftp.cs.usask.ca query can be sent to http://www-ma2.upc.es/~geomc/geombib/geombibe.html http://www.cs.uu.nl/geobook/geom.html @article{mnssssu-cgpvg-99 , author = "K. Mehlhorn and S. N{\"a}her and M. Seel and R. Seidel and T. S chilz and S. Schirra and C. Uhrig" , title = "Checking Geometric Programs or Verification of Geometric Struct ures" , journal = "Comput. Geom. Theory Appl." , volume = 12 , number = "1--2" , year = 1999 , pages = "85--103" , succeeds = "mnssssu-cgpvg-96" , update = "99.07 } @article{dlpt-ccpps-98 , author = "Olivier Devillers and Giuseppe Liotta and Franco P. Preparata a nd Roberto Tamassia" , title = "Checking the Convexity of Polytopes and the Planarity of Subdiv isions" , journal = "Comput. Geom. Theory Appl." , volume = 11 , year = 1998 , pages = "187--208" , url = "http://www-sop.inria.fr/prisme/biblio/search.html" , keywords = "graph drawing, planar, straight-line, checking" , succeeds = "dlpt-ccpps-97" , cites = "-dcgs-, bbdgt-ccgg-97, bo-arcgi-79, bk-dpcw-95, b-ecvdl-96, c-t splt-91a, dtv-olcpt-95, dtv-olcpt-95t, dv-aptg-96, f-slrpg-48, glm-othsr-96, h-g t-72, ht-ept-74, k-eops-88, ll-abgtc-87, lpt-rpqid-97, lpt-rpqid-99, mn-cgs-96, mnssssu-cgpvg-96, mnssssu-cgpvg-97, swm-ccr-95, y-tegc-97" , update = "99.11 devillers, 99.03 devillers, 98.11 tamassia" , abstract = "This paper considers the problem of verifying the correctness o f geometric structures. In particular, we design simple optimal checkers for con vex polytopes in two and higher dimensions, and for various types of planar subd ivisions, such as triangulations, Delaunay triangulations, and convex subdivisio ns. Their performance is analyzed also in terms of the algorithmic degree, which characterizes the arithmetic precision required." } ------------- 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 compgeom-owner@research.bell-labs.com Mon Apr 30 13:40:54 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id NAA23926 for ; Mon, 30 Apr 2001 13:40:54 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id NAA16985; Mon, 30 Apr 2001 13:40:54 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Apr 30 14:38:24 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Mon Apr 23 05:44:58 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Mon Apr 23 05:44:21 EDT 2001 Received: from polaire.inria.fr ([138.96.83.13]) by dusty; Mon Apr 23 05:44:01 EDT 2001 Received: from polaire.inria.fr by polaire.inria.fr (8.11.1/8.10.0) with ESMTP id f3N9iBo17013 for ; Mon, 23 Apr 2001 11:44:11 +0200 Message-Id: <200104230944.f3N9iBo17013@polaire.inria.fr> X-Mailer: exmh version 2.3.1 01/18/2001 To: compgeom-announce@research.bell-labs.com Subject: Nuages reconstruction software announcement. Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii Date: Mon, 23 Apr 2001 11:44:11 +0200 From: Olivier Devillers Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 813 Lines: 26 The software NUAGES dealing with 3D reconstruction for cross sections. The source code of this software is now freely available for non commercial use. Thanks for your interest Olivier Devillers ftp://ftp-sop.inria.fr/prisme/NUAGES/Nuages/NUAGES_SRC.tar.gz --------------------------------------------------------------------------- O. Devillers, INRIA, 2004 route des Lucioles, BP 93, 06902 Sophia Antipolis Olivier.Devillers@sophia.inria.fr, +33 4 92 38 77 63, Fax +33 4 92 38 76 43 http://www-sop.inria.fr/prisme/personnel/devillers/ ------------- 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 compgeom-owner@research.bell-labs.com Mon Apr 30 13:40:57 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id NAA23930 for ; Mon, 30 Apr 2001 13:40:57 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id NAA16996; Mon, 30 Apr 2001 13:40:55 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Apr 30 14:33:25 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Sun Apr 22 16:17:01 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sun Apr 22 16:15:57 EDT 2001 Received: from photon.poly.edu ([128.238.32.22]) by dusty; Sun Apr 22 16:15:39 EDT 2001 Received: from localhost (yjc@localhost) by photon.poly.edu (8.9.0/8.9.0) with ESMTP id QAA19863; Sun, 22 Apr 2001 16:15:46 -0400 (EDT) Date: Sun, 22 Apr 2001 16:15:46 -0400 (EDT) From: Yi-Jen Chiang Reply-To: yjc@poly.edu To: DMANET@zpr.uni-koeln.de, THEORYNT@listserv.nodak.edu, compgeom-announce@research.bell-labs.com, GRAPHNET@listserv.nodak.edu, opt-net@ZIB.DE, dm@INFORMATIK.HU-BERLIN.DE, DMA-LIST@nic.surfnet.nl cc: Yi-Jen Chiang Subject: WADS 2001: list of accepted papers Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 4815 Lines: 136 The following papers have been accepted to the 7th Workshop on Algorithms and Data Structures (WADS 2001), to be held August 8-10, 2001, at Brown University, Providence, Rhode Island, USA. For more information about the conference, please see the web page http://www.wads.org/. ------------------------ A Linear-Time Algorithm for Computing Inversion Distance Between Signed Permutations with an Experimental Study David A. Bader and Bernard M.E. Moret and Mi Yan Admission Control to Minimize Rejections Avrim Blum and Adam Kalai and Jon Kleinberg Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos A simple linear time algorithm for proper box rectangular drawings of plane grapghs Xin He Bin Packing with Item Fragmentation Nir Menakerman and Raphael Rom Minimizing clique-width for graphs of bounded tree-width Wolfgang Espelage and Frank Gurski and Egon Wanke Seller-Focused Algorithms for Online Auctioning A. Bagchi and A. Chaudhary and R. Garg and M. T. Goodrich and V. Kumar Upward Embeddings and Orientations of Undirected Planar Graphs Walter Didimo and Maurizio Pizzonia Using the pseudo-dimension to analyze approximation algorithms for integer programming Philip M. Long Higher-Dimensional Packing with Order Constraints S\'andor P. Fekete and Ekkehard K\"ohler and J\"urgen Teich Small Maximal Independent Sets and Faster Exact Graph Coloring David Eppstein Optimal Moebius Transformations for Information Visualization and Meshing Marshall Bern and David Eppstein On the Reflexivity of Point Sets E. M. Arkin and S. P. Fekete and F. Hurtado and J. S. B. Mitchell and M. Noy and V. Sacrist\'an and S. Sethia A decomposition-based approach to layered manufacturing Ivaylo Ilinkin and Ravi Janardan and Jayanth Majhi and Joerg Schwerdt and Michiel Smid and Ram Sriram Computing Phylogenetic Roots with Bounded Degrees and Errors Zhi-Zhong Chen and Tao Jiang and Guo-Hui Lin A (7/8)-approximation algorithm for metric Max TSP Refael Hassin and Shlomi Rubinstein Approximating Multi-Objective Knapsack Problems Thomas Erlebach and Hans Kellerer and Ulrich Pferschy Visual Ranking of Link Structures Ulrik Brandes and Sabine Cornelsen Complexity Bounds for Vertical Decompositions of Linear Arrangements in Four Dimensions Vladlen Koltun Search Trees with Relaxed Balance and Near-Optimal Height Rolf Fagerberg and Rune E. Jensen and Kim S. Larsen Voronoi Diagrams for Moving Disks and Applications Menelaos I. Karavelas Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions P. K. Agarwal and M. de Berg and S. Har-Peled and M. Overmars and M. Sharir and J. Vahrenhold Time Responsive External Data Structures for Moving Points Pankaj K. Agarwal and Lars Arge and Jan Vahrenhold The Grid Placement Problem P. Bose and A. Maheshwari and P. Morin and J. Morrison An Approach for Mixed Upward Planarization Markus Eiglsperger and Michael Kaufmann Short and simple labels for small distances and other functions Haim Kaplan and Tova Milo Competitive analysis of the LRFU paging algorithm Edith Cohen and Haim Kaplan and Uri Zwick I/O-Efficient Shortest Path Queries in Geometric Spanners Anil Maheshwari and Michiel Smid and Norbert Zeh When Can You Fold a Map? E. M. Arkin and M. A. Bender and E. D. Demaine and M. L. Demaine and J. S. B. Mitchell and S. Sethia and S. S. Skiena Optimal, Suboptimal and Robust Algorithms for Proximity Graphs F. Hurtado and G. Liotta and H. Meijer On External-Memory Planar Depth First Search Lars Arge and Ulrich Meyer and Laura Toma and Norbert Zeh Movement Planning in the Presence of Flows John Reif and Zheng Sun The Analysis of a Probabilistic Approach to Nearest Neighbor Searching Songrit Maneewongvatana and David M. Mount Optimization Over Zonotopes and Training Support Vector Machines Marshall Bern and David Eppstein Practical Approximation Algorithms for Separable Packing Linear Programs F.F. Dragan and A.B. Kahng and I.I. Mandoiu and S. Muddu Two-Guard Walkability of Simple Polygons Binay Bhattacharya and Asish Mukhopadhyay and Giri Narasimhan Fast Boolean matrix multiplication for highly clustered data Andreas Bjorklund and Andrzej Lingas On the Complexity of Scheduling Conditional Real-Time Code Samarjit Chakraborty and Thomas Erlebach and Lothar Thiele Succinct Dynamic Data Structures Rajeev Raman and Venkatesh Raman and S. Srinivasa Rao Partitioning colored point sets into monochromatic parts Adrian Dumitrescu and Janos Pach ------------- 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 compgeom-owner@research.bell-labs.com Mon Apr 30 13:44:56 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id NAA23937 for ; Mon, 30 Apr 2001 13:44:56 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id NAA17156; Mon, 30 Apr 2001 13:44:55 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Mon Apr 30 14:41:36 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Thu Apr 26 20:34:59 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu Apr 26 20:34:26 EDT 2001 Received: from jardine.math.uwo.ca ([129.100.75.21]) by dusty; Thu Apr 26 20:34:05 EDT 2001 Received: from uwo.ca (jardine@cr405431-a.lndn1.on.wave.home.com [24.112.60.174]) by jardine.math.uwo.ca (8.10.2/8.10.0) with ESMTP id f3R0YFt10737 for ; Thu, 26 Apr 2001 20:34:16 -0400 Sender: jardine@jardine.math.uwo.ca Message-ID: <3AE8BE81.2DC271F@uwo.ca> Date: Thu, 26 Apr 2001 20:34:09 -0400 From: jardine@uwo.ca X-Mailer: Mozilla 4.75 [en] (X11; U; Linux 2.2.14 i686) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: Stanford conference, July 30 - August 3 Content-Type: multipart/mixed; boundary="------------A8EB5C512121E4181D150E8D" Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2844 Lines: 88 This is a multi-part message in MIME format. --------------A8EB5C512121E4181D150E8D Content-Type: text/plain; charset=iso-8859-15 Content-Transfer-Encoding: 7bit --------------A8EB5C512121E4181D150E8D Content-Type: text/plain; charset=iso-8859-15; name="3rd.txt" Content-Transfer-Encoding: 7bit Content-Disposition: inline; filename="3rd.txt" Third Announcement: Conference on Algebraic Topological Methods in Computer Science Stanford University July 30 - August 3, 2001 This meeting is supported by grants from the National Science Foundation, the Natural Sciences and Engineering Research Council of Canada, the Fields Institute, Hewlett-Packard, and the Stanford Department of Mathematics. The most up to date information on the conference appears on the conference web page http://math.stanford.edu/atmcs/index.htm. Housing is still available on campus at a cost of about 50.00 US per night. The deadline for registering for on campus housing at Stanford is *May 1, 2001*. There is a registration form available as a pdf file, to be printed, filled out and faxed to the Stanford Summer Conference Services office. There is also a short registration for the conference itself at that web page. If you are coming to the conference and have not yet registered for the conference, please do so. There will be no registration fee. Limited financial support may be available for travel and housing. Please make your request when registering for the conference. The following have agreed to speak at this meeting: John Baez (Math, UC Riverside) Marshall Bern (Xerox PARC) Anders Bjorner (Royal Institute of Technology, Stockholm) Tamal Dey (CS, Ohio State) Herbert Edelsbrunner (CS, Duke) David Eppstein (CS, UC Irvine) Michael Freedman (Microsoft) Philippe Gaucher (CNRS, Strasbourg) Eric Goubault (Commissariat a l'Energie Atomique, France) Jean Goubault-Larrecq (ENS Cachan) Marco Grandis (Dip. di Mat., Genova) Jeremy Gunawardena (HP BRIMS) John Harer (Math, Duke) Joel Hass (Math, UC Davis) Maurice Herlihy (CS, Brown) Reinhard Laubenbacher (Math, NMSU) Laszlo Lovasz (Microsoft) Vaughan Pratt (CS, Stanford) Christian Reidys (Los Alamos National Lab) Bernd Sturmfels (Math, UC Berkeley) Noson Yanofsky (CS, Brooklyn College) There will be some time for contributed talks. If you would like to give a short talk at the meeting, please send a title and abstract to one of the organizers. The organizers for this meeting are: Gunnar Carlsson: gunnar@math.stanford.edu Rick Jardine: jardine@uwo.ca --------------A8EB5C512121E4181D150E8D-- ------------- 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 compgeom-owner@research.bell-labs.com Mon Apr 30 13:46:36 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id NAA23946 for ; Mon, 30 Apr 2001 13:46:36 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id NAA18060; Mon, 30 Apr 2001 13:46:35 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Apr 30 14:38:50 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Fri Apr 27 11:57:00 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Fri Apr 27 11:55:07 EDT 2001 Received: from magnolia.math.uwaterloo.ca ([129.97.74.123]) by dusty; Fri Apr 27 11:54:44 EDT 2001 Received: from localhost (biedl@localhost) by magnolia.math.uwaterloo.ca (8.9.3/8.9.3) with ESMTP id LAA10710; Fri, 27 Apr 2001 11:54:31 -0400 (EDT) X-Authentication-Warning: magnolia.math: biedl owned process doing -bs Date: Fri, 27 Apr 2001 11:54:31 -0400 (EDT) From: Therese Biedl To: THEORYNT@LISTSERV.NODAK.EDU, DMANET@zpr.uni-koeln.de, compgeom-announce@research.bell-labs.com Subject: CCCG'01 - Last Call for Papers - Deadline April 30th Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2613 Lines: 82 -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- Last Call for Papers 13th Canadian Conference on Computational Geometry August 13-15, 2001 University of Waterloo http://compgeo.math.uwaterloo.ca/~cccg01 -=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=- 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. A special issue of Computational Geometry: Theory and Applications will be devoted to invited papers from the conference. Program Committee ================= Therese Biedl (Univ. of Waterloo) Timothy Chan (Univ. of Waterloo) Erik Demaine (Univ. of Waterloo) David Kirkpatrick (UBC) Anna Lubiw (Univ. of Waterloo) Joseph O'Rourke (Smith College) Godfried Toussaint (McGill University) Organizing Committee ==================== Therese Biedl (Univ. of Waterloo) Erik Demaine (Univ. of Waterloo) Martin Demaine (Univ. of Waterloo) Anna Lubiw (Univ. of Waterloo) Important dates =============== Submission of papers: April 30, 2001 Notification of acceptance: May 29, 2001 Submission of final paper: June 29, 2001 Conference: August 13-15, 2001 Contact Information =================== Therese Biedl Dept. of Computer Science University of Waterloo Waterloo, ON N2L 3G1 Phone: (519) 888-4567x4721 Fax: (519) 885-1208 Email: biedl@uwaterloo.ca Sponsors ======== CCCG '01 is supported by CRM, The Fields Institute, PIMS and the University of Waterloo. ------------- 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 compgeom-owner@research.bell-labs.com Mon Apr 30 13:46:40 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id NAA23950 for ; Mon, 30 Apr 2001 13:46:40 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id NAA18072; Mon, 30 Apr 2001 13:46:38 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Mon Apr 30 14:39:10 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Sun Apr 29 16:18:57 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Sun Apr 29 16:18:55 EDT 2001 Received: from snow.cs.dartmouth.edu ([129.170.212.127]) by dusty; Sun Apr 29 16:18:30 EDT 2001 Received: (from brd@localhost) by snow.cs.dartmouth.edu (SGI-8.9.3/8.9.3) id UAA39648; Sun, 29 Apr 2001 20:18:45 GMT Date: Sun, 29 Apr 2001 20:18:45 GMT Message-Id: <200104292018.UAA39648@snow.cs.dartmouth.edu> From: Bruce Randall Donald To: compgeom-announce@research.bell-labs.com Subject: Postdoc in Computational Biology X-Emma-Lisbon: Individual if jacket. Reply-To: brd@cs.dartmouth.edu (Bruce Randall Donald) Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1898 Lines: 40 Dartmouth College Department of Computer Science Postdoctoral Research Associate in Computer Science: (One, or possibly two positions open). We are looking for persons with a doctorate in computer science to conduct focused research in computational biology, specifically, on computational structural biology and computer-aided drug design. The position involves a two-year appointment which may be extended depending on funding. The research has two parts: (1) geometric algorithms and systems for drug design and (2) the automated interpretation of high-throughput structural data for proteins and protein-protein complexes (e.g., from NMR or mass spectrometry). A wealth of fascinating computational problems arise in computer-aided drug design and structural proteomics. For more on this position, our research, job placement for Donald Lab alumni, and life at Dartmouth, see http://www.cs.dartmouth.edu/~brd/Jobs/. Applicants for this position must hold a PhD in Computer Science or a related discipline, or show evidence that the PhD will be completed before the start of the position. Applicants should send a resume and have at least two referees send letters of recommendation to Prof. Bruce Randall Donald, Dept. of Computer Science, Dartmouth College, 6211 Sudikoff Laboratory, Hanover, NH 03755-3510, brd@cs.dartmouth.edu, http://www.cs.dartmouth.edu/~brd/. Electronic submissions are encouraged, although I greatly prefer ascii text to enclosures. Dartmouth College is an Equal Opportunity Affirmative Action employer. ------------- 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 compgeom-owner@research.bell-labs.com Tue May 8 12:35:22 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id MAA06894 for ; Tue, 8 May 2001 12:35:22 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id MAA12313; Tue, 8 May 2001 12:35:21 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue May 8 13:25:58 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Wed May 2 17:58:59 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed May 2 17:58:25 EDT 2001 Received: from rly-ip01.mx.aol.com ([205.188.156.49]) by dusty; Wed May 2 17:57:56 EDT 2001 Received: from tot-wf1-we.proxy.aol.com (tot-wf1-we.proxy.aol.com [205.188.195.3]) by rly-ip01.mx.aol.com (8.8.8/8.8.8/AOL-5.0.0) with ESMTP id RAA03134 for ; Wed, 2 May 2001 17:37:37 -0400 (EDT) Received: from oemcomputer (AC843A6E.ipt.aol.com [172.132.58.110]) by tot-wf1-we.proxy.aol.com (8.10.0/8.10.0) with SMTP id f42LbW020248 for ; Wed, 2 May 2001 17:37:32 -0400 (EDT) Message-ID: <002c01c0d350$617250a0$6e3a84ac@oemcomputer> Reply-To: "Michael Rund" From: "Michael Rund" To: Subject: position announce: geometric modeling specialist Date: Wed, 2 May 2001 17:38:57 -0400 MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_NextPart_000_001D_01C0D32E.C3D2C3A0" X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.2314.1300 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.2314.1300 X-Apparently-From: REA1054AD@aol.com Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 12008 Lines: 332 This is a multi-part message in MIME format. ------=_NextPart_000_001D_01C0D32E.C3D2C3A0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable please post: Employment Positions: To work with company principals and recognized world class leaders in = computer graphics, award winning R&D of CAD/CAM and new 3-d paradigms for implicit = parametric surfaces,=20 isosurfaces, volume visualization approaches, features and solid = modeling strategies. We are looking for senior research assistants or associates who have = some of the following experience: -Sr./Principle Geometric Modeling Specialists (multiple);=20 -3-d Modeling Software Development, -Variational/Parametrics Modeling Software Development, -Visualization development (multiple), -3-d Graphics software engineers (multiple) Geometric modeling and visualization development, curve and surface = mathematics,=20 C or C++ programming, solids representations, hi-level 3-d development. = The overall approach is variational, feature-based, next-generation = development. Skills & Experience required: Curve & Surfaces, NURBS, geometric modeling = = =20 OR solids modeling or parametric constraints/variational geometry = =20 OR=20 CAD geometry (Pro/E, Unigraphics, Intergraph, CATIA, IDEAS, = etc.) OR graphics pipelines and 3-d visualization of CAD modeling object = software, OR API open architecture programamatic interface (C++) OR=20 Release Management OR device-level 3-d graphics development = (Open GL,PEX) OR Sub-specialties: topology, NURBS libraries, fillets, foreign = CAD data topology cleaners OR Databases for part planning. = =20 An extensive next-generation type project to rebuild a powerful 3-d = software presently=20 resident on workstations into the world's most advanced graphical = modeling software. =20 Excellent salaries will be offered. Benefits, incentives, bonuses, and = full, extended=20 relocation will be offered AND the opportunity to build a smaller = company into a big=20 and very important company, partnering with the best CAD and graphics = software manufacturers=20 supported by the world's leading providers of design and engineering = software -=20 with over 1 million customers of CAD and a supply chain in the = manufacturing industry,=20 a market place doing 1.8 trillion dollars worth of commerce annually in = the US alone.=20 These are full time, permanent positions to support long term = development. =20 Jr. and mid-level positions are also available to support this work in = a friendly development=20 environment named by ComputerWork magazine as one of the top 100 = software companies to work=20 for based on salary, benefits, opportunity, management and work = environment and culture. Join an established and highly successful company, an industry leader = with wide ranging=20 contracts in design automation, manufacturing, and graphics. The = development location is=20 in an ideal area with a very low cost of living and temperate climate. =20 Visa sponsorship available.=20 To apply in confidence please send your resume and / or contact: Michael Rund Tech Visions =20 e-mail: MiRu@acm.org - - e-mail resumes accepted or fax (706)-864-1255 - my direct fax or call (706)-864-1244 - my direct line =20 =20 =20 =20 ------=_NextPart_000_001D_01C0D32E.C3D2C3A0 Content-Type: text/html; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable
please post:
Employment Positions:
 
To work with company principals and recognized world = class=20 leaders in computer graphics,
award winning R&D of CAD/CAM and = new 3-d=20 paradigms for implicit parametric surfaces,
isosurfaces, volume=20 visualization approaches, features and solid modeling = strategies.
 
We are looking for senior research assistants or = associates=20 who have some of the following experience:
 
-Sr./Principle Geometric Modeling Specialists = (multiple);=20
-3-d Modeling Software Development,
-Variational/Parametrics = Modeling=20 Software Development,
-Visualization development (multiple),
-3-d = Graphics=20 software engineers (multiple)
 
Geometric modeling and visualization development, = curve and=20 surface mathematics,
C or C++ programming, solids representations, = hi-level=20 3-d development. 
The overall approach is variational, = feature-based,=20 next-generation development.
 
Skills & Experience required:
 
        Curve = &=20 Surfaces, NURBS, geometric=20 modeling           = ;            =             &= nbsp;           &n= bsp;           &nb= sp;           &nbs= p;            = ;            =             &= nbsp;           &n= bsp;           &nb= sp;           &nbs= p;   =20
 
          &nbs= p;    =20 OR
 
        solids = modeling or=20 parametric constraints/variational=20 geometry           = ;            =   =20
 
          &nbs= p;    =20 OR
 
        CAD = geometry=20 (Pro/E, Unigraphics, Intergraph, CATIA, IDEAS, etc.)
 
          &nbs= p;    =20 OR
 
        graphics = pipelines=20 and 3-d visualization of CAD modeling object software,
 
          &nbs= p;    =20 OR
 
        API open=20 architecture programamatic interface (C++)
 
          &nbs= p;    =20 OR
 
        Release = Management=20 OR device-level 3-d graphics development (Open GL,PEX)
 
          &nbs= p;    =20 OR
 
       =20 Sub-specialties:  topology, NURBS libraries, fillets, foreign CAD = data=20 topology cleaners
 
          &nbs= p;   =20 OR
 
        Databases = for part=20 planning.          &nbs= p;            = ;            =             &= nbsp;    =20
 
An extensive next-generation type project to rebuild = a=20 powerful 3-d software presently
resident on workstations into the = world's=20 most advanced graphical modeling software.  
Excellent = salaries=20 will be offered.  Benefits, incentives, bonuses, and full, extended =
relocation will be offered AND the opportunity to build a smaller = company=20 into a big
and very important company, partnering with the best CAD = and=20 graphics software manufacturers
supported by the world's leading = providers=20 of design and engineering software -
with over 1 million customers = of CAD=20 and a supply chain in the manufacturing industry,
a market place = doing 1.8=20 trillion dollars worth of commerce annually in the US alone.
These = are full=20 time, permanent positions to support long term=20 development.    
 
Jr. and  mid-level positions are also available = to=20 support this work in a friendly development
environment named by=20 ComputerWork magazine as one of the top 100 software companies to work =
for=20 based on salary, benefits, opportunity, management and work environment = and=20 culture.
 
Join an established and highly successful company, = an industry=20 leader with wide ranging
contracts in design automation, = manufacturing, and=20 graphics.  The development location is
in an ideal area with a = very low=20 cost of living and temperate climate.
 
Visa sponsorship available. 
 
To apply in confidence please send your resume and / = or =20 contact:
 
Michael Rund
Tech=20 Visions           =   =20
e-mail: MiRu@acm.org   = -=20 -   e-mail resumes accepted
or fax  (706)-864-1255 - = my direct=20 fax
or call (706)-864-1244 - my direct line
 
 
 
 
 
 
 
 
------=_NextPart_000_001D_01C0D32E.C3D2C3A0-- ------------- 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 compgeom-owner@research.bell-labs.com Tue May 8 12:38:34 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id MAA06898 for ; Tue, 8 May 2001 12:38:34 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id MAA15760; Tue, 8 May 2001 12:38:34 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue May 8 13:33:02 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Tue May 8 09:18:55 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Tue May 8 09:18:11 EDT 2001 To: compgeom-announce@research.bell-labs.com Received: from ada.cs.ucy.ac.cy ([194.42.7.2]) by dusty; Tue May 8 09:17:31 EDT 2001 Received: from ada.cs.ucy.ac.cy (ada.cs.ucy.ac.cy [194.42.7.2]) by ada.cs.ucy.ac.cy (8.8.8/8.8.8) with ESMTP id QAA42002; Tue, 8 May 2001 16:24:32 +0300 Date: Tue, 8 May 2001 16:24:32 +0300 (WET) From: George Angelos Papadopoulos Reply-To: george@cs.ucy.ac.cy Subject: Academic Vacancies -- CS Dept -- Univ. of Cyprus Message-ID: Organization: Department of Computer Science - University of Cyprus Address: 75 Kallipoleos Str. -- POB 20537 -- CY-1678 -- Nicosia -- Cyprus Tel: +357-2-892242 -- Fax: +357-2-339062 URL: http://www.cs.ucy.ac.cy/~george MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 2840 Lines: 90 *** ANNOUNCEMENT OF ACADEMIC POSITIONS *** The University of Cyprus announces the following non permanent posts (Assistant Professor or Lecturer): DEPARTMENT OF COMPUTER SCIENCE 4 non permanent posts in the following fields of study: * Software Engineering * Computer Architecture * Information Systems * Computer Networks * Database Systems * Internet Technologies For all academic ranks, a Ph.D. from a recognized University is required. PLEASE NOTE: The languages of instruction are Greek and Turkish. Applicants need not be citizens of the Republic of Cyprus. The annual salaries for these positions (including the 13th salary) are: Assistant Professor (Scale A13-A14) CY22,939 - CY30,914 Lecturer (Scale A12-A13) CY19,372 - CY28,373 (At present 1 CY = 1.0769 sterling and 1 CY = 1.5370 dollars) Interested individuals must submit the following items by Friday 6th of July 2001: I A letter stating the department, the academic rank or ranks for which the applicant is interested in, the field or fields of study and the date when he/she may be able to assume duties in the event of selection. II A Curriculum Vitae (6 copies). III A brief summary (not exceeding three pages) of their research work as well as a description of plans for future research (6 copies). IV A list of publications (6 copies). V Copies of representative publications (6 copies if possible). VI Copies of their qualifications. In addition, the applicants must request three academic referees to send letters of recommendation directly to the University; the names and addresses of these referees must be submitted with the application. Additional confidential information may be sought. The Curriculum Vitae and the brief summary of the research work should be written in Greek or Turkish and in one international language, preferably English. Applications, other documents and reference letters submitted in the past will NOT be considered and must be re-submitted. Applications that are not complete will not be considered. The above must reach the University by 2 pm Friday 6th of July 2001 at the following address: The Registrar University of Cyprus P O Box 20537 CY-1678 Nicosia CYPRUS Tel: 02-892000 Fax: 02-892100 For more details and other information interested individuals may contact the Head of the Department of Computer Science, Associate Professor Antonis Kakas: Tel: +357-2-892231 Fax: +357-2-339062 E-mail: antonis@cs.ucy.ac.cy ------------- 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 compgeom-owner@research.bell-labs.com Wed May 9 18:20:10 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id SAA16751 for ; Wed, 9 May 2001 18:20:09 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id SAA28393; Wed, 9 May 2001 18:20:09 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed May 9 19:17:11 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Tue May 8 21:08:58 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Tue May 8 21:08:55 EDT 2001 Received: from yogi.eecs.tufts.edu ([130.64.23.171]) by dusty; Tue May 8 21:08:25 EDT 2001 Received: from andante.eecs.tufts.edu (Andante.EECS.Tufts.EDU [130.64.23.37]) by yogi.eecs.tufts.edu (Postfix) with ESMTP id 5A91B1A8F2; Tue, 8 May 2001 21:08:58 -0400 (EDT) Received: (from dls@localhost) by andante.eecs.tufts.edu (8.9.3+Sun/8.9.1) id VAA16918; Tue, 8 May 2001 21:08:47 -0400 (EDT) Date: Tue, 8 May 2001 21:08:47 -0400 (EDT) From: Message-Id: <200105090108.VAA16918@andante.eecs.tufts.edu> To: compgeom-announce@research.bell-labs.com Subject: ACM Symposium on Computational Geometry Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1065 Lines: 40 REGISTER NOW! EARLY REGISTRATION ENDS 5/10 1-day rate ** 3-day rate ** student rates http://www.eecs.tufts.edu/EECS/scg01 17th Annual ACM Symposium on June 3--5, 2001 Tufts University Medford/Somerville, MA, USA INVITED SPEAKERS: Thomas Hales (University of Michigan): Sphere Packings and Generative Programming Fred Richards (Yale University): Protein Geometry as a Function of Time George W. Hart (http://www.georgehart.com): Computational Geometry for Sculpture Sponsored by: ACM Special Interest Groups on Graphics (SIGGRAPH) and Algorithms and Computation Theory (SIGACT) With support from: Mitsubishi Electric Research Labs (MERL) School of Engineering, Tufts 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://www.uiuc.edu/~sariel/CG/compgeom/maillist.html. From compgeom-owner@research.bell-labs.com Wed May 9 18:22:56 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id SAA16755 for ; Wed, 9 May 2001 18:22:55 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id SAA02253; Wed, 9 May 2001 18:22:55 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Wed May 9 19:17:53 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Wed May 9 12:52:58 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Wed May 9 12:52:38 EDT 2001 Received: from miralab.unige.ch ([129.194.68.138]) by dusty; Wed May 9 12:52:08 EDT 2001 Received: by miralab.unige.ch with Internet Mail Service (5.5.2653.19) id ; Wed, 9 May 2001 18:52:29 +0200 Received: from pcmira157 (pcmira157.unige.ch [129.194.68.157]) by miralab.unige.ch with SMTP (Microsoft Exchange Internet Mail Service Version 5.5.2653.13) id K3ZMTMCL; Wed, 9 May 2001 18:52:22 +0200 From: Wonsook Lee To: compgeom-announce@research.bell-labs.com Message-ID: <003301c0d8a8$5f2c54a0$9d44c281@unige.ch> Subject: job searching in Computer Graphics, VR, e-commerse and Medical fields Date: Wed, 9 May 2001 18:52:02 +0200 MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.50.4133.2400 X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400 Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 805 Lines: 22 Whom it may concern, This is WonSook Lee from MIRALab, Center University of Information (Computer Science), University of Geneve, Switzerland. I am a senior research assistant at this moment. I am now looking for a job. My background is mathematics and computer science mainly computer graphics, VR, e-commerse and Medical fields. My CV is shown in http://miralabwww.unige.ch/~wslee/CV/cv.html and my homepage is in http://miralabwww.unige.ch/~wslee. Please have a look and forward my CV to intereting people if any. Best regards & wishes, *w* ------------- 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 compgeom-owner@research.bell-labs.com Thu May 17 17:08:35 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA14402 for ; Thu, 17 May 2001 17:08:35 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA09527; Thu, 17 May 2001 17:08:34 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu May 17 18:07:28 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Thu May 10 11:18:54 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by scummy; Thu May 10 11:18:10 EDT 2001 Received: from aragorn.ads.tuwien.ac.at ([128.131.166.130]) by dusty; Thu May 10 11:17:32 EDT 2001 Received: from ads.tuwien.ac.at (helios.ads.tuwien.ac.at [128.131.166.131]) by aragorn.ads.tuwien.ac.at (8.9.3/8.9.3) with ESMTP id RAA11969 for ; Thu, 10 May 2001 17:17:54 +0200 Sender: mutzel@ads.tuwien.ac.at Message-ID: <3AFAB121.950DB7F5@ads.tuwien.ac.at> Date: Thu, 10 May 2001 17:17:53 +0200 From: Petra Mutzel Organization: TU Wien, Institut =?iso-8859-1?Q?f=FCr?= Computergraphik X-Mailer: Mozilla 4.7 [en] (X11; I; SunOS 5.7 sun4u) X-Accept-Language: en MIME-Version: 1.0 To: compgeom-announce@research.bell-labs.com Subject: Graph Drawing 2001 --- Vienna Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 10033 Lines: 240 ********************************************************************* ** ** ***** Second and Final Call for Papers and Software ***** ****** ****** ******** G R A P H D R A W I N G 2 0 0 1 ******** ******** ******** ******** September 23-26, 2001, Vienna, Austria ******** ****** ****** ***** http://www.ads.tuwien.ac.at/gd2001 ***** ** ** ********************************************************************* N E W S INVITED LECTURES It is a special pleasure to announce that Alexander Schrijver (Amsterdam) and Eduard Groeller (Vienna) have accepted our invitation to present invited lectures. Their talks will mark extreme points of the wide spectrum of graph drawing, the mathematical foundations and the computer graphics, respectively. SUBMISSION OF PAPERS AND SOFTWARE Most important: Please remember the submission deadline: May 28, 2001 The GD2001 web site is now fully set up to support comfortable submission of papers and software. Indeed a number of submissions have already been received. There have been several requests concerning the software submission rules. We found that requesting a poster by May 28 was not a good idea, so we relax this requirement and redefine an acceptable submission as follows: * SOFTWARE: A contribution to the software exhibition consists of the software in executable format for Windows, Linux, or Solaris and a 2 page short description in Springer LNCS-style format, including fax number and e-mail address. Accepted software will have to be documented by a poster at the conference. Participants and guests of GD2001 will have the opportunity to use the software during the conference. In collaboration with the authors/owners, the organizers guarantee that they will make sure that the software is adequately protected and the production of unauthorized copies is prevented. GRAPH DRAWING CONTEST The graph drawing competition and the nomination of the winners has been among the highlights of the past graph drawing symposia. It's both fun and a challenge and has inspired new research in graph drawing. See the GD2001 web site for the complete set of challenges and data. REGISTRATION Please register at the GD2001 web site at your earliest convenience. ACCOMMODATION September is high season in Vienna; it may be hard to get a hotel room within walking distance after May 2001. Therefore, we recommend reservation of a hotel room as soon as possible. The GD2001 web site gives you support by listing several hotels you may want to consider. CONFERENCE DINNER The conference dinner will be at Stift Klosterneuburg near the city of Vienna. PLEASE VISIT THE GD2001 WEB SITE! If you have not visited the GD2001 web site lately, please try: Many new items have been added recently, and we'll keep it up-to-date. SPECIAL FINANCIAL SUPPORT The organizers have applied for funding the participation of young researchers from eastern European countries. Please contact them if you are eligible and interested. ORIGINAL CALL WITH CORRECTED SOFTWARE SUBMISSION RULES *********************************************************************** ***** Call for Papers ***** ****** ****** ******** G R A P H D R A W I N G 2 0 0 1 ******** ******** ******** ******** September 23-26, 2001, Vienna, Austria ******** ****** ****** ***** http://www.ads.tuwien.ac.at/gd2001 ***** *********************************************************************** *** Scope: *** Theory - Algorithms - Software. The symposium is a forum for researchers, practitioners, developers, and users working on all aspects of graph visualization and representation. The range of issues considered in graph drawing includes graph algorithms, graph theory, computational geometry, topology, planarity issues, combinatorics, optimization, heuristics, local search, computational cartography, information visualization, visual languages, visual perception, computer-human interaction, applications, and practical systems. 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). Researchers and practitioners with an interest in these or other applications are especially welcome to participate. *** Software_Exhibition: *** During the conference there will be a graph drawing software exhibition for which we hope to attract all state-of-the-art software tools in graph drawing. The software will be accessible for all conference participants on computers in the hall of the conference building. *** Graph_Drawing_Contest: *** See the GD 2001 web site. *** Location: *** The conference will take place in the building of the Austrian Academy of Sciences (picture on the 100 schilling bank note) which is located in the center of Vienna at Dr. Ignaz Seipel Platz 2 (about 3 minutes walking distance from Stephansdom). *** Call_for_Papers_and_Software: *** * PAPERS: We invite papers describing original research of theoretical or practical significance to graph drawing. A submission consists of a standard PostScript or PDF file of an extended abstract or full draft paper of at most 15 pages in Springer LNCS-style format, including fax number and e-mail address. * SOFTWARE: A contribution to the software exhibition consists of the software in executable format for Windows, Linux, or Solaris and a 2 page short description in Springer LNCS-style format, including fax number and e-mail address. Accepted software will have to be documented by a poster shortly before the conference. Please e-mail submissions to gd2001@ads.tuwien.ac.at by May 28, 2001. See http://www.springer.de/comp/lncs/authors.html for Springer LNCS-style format requirements. *** Proceedings: *** Accepted papers (at most 15 pages) and software (2 pages) will be published in the conference proceedings, which will appear in the series Lecture Notes in Computer Science of Springer-Verlag. The camera-ready copy as well as electronic files of accepted papers and software are due at the conference. A selection of the exhibited software will be invited to contribute to a book on state-of-the-art graph drawing software. This book will be one of the first volumes in a new book series called "Mathematics and Visualization" that will be launched by Springer-Verlag. *** Program Committee: *** Petra Mutzel, Vienna University of Technology - chair Michael Juenger, University of Cologne - co-chair Franz Aurenhammer, Graz University of Technology Therese Biedl, University of Waterloo Giuseppe Di Battista, University of Rome III Franz Brandenburg, University of Passau Yefim Dinitz, Ben Gurion University Peter Eades, University of Sydney Herbert Fleischner, Austrian Academy of Sciences Hubert de Fraysseix, CNRS Paris Mike Goodrich, Johns Hopkins University Jan Kratochvil, Charles University Prague Giuseppe Liotta, University of Perugia Brendan Madden, Tom Sawyer Software Shin-ichi Nakano, Gunma University *** Organizing Committee: *** Petra Mutzel, Vienna University of Technology - chair Michael Juenger, University of Cologne - co-chair Leonid Dimitrov, Austrian Academy of Sciences Barbara Hufnagel, Vienna University Of Technology Gunnar Klau, Vienna University of Technology Sebastian Leipert, caesar Bonn Rene Weiskircher, Vienna University Of Technology Emanuel Wenger, Austrian Academy of Sciences *** Software Exhibition Organizers: *** Martin Gruber, Vienna University of Technology Thomas Lange, University of Cologne *** Graph Drawing Contest Organizer: *** Franz Brandenburg, University of Passau *** Important Dates:*** Submission of papers and software: May 28, 2001 Notification of acceptance: July 17, 2001 Registration: July 31, 2001 Final version due: Sept. 23, 2001 *** Contact Information: *** Petra Mutzel - GD 2001 Institute of Computer Graphics and Algorithms Vienna University of Technology Favoritenstr. 9-11 E186 A-1040 Vienna, Austria ----- fax: +43 1 58801 18699 phone: +43 1 58801 18611 e-mail: gd2001@ads.tuwien.ac.at **** Graph Drawing 2001 Web Site: **** http://www.ads.tuwien.ac.at/gd2001 *********************************************************************** **** GD 2001 is organized by Vienna University of Technology, ***** **** Austrian Academy of Sciences, and University of Cologne ***** *********************************************************************** -- Univ.-Prof. Dr. Petra Mutzel Abt. fuer Algorithmen und Datenstrukturen Institut fuer Computergraphik und Algorithmen Favoritenstrasse 9-11 E186/1, A-1040 Wien, Austria ------------- 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 compgeom-owner@research.bell-labs.com Thu May 17 17:11:22 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id RAA14410 for ; Thu, 17 May 2001 17:11:22 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id RAA09648; Thu, 17 May 2001 17:11:22 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Thu May 17 18:06:52 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Thu May 10 00:04:58 EDT 2001 Received: from dusty.research.bell-labs.com ([135.104.2.7]) by grubby; Thu May 10 00:04:46 EDT 2001 Received: from wren.cs.unc.edu ([152.2.128.86]) by dusty; Thu May 10 00:04:15 EDT 2001 Received: from capefear.cs.unc.edu (capefear.cs.unc.edu [152.2.128.19]) by wren.cs.unc.edu (8.9.3/8.9.3) with ESMTP id AAA21098 for ; Thu, 10 May 2001 00:04:35 -0400 (EDT) Received: (from ehmann@localhost) by capefear.cs.unc.edu (8.9.3+Sun/8.9.3) id AAA05538 for compgeom-announce@research.bell-labs.com; Thu, 10 May 2001 00:04:35 -0400 (EDT) From: Stephen Ehmann Message-Id: <200105100404.AAA05538@capefear.cs.unc.edu> Subject: SWIFT++: A new collision detection package To: compgeom-announce@research.bell-labs.com Date: Thu, 10 May 2001 00:04:35 -0400 (EDT) X-Mailer: ELM [version 2.5 PL2] MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Content-Transfer-Encoding: 7bit Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1487 Lines: 38 SWIFT++: Speedy Walking via Improved Feature Testing for Non-Convex Objects We announce the release of a new proximity query package called SWIFT++. SWIFT++ is a C++ library for intersection detection, tolerance verification, exact and approximate distance computation, and contact determination of general three-dimensional polyhedral objects undergoing rigid motion. Polyhedral surfaces may have boundary. SWIFT++ combines convex surface decomposition with a convex bounding volume hierarchy and Voronoi based walking (first proposed by Lin and Canny). It has been successfully applied to dynamic simulation and haptic applications. It is free for non-commercial use. More information about the package, new proximity query algorithms, MPEG demonstrations and related publications can be found at: http://www.cs.unc.edu/~geom/SWIFT++ Collide Research Group Computer Science Department University of North Carolina -- Stephen A. Ehmann Graduate Student -- Research Assistant -- GAMMA group -- Collision Detection Department of Computer Science E-mail: ehmann@cs.unc.edu University of North Carolina at Chapel Hill Web: www.cs.unc.edu/~ehmann (( A man's life is but a breath. -- SPOKEN )) ------------- 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 compgeom-owner@research.bell-labs.com Sat May 26 21:16:13 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id VAA32043 for ; Sat, 26 May 2001 21:16:09 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id VAA04509; Sat, 26 May 2001 21:16:08 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sat May 26 22:11:02 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Mon May 21 21:26:45 EDT 2001 Received: from rahu.research.bell-labs.com ([135.104.2.20]) by scummy; Mon May 21 21:26:57 EDT 2001 Received: from dusty.research.bell-labs.com (dusty.research.bell-labs.com [135.104.2.7]) by rahu.research.bell-labs.com (8.11.3/8.11.3) with SMTP id f4M1QZv70673 for ; Mon, 21 May 2001 21:26:35 -0400 (EDT) Received: from ecse.rpi.edu ([128.113.40.200]) by dusty; Mon May 21 21:26:01 EDT 2001 Received: from cp472970-a.alngtn1.va.home.com (ecse.rpi.edu [128.113.40.200]) by ecse.rpi.edu (8.9.2/8.9.2) with ESMTP id VAA26681; Mon, 21 May 2001 21:26:30 -0400 (EDT) Message-Id: <200105220126.VAA26681@ecse.rpi.edu> To: THEORYNT@listserv.nodak.edu, compgeom-announce@research.bell-labs.com Subject: CARGO, new NSF solicitation is out From: "Wm. Randolph Franklin" Date: Mon, 21 May 2001 21:26:26 -0400 Sender: wrf@cp472970-a.alngtn1.va.home.com X-Scanning-Notification: This email was scanned in its path for viruses and certain attachments may have been dropped Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 667 Lines: 28 See http://www.nsf.gov/cgi-bin/getpub?nsf01111 CARGO = Computational Algorithms and Representations for Geometric Objects /Randolph ======================== WR Franklin, Program Director NSF/CISE/C-CR, 4201 Wilson Blvd, Room 1145 Arlington VA 22230 wfrankli@nsf.gov +1 (703) 292-8912 Fax: +1 (703) 292-9059 ------------- 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 compgeom-owner@research.bell-labs.com Sat May 26 21:22:24 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id VAA32057 for ; Sat, 26 May 2001 21:22:24 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id VAA04621; Sat, 26 May 2001 21:22:23 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sat May 26 22:18:47 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Tue May 22 12:42:46 EDT 2001 Received: from ketu.research.bell-labs.com ([135.104.2.21]) by scummy; Tue May 22 12:42:35 EDT 2001 Received: from dusty.research.bell-labs.com (dusty.research.bell-labs.com [135.104.2.7]) by ketu.research.bell-labs.com (8.11.3/8.11.3) with SMTP id f4MGgDY92353 for ; Tue, 22 May 2001 12:42:13 -0400 (EDT) Received: from bologna.vision.caltech.edu ([131.215.134.19]) by dusty; Tue May 22 12:41:38 EDT 2001 Received: from mesh (mesh.caltech.edu [131.215.134.2]) by bologna.vision.caltech.edu (8.9.3/8.8.7) with SMTP id JAA11640 for ; Tue, 22 May 2001 09:42:09 -0700 Message-ID: <005a01c0e2de$157f3850$0286d783@mesh> From: "Gabriel Taubin" To: References: <200103260407.XAA04535@piano.eecs.tufts.edu> Subject: CFP: Graphics Models, Special Issue on Processing of Large Polygonal Meshes Date: Tue, 22 May 2001 09:41:43 -0700 MIME-Version: 1.0 Content-Type: text/plain; charset="Windows-1252" Content-Transfer-Encoding: 7bit X-Priority: 3 X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook Express 5.00.3018.1300 X-MimeOLE: Produced By Microsoft MimeOLE V5.00.3018.1300 X-Scanning-Notification: This email was scanned in its path for viruses and certain attachments may have been dropped Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 3044 Lines: 77 2nd. CALL FOR PAPERS GRAPHICS MODELS http://www.academicpress.com/gmod Special Issue on Processing of Large Polygonal Meshes Guest Editor GABRIEL TAUBIN California Institute of Technology and IBM T.J. Watson Research Center Very large polyhedral models, which are used in more and more in graphics applications today, are routinely generated by a variety of methods such as surface reconstruction algorithms from 3D scanned data, iso-surface construction algorithms from volumetric data, and photogrametric methods from aerial photography. The special issue will focus on methods designed to smooth, denoise, edit, compress, transmit, and animate very large polygonal meshes, based on signal processing techniques, constrained energy minimization, and the solution of diffusion differential equations. Examples of topics of interest include, but are not limited to: - Representation and operations on large polygonal meshes - Connectivity operators - Geometry operators - Linear and non-linear Smoothing techniques - Filtering of normal and tensor fields - Anisotropic diffusion on meshes - Mesh sampling rate conversion / resampling - Curvature-based resampling - Fourier analysis on meshes and linear filter design - Mesh fairing by constrained energy minimization - Mesh fairing by solving PDEs - Multiresolution representations, editing, and smoothing - Applications to subdivision surfaces - Applications to 3D geometry compression / progressive transmission - Dynamic meshes Prospective authors are encouraged to submit high quality, original works which have not appeared, nor are under consideration, in any other journals. Dates: + Submission Deadline: 09/15/2001 + Reviews returned to Authors: 12/31/2001 + Revised paper due by: 01/31/2002 + Acceptance decisions due by: 02/15/2002 + Final version due by: 02/28/2002 + Planned publication date: 07/2002 Electronic Submission : Papers should be submitted electronically in PDF format. Send your submission as an attachement by email to taubin@us.ibm.com Three hard-copy printouts exactly matching the electronic file must be supplied as well. Academic Press (AP) encourages all of its authors to prepare and transmit their manuscripts and associated materials electronically. Information about preparation of electronic files can be found here http://www.academicpress.com/www/journal/esub.htm ------------- 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 compgeom-owner@research.bell-labs.com Sat May 26 21:32:36 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id VAA32285 for ; Sat, 26 May 2001 21:32:36 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id VAA06918; Sat, 26 May 2001 21:32:35 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Sat May 26 22:29:47 EDT 2001 Received: from scummy.research.bell-labs.com ([135.104.2.10]) by netlib2; Thu May 24 23:26:25 EDT 2001 Received: from ketu.research.bell-labs.com ([135.104.2.21]) by scummy; Thu May 24 23:19:56 EDT 2001 Received: from dusty.research.bell-labs.com (dusty.research.bell-labs.com [135.104.2.7]) by ketu.research.bell-labs.com (8.11.3/8.11.3) with SMTP id f4P3JXY25553 for ; Thu, 24 May 2001 23:19:33 -0400 (EDT) Received: from amirani.ams.sunysb.edu ([129.49.6.2]) by dusty; Thu May 24 23:18:55 EDT 2001 Received: from ams.sunysb.edu (jsbm@joepc.ams.sunysb.edu [129.49.6.238]) by amirani.ams.sunysb.edu (8.9.1a/8.9.1) with ESMTP id XAA04342; Thu, 24 May 2001 23:19:25 -0400 (EDT) Message-Id: <200105250319.XAA04342@amirani.ams.sunysb.edu> Date: Thu, 24 May 2001 23:19:22 -0400 (EDT) From: jsbm@ams.sunysb.edu Subject: call for business meeting agenda items To: compgeom-announce cc: Joseph Mitchell MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii X-Scanning-Notification: This email was scanned in its path for viruses and certain attachments may have been dropped Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1106 Lines: 33 Dear Members of the Computational Geometry Community, The annual SoCG business meeting will be held on Sunday, June 3 (5:30pm). We are currently collecting business agenda items for the meeting. Please let me know if you have announcements or discussion items to raise. SoCG'2002 will take place in Barcelona; we will hear from one of the conference chairs (Ferran Hurtado) on how plans are shaping up. Last year at the business meeting, we had a straw vote showing a considerable majority favoring to join FCRC in 2003. We will have a report on the latest FCRC'2003 plans at our meeting this year and will hold a binding vote whether or not to join FCRC in 2003. In case the vote goes against joining FCRC, bids for hosting SoCG'2003 will be welcome. See you in Medford! Joe Mitchell Steering Committee jsbm@ams.sunysb.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 compgeom-owner@research.bell-labs.com Sat May 26 21:40:36 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id VAA32299 for ; Sat, 26 May 2001 21:40:36 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id VAA14294; Sat, 26 May 2001 21:40:35 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Sat May 26 22:32:30 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Fri May 18 08:22:56 EDT 2001 Received: from rahu.research.bell-labs.com ([135.104.2.20]) by grubby; Fri May 18 08:22:21 EDT 2001 Received: from dusty.research.bell-labs.com (dusty.research.bell-labs.com [135.104.2.7]) by rahu.research.bell-labs.com (8.11.3/8.11.3) with SMTP id f4ICLtj63744 for ; Fri, 18 May 2001 08:21:55 -0400 (EDT) Received: from mgate2.uni-hannover.de ([130.75.2.5]) by dusty; Fri May 18 08:21:39 EDT 2001 Received: from mgate6.rrzn.uni-hannover.de by mgate2.uni-hannover.de with LocalSMTP (PP) with ESMTP; Fri, 18 May 2001 14:21:56 +0200 Received: from unics by mgate6.rrzn.uni-hannover.de (PP) with ESMTP; Fri, 18 May 2001 14:21:39 +0200 Date: Fri, 18 May 2001 14:21:41 +0200 (MEST) From: Jobst Heitzig X-Sender: nhabheit@unics To: compgeom-discuss@research.bell-labs.com Subject: Angles in a convex pentagon? Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Scanning-Notification: This email was scanned in its path for viruses and certain attachments may have been dropped Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 482 Lines: 15 Does anyone know whether the following is true in a convex pentagon ABCDE: Given that EA>AB>BC and CD Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id PAA18346 for ; Tue, 29 May 2001 15:20:07 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id PAA12348; Tue, 29 May 2001 15:20:06 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Tue May 29 16:14:57 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Tue May 29 15:14:54 EDT 2001 Received: from ketu.research.bell-labs.com ([135.104.2.21]) by grubby; Tue May 29 15:14:58 EDT 2001 Received: from dusty.research.bell-labs.com (dusty.research.bell-labs.com [135.104.2.7]) by ketu.research.bell-labs.com (8.11.3/8.11.3) with SMTP id f4TJEjj35710 for ; Tue, 29 May 2001 15:14:45 -0400 (EDT) Received: from magnolia.math.uwaterloo.ca ([129.97.74.123]) by dusty; Tue May 29 15:14:02 EDT 2001 Received: from localhost (biedl@localhost) by magnolia.math.uwaterloo.ca (8.9.3/8.9.3) with ESMTP id PAA01298; Tue, 29 May 2001 15:14:03 -0400 (EDT) X-Authentication-Warning: magnolia.math: biedl owned process doing -bs Date: Tue, 29 May 2001 15:14:03 -0400 (EDT) From: Therese Biedl To: THEORYNT@LISTSERV.NODAK.EDU, DMANET@zpr.uni-koeln.de, compgeom-announce@research.bell-labs.com Subject: CCCG'01: Accepted papers In-Reply-To: Message-ID: MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII X-Scanning-Notification: This email was scanned in its path for viruses and certain attachments may have been dropped Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 4585 Lines: 156 The following 45 papers have been accepted to CCCG'01: The Reflex-Free Hull Hee-kap Ahn, Siu-wing Cheng, Otfried Cheong, Jack Snoeyink The Point Set Order Type Data Base: A Collection of Applications and Results Oswin Aichholzer, Hannes Krasser On the Number of Triangulations every Planar Point Set must have Oswin Aichholzer, Ferran Hurtado, Marc Noy Algorithms for Bivariate Medians and a Fermat-Torricelli Problem for Lines Greg Aloupis, Stefan Langerman, Michael Soss, Godfried Toussaint Good Approximations for the Relative Neighbourhood Graph Diogo Vieira Andrade, Luiz Henrique de Figueiredo Line Voronoi diagram based interpolation and application to digital terrain modelling Francois Anton, Darka Mioc, Christopher M. Gold Computational analysis of 4-8 meshes with application to surface simplification using global error Laurent Balmelli, Thomas Liebling, Martin Vetterli A Simpler Circular Ray Shooting Algorithm Ralph P. Boland, Jorge Urrutia Finding the Largest Axis Aligned Rectangle in a Polygon in O(n log n) time Ralph P. Boland, Jorge Urrutia Guarding Lines and 2-Link Polygons is MAXSNP-Hard Bjorn Broden, Mikael Hammar, Bengt J. Nilsson Binary Space Partitioning Tree and Constructive Solid Geometry Representations for Objects Bounded by Curved Surfaces Suzanne F. Buchele, Angela C. Roles On Algorithms for Simplicial Depth Andrew Y. Cheng, Ming Ouyang Translational Polygon Covering using Intersection Graphs Karen Daniels, Rajasekhar Inkulu The CCCG 2001 Logo Erik D. Demaine, Martin L. Demaine, Anna Lubiw Pushing Blocks is NP-Complete for Noncrossing Solution Paths Erik D. Demaine, Michael Hoffmann Short Interlocked Linkages Erik D. Demaine, Stefan Langerman, Joseph O'Rourke Reaching Folded States of a Rectangular Piece of Paper Erik D. Demaine, Joseph S. B. Mitchell The Shuffling Buffer Olivier Devillers, Philippe Guigue Separating Several Point Sets in the Plane Olivier Devillers, Ferran Hurtado, Merce Mora, Carlos Seara Decimating Samples for Mesh Simplification Tamal K. Dey, Joachim Giesen, James Hudson Matching Points to a Convex Polygonal Boundary Matthew T. Dickerson, Michael T. Goodrich The Convex Hull in a New Model of Computation Abbas Edalat, Andre Lieutier, Elham Kashefi Complete Combinatorial Generation of Small Point Configurations and Hyperplane Arrangements Lukas Finschi, Komei Fukuda Computing the Width of a Point Set in 3-Space Bernd Gaertner, Thomas Herrmann Approximating the Shortest Path in Line Arrangements David W. Hart Segment endpoint visibility graphs are Hamiltonian Michael Hoffmann, Csaba D. Toth Local Optimization of Triangular Surface Meshes for General Quadrics in Lp Norm Jerzy W. Jaromczyk, Yang Wang Tight Degree Bounds for Pseudo-triangulations of Points Lutz Kettner, David Kirkpatrick, Bettina Speckmann Listing All Connected Plane Triangulation Zhangjian Li, Shin-ichi Nakano Parallel Searching on a Lattice Alejandro Lopez-Ortiz, Graeme Sweet Heaphull? Andrea Mantler, Jack Snoeyink On the Topology of the Level Sets of a Scalar Field Valerio Pascucci Voronoi Diagrams in Projective Geometry and Sweep Circle Algorithms for Constructing Circle-based Voronoi Diagrams' Axel Pavillet Counting triangulations and pseudo-triangulations of wheels Dana Randall, Guenter Rote, Francisco Santos, Jack Snoeyink Narrowing Light Rays with Mirrors Joseph O'Rourke, Octavia Petrovici Partitioning Orthogonal Polygons into Fat Rectangles Joseph O'Rourke, Irena Pashchenko, Geetika Tewari Heuristics for placing non-orthogonal axial lines to cross the adjacencies between orthogonal rectangles Ian Sanders, Leigh-Ann Kenny Nearest neighbor search through function minimization Chang Shu, Michael Greenspan, Guy Godin The Arithmetic Precision of Ray-Polygon Intersection Testing Jack Snoeyink Testing Extendability for Partial Chirotopes is NP-complete Falk Tschirschnitz Tiling 3D Euclidean Space with Acute Tetrahedra Alper Ungor Tutte's Barycenter Method applied to Isotopies Eric Colin de Verdiere, Michel Pocchiola, Gert Vegter Yet Another Look at Fractional Cascading: B-graphs with Application to Point Location Chee Yap, Yunyue Zhu Geometric Permutations of Balls with Bounded Size Disparity Yunhong Zhou, Subhash Suri Turing Computability of (Non-)Linear Optimization Martin Ziegler, Vasco Brattka ------------- 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 compgeom-owner@research.bell-labs.com Tue May 29 15:24:04 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id PAA18353 for ; Tue, 29 May 2001 15:24:04 -0500 Received: from crufty.research.bell-labs.com (crufty.research.bell-labs.com [204.178.16.49]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id PAA12571; Tue, 29 May 2001 15:24:02 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by crufty; Tue May 29 16:14:29 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Mon May 28 15:28:52 EDT 2001 Received: from rahu.research.bell-labs.com ([135.104.2.20]) by grubby; Mon May 28 15:28:34 EDT 2001 Received: from dusty.research.bell-labs.com (dusty.research.bell-labs.com [135.104.2.7]) by rahu.research.bell-labs.com (8.11.3/8.11.3) with SMTP id f4SJSLv80387 for ; Mon, 28 May 2001 15:28:22 -0400 (EDT) Received: from cs.sfu.ca ([142.58.111.1]) by dusty; Mon May 28 15:27:41 EDT 2001 Received: from alula (shermer@alula [199.60.3.16]) by cs.sfu.ca (8.9.1/8.9.1) with SMTP id MAA14748; Mon, 28 May 2001 12:28:18 -0700 (PDT) Message-Id: <200105281928.MAA14748@cs.sfu.ca> Date: Mon, 28 May 2001 12:28:18 -0700 (PDT) From: Tom Shermer Reply-To: Tom Shermer Subject: Re: Angles in a convex pentagon? To: compgeom-discuss@research.bell-labs.com, heitzig@mbox.math.uni-hannover.de MIME-Version: 1.0 Content-Type: TEXT/plain; charset=us-ascii Content-MD5: i34kctcTR6SP7MqNOct8rA== X-Mailer: dtmail 1.2.1 CDE Version 1.2.1 SunOS 5.6 sun4u sparc X-Scanning-Notification: This email was scanned in its path for viruses and certain attachments may have been dropped Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1448 Lines: 42 You can get an angle approaching pi + arccos(1/4) > pi + pi/3 by the following method: 1) Construct an equilateral not-strictly-convex pentagon with EA and AB colinear, and BC and CD colinear. 2) Wiggle it. (shrink the appropriate edges slightly, causing slight changes in the angles). Tom > Date: Fri, 18 May 2001 14:21:41 +0200 (MEST) > From: Jobst Heitzig > X-Sender: nhabheit@unics > To: compgeom-discuss@research.bell-labs.com > Subject: Angles in a convex pentagon? > MIME-Version: 1.0 > X-Scanning-Notification: This email was scanned in its path for viruses and certain attachments may have been dropped > > Does anyone know whether the following is true in a convex pentagon ABCDE: > Given that EA>AB>BC and CD > I tried hard but could neither prove nor disprove it :-) > > Jobst Heitzig > > > > ------------- > 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 compgeom-owner@research.bell-labs.com Wed May 30 08:07:03 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id IAA20219 for ; Wed, 30 May 2001 08:07:03 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA22576; Wed, 30 May 2001 08:06:59 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed May 30 09:06:53 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Tue May 29 22:50:53 EDT 2001 Received: from ketu.research.bell-labs.com ([135.104.2.21]) by grubby; Tue May 29 22:50:17 EDT 2001 Received: from dusty.research.bell-labs.com (dusty.research.bell-labs.com [135.104.2.7]) by ketu.research.bell-labs.com (8.11.3/8.11.3) with SMTP id f4U2o4j51076 for ; Tue, 29 May 2001 22:50:04 -0400 (EDT) Received: from burdell.cc.gatech.edu ([130.207.3.207]) by dusty; Tue May 29 22:49:23 EDT 2001 Received: from gvu2.cc.gatech.edu (gvu2.cc.gatech.edu [130.207.119.167]) by burdell.cc.gatech.edu (8.9.1/8.9.3) with ESMTP id WAA04567; Tue, 29 May 2001 22:49:57 -0400 (EDT) Received: from [130.207.31.175] (jarek-home.dial.cc.gatech.edu [130.207.31.175]) by gvu2.cc.gatech.edu (8.9.1/8.9.1) with ESMTP id WAA29079; Tue, 29 May 2001 22:49:54 -0400 (EDT) Mime-Version: 1.0 X-Sender: jarek@gvu2.cc.gatech.edu Message-Id: Date: Tue, 29 May 2001 22:39:37 -0400 To: compgeom-announce@research.bell-labs.com From: Jarek Rossignac Subject: Edgebreaker 3D compression for triangle meshes Content-Type: text/plain; charset="us-ascii" ; format="flowed" X-Scanning-Notification: This email was scanned in its path for viruses and certain attachments may have been dropped Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 1489 Lines: 38 A first version of the Edgebreaker 3D compression software is freely available from http://www.gvu.gatech.edu/~jarek/edgebreaker/eb/ Edgebreaker is a very simple state machine that encodes and decodes the connectivity of a triangle mesh as a sequence of symbols from the set {C,L,E,R,S} with a guaranteed cost of 1.8 bits per triangle and a practical cost of about 1 bit per triangle for meshes homeomorphic to a sphere and with a modest cost per handle and hole. The proposed code uses a parallelogram rule for predicting and compressing vertex location, but can be easily combined with other predictio schemes. The current version of the software supports manifold meshes with an arbitrary number of handles but a single hole. Additional holes must be filled and then removed by the application. Please let me know if you decide to use it. Thanks - Jarek -- ========================== Prof. Jarek Rossignac College of Computing & GVU Center Georgia Institute of Technology 801 Atlantic Drive NW, CCB-256 Atlanta, GA 30332-0280 Phone: 404/894-0671, Fax: 404/894-0673 http://www.gvu.gatech.edu/~jarek For assistance, please contact Pam Ruffin at (404) 385-2464, pamela@cc.gatech.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 compgeom-owner@research.bell-labs.com Wed May 30 08:15:19 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id IAA20308 for ; Wed, 30 May 2001 08:15:19 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id IAA24504; Wed, 30 May 2001 08:15:14 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Wed May 30 09:08:55 EDT 2001 Received: from grubby.research.bell-labs.com ([135.104.2.9]) by netlib2; Tue May 29 16:40:52 EDT 2001 Received: from rahu.research.bell-labs.com ([135.104.2.20]) by grubby; Tue May 29 16:40:59 EDT 2001 Received: from dusty.research.bell-labs.com (dusty.research.bell-labs.com [135.104.2.7]) by rahu.research.bell-labs.com (8.11.3/8.11.3) with SMTP id f4TKejv16303 for ; Tue, 29 May 2001 16:40:45 -0400 (EDT) Received: from wren.cs.unc.edu ([152.2.128.86]) by dusty; Tue May 29 16:40:05 EDT 2001 Received: from POSTDOCCS (postdoc-cs.cs.unc.edu [152.2.132.95]) by wren.cs.unc.edu (8.9.3/8.9.3) with SMTP id QAA04214 for ; Tue, 29 May 2001 16:40:43 -0400 (EDT) From: "Young J. Kim" To: Subject: a Minkowski sum implementation for convex polyhedra ? Date: Tue, 29 May 2001 16:40:42 -0400 Message-ID: MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: 7bit X-Priority: 3 (Normal) X-MSMail-Priority: Normal X-Mailer: Microsoft Outlook IMO, Build 9.0.2416 (9.0.2911.0) Importance: Normal X-MimeOLE: Produced By Microsoft MimeOLE V5.50.4133.2400 X-Scanning-Notification: This email was scanned in its path for viruses and certain attachments may have been dropped Errors-To: compgeom-owner@research.bell-labs.com Precedence: bulk Status: RO Content-Length: 384 Lines: 14 Hello, Is there anybody who knows about a Minkowski sum implementation for two convex polyhedra ? Thanks in advance, Young. ------------- 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 compgeom-owner@research.bell-labs.com Sat Jun 9 16:35:32 2001 Return-Path: Received: from dcs-server1.cs.uiuc.edu (dcs-research1-server1.cs.uiuc.edu [128.174.244.4]) by valis.cs.uiuc.edu (8.9.3/8.9.3) with ESMTP id QAA02665 for ; Sat, 9 Jun 2001 16:35:32 -0500 Received: from dirty.research.bell-labs.com (dirty.research.bell-labs.com [204.178.16.6]) by dcs-server1.cs.uiuc.edu (8.9.3/8.9.3) with SMTP id UAA15094; Thu, 7 Jun 2001 20:21:05 -0500 (CDT) Received: from netlib2.cs.bell-labs.com ([135.104.9.27]) by dirty; Thu J